One great problem, three kinds of immersion
From a story to your own conjecture
Problem stories open curiosity. The problem workshop is the next place, where curiosity becomes a testable idea.
- 1 · DiscoverMeet the questionLearn when it appeared and why it still holds people’s attention.
- 2 · ChallengeTest one caseMake your first observation in five minutes with a drawing, calculation, or colors.
- 3 · DevelopYou are hereBuild on ideasPublish an observation and grow it through comparisons, conjectures, and counterexamples.
Erdős Discrepancy Problem — Can Subsequence Sums Stay Bounded?
Problem
For any sequence , do the partial sums always become arbitrarily large? Erdős (1932) conjectured yes — no sequence can keep all "arithmetic-progression sums" bounded.
Why it matters
For , partial sums describe a Bernoulli walk. For all simultaneously bounded, the sequence would have to balance against every multiplicative structure — Erdős conjectured impossible. Even the case was open for 80 years.
Progress so far
Tao (2015-09-17, Discrete Analysis 2016) completely resolved the problem after Polymath 5 reduced the case computationally. Tao's entropy-decrement argument combined with multiplicative-function structure (Liouville/Möbius) closed the case for all .
Further reading
💡 Explore together, one line at a time(0 contributions)
Contributions are not ranked by popularity. Curator feedback names what is clear or reproducible, and peer signals mean someone understood or actually reproduced it.
What did you notice?
You do not need a complete proof. A small observation can open the next path.
moderation policy. Sign in after submitting if you want to edit or delete this attempt from another device.