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 2Other wordings
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
Erdős discrepancy problem
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
Erdős Problem #67 — The Erdős Discrepancy Problem
For every function and every real number , there exist natural numbers such that
References
Primary source
Additional references
- Wikipedia, Sign sequence, the article this problem comes from.
Progress summary
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.