math.NT — Number Theory
Ramanujan's prime counting inequality holds for all x ≥ 38,358,837,683: ranges from the zeros, a spectral barrier, and trade-offs
Ramanujan proved that for all sufficiently large . Let be the least integer such that this holds for every real . Dudek and Platt showed that the Riemann hypothesis implies . We prove that . To our knowledge, this is the first determination of without assuming the Riemann hypothesis. The proof uses the zero-free half-plane of a recent OpenAI preprint. Its main statement for is formalized in Lean 4 and has been rebuilt independently; its written proof has not been peer reviewed. The deduction is our Theorem B: if for , then . The proof of Theorem B uses only refereed inputs, together with Bhattacharjee's correction of a theorem of Büthe. Relying only on the peer-reviewed literature, and on preprints where stated, we also prove the following by rigorous computer-assisted interval arithmetic. (A) The inequality holds for . The previous range ended at . (C) It holds for . This replaces Axler's threshold , whose proof applies a lemma of Dudek and Platt in a case where that lemma's proof is defective. (B′, D) Either of the following also suffices: a zero-free region above height , or RH verified to height . We tabulate the trade-off between the two. (E) Arguments that use only non-negativity, analytic continuation and the poles up to height cannot go beyond when . So (A) is optimal among such arguments to within 0.41 in . Building on Bhattacharjee's discovery that the constant in Büthe's Theorem 1 lacks a factor , we show that the affected rows of the Broadbent–Kadiri–Lumley–Ng–Wilk table inherit the error, by 1.3–2.2% after re-optimization. We also trace the consequences in the literature.