Erdős discrepancy problem
Let be a sequence with for every positive integer , and let be an integer. Then there exist positive integers and such that
Equivalently, for every such sequence,
the supremum being taken over all pairs of positive integers and .
Equivalent formulations
In mathematics, a sign sequence, or ±1–sequence or bipolar sequence, is a sequence of numbers, each of which is either 1 or −1. One example is the sequence.
source: Wikipedia
For every function and every real number , there exist natural numbers such that
References
- Wikipedia, Sign sequence, the article this problem comes from.
Status
- Solved: Terence Tao. The Erdős Discrepancy Problem (Discrete Analysis, 2016) https://discreteanalysisjournal.com/article/609-the-erdos-discrepancy-problem
Source: Wikipedia
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.