erdős #321
What is the size of the largest such that all sums are distinct for ?
unreviewedOpen. Best to date: honest null, not yet machine-sealed.
number theory · open · formalized (Lean) · 1 attempt
use this data
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsEvidence1
honest null
unverified claim
attempted via frontier 'sidon/B2' (transfer_strength=weak) -> no_progress
No solve/partial on this pass. Transfer into the owned frontier was 'weak'. Do not re-attack cold; needs a new idea or richer accumulated context.
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Let $R(N)$ denote the maximum size of a set (A\subseteq{1,\dots,N}) such that the map [ S\subseteq A \ \longmapsto\ \sum_{n\in S}\frac1n ] is injective (i.e., all these subset–reciprocal sums are distinct).
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗Formal proof
AMS 11 · open (literature)
theorem erdos_321 (N : ℕ) :
R N = answer(sorry)formal-conjectures/321.lean ↗OEIS2
Connections
Check it yourself
One command re-derives this record's receipts on your machine.
vela reproduce examples/erdos-problems