Claim in Erdős problems that formal-conjectures marks solved

A published paper or arXiv preprint answers the main question of Erdős Problem #260 (theorem erdos_260 in formal-conjectures) in full (proof, disproof, or the exact value asked for) with no hypotheses beyond the problem's own.

Problem as stated at github.com/google-deepmind/formal-conjectures/blob/34ee0e3c5fd52d202d62a71094a37970cb5fb870/FormalConjectures/ErdosProblems/260.lean. The claim text is written by Corroborate; that site has not reviewed or endorsed it.

The problem, as stated in formal-conjectures (Apache 2.0):

Let a_1 < a_2 < \cdots be an increasing sequence such that \frac{a_n}{n} \to \infty. Is the sum \sum_{n}^{\infty} \frac{a_n}{2^{a_n}} irrational? For a proof, see [Wang, *Sparse Polynomial-Weighted Expansions*] (https://arxiv.org/abs/2606.24972).

References formal-conjectures lists for this problem (a starting point, not evidence):

[Wang, Sparse Polynomial-Weighted Expansions] (

Verdict: no verdict yet

formal-conjectures marks problem #260 as solved. Those pages say who settled it and how.

Evidence for

None yet.

Evidence against

None yet.