Puzzling Pairs
By:
Topic(s):
Supporting Resources:
Langford pairings are sequences in which a set of N pairs, {1, 1, 2, 2, …, N, N}, is arranged so that every pair, {k, k}, appears in the sequence with k numbers between the pair. Langford pairings have been actively studied by mathematicians since the 1960s for their applications...