number-theory / Number Theory, Additive Combinatorics

Erdős Problem #131

The new content is the upper bound; the matching N^(1/5) construction is prior work of Erdős and Csaba. erdosproblems.com has not accepted the claim

10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

number-theoryJul 24, 2026Significance 10/100Registry: lean verified

Erdős Problem #131

Prior state unknown→proved

The new content is the upper bound; the matching N^(1/5) construction is prior work of Erdős and Csaba. erdosproblems.com has not accepted the claim

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

The new content is the upper bound; the matching N^(1/5) construction is prior work of Erdős and Csaba. erdosproblems.com has not accepted the claim

The new content is the upper bound; the matching N^(1/5) construction is prior work of Erdős and Csaba. erdosproblems.com has not accepted the claim

Recorded attempts

Evidence graph

Connected research record