Erdős Problem #866
Prior state unknown→proved
h₄(n) = 4 for every n ≥ 331,777, with improved global bounds; the broader problem remains open
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theory / Additive Combinatorics
Erdős Problem #866
h₄(n) = 4 for every n ≥ 331,777, with improved global bounds; the broader problem remains open
10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
h₄(n) = 4 for every n ≥ 331,777, with improved global bounds; the broader problem remains open
h₄(n) = 4 for every n ≥ 331,777, with improved global bounds; the broader problem remains open
Recorded attempts
Evidence graph
Connected research record
- →Erdős Problem #866
parent of · event · claim reported
- →h₄(n) = 4 for every n ≥ 331,777, with improved global bounds; the broader problem remains open
parent of · claim · theorem