David Kurniadi Angdinata, Evan Chen, Chris Cummins, Ben Eltschig, Dejan Grubisic, Leopold Haller, Letong Hong, Andranik Kurghinyan, Kenny Lau, Hugh Leather, Seewoo Lee, Simon Mahns, Aram H. Markosyan, Rithikesh Muddana, Ken Ono, Manooshree Patel, Gaurang Pendharker, Vedant Rathi, Alex Schneidman, Volker Seeker, Shubho Sengupta, Ishan Sinha, Jimmy Xin, Jujian Zhang
5 min
Abstract
Lehmer conjectured that Ramanujan's tau-function never vanishes. In a related direction, a folklore conjecture asserts that infinitely many primes arise as absolute values of Ramanujan's tau-function. Recently, Xiong showed that these prime values form a subset of the primes with density at most $2/11$. Assuming the $abc$ Conjecture, we prove the stronger upper bound \[ S(X):=\#\{\ell\le X:\ \ell\ \text{prime and } |τ(n)|=\ell \text{ for some } n\ge 1\} = O(X^{9/10}\log X), \] which implies that Ramanujan's tau-function misses a density 1 subset of the primes. We give a heuristic suggesting that $S(X)$ should nevertheless be infinite, with predicted order of magnitude \[ S(X)\asymp \frac{C X^{\frac{1}{11}}}{(\log X)^2}. \] The main engine in this note was formalized and produced automatically in Lean/Mathlib by AxiomProver from a natural-language statement of the problem.
Sam: Correct. Xiong had density ≤2/11 in some cases; here abc kills the rest, implying tau misses density 1 primes. They note explicit primes exist, like tau(251^2) a huge negative prime, but sparse.
Alex: But it's conditional on abc, right? Unproven, though famous.
Sam: Yes, fully conditional—the main engine, those curve bounds, assumes abc. Higher k≥3 uses Xiong unconditionally.
Alex: And for infinity? They don't prove it, but hint?
Sam: In section 4, a heuristic using Sato-Tate: tau(p) behaves like 2 p^{11/2} cos θ_p, equidistributed; for fixed m, primes p up to some size give values ~ p^{11m}, suggesting the total count grows like X^{1/11} times log terms—infinite but ultra-sparse.
Alex: So even if density zero, still potentially endless, just very slow growth. Neat counterpoint. And they formalized the engine in Lean/Mathlib via AxiomProver—from natural language to verified code, assuming abc and Xiong's results.
Sam: Indeed. Input informal statements, config for Lean 4.26, Xiong papers; output autonomous proofs.
Alex: Wrapping up, this shows tau likely misses almost all primes under abc, yet heuristics say infinitely many lurk. A precise conditional advance on a classic puzzle. Thanks, Sam—clear as always.
Sam: Pleasure unpacking it. The logic holds tightly on those curves. Thanks for listening to ResearchPod.