← All problems

Erdős discrepancy problem

94 years old · traced to

Let (x1,x2,x3,…)(x_1, x_2, x_3, \ldots) be a sequence with xi∈{+1,−1}x_i \in \{+1, -1\} for every positive integer ii, and let CC be an integer. Then there exist positive integers kk and dd such that

∣∑i=1kxi⋅d∣>C.\left|\sum_{i=1}^{k} x_{i \cdot d}\right| > C.

Equivalently, for every such sequence,

sup⁡k,d≥1∣∑i=1kxi⋅d∣=∞,\sup_{k, d \geq 1} \left|\sum_{i=1}^{k} x_{i \cdot d}\right| = \infty,

the supremum being taken over all pairs of positive integers kk and dd.

Equivalent formulations
  1. 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

  2. For every function f ⁣:N→{−1,+1}⊂Rf\colon\mathbb{N}\to\{-1,+1\}\subset\mathbb{R} and every real number C>0C>0, there exist natural numbers d,m≥1d,m\geq 1 such that

    ∣∑1≤k≤mf(kd)∣>C.\left|\sum_{1\leq k\leq m} f(kd)\right|>C.

    source: The Formal Conjectures Authors, Formal Conjectures (2025); independently edited from the pinned source file.

References
  1. Wikipedia, Sign sequence, the article this problem comes from.

Status

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.