Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Hough, Lemma 7, Appendix A, printed pp. 378–379 of the published paper. The external input is exactly Theorem 6.

Statement. For every integer n≥11n\ge11, with qj=(j+1)3−j3q_j=(j+1)^3-j^3,

An:=∏en<p≤en+1(1+2p−1)<65,A_n:=\prod_{e^n<p\le e^{n+1}}\left(1+\frac2{p-1}\right)<\frac65, Gn:=∏en<p≤en+1(1+2∑j≥1qjpj)<175,Sn:=∑en<p≤en+11(p−1)3<22/252ne2n.G_n:=\prod_{e^n<p\le e^{n+1}} \left(1+2\sum_{j\ge1}\frac{q_j}{p^j}\right)<\frac{17}{5}, \qquad S_n:=\sum_{e^n<p\le e^{n+1}}\frac1{(p-1)^3} <\frac{22/25}{2ne^{2n}}.

The source states the weaker third bound Sn<1/(2ne2n)S_n<1/(2ne^{2n}). Its proof already establishes the factor 22/25=0.8822/25=0.88 for n≥14n\ge14; the complete finite certificate establishes it also for n=11,12,13n=11,12,13.

Complete proof. The cases n=11,12,13n=11,12,13 are the finite prime calculations proved and executed in the numerical certificate. Now suppose n≥14n\ge14, put a=ena=e^n, b=en+1b=e^{n+1}, and write E(x)=θ(x)−xE(x)=\theta(x)-x. Since e14>678407e^{14}>678407, the external theorem gives ∣E(x)∣<x/(40log⁡x)|E(x)|<x/(40\log x) throughout [a,b][a,b].

Set

In=∫abdθ(x)xlog⁡x=∑a<p≤b1p.I_n=\int_a^b\frac{d\theta(x)}{x\log x} =\sum_{a<p\le b}\frac1p.

Stieltjes integration by parts, using dθ=dx+dEd\theta=dx+dE, gives

In≤log⁡n+1n+∣E(b)∣b(n+1)+∣E(a)∣an+∫ab∣E(x)∣x2(1log⁡x+1(log⁡x)2)dx.I_n\le\log\frac{n+1}{n} +\frac{|E(b)|}{b(n+1)}+\frac{|E(a)|}{an} +\int_a^b\frac{|E(x)|}{x^2} \left(\frac1{\log x}+\frac1{(\log x)^2}\right)dx.

The integral's error is at most 240nlog⁡((n+1)/n)\frac{2}{40n}\log((n+1)/n): insert the bound for EE and use log⁡x≥n≥1\log x\ge n\ge1. All the resulting positive bounds decrease when nn increases. Therefore

In≤log⁡1514+140⋅152+140⋅142+240⋅14log⁡1514<0.0695.(A)I_n\le\log\frac{15}{14}+\frac1{40\cdot15^2} +\frac1{40\cdot14^2}+\frac2{40\cdot14}\log\frac{15}{14} <0.0695. \tag{A}

Using log⁡(1+u)≤u\log(1+u)\le u,

log⁡An≤2∑a<p≤b1p−1≤21−e−14In<0.14<log⁡(6/5).\log A_n\le2\sum_{a<p\le b}\frac1{p-1} \le\frac2{1-e^{-14}}I_n<0.14<\log(6/5).

For the second product, q1=7q_1=7 and 3qj−qj+1=6j2−4>03q_j-q_{j+1}=6j^2-4>0 give qj≤7⋅3j−1q_j\le7\cdot3^{j-1}, so ∑j≥1qj/pj≤7/(p−3)\sum_{j\ge1}q_j/p^j\le7/(p-3). Hence

log⁡Gn≤14∑a<p≤b1p−3≤141−3e−14In<14⋅0.071−3e−14<1<log⁡(17/5).\log G_n\le14\sum_{a<p\le b}\frac1{p-3} \le\frac{14}{1-3e^{-14}}I_n <\frac{14\cdot0.07}{1-3e^{-14}}<1<\log(17/5).

Finally, since log⁡p≥n\log p\ge n in this band,

Sn≤1n(1−e−n)3∫abdθ(x)x3.S_n\le\frac1{n(1-e^{-n})^3}\int_a^b\frac{d\theta(x)}{x^3}.

Writing dθ=dx+dEd\theta=dx+dE again, and integrating the error by parts,

∫abdθ(x)x3≤1−e−22e2n+140ne2n+140(n+1)e2(n+1)+340n∫abdxx3.\int_a^b\frac{d\theta(x)}{x^3} \le\frac{1-e^{-2}}{2e^{2n}} +\frac1{40ne^{2n}}+\frac1{40(n+1)e^{2(n+1)}} +\frac3{40n}\int_a^b\frac{dx}{x^3}.

After division by n(1−e−n)3n(1-e^{-n})^3, this is at most

12ne2n1(1−e−14)3(1−e−2+120⋅14+120e2⋅15+340⋅14)<0.882ne2n.\frac1{2ne^{2n}}\frac1{(1-e^{-14})^3} \left(1-e^{-2}+\frac1{20\cdot14} +\frac1{20e^2\cdot15}+\frac3{40\cdot14}\right) <\frac{0.88}{2ne^{2n}}.

Here we bounded 1−e−21-e^{-2} by 11 only in the last error term and used n≥14n\ge14 in the other positive factors. Every scalar comparison in (A) and the subsequent displays is enclosed with rational Taylor bounds in the numerical certificate. This proves all three inequalities uniformly for every integer n≥11n\ge11.

Scope. The ordinary proof is complete relative to the exact Rosser–Schoenfeld estimate. The computation treats three finite bands, not an infinite enumeration. Retaining the factor 0.880.88 supplies the uniform numerical margin used in the compiled proof of Theorem 1; this is not presented as an author-issued correction.

Bears on. Problem 2.