Vela

erdős #170 · sparse ruler problem

← #169 · #171 (packet.json; erdosproblems.com)

Let be the smallest possible size of such that . Find the value of

Worked, still open.

additive combinatorics · open · formalized (Lean) · 0 attempts

machinery: additive-combinatorics,Sidon/B_h,sieve/Brun-Titchmarsh,extremal-set-system

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Because (N\in A-A) and (A\subset{0,1,\dots,N}), we must have (0\in A) and (N\in A) (the only way to get a difference of $N$ is $N-0$). So this is exactly the “complete sparse ruler of length $N$” problem. ([Wikipedia][1])

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

candidate solution ↗

formal

AMS 5 · api (literature)

lemma trivial_ruler_is_perfect (N : ℕ) : TrivialRuler N ∈ PerfectRulersLengthN N
formal-conjectures/170.lean ↗

oeis

Sparse Ruler · reference

status

open

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 ec8dbb5410ec94e7ca5f8552e498ad732d04d892dc1916a8af6cb1345a32a968

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.