Terence Tao has just uploaded a preprint to the arXiv with a claimed proof of the Erdős discrepancy problem.

### Terence Tao has solved the Erdős discrepancy problem!

[Continue reading…]

Terence Tao has just uploaded a preprint to the arXiv with a claimed proof of the Erdős discrepancy problem.

[Continue reading…]

Boris Konev and Alexei Lisitsa of the University of Liverpool have been looking at sequences of $+1$s and $-1$s, and have shown using an SAT-solver-based proof that every sequence of $1161$ or more elements has a subsequence which sums to at least $2$. This extends the existing long-known result that every such sequence of $12$ or more elements has a subsequence which sums to at least $1$, and constitutes a proof of Erdős’s discrepancy problem for $C \leq 2$.

[Continue reading…]