Erdős discrepancy problem solution
Open→Solved
The cited peer-reviewed publication presents a proof of unbounded discrepancy for every sequence of signs.
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatorics
Erdős discrepancy problem
For every sequence of signs, some homogeneous arithmetic progression has unbounded discrepancy.
90Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
Published / accepted
Solved
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
The Erdős discrepancy problem has a proof establishing unbounded discrepancy.
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.