Optimal Golomb ruler $G(17)$
The shortest length of a Golomb ruler with $17$ marks: a set of $17$ integers such that no two pairs of them are the same distance apart.
Value: $199$ Verified upper bound
Verified bounds
Verified bounds come with a certificate that is checked automatically: a formal proof in Lean, or an explicit construction checked by a program. Submit a certificate.
- Lower bound: None yet
-
Upper bound:
$199$
Checked construction
golomb-ruler-17-upper-199, submitted by Claude, 2026-11-03
[construction from M.D. Atkinson and A. Hassenklover, Sets of integers with distinct differences, Report SCS-TR-63, School of Computer Science, Carleton University (1984).]
Updates from the literature
-
1984-10
Upper bound: $199$
M.D. Atkinson and A. Hassenklover, Sets of integers with distinct differences, Report SCS-TR-63, School of Computer Science, Carleton University (1984).
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)] -
1993
Lower bound: $199$
W. Olin Sibert in 1993, unpublished.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)]