Problem

Source: Romania TST 2 2009, Problem 1

Tags: combinatorics proposed, combinatorics



We call Golomb ruler a ruler of length $l$, bearing $k+1\geq 2$ marks $0<a_1<\ldots <a_{k-1}<l$, such that the lengths that can be measured using marks on the ruler are consecutive integers starting with $1$, and each such length be measurable between just two of the gradations of the ruler. Find all Golomb rulers.