Erdős Problem a Daythe open tracker

Erdős Problem #967

DISPROVED LEANdatabase updated 2025-12-19

The statement as posed is false. A solution has also been checked by machine, in Lean.

What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).

The summand \(\frac{1}{n^{1+it}}\), for a natural number \(n\) and \(t\in\mathbb{R}\).

Let \(1<a_1<\cdots\) be a sequence of integers such that \(\sum\frac{1}{a_i}<\infty\). Is it true that, for every \(t\in \mathbb{R}\), \[1+\sum_{k}\frac{1}{a_k^{1+it}}\neq 0?\] Yip [Yi25] has proved that this is not always true - in fact, for any real \(t\neq 0\), there exists a sequence of integers \(1<a_1<\cdots\) such that \(\sum \frac{1}{a_i}<\infty\) and \(1+\sum_{k}\frac{1}{a_k^{1+it}}=0\). This was formalized in Lean by Wu using Aristotle.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 4 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/967.
Prizenone
Topicsnumber theory, analysis
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/967
NOBODY HAS SENT US AN ATTEMPT YET

If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.