What is the size of the largest such that all sums are distinct for ?

claimed — no verifier run, no signed judgmentunreviewedOpen. Best to date: honest null, not yet machine-sealed.

number theory · open · formalized (Lean) · 1 attempt

use this data

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

Evidence1

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

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Verify this yourself

Run this command — the output must match these fingerprints.

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

Search Vela

Search problems, results, contributors, and pages — or jump straight to an id.