Matching works

19 works

math.NT — Number Theory

A narrower admissible 234 360 000-tuple and H_5 <= 4 891 341 734

Contributed by David Niedbala Giraudin

Let H_m = liminf (p_{n+m} - p_n). Kapila proved DHL[234360000,6] and deduced H_5 <= 5040082836, the diameter of the tuple formed by the 234360000 smallest primes larger than 234360000. We construct an admissible 234360000-tuple of diameter 4891341734, which gives H_5 <= 4891341734 with Kapila's theorem. The tuple consists of +-1 and of +-q for primes q in a symmetric window, with 1746831 primes removed; its admissibility is checked by two independent programs.

Primarily AI-generated textHuman understanding: no partsMaynard-Tao sieveadmissible tuplesbounded gapscomputer-assisted proofgaps between primes
Nov 16, 20263 pages
PDFView work

math.NT — Number Theory

Pair correlation of LL-zeros and Hooley's conjecture

Contributed by Travor Zihao Liu

In this article, we study the form factor for zeros of Dirichlet LL-functions, pairing zeros of the same LL-function and then averaging over primitive characters modulo a prime conductor. Unconditionally, we show for ∣α∣<1|\alpha|<1 that the form factor agrees with the random matrix prediction from the Circular Unitary Ensemble (CUE). Under GRH and the Hardy--Littlewood twin primes conjecture, we extend this agreement to ∣α∣<2|\alpha|<2. For ∣α∣≥1|\alpha|\ge1, we prove that the CUE prediction is equivalent to Hooley's conjecture for the variance of primes in arithmetic progressions with prime moduli. We also explore applications of these form-factor results to the simplicity of zeros.

Primarily human-written textHuman understanding: all parts
Nov 16, 202622 pages
PDFView work

math.NT — Number Theory

Landau's problems through ratios of LL-functions

Contributed by Haozhe Gou, Victor Wang, Max Wenqiang Xu

Very recently, Lee announced a proof of the Twin Prime Conjecture assuming the Ratios Conjecture for the Riemann zeta function. We obtain conditional asymptotic formulas with power-saving errors for each of Landau's four prime problems. Similar results may be possible for other problems in analytic number theory.

Author comments: 36 pages

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 13, 202636 pages
PDFView work

math.NT — Number Theory

An explicit prime gap under the Riemann hypothesis, formalized in Lean with its prime power input made elementary

Contributed by Steve Hubbard

We report on a Lean 4 formalization of Theorem 2 of Dudek, 2015, as numbered in arXiv v2, which states that if the Riemann hypothesis is true, then for every real x≥2x \ge 2 there is a prime in the interval (x−(4/π)xlog⁡x,x](x - (4/\pi)\sqrt{x}\log x, x]. In the formalization, Theorem 2 is proved assuming the Riemann hypothesis and one cited explicit zero-counting bound of Hasanalizade, Shen and Wong, arXiv:2107.06506. Four cited inputs of the printed proof are replaced in the formal proof. The two that carry the argument are these: first, the prime power contribution ψ−θ\psi - \theta is required only across the moving window (x−h,x+h](x - h, x + h] and is proved outright in Lean by an elementary counting argument with no cited input and without assuming the Riemann hypothesis; second, the sum over nontrivial zeros is bounded from the cited Hasanalizade, Shen and Wong zero count for T≥70T \ge 70 by trading slack between the head and tail sums at the split point T=2x/hT = 2x/h. The Riemann hypothesis is open and this note makes no progress on it.

Author comments: 11 pages. Version 2 of the note, first deposit on Hexagon.

Primarily AI-generated textHuman understanding: some partsLean 4Riemann Hypothesisexplicit number theoryformal verificationprime gaps
Nov 06, 202611 pages
PDFView work

math.NT — Number Theory

Cumulative Prime Sums and Riemann Zeros: A fine grid, its ripple, and a family of prime races

Contributed by Antonio Mennillo

Summing the primes one after another and taking logarithms gives an increasing sequence of real numbers, σm=log⁡Spm\sigma_m=\log S_{p_m} with SN=1+∑p≤NpS_N = 1+\sum_{p\le N}p, which becomes exponentially dense. The ordinates γn\gamma_n of the zeros of the Riemann zeta function fall on this grid with tiny errors: 1.4⋅10−31.4\cdot10^{-3} at the first zero, 2.4⋅10−72.4\cdot10^{-7} at the fifth, 3⋅10−173\cdot10^{-17} at the twentieth. Part I explains why. The cell of the grid containing a height tt has width (1+o(1))t e−t/2(1+o(1))\sqrt t\,e^{-t/2} (Step Theorem), and every real t>log⁡3t>\log 3 has a node above it within that width, by an argument going back to Bertrand's postulate (Covering Theorem). The precision observed at the zeros is therefore the resolution of the grid, and the same precision holds at every height (Genericity Principle). We compute the first-crossing primes NnN_n with certification up to n=20n=20 and test, in a protocol fixed before the computation, whether the zeros sit closer to the nodes than a generic height. Neither the mean distance to the nearest node (0.2460.246 against 0.2500.250, p=0.92p=0.92) nor the distribution of the position within the cell (Kolmogorov–Smirnov, p=0.79p=0.79) departs detectably from the generic case, and an integer grid used as control behaves in the same way. We also correct the half-exponent law by a factor t′/t\sqrt{t'/t}. Part II shows where the zeros are actually visible. They are not in the position of the nodes but in the ripple: the deviation of the grid from its mean curve B(x)=1+li(x2)−li(4)B(x)=1+\mathrm{li}(x^2)-\mathrm{li}(4). This ripple is a sum of pure oscillations, one per zero; its spectrum shows a peak at each of the first 13 ordinates, with the amplitude predicted by the explicit formula. Under RH the ripple has size e−t/4e^{-t/4} on the grid, much larger than the cell e−t/2e^{-t/2}, and RH is equivalent to this decay rate. The ripple is not centred: on [103,108][10^3,10^8] the sum of the primes stays below li(x2)\mathrm{li}(x^2) for about 97% of logarithmic time, and it first exceeds it at x=109x=109. We place this in a one-parameter family of prime races, ∑p≤xpa\sum_{p\le x}p^a against li(xa+1)\mathrm{li}(x^{a+1}), and prove that under RH the normalized error has mean −1/(2a+1)-1/(2a+1), coming from the squares of the primes. Under RH and LI the limiting logarithmic density of the set where the race is ahead is given by a Rubinstein–Sarnak formula; it moves from 2.6⋅10−72.6\cdot10^{-7} (counting the primes, a=0a=0) to 0.060.06 (summing them, a=1a=1) and tends to 1/21/2 as a→∞a\to\infty, at the rate 12−δa∼1/(2πAlog⁡(A/2π))\tfrac12-\delta_a\sim1/\bigl(2\sqrt{\pi A\log(A/2\pi)}\bigr) with A=a+12A=a+\tfrac12. At a=−1/2a=-1/2 the bias becomes the 12log⁡log⁡x\tfrac12\log\log x of the weighted counting functions of Aoki and Koyama. All theorems are formalized in Lean 4, with the classical results they use as explicit hypotheses.

A mix of human-written and AI-generated textHuman understanding: some partsChebyshev biasLean 4Riemann zerosexplicit formulaprime races
Nov 06, 202629 pages
PDFView work

math.NT — Number Theory

The parity of the prime-counting function in time xo(1)x^{o(1)}

Contributed by Vaibhav Tulsyan

Computing the prime-counting function π(x)\pi(x) exactly takes x1/2+o(1)x^{1/2+o(1)} steps by the analytic method of Lagarias and Odlyzko, and to our knowledge its parity is known faster only on short intervals: Tao, Croot and Helfgott decide whether an interval of length at most x1/2+cx^{1/2+c} near xx contains an odd number of primes in time x1/2−c+o(1)x^{1/2-c+o(1)}. However, their identity needs the Mobius function μ(d)\mu(d) for all d≤xd\le\sqrt x, and we know of no bound of the form xo(1)x^{o(1)} for the parity, even conditionally. We present deterministic algorithms that output π(x) mod 2\pi(x) \bmod 2 and the parity of the number of primes in any interval [A,B][A,B] in time 2O(n/log⁡n)=xo(1)2^{O(n/\sqrt{\log n})}=x^{o(1)}, where nn is the input bit length. Our approach replaces μ(d)\mu(d) by its residue modulo 2, which is the squarefree indicator again: the number of chains d12∣md_1^2\mid m, d22∣d1,…d_2^2\mid d_1,\dots of depth LL is odd exactly when mm is squarefree, for m<22Lm<2^{2^L}. The parity of π\pi on [A,B][A,B] is then the parity of one count of tuples satisfying O(log⁡n)O(\log n) multiplications, which Anthropic's counting engine evaluates through a network whose variables have geometrically shrinking widths. We prove both theorems in Lean 4 (piParity_TM_rate, piIntervalParity_TM_rate; axioms propext, Classical.choice, Quot.sound). The result does not give deterministic prime finding or the exact value of π(x)\pi(x): the parity can be even on every interval one queries, and exact counts seem to need iterated products, for whose product-tree verifiers we prove a lower bound in Lean. The constants are astronomical, and the result rests on Anthropic's Lean development of its claimed refutation of the Exponential Time Hypothesis, which is under review.

Primarily AI-generated textHuman understanding: some partsExponential Time HypothesisMobius functiondeterministic prime findingdivisor chainsparity of pi(x)prime-counting functionsquarefree numbers
Nov 05, 20269 pages
PDFView work

math.NT — Number Theory

A sharper Type I/II estimate for primes in arithmetic progressions to smooth moduli, and H_m << e^{3.8043 m}

Contributed by David Niedbala Giraudin

In Stadlmann's Type I/II equidistribution estimate for x^delta-smooth moduli, one of the three conditions, 64 varpi + 20 delta + 2 sigma < 1, can be replaced by 48 varpi + 18 delta + 2 sigma < 1. This weaker condition follows from the second one, 48 varpi + 16 delta + 4 sigma < 1, whenever delta <= sigma. The proof follows Stadlmann's argument and makes two changes: the length of a block in one Taylor expansion depends on the pair of shifts, and the bounds are summed over the pairs instead of being multiplied by their number. Combined with Stadlmann's general Harman-sieve construction, this gives a minorant for the primes with exponent of distribution 1/2 + 2 varpi to smooth moduli for every varpi < 7/544, instead of varpi = 0.01265. As a consequence, liminf (p_{n+m} - p_n) << e^{cm} for every c > 3.80428, and for every c > 3.80423 if a numerically computed value of the sieve deficit is used. This improves Stadlmann's exponent 3.8075.

Primarily AI-generated textHuman understanding: no partsHarman's sieveType I/II estimatesbounded gaps between primesexponent of distributionprimes in arithmetic progressionssmooth moduli
Nov 04, 20265 pages
PDFView work

math.NT — Number Theory

Arcs of Π(1+z^p): prime races, the Gaussian core, Dirichlet L-functions and a certified solver for Subset Sum

Contributed by Antonio Mennillo

The subsets of {1}∪{p≤N}\{1\} \cup \{p \le N\} reach every integer between 0 and their total, by Bertrand's postulate, so deciding whether a target is a subset sum of the primes is trivial. Counting the solutions is not: the count carries the arithmetic of the primes. We study the generating function FN(z)=Π(1+zw)F_N(z) = \Pi(1 + z^w) on the unit circle and follow one object, the arc at a rational a/qa/q, through three settings. For the primes, the centre of the arc a/qa/q rises above the sea of the minor arcs exactly when q=2k(k≥2)q = 2^k (k \ge 2) or q=2pjq = 2p^j, with excess Λ(q/2)/φ(q)\Lambda(q/2)/\varphi(q), and the neighbourhoods of all the other arcs are bounded uniformly in qq; Theorem E gives the expansion arc by arc. The height of an arc is a race of the primes modulo qq with weights log⁡∣cos⁡(πra/q)∣\log |\cos (\pi ra/q)|. By Landau's theorem a one-sided bound on it is equivalent to GRH for the even characters it sees, unconditionally at q=8q = 8, 10 and 14, where the zero-free segments it needs are certified; at q=14q = 14 the race changes sign infinitely often. The principal arc carries ζ\zeta in the centre and width of its Gaussian. For arbitrary weights, the arcs become the decision rule of a Subset Sum solver that reads them on the original weights and ends with a meet-in-the-middle filtered by a random residue class. Every answer it returns is verified. The dummy weights of HURS explain why the reading is exact: they blur the counts by a flat window, and the blur is invertible on counts, though not on reachable sets. On random weights of bb bits the method has rigorous guarantees, in time 2b/2+o(b)2^{b/2+o(b)} and, with the filter, 2b/3+o(b)2^{b/3+o(b)}, resting on a local limit theorem uniform in the size of the weights and on a concentration bound for signed subset sums. Finally, the solver is read inside a general theory of constraint propagation, in which every network factors as T=Tcomp∘TstructT = T_{\mathrm{comp}} \circ T_{\mathrm{struct}}.

A mix of human-written and AI-generated textHuman understanding: some partsDirichlet L-functionsGRHSubset Sumcircle methodconstraint propagationlocal limit theoremmeet-in-the-middleprime races
Nov 04, 202662 pages
PDFView work

math.NT — Number Theory

The Riemann hypothesis as a margin: a two-sided criterion verified to 2*10^29, the fourth-moment anatomy of Mobius cancellation, and one constant seen from every side

Contributed by Pedro Caceres

This paper collects, with uniform notation, a month of new results around one way of looking at the Riemann hypothesis (RH): as the statement that explicitly computable margins stay on one side of explicit constants for ever. Part I studies the Cesaro margin M(N) between a smooth curve and the weighted prime sum 2*sum_{q<N} Lambda(q) q^{-1/2} log(N/q): RH is equivalent to M(N) >= 0 for all large N (a theorem of Suzuki), and we verify 0 < M(N) < 0.18484 for every real 1 < N <= 2.15*10^29, with explicit unconditional bounds beyond; the margin is analyzed as a walk of the primes against a curve, as an energy, and as a one-sided mean: RH holds if and only if a weighted mean of the prime-counting error stays below -B = -(1 + gamma/2 - (1/2) log 4pi) for ever. Part II dissects the Mobius side of the same coin: an exact positive-definite variance identity for sum_{d<=D} mu(d)({x/d}-1/2), empirically Gaussian statistics, and an exact anatomy of the fourth moment — the conductor-1 orbit decouples, the cross term moves only at composite squarefree conductors, two of its four sectors are O(D log^4 D) unconditionally, and an empirical jump law, first refuted, is proved exactly in its sector. Part III shows that 2B is the Baez-Duarte constant of the Nyman-Beurling criterion and recomputes the Nyman-Beurling distances from scratch through Vasyunin's cotangent formula: d_N^2 log N reaches 0.0461 against 2B = 0.04619, with no zero of zeta used anywhere in the computation. Part IV distils the author's twenty-two-part study of the cross-energy of consecutive Dirichlet partial sums: the trichotomy that singles out the critical line as the trace of the pole, the energy law (the mean energy of the prime-counting error is >= 2B unconditionally, with equality if and only if RH holds with simple zeros), the energy slope as a truncated Weil functional exact in the primes, the functional reflection that reproduces Hardy's function from the integers, and the systematic Davenport-Heilbronn and Beurling controls. Part V states precisely what none of this can do: a no-go theorem shows that weights indistinguishable from the primes' to q^(delta-1/2) satisfy every averaged statement here and still carry an off-line zero, so the exact identity Lambda = mu * log must enter beyond its first moments. The paper opens with a list of its twenty-two original contributions and a matching statement of what is due to others. We do not prove the Riemann hypothesis, and no statement in this paper should be read as progress towards it beyond what it literally says.

A mix of human-written and AI-generated textHuman understanding: all partsRiemann hypothesis; Cesaro; Mobius; Landau; Nyman; Dirichlet; Weil; Davenport
Oct 31, 202681 pages
PDFView work

math.NT — Number Theory

Cross-Energy of Dirichlet Partial Sums. Part 11: A two-sided criterion for the Riemann hypothesis from weighted prime sums, verified up to 2⋅10292\cdot10^{29}

Contributed by Pedro Caceres

For N>1N>1 let C(N)=2∑n<NΛ(n)n−1/2log⁡(N/n)C(N)=2\sum_{n<N}\Lambda(n)n^{-1/2}\log(N/n) and let M(N)=R(N)−C(N)M(N)=R(N)-C(N), where R(N)=8N−5.3721834log⁡N−7.4013354+O(N−5/2)R(N)=8\sqrt N-5.3721834\log N-7.4013354+O(N^{-5/2}) is explicit. By a theorem of Suzuki, the Riemann hypothesis (RH) holds if and only if M(N)≥0M(N)\ge0 for all large NN, and then 0≤M(N)≤4(log⁡ξ)′′(12)=0.184840\le M(N)\le4(\log\xi)''(\frac12)=0.18484. We prove, with computer assistance, that this two-sided inequality holds for every real 1<N≤2.15⋅10291<N\le2.15\cdot10^{29}: up to 101010^{10} from the primes with correctly rounded arithmetic, and beyond from the first 45204520 zeros, certified with ball arithmetic, together with the verification of RH to 3⋅10123\cdot10^{12} and an explicit zero-density estimate. The same ingredients give, for every NN and without any hypothesis, −E(N)≤M(N)≤0.18484+E(N)-E(N)\le M(N)\le0.18484+E(N) with E(N)E(N) explicit and E(1020)<3⋅10−5E(10^{20})<3\cdot10^{-5}. We describe the local minima of MM exactly, through the slope α(x)=∑n≤xΛ(n)n−1/2−2x+c02\alpha(x)=\sum_{n\le x}\Lambda(n)n^{-1/2}-2\sqrt x+\frac{c_0}2. Under RH the margin is the variogram of α\alpha, and RH is equivalent to ∫1Xα2 dx/x=Xo(1)\int_1^X\alpha^2\,dx/x=X^{o(1)}. Without any hypothesis we prove an energy identity, which expresses the energy of the slope as a C-transform of the margin against the prime measure, and a lower bound for the mean energy that is attained exactly under RH with simple zeros. We then show what such arguments cannot do. Positive weights within qδ−1/2q^{\delta-1/2} of Λ(q)q−1/2\Lambda(q)q^{-1/2} satisfy the energy identity, the prime number theorem and Chebyshev's identity up to x1/2+δx^{1/2+\delta}, yet carry an off-line zero. So the structural inputs listed do not suffice, and a proof along these lines has to use Λ=μ∗log⁡\Lambda=\mu*\log exactly. Carrying that identity through the slope, α\alpha is numerically, to within 1%1\% in the range tested, a M\"obius-weighted sawtooth, and the exact argument reduces to a type~I sum of μ\mu against the fractional parts of x/dx/d, which is RH again.

Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 36 pages, 10 figures; ancillary scripts reproduce the computations; Part 11 of the 47-part book-series Cross-Energy of Dirichlet Partial Sums (Parts 0-46), block III (The margin and the constant B-hat); formerly a standalone note; a public version is the Hexagon preprint hexagon:2610.00661v1. Part 0 is the guide. The paper states the Riemann-hypothesis caveat once (2 Nov 2026: removed from the abstract and from a remark).

A mix of human-written and AI-generated textHuman understanding: all partsRiemann hypothesis; explicit formula; Weil positivity; Riesz; ball arithmetic
Oct 31, 202636 pages
PDFView work

math.NT — Number Theory

Computing Jacobsthal’s Function on Primorials: Exact Values and Constructive Bounds

Contributed by Alben Weeks

Let h(x) = j(Px), where j is Jacobsthal’s function and Px is the product of the first x primes. We describe a parallel residue-covering search. Exhaustive exclusion runs, together with independently checked covering witnesses, establish h(65) = 1134, h(66) = 1160, h(67) = 1192, h(68) = 1216, h(69) = 1248, h(70) = 1274, and h(71) = 1298. Method 5B gives explicit certificates for h(100) ≥ 2054, h(150) ≥ 3558, and h(200) ≥ 5172, using partial coverings with five reserve primes. Exhaustive searches give h(100) ≤ 2798, h(150) ≤ 6898, and h(200) ≤ 11998. The search combines parity compression, descending endpoint restrictions, canonical deduplication, a sliding-window bootstrap, and dynamic prime selection related to Ziller and Morack’s Greedy Permutation Algorithm. We state the conditions needed for capacity bounds and conditional propagation, and organize extensions of complete or partial coverings in a five-tier framework. A catalog of 62 coverings at index 65 supports a verified multi-certificate envelope. The solver source, run evidence, certificates, and arithmetic verifiers are publicly available in the accompanying GitHub release v1.0-paper. Upper-bound conclusions depend on exhaustive execution of the search; the record audits do not independently repeat those searches or supply standalone unsatisfiability certificates

A mix of human-written and AI-generated textHuman understanding: some partsJacobsthal functionbranch-and-boundparallel computationprimorialresidue covering
Oct 31, 202642 pages
PDFView work

math.NT — Number Theory

An explicit elementary proof of no Landau--Siegel zeros

Contributed by Victor Z. Guo

We give an elementary proof of the absence of Landau--Siegel zeros with the explicit constant c=1/100c=1/100. For every primitive quadratic Dirichlet character χ\chi of conductor q≥3q\ge3, each real zero β∈(0,1)\beta\in(0,1) of L(s,χ)L(s,\chi) satisfies (1−β)log⁡q>c(1-\beta)\log q>c. The proof combines integer coefficient counting, polynomial congruences, a paired-tail hyperbola estimate, and a logarithmically weighted comparison of positive sums. All required constants are explicit, and one choice of parameters covers every conductor. The argument uses elementary arithmetic and real summation and integration, without separate zero computations for small conductors.

A mix of human-written and AI-generated textHuman understanding: all partsFrobenius congruencesLandau--Siegel zeroselementary methodsexplicit estimatesquadratic characters
Oct 22, 202617 pages
PDFView work

math.NT — Number Theory

A quantitative refinement of Lu's elementary prime number theorem

Contributed by Rajat Bhattacharjee

We refine Lu's elementary method for the prime number theorem to obtain, for every fixed K>400K>400, \[ \psi(X)-X=O_K\!\left( X\exp\!\left\{-\frac{\sqrt{\log X}}{(\log\log X)^K}\right\}\right) \qquad(X\to\infty), \] where ψ\psi is Chebyshev's function. The main ingredient is a comparison estimate that remains uniform as the degree grows and the short-interval parameter shrinks. Combining this estimate with exponential weights in Balog's identity, a single finite energy step and positivity-based interpolation yields the stated bound, retaining the full degree tail and all arithmetic correction terms. The resulting remainder strengthens Lu's fixed-parameter estimates and Goz\'e's quantitative refinement within the real-variable framework; stronger remainder estimates are known by other methods.

Primarily AI-generated textHuman understanding: no parts
Oct 22, 202629 pages
PDFView work

math.NT — Number Theory

Finite prime gaps from weighted Selberg sieves and pair penalties

Contributed by Annanay Kapila

Let Hm=lim inf⁡n→∞(pn+m−pn)H_m=\liminf_{n\to\infty}(p_{n+m}-p_n). We develop a pair-penalty refinement of a multidimensional Selberg sieve, together with explicit admissible tuples and interval-arithmetic evaluations. A mixed prime–divisor asymptotic is derived from distribution on triply densely divisible moduli. Combining it with the numerical certificates gives H2≤19,844H_2\le19{,}844, H3≤1,357,780H_3\le1{,}357{,}780, H4≤82,234,788H_4\le82{,}234{,}788, and H5≤4,830,355,416H_5\le4{,}830{,}355{,}416. The proof combines truncated marginal estimates, support-loss bounds for signed trial functions, a trace-preserving auxiliary sieve for prime pairs, and exact modular certificates. Exact finite data, interval enclosures, and reproducibility code accompany the manuscript.

Author comments: Updated manuscript dated 6 November 2026, with a pair-penalty refinement and improved bounds for H_2 through H_5.

Primarily AI-generated textHuman understanding: some parts
Oct 20, 202635 pages
PDFView work

math.NT — Number Theory

Note on variable role-reversals

Contributed by Runbo Li

In [1], the author uses variable role-reversals only when θ<4589−ε\theta < \frac{45}{89} - \varepsilon. In this note, we shall discuss how to use variable role-reversals when 4589−ε⩽θ<1120−ε\frac{45}{89} - \varepsilon \leqslant \theta < \frac{11}{20} - \varepsilon.

Primarily human-written textHuman understanding: all partsHarman's sieveVariable role-reversalsarithmetic progressionssieve methods
Oct 20, 20264 pages
PDFView work

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

Contributed by Sayed Barez

Ramanujan proved that π(x)2<exlog⁡xπ(x/e)\pi(x)^2 < \frac{ex}{\log x}\pi(x/e) for all sufficiently large xx. Let NRN_R be the least integer such that this holds for every real x≥NRx \ge N_R. Dudek and Platt showed that the Riemann hypothesis implies NR=38,358,837,683N_R = 38{,}358{,}837{,}683. We prove that NR=38,358,837,683N_R = 38{,}358{,}837{,}683. To our knowledge, this is the first determination of NRN_R without assuming the Riemann hypothesis. The proof uses the zero-free half-plane Res>7/8\mathrm{Re}s > 7/8 of a recent OpenAI preprint. Its main statement for ζ\zeta 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 ζ(s)≠0\zeta(s) \ne 0 for Res>0.945092\mathrm{Re}s > 0.945092, then NR=38,358,837,683N_R = 38{,}358{,}837{,}683. 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 38,358,837,683≤x≤e753.9838{,}358{,}837{,}683 \le x \le e^{753.98}. The previous range ended at e103e^{103}. (C) It holds for x≥e3035.01x \ge e^{3035.01}. This replaces Axler's threshold e3158.442e^{3158.442}, 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 β≤1−1/(1.7373log⁡∣γ∣)\beta \le 1 - 1/(1.7373\log|\gamma|) above height 3⋅10123\cdot10^{12}, or RH verified to height 4.1602⋅10144.1602\cdot10^{14}. We tabulate the trade-off between the two. (E) Arguments that use only non-negativity, analytic continuation and the poles up to height TT cannot go beyond e754.40e^{754.40} when T=3⋅1012T = 3\cdot10^{12}. So (A) is optimal among such arguments to within 0.41 in log⁡x\log x. Building on Bhattacharjee's discovery that the constant E2E_2 in Büthe's Theorem 1 lacks a factor log⁡(3c)\log(3c), 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.

Primarily AI-generated textHuman understanding: all partsChebyshev functionRamanujan's inequalitycomputer-assisted proofexplicit estimatesinterval arithmeticprime-counting functionzero-density estimateszero-free half-planezero-free region
Oct 20, 202628 pages
PDFView work

math.CO — Combinatorics

Prescribed Eigenvalues in Power Bands of Finite Prime-Cover Graphs

Contributed by Idris Ali Shaik

Let G_X be the graph on the positive integers at most X, with an edge between n and np whenever p is prime and np <= X. Write lambda_1(X) >= lambda_2(X) >= ... > 0 for its positive adjacency eigenvalues, counted with multiplicity. We prove that, for every fixed 21/61 < theta < 1/2 and every integer X^theta/log X <= a <= X^theta, lambda_a(X)^2 = pi(X/a) + O_theta(a/log X), where pi is the prime-counting function. This identifies the eigenvalue at the prescribed rank a throughout a polynomially growing band of centres. For every 0 < theta < 1/2, ordered mean-square bounds give a weaker estimate outside o(X^theta) centres below X^theta. When 1/3 < theta < 1/2, the same O_theta(a/log X) error holds outside o(X^theta) centres using only global prime estimates. The results extend to deletion of any fixed finite set of prime directions. Edges labelled by primes exceeding sqrt(X) form disjoint stars. Retaining their first-exit interactions gives local comparison operators and a family of approximate eigenvectors. Bounds on their overlaps and residuals control eigenvalue counts across clusters, allowing ranks to be recovered where the global perturbation bound no longer separates neighbouring star levels. The Baker--Harman--Pintz lower bound and the Brun--Titchmarsh upper bound supply the short-interval prime counts used in the uniform every-centre theorem.

A mix of human-written and AI-generated textHuman understanding: all partsmatrix perturbationordered eigenvaluesprime number theoremprime-cover graphsshort intervalsspectral graph theory
Oct 20, 202633 pages
PDFView work

math.CO — Combinatorics

Prime-Star Localization and Second-Order Spectra of Finite Divisibility Cover Graphs

Contributed by Idris Ali Shaik

Let G_X be the graph on the positive integers n <= X in which n is joined to np whenever p is prime and np <= X. Let A_X be its adjacency matrix, let lambda_1(A_X) be its spectral radius, and let pi(X) count the primes up to X. Then lambda_1(A_X)^2 = pi(X) + 4 sum_{p <= X} 1/(p - 1) + o(1). More generally, fix a finite set S of primes and retain only the positive integers divisible by none of the primes in S. Let a_1 < a_2 < ... list these integers, and let pi_S count the primes outside S. For every fixed j, the j-th largest positive eigenvalue satisfies lambda_j(A_{S,X})^2 = pi_S(X/a_j) + 4 sum_{p <= X, p not in S} 1/(p - 1) + c(a_j) + o_{S,j}(1), where c(a) = sum_{q divides a, q prime} (q - 5)/(q - 1). The proof splits the edges according to whether their prime label exceeds sqrt(X). The large-prime edges form disjoint stars, while the remaining adjacency has norm of order X^(1/4)/sqrt(log X) but zero first-order matrix element on each star eigenvector. An explicit first-exit resolvent calculation gives a degree-ratio correction with remainder O_{S,j}(1/log X) and localization of the extreme eigenvectors. The prime number theorem and Mertens estimates then evaluate that correction as 4 log log X plus an explicit constant, yielding the displayed o(1) formula. The same constant-layer formula and localization hold uniformly for retained centres a <= (log X)^(1/2-epsilon), with finite-sum error O_{S,epsilon}(a^2/log X). The paired positive and negative modes also yield uniform centre--shell adjacency evolution. The explicit finite correction determines its phase with uniform o(1) error whenever |t| = o(sqrt(X log X)/a^(5/2)). The uniform finite-prime-sum law, its largest-eigenvalue specialization, and the explicit-frequency centre--shell dynamics theorem are formalized in Lean 4 and registered in the Palomar Registry as PALOMAR-2026-08-29-000017, version 2.

A mix of human-written and AI-generated textHuman understanding: all partsFeshbach-Schur mapadjacency spectrumdivisibility cover grapheigenvector localizationprime-counting functionspectral graph theory
Oct 20, 202631 pages
PDFView work

math.NT — Number Theory

Hilbert-type inequality with primes

Contributed by Kannan Soundararajan

This note answers a problem posed in Montgomery's CBMS book. The proof was found by ChatGPT 6, and written up by the author.

Primarily human-written textHuman understanding: all partsCollar-Stein LemmaHilbert's inequalitySieves
Sep 28, 20266 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations