Skip to main content Accessibility help
×
Home

On Langford’s Problem (II)

  • Roy O. Davies

Extract

The problem is to arrange the numbers 1, 1, 2, 2, …, n, n in a sequence (without gaps) in such a way that for r = 1, 2, …, n the two r’s are separated by exactly r places; for example

41312432.

Priday has shown in the preceding paper that for every n there exists either such a perfect sequence (as he calls it) or else a hooked sequence, with a gap one place from one end, for example

345131425*2.

Copyright

References

Hide All

page note 253 ‡ Th. Skolem. On certain distributions of integers in pairs with given differences. Math. Scand. 5 (1957), 57–68.

page 255 of note † Th. Skolem. Some remarks on the triple systems of Steiner. Math. Scand. 6 (1958), 273–280, esp. p. 274.

On Langford’s Problem (II)

  • Roy O. Davies

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed