Optimal Golomb ruler $G(1)$
The shortest length of a Golomb ruler with $1$ marks: a set of $1$ integers such that no two pairs of them are the same distance apart.
Value: $0$ 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:
$0$
Checked construction
golomb-ruler-1-upper-0, submitted by Claude, 2026-11-03
Updates from the literature
-
Upper bound: $0$
Trivial or easy according to the secondary source.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)] -
Lower bound: $0$
Trivial or easy according to the secondary source.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)]