Garfield’s Proof of the Garfield’s Proof Pie- thagorean Theorem Garfield’s Proof of the.
A Direct Proof of the Prime Number Theorem
Transcript of A Direct Proof of the Prime Number Theorem
![Page 1: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/1.jpg)
A Direct Proof of thePrime Number Theorem
Stephen Lucas
Department of Mathematics and Statistics
James Madison University, Harrisonburg VA
The primes . . . those exasperating, unruly integers that refuse to be divided evenly by any integers
except themselves and one.
Martin Gardner
Direct PNT – p. 1/28
![Page 2: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/2.jpg)
Outline
Why me?
What is the Prime Number Theorem.
History of Prime Number Theorem.
Transforms.
A direct proof.
Riemann’s and the “exact” forms.
Number of distinct primes.
Conclusion.
Thanks to Ken Lever (Cardiff), Richard Martin (London)
Direct PNT – p. 2/28
![Page 3: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/3.jpg)
Research ProjectsNumerical AnalysisAccurately finding multiple roots.
Euler-Maclaurin-like summation for Simp-son’s rule.
Placing a circle pack.
Applied MathDeformation of half-spaces.Micro-pore diffusion in a finite volume.
Froth Flotation.Deformation of spectacle lenses.
Pure MathFractals in regular graphs.
Integral approximations to π.The Hamiltonian cycle problem.
NewImproving kissing sphere bounds.Counting cycles in graphs.
Integer-valued logistic equation.Fitting data to predator-prey.
Representing reals using boundedcontinued fractions.
Analysis of “Dreidel”.
Direct PNT – p. 3/28
![Page 4: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/4.jpg)
Research ProjectsNumerical AnalysisAccurately finding multiple roots.
Euler-Maclaurin-like summation for Simp-son’s rule.
Placing a circle pack.Applied MathDeformation of half-spaces.Micro-pore diffusion in a finite volume.
Froth Flotation.Deformation of spectacle lenses.
Pure MathFractals in regular graphs.
Integral approximations to π.The Hamiltonian cycle problem.
NewImproving kissing sphere bounds.Counting cycles in graphs.
Integer-valued logistic equation.Fitting data to predator-prey.
Representing reals using boundedcontinued fractions.
Analysis of “Dreidel”.
Direct PNT – p. 3/28
![Page 5: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/5.jpg)
Research ProjectsNumerical AnalysisAccurately finding multiple roots.
Euler-Maclaurin-like summation for Simp-son’s rule.
Placing a circle pack.Applied MathDeformation of half-spaces.Micro-pore diffusion in a finite volume.
Froth Flotation.Deformation of spectacle lenses.
Pure MathFractals in regular graphs.
Integral approximations to π.The Hamiltonian cycle problem.
NewImproving kissing sphere bounds.Counting cycles in graphs.
Integer-valued logistic equation.Fitting data to predator-prey.
Representing reals using boundedcontinued fractions.
Analysis of “Dreidel”.
Direct PNT – p. 3/28
![Page 6: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/6.jpg)
Research ProjectsNumerical AnalysisAccurately finding multiple roots.
Euler-Maclaurin-like summation for Simp-son’s rule.
Placing a circle pack.Applied MathDeformation of half-spaces.Micro-pore diffusion in a finite volume.
Froth Flotation.Deformation of spectacle lenses.
Pure MathFractals in regular graphs.
Integral approximations to π.The Hamiltonian cycle problem.
NewImproving kissing sphere bounds.Counting cycles in graphs.
Integer-valued logistic equation.Fitting data to predator-prey.
Representing reals using boundedcontinued fractions.
Analysis of “Dreidel”.
Direct PNT – p. 3/28
![Page 7: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/7.jpg)
The Prime Number Theorem
A prime number is any integer ≥ 2 with no divisors except itself and one.
Let π(x) be the number of primes less than or equal to x. (π(x)→∞ asx→∞)
The prime number theorem states that
π(x) ∼x
lnxor lim
x→∞
π(x)
x/ lnx= 1.
Another form states that
π(x) ∼ −
∫ x
0
dt
ln t(= li(x))
Direct PNT – p. 4/28
![Page 8: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/8.jpg)
The Prime Number Theorem
A prime number is any integer ≥ 2 with no divisors except itself and one.
Let π(x) be the number of primes less than or equal to x. (π(x)→∞ asx→∞)
The prime number theorem states that
π(x) ∼x
lnxor lim
x→∞
π(x)
x/ lnx= 1.
Another form states that
π(x) ∼ −
∫ x
0
dt
ln t(= li(x))
Direct PNT – p. 4/28
![Page 9: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/9.jpg)
The Prime Number Theorem
A prime number is any integer ≥ 2 with no divisors except itself and one.
Let π(x) be the number of primes less than or equal to x. (π(x)→∞ asx→∞)
The prime number theorem states that
π(x) ∼x
lnxor lim
x→∞
π(x)
x/ lnx= 1.
Another form states that
π(x) ∼ −
∫ x
0
dt
ln t(= li(x))
Direct PNT – p. 4/28
![Page 10: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/10.jpg)
The Prime Number Theorem
A prime number is any integer ≥ 2 with no divisors except itself and one.
Let π(x) be the number of primes less than or equal to x. (π(x)→∞ asx→∞)
The prime number theorem states that
π(x) ∼x
lnxor lim
x→∞
π(x)
x/ lnx= 1.
Another form states that
π(x) ∼ −
∫ x
0
dt
ln t(= li(x))
Direct PNT – p. 4/28
![Page 11: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/11.jpg)
Plot of π(x), x/ ln x, li(x)
x
Num
ber
ofP
rim
es
Rel
ativ
eE
rror
101 103 105 107 109 1011 1013 1015100
102
104
106
108
1010
1012
1014
10-8
10-7
10-6
10-5
10-4
10-3
10-2
10-1
100
x/ln x
li(x)
Direct PNT – p. 5/28
![Page 12: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/12.jpg)
History of the PNT
Legendre (1798) conjectured π(x) =x
A lnx+B.
Legendre (1808) used numerical evidence to claim
π(x) =x
lnx+A(x), where lim
x→∞A(x) = 1.08366 . . ..
Gauss (1849, as early as 1792) used numerical evidence toconjecture that
π(x) ∼ −
∫ x
0
dt
ln t.
Dirichlet (1837) introduced Dirichlet series:
f(s) =∞∑
n=1
f(n)
ns.
Direct PNT – p. 6/28
![Page 13: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/13.jpg)
History of the PNT
Legendre (1798) conjectured π(x) =x
A lnx+B.
Legendre (1808) used numerical evidence to claim
π(x) =x
lnx+A(x), where lim
x→∞A(x) = 1.08366 . . ..
Gauss (1849, as early as 1792) used numerical evidence toconjecture that
π(x) ∼ −
∫ x
0
dt
ln t.
Dirichlet (1837) introduced Dirichlet series:
f(s) =∞∑
n=1
f(n)
ns.
Direct PNT – p. 6/28
![Page 14: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/14.jpg)
History of the PNT
Legendre (1798) conjectured π(x) =x
A lnx+B.
Legendre (1808) used numerical evidence to claim
π(x) =x
lnx+A(x), where lim
x→∞A(x) = 1.08366 . . ..
Gauss (1849, as early as 1792) used numerical evidence toconjecture that
π(x) ∼ −
∫ x
0
dt
ln t.
Dirichlet (1837) introduced Dirichlet series:
f(s) =∞∑
n=1
f(n)
ns.
Direct PNT – p. 6/28
![Page 15: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/15.jpg)
History of the PNT
Legendre (1798) conjectured π(x) =x
A lnx+B.
Legendre (1808) used numerical evidence to claim
π(x) =x
lnx+A(x), where lim
x→∞A(x) = 1.08366 . . ..
Gauss (1849, as early as 1792) used numerical evidence toconjecture that
π(x) ∼ −
∫ x
0
dt
ln t.
Dirichlet (1837) introduced Dirichlet series:
f(s) =
∞∑
n=1
f(n)
ns.
Direct PNT – p. 6/28
![Page 16: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/16.jpg)
History of the PNT (cont’d)
Chebyshev (1851) introduced
θ(x) =∑
p≤x
ln p, ψ(x) =∑
pm≤x
ln p,
and showed that the PNT is equivalent to
limx→∞
θ(x)
x= 1, lim
x→∞
ψ(x)
x= 1.
Riemann (1860) introduced the Riemann zeta function:
ζ(s) =∞∑
n=1
1
ns=∏
p
(1−
1
ps
)−1
, <(s) > 1.
Direct PNT – p. 7/28
![Page 17: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/17.jpg)
History of the PNT (cont’d)
Chebyshev (1851) introduced
θ(x) =∑
p≤x
ln p, ψ(x) =∑
pm≤x
ln p,
and showed that the PNT is equivalent to
limx→∞
θ(x)
x= 1, lim
x→∞
ψ(x)
x= 1.
Riemann (1860) introduced the Riemann zeta function:
ζ(s) =∞∑
n=1
1
ns=∏
p
(1−
1
ps
)−1
, <(s) > 1.
Direct PNT – p. 7/28
![Page 18: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/18.jpg)
Riemann Zeta Function
Integrals extend to whole plane by analytic continuation.
Only singularity at s = 1, ζ(s) =1
s− 1+ γ + γ1(s− 1) + · · ·.
Showed using residue calculus that
ψ(x) = x−∑
ρ
xρ
ρ−ζ ′(0)
ζ(0)−
1
2ln(1− x−2
),
where ρ are the non-trivial zeros of ζ(s), so the PNT is equivalent to
limx→∞
1
x
∑
ρ
xρ
ρ= 0.
Riemann hypothesis: <(ρ) =1
2.
Direct PNT – p. 8/28
![Page 19: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/19.jpg)
Riemann Zeta Function
Integrals extend to whole plane by analytic continuation.
Only singularity at s = 1, ζ(s) =1
s− 1+ γ + γ1(s− 1) + · · ·.
Showed using residue calculus that
ψ(x) = x−∑
ρ
xρ
ρ−ζ ′(0)
ζ(0)−
1
2ln(1− x−2
),
where ρ are the non-trivial zeros of ζ(s), so the PNT is equivalent to
limx→∞
1
x
∑
ρ
xρ
ρ= 0.
Riemann hypothesis: <(ρ) =1
2.
Direct PNT – p. 8/28
![Page 20: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/20.jpg)
Riemann Zeta Function
Integrals extend to whole plane by analytic continuation.
Only singularity at s = 1, ζ(s) =1
s− 1+ γ + γ1(s− 1) + · · ·.
Showed using residue calculus that
ψ(x) = x−∑
ρ
xρ
ρ−ζ ′(0)
ζ(0)−
1
2ln(1− x−2
),
where ρ are the non-trivial zeros of ζ(s), so the PNT is equivalent to
limx→∞
1
x
∑
ρ
xρ
ρ= 0.
Riemann hypothesis: <(ρ) =1
2.
Direct PNT – p. 8/28
![Page 21: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/21.jpg)
Riemann Zeta Function
Integrals extend to whole plane by analytic continuation.
Only singularity at s = 1, ζ(s) =1
s− 1+ γ + γ1(s− 1) + · · ·.
Showed using residue calculus that
ψ(x) = x−∑
ρ
xρ
ρ−ζ ′(0)
ζ(0)−
1
2ln(1− x−2
),
where ρ are the non-trivial zeros of ζ(s), so the PNT is equivalent to
limx→∞
1
x
∑
ρ
xρ
ρ= 0.
Riemann hypothesis: <(ρ) =1
2.
Direct PNT – p. 8/28
![Page 22: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/22.jpg)
First Proof of the PNT
Hadamard & de la Valèe Poussin (1896, independently) showed ∃a, t0
such that ζ(σ + it) 6= 0 if σ ≥ 1−1
a log |t|, |t| ≥ t0, so
ψ(x) = x+O(xe−c(log x)1/14
).
Direct PNT – p. 9/28
![Page 23: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/23.jpg)
Improvements to the PNT Proof
Mertens (1898) gave a short proof that ζ(s) 6= 0, <(s) = 1.
Ikehara (1930) & Wiener (1932) used Tauberian theorems to proveIkehara’s theorem:
Let f(s) =∞∑
n=1
an
ns, ai real and nonnegative.
If f(s) converges for <(s) > 1, and ∃A > 0 s.t. for all t ∈ R,
f(s)−A
(s− 1)→ finite limit as s→ 1+ + it, then
∑n≤x an ∼ Ax.
This can be used to show limx→∞
ψ(x)/x = 1 directly.
Direct PNT – p. 10/28
![Page 24: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/24.jpg)
Improvements to the PNT Proof
Mertens (1898) gave a short proof that ζ(s) 6= 0, <(s) = 1.
Ikehara (1930) & Wiener (1932) used Tauberian theorems to proveIkehara’s theorem:
Let f(s) =∞∑
n=1
an
ns, ai real and nonnegative.
If f(s) converges for <(s) > 1, and ∃A > 0 s.t. for all t ∈ R,
f(s)−A
(s− 1)→ finite limit as s→ 1+ + it, then
∑n≤x an ∼ Ax.
This can be used to show limx→∞
ψ(x)/x = 1 directly.
Direct PNT – p. 10/28
![Page 25: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/25.jpg)
Improvements (cont’d)
Erdös & Selberg (1949) produced an “elementary” proof – no complexanalysis.
Newman (1980) showed limx→∞
ψ(x)/x = 1 using straightforward
contour integration.
Lucas, Martin & Lever – current work, looks at π(x) directly.
Direct PNT – p. 11/28
![Page 26: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/26.jpg)
Improvements (cont’d)
Erdös & Selberg (1949) produced an “elementary” proof – no complexanalysis.
Newman (1980) showed limx→∞
ψ(x)/x = 1 using straightforward
contour integration.
Lucas, Martin & Lever – current work, looks at π(x) directly.
Direct PNT – p. 11/28
![Page 27: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/27.jpg)
Improvements (cont’d)
Erdös & Selberg (1949) produced an “elementary” proof – no complexanalysis.
Newman (1980) showed limx→∞
ψ(x)/x = 1 using straightforward
contour integration.
Lucas, Martin & Lever – current work, looks at π(x) directly.
Direct PNT – p. 11/28
![Page 28: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/28.jpg)
Laplace Transforms
Lf(x) = f(s) =
∫ ∞
0
e−sxf(x) dx.
L−1f(s) = H(x)f(x) =1
2πi
∫ ε+i∞
ε−i∞
f(s)esx ds.
H is the unit step function.
ε to the right of any singularities in f(s).
assume f(s)→ 0 as |s| → ∞.
Choose g(s) such that f(s)− g(s) is analytic at the rightmostsingularity in f(s). If g(s)→ 0 as |s| → ∞, then shift the integrationcontour to the left, apply the Cauchy integral theorem, and get thatf(x) = g(x) +O(xc), where c is the new position of ε. (e.g. Smith,1966)
Direct PNT – p. 12/28
![Page 29: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/29.jpg)
Laplace Transforms
Lf(x) = f(s) =
∫ ∞
0
e−sxf(x) dx.
L−1f(s) = H(x)f(x) =1
2πi
∫ ε+i∞
ε−i∞
f(s)esx ds.
H is the unit step function.
ε to the right of any singularities in f(s).
assume f(s)→ 0 as |s| → ∞.
Choose g(s) such that f(s)− g(s) is analytic at the rightmostsingularity in f(s). If g(s)→ 0 as |s| → ∞, then shift the integrationcontour to the left, apply the Cauchy integral theorem, and get thatf(x) = g(x) +O(xc), where c is the new position of ε. (e.g. Smith,1966)
Direct PNT – p. 12/28
![Page 30: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/30.jpg)
Laplace Transforms
Lf(x) = f(s) =
∫ ∞
0
e−sxf(x) dx.
L−1f(s) = H(x)f(x) =1
2πi
∫ ε+i∞
ε−i∞
f(s)esx ds.
H is the unit step function.
ε to the right of any singularities in f(s).
assume f(s)→ 0 as |s| → ∞.
Choose g(s) such that f(s)− g(s) is analytic at the rightmostsingularity in f(s).
If g(s)→ 0 as |s| → ∞, then shift the integrationcontour to the left, apply the Cauchy integral theorem, and get thatf(x) = g(x) +O(xc), where c is the new position of ε. (e.g. Smith,1966)
Direct PNT – p. 12/28
![Page 31: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/31.jpg)
Laplace Transforms
Lf(x) = f(s) =
∫ ∞
0
e−sxf(x) dx.
L−1f(s) = H(x)f(x) =1
2πi
∫ ε+i∞
ε−i∞
f(s)esx ds.
H is the unit step function.
ε to the right of any singularities in f(s).
assume f(s)→ 0 as |s| → ∞.
Choose g(s) such that f(s)− g(s) is analytic at the rightmostsingularity in f(s). If g(s)→ 0 as |s| → ∞, then shift the integrationcontour to the left, apply the Cauchy integral theorem, and get thatf(x) = g(x) +O(xc), where c is the new position of ε. (e.g. Smith,1966)
Direct PNT – p. 12/28
![Page 32: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/32.jpg)
Arithmetic Functions and Dirichlet Series
An arithmetic function is a map f : N→ C.
Its Dirichlet series is f(s) =∞∑
n=1
f(n)
ns,
convergent for <(s) > c if f(n) = O(nc−1) as n→∞.
Given that
1
2πi
∫ ε+i∞
ε−i∞
xs
sds =
0, x < 1,
1, x > 1,ε > 0,
then
1
2πi
∫ ε+i∞
ε−i∞
xsf(s)ds
s=
∞∑
n=1
f(n)×
0, x < n,
1, x > n,
=∑
1≤n≤x
f(n).
Direct PNT – p. 13/28
![Page 33: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/33.jpg)
Arithmetic Functions and Dirichlet Series
An arithmetic function is a map f : N→ C.
Its Dirichlet series is f(s) =∞∑
n=1
f(n)
ns,
convergent for <(s) > c if f(n) = O(nc−1) as n→∞.
Given that
1
2πi
∫ ε+i∞
ε−i∞
xs
sds =
0, x < 1,
1, x > 1,ε > 0,
then
1
2πi
∫ ε+i∞
ε−i∞
xsf(s)ds
s=
∞∑
n=1
f(n)×
0, x < n,
1, x > n,
=∑
1≤n≤x
f(n).
Direct PNT – p. 13/28
![Page 34: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/34.jpg)
Arithmetic Functions and Dirichlet Series
An arithmetic function is a map f : N→ C.
Its Dirichlet series is f(s) =∞∑
n=1
f(n)
ns,
convergent for <(s) > c if f(n) = O(nc−1) as n→∞.
Given that
1
2πi
∫ ε+i∞
ε−i∞
xs
sds =
0, x < 1,
1, x > 1,ε > 0,
then
1
2πi
∫ ε+i∞
ε−i∞
xsf(s)ds
s=
∞∑
n=1
f(n)×
0, x < n,
1, x > n,
=∑
1≤n≤x
f(n).
Direct PNT – p. 13/28
![Page 35: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/35.jpg)
The Transform
We can recognize this as the inversion of a Laplace-like transform(x = et):
(Mf)(t) =
∫ ∞
1
f(x)x−s−1 dx,
H(x− 1)f(x) =1
2πi
∫ ε+i∞
ε−i∞
(Mf)(t)xt dt.
Some useful transform pairs are:
fM←→ M(f)
γ + ln(lnx)1
slog
1
s
xali(xc)1
s− alog
c
s− a− c, <(s) > c > 0
Γ(k)−1xc(lnx)k−1 1
(s− c)k, <(s) > c; k > 0
Direct PNT – p. 14/28
![Page 36: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/36.jpg)
The Transform
We can recognize this as the inversion of a Laplace-like transform(x = et):
(Mf)(t) =
∫ ∞
1
f(x)x−s−1 dx,
H(x− 1)f(x) =1
2πi
∫ ε+i∞
ε−i∞
(Mf)(t)xt dt.
Some useful transform pairs are:
fM←→ M(f)
γ + ln(lnx)1
slog
1
s
xali(xc)1
s− alog
c
s− a− c, <(s) > c > 0
Γ(k)−1xc(lnx)k−1 1
(s− c)k, <(s) > c; k > 0
Direct PNT – p. 14/28
![Page 37: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/37.jpg)
Average Order Asymptotics
The average order of an arithmetic function is f(x) =1
x
∑
1≤n≤x
f(n).
Then xf(x) =1
2πi
∫ ε+i∞
ε−i∞
f(s)xs−1 ds,
and xf(x)M←→
f(s)
sand f(x)
M←→
f(s+ 1)
s+ 1.
So, to find the asymptotic form of an average order:
find its Dirichlet series f(s) in closed form,
identify the position and form of the singularities inf(s)
s,
sum the inverse transforms of the singular parts.
Direct PNT – p. 15/28
![Page 38: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/38.jpg)
Average Order Asymptotics
The average order of an arithmetic function is f(x) =1
x
∑
1≤n≤x
f(n).
Then xf(x) =1
2πi
∫ ε+i∞
ε−i∞
f(s)xs−1 ds,
and xf(x)M←→
f(s)
sand f(x)
M←→
f(s+ 1)
s+ 1.
So, to find the asymptotic form of an average order:
find its Dirichlet series f(s) in closed form,
identify the position and form of the singularities inf(s)
s,
sum the inverse transforms of the singular parts.
Direct PNT – p. 15/28
![Page 39: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/39.jpg)
Average Order Asymptotics
The average order of an arithmetic function is f(x) =1
x
∑
1≤n≤x
f(n).
Then xf(x) =1
2πi
∫ ε+i∞
ε−i∞
f(s)xs−1 ds,
and xf(x)M←→
f(s)
sand f(x)
M←→
f(s+ 1)
s+ 1.
So, to find the asymptotic form of an average order:
find its Dirichlet series f(s) in closed form,
identify the position and form of the singularities inf(s)
s,
sum the inverse transforms of the singular parts.
Direct PNT – p. 15/28
![Page 40: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/40.jpg)
Average Order Asymptotics
The average order of an arithmetic function is f(x) =1
x
∑
1≤n≤x
f(n).
Then xf(x) =1
2πi
∫ ε+i∞
ε−i∞
f(s)xs−1 ds,
and xf(x)M←→
f(s)
sand f(x)
M←→
f(s+ 1)
s+ 1.
So, to find the asymptotic form of an average order:
find its Dirichlet series f(s) in closed form,
identify the position and form of the singularities inf(s)
s,
sum the inverse transforms of the singular parts.
Direct PNT – p. 15/28
![Page 41: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/41.jpg)
Riemann and Prime Zeta-Functions
The Riemann zeta-function is the Dirichlet series of f(n) = 1:
ζ(s) =∞∑
n=1
1
ns=∏
p
1
1− p−s.
ζ(s) only singularity ∼1
s− 1at s = 1, and ζ(s) 6= 0 for <(s) ≥ 1.
The prime zeta-function is the Dirichlet series of
f(n) =
1, n prime,
0, otherwise,: P (s) =
∑
p
1
ps.
Direct PNT – p. 16/28
![Page 42: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/42.jpg)
Riemann and Prime Zeta-Functions
The Riemann zeta-function is the Dirichlet series of f(n) = 1:
ζ(s) =∞∑
n=1
1
ns=∏
p
1
1− p−s.
ζ(s) only singularity ∼1
s− 1at s = 1, and ζ(s) 6= 0 for <(s) ≥ 1.
The prime zeta-function is the Dirichlet series of
f(n) =
1, n prime,
0, otherwise,: P (s) =
∑
p
1
ps.
Direct PNT – p. 16/28
![Page 43: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/43.jpg)
Riemann and Prime Zeta-Functions
The Riemann zeta-function is the Dirichlet series of f(n) = 1:
ζ(s) =∞∑
n=1
1
ns=∏
p
1
1− p−s.
ζ(s) only singularity ∼1
s− 1at s = 1, and ζ(s) 6= 0 for <(s) ≥ 1.
The prime zeta-function is the Dirichlet series of
f(n) =
1, n prime,
0, otherwise,: P (s) =
∑
p
1
ps.
Direct PNT – p. 16/28
![Page 44: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/44.jpg)
The Prime Zeta-Function
Now
log ζ(s) =∑
p
log
(1
1− p−s
)=
∑
p
∞∑
m=1
1
mpms
=∞∑
m=1
1
mP (ms).
Using the Möbius inversion formula,
P (s) =∞∑
n=1
µ(n)
nlog ζ(ns),
where µ(n) =
0, n contains a square factor,
(−1)m, n a product of m distinct primes.
Direct PNT – p. 17/28
![Page 45: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/45.jpg)
The Prime Zeta-Function
Now
log ζ(s) =∑
p
log
(1
1− p−s
)=
∑
p
∞∑
m=1
1
mpms
=∞∑
m=1
1
mP (ms).
Using the Möbius inversion formula,
P (s) =∞∑
n=1
µ(n)
nlog ζ(ns),
where µ(n) =
0, n contains a square factor,
(−1)m, n a product of m distinct primes.
Direct PNT – p. 17/28
![Page 46: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/46.jpg)
The Prime Number Theorem
Let
f(n) =
1, n prime,
0, otherwise,
Then
f(s) = P (s) and xf(x) = π(x).
So
π(x)M←→
P (s)
s.
The rightmost singularity ofP (s)
sis
1
slog
1
s− 1at s− 1, whose inverse
transform is li(x).So π(x) ∼ li(x).
Direct PNT – p. 18/28
![Page 47: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/47.jpg)
The Prime Number Theorem
Let
f(n) =
1, n prime,
0, otherwise,
Then
f(s) = P (s) and xf(x) = π(x).
So
π(x)M←→
P (s)
s.
The rightmost singularity ofP (s)
sis
1
slog
1
s− 1at s− 1, whose inverse
transform is li(x).So π(x) ∼ li(x).
Direct PNT – p. 18/28
![Page 48: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/48.jpg)
The Prime Number Theorem
Let
f(n) =
1, n prime,
0, otherwise,
Then
f(s) = P (s) and xf(x) = π(x).
So
π(x)M←→
P (s)
s.
The rightmost singularity ofP (s)
sis
1
slog
1
s− 1at s− 1, whose inverse
transform is li(x).So π(x) ∼ li(x).
Direct PNT – p. 18/28
![Page 49: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/49.jpg)
The Prime Number Theorem
Let
f(n) =
1, n prime,
0, otherwise,
Then
f(s) = P (s) and xf(x) = π(x).
So
π(x)M←→
P (s)
s.
The rightmost singularity ofP (s)
sis
1
slog
1
s− 1at s− 1, whose inverse
transform is li(x).
So π(x) ∼ li(x).
Direct PNT – p. 18/28
![Page 50: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/50.jpg)
The Prime Number Theorem
Let
f(n) =
1, n prime,
0, otherwise,
Then
f(s) = P (s) and xf(x) = π(x).
So
π(x)M←→
P (s)
s.
The rightmost singularity ofP (s)
sis
1
slog
1
s− 1at s− 1, whose inverse
transform is li(x).So π(x) ∼ li(x).
Direct PNT – p. 18/28
![Page 51: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/51.jpg)
Riemann’s Form of π(x)
Recall P (s) =
∞∑
n=1
µ(n)
nlog ζ(ns).
Singularity in ζ(s) at s = 1 means singularities inP (s)
sat s =
1
n, µ(n) 6= 0.
At these points, singularities take the formµ(n)
nslog
1
ns− 1, whose inverse
transforms are µ(n)li(x1/n)
n.
So
π(x) ∼ li(x) +∞∑
n=2
µ(n)
nli(x1/n
)= R(x).
Direct PNT – p. 19/28
![Page 52: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/52.jpg)
Riemann’s Form of π(x)
Recall P (s) =
∞∑
n=1
µ(n)
nlog ζ(ns).
Singularity in ζ(s) at s = 1 means singularities inP (s)
sat s =
1
n, µ(n) 6= 0.
At these points, singularities take the formµ(n)
nslog
1
ns− 1, whose inverse
transforms are µ(n)li(x1/n)
n.
So
π(x) ∼ li(x) +∞∑
n=2
µ(n)
nli(x1/n
)= R(x).
Direct PNT – p. 19/28
![Page 53: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/53.jpg)
Riemann’s Form of π(x)
Recall P (s) =
∞∑
n=1
µ(n)
nlog ζ(ns).
Singularity in ζ(s) at s = 1 means singularities inP (s)
sat s =
1
n, µ(n) 6= 0.
At these points, singularities take the formµ(n)
nslog
1
ns− 1, whose inverse
transforms are µ(n)li(x1/n)
n.
So
π(x) ∼ li(x) +∞∑
n=2
µ(n)
nli(x1/n
)= R(x).
Direct PNT – p. 19/28
![Page 54: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/54.jpg)
Riemann’s Form of π(x)
Recall P (s) =
∞∑
n=1
µ(n)
nlog ζ(ns).
Singularity in ζ(s) at s = 1 means singularities inP (s)
sat s =
1
n, µ(n) 6= 0.
At these points, singularities take the formµ(n)
nslog
1
ns− 1, whose inverse
transforms are µ(n)li(x1/n)
n.
So
π(x) ∼ li(x) +∞∑
n=2
µ(n)
nli(x1/n
)= R(x).
Direct PNT – p. 19/28
![Page 55: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/55.jpg)
“Exact” Form of π(x)
Recall P (s) =
∞∑
n=1
µ(n)
nlog ζ(ns).
Zero of ζ(s) at s = ρm means a singularity in P (s)/s at s = ρm of the form1
slog
(s
ρm− 1
), whose inverse is −li(xρm).
As for Riemann’s form, singularity in ζ(s) at s = ρm also meanssingularities in P (s) at s = ρm/n, µ(n) 6= 0. These singularities are of the
formµ(n)
nslog
(ns
ρm− 1
), whose inverses are −µ(n)li
(xρm/n
)/n.
The contributions of all singularities related to s = ρm contribute −R(xρm)
to π(x), and so
π(x) = limk→∞
Rk(x) where Rk(x) = R(x)−k∑
m=−k
R(xρm).
Direct PNT – p. 20/28
![Page 56: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/56.jpg)
“Exact” Form of π(x)
Recall P (s) =
∞∑
n=1
µ(n)
nlog ζ(ns).
Zero of ζ(s) at s = ρm means a singularity in P (s)/s at s = ρm of the form1
slog
(s
ρm− 1
), whose inverse is −li(xρm).
As for Riemann’s form, singularity in ζ(s) at s = ρm also meanssingularities in P (s) at s = ρm/n, µ(n) 6= 0. These singularities are of the
formµ(n)
nslog
(ns
ρm− 1
), whose inverses are −µ(n)li
(xρm/n
)/n.
The contributions of all singularities related to s = ρm contribute −R(xρm)
to π(x), and so
π(x) = limk→∞
Rk(x) where Rk(x) = R(x)−k∑
m=−k
R(xρm).
Direct PNT – p. 20/28
![Page 57: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/57.jpg)
“Exact” Form of π(x)
Recall P (s) =
∞∑
n=1
µ(n)
nlog ζ(ns).
Zero of ζ(s) at s = ρm means a singularity in P (s)/s at s = ρm of the form1
slog
(s
ρm− 1
), whose inverse is −li(xρm).
As for Riemann’s form, singularity in ζ(s) at s = ρm also meanssingularities in P (s) at s = ρm/n, µ(n) 6= 0. These singularities are of the
formµ(n)
nslog
(ns
ρm− 1
), whose inverses are −µ(n)li
(xρm/n
)/n.
The contributions of all singularities related to s = ρm contribute −R(xρm)
to π(x), and so
π(x) = limk→∞
Rk(x) where Rk(x) = R(x)−k∑
m=−k
R(xρm).
Direct PNT – p. 20/28
![Page 58: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/58.jpg)
“Exact” Form of π(x)
Recall P (s) =
∞∑
n=1
µ(n)
nlog ζ(ns).
Zero of ζ(s) at s = ρm means a singularity in P (s)/s at s = ρm of the form1
slog
(s
ρm− 1
), whose inverse is −li(xρm).
As for Riemann’s form, singularity in ζ(s) at s = ρm also meanssingularities in P (s) at s = ρm/n, µ(n) 6= 0. These singularities are of the
formµ(n)
nslog
(ns
ρm− 1
), whose inverses are −µ(n)li
(xρm/n
)/n.
The contributions of all singularities related to s = ρm contribute −R(xρm)
to π(x), and so
π(x) = limk→∞
Rk(x) where Rk(x) = R(x)−k∑
m=−k
R(xρm).
Direct PNT – p. 20/28
![Page 59: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/59.jpg)
Number of Distinct Primes
Define ω(n) to be the number of distinct primes in the primedecomposition of n, and Ω(n) to be the total number of primes.
If n = pα1
1 pα2
2 . . . pαk
k (pi’s some primes), then ω(n) = k andΩ(n) = α1 + α2 + · · ·+ αk.
It is well known (e.g. Hardy & Wright) that ω(n) = ln(lnn) +B1 + o(1),
where B1 = γ +∑
p
ln
(1−
1
p
)+
1
p
= 0.26149 72128 47642 . . .,
and Ω(n) = ω(n) +∑
p
1
p(p− 1)= ω(n) +B2 −B1,
where B2 = 1.03465 38818 97438 . . ..
Direct PNT – p. 21/28
![Page 60: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/60.jpg)
Number of Distinct Primes
Define ω(n) to be the number of distinct primes in the primedecomposition of n, and Ω(n) to be the total number of primes.
If n = pα1
1 pα2
2 . . . pαk
k (pi’s some primes), then ω(n) = k andΩ(n) = α1 + α2 + · · ·+ αk.
It is well known (e.g. Hardy & Wright) that ω(n) = ln(lnn) +B1 + o(1),
where B1 = γ +∑
p
ln
(1−
1
p
)+
1
p
= 0.26149 72128 47642 . . .,
and Ω(n) = ω(n) +∑
p
1
p(p− 1)= ω(n) +B2 −B1,
where B2 = 1.03465 38818 97438 . . ..
Direct PNT – p. 21/28
![Page 61: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/61.jpg)
Number of Distinct Primes
Define ω(n) to be the number of distinct primes in the primedecomposition of n, and Ω(n) to be the total number of primes.
If n = pα1
1 pα2
2 . . . pαk
k (pi’s some primes), then ω(n) = k andΩ(n) = α1 + α2 + · · ·+ αk.
It is well known (e.g. Hardy & Wright) that ω(n) = ln(lnn) +B1 + o(1),
where B1 = γ +∑
p
ln
(1−
1
p
)+
1
p
= 0.26149 72128 47642 . . .,
and Ω(n) = ω(n) +∑
p
1
p(p− 1)= ω(n) +B2 −B1,
where B2 = 1.03465 38818 97438 . . ..
Direct PNT – p. 21/28
![Page 62: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/62.jpg)
Asymptotics for ω
We can show that
ω(s) = ζ(s)P (s), and ω(x)M←→
ζ(s+ 1)
(s+ 1)P (s+ 1).
Expanding around the rightmost singularity at the origin,
1
slog
1
s+
1
s
∞∑
m=2
µ(m)
mln ζ(m) +
γ − 1
s+ 1log
1
s+O(1).
Inversion gives
ω(x) ∼ ln(lnx) + γ +∞∑
m=2
µ(m)
mln ζ(m) + (γ − 1)
li(x)x
.
Previously ω(n) ∼ ln(lnn) + γ +∑
p
ln
(1−
1
p
)+
1
p
.
Direct PNT – p. 22/28
![Page 63: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/63.jpg)
Asymptotics for ω
We can show that
ω(s) = ζ(s)P (s), and ω(x)M←→
ζ(s+ 1)
(s+ 1)P (s+ 1).
Expanding around the rightmost singularity at the origin,
1
slog
1
s+
1
s
∞∑
m=2
µ(m)
mln ζ(m) +
γ − 1
s+ 1log
1
s+O(1).
Inversion gives
ω(x) ∼ ln(lnx) + γ +∞∑
m=2
µ(m)
mln ζ(m) + (γ − 1)
li(x)x
.
Previously ω(n) ∼ ln(lnn) + γ +∑
p
ln
(1−
1
p
)+
1
p
.
Direct PNT – p. 22/28
![Page 64: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/64.jpg)
Asymptotics for ω
We can show that
ω(s) = ζ(s)P (s), and ω(x)M←→
ζ(s+ 1)
(s+ 1)P (s+ 1).
Expanding around the rightmost singularity at the origin,
1
slog
1
s+
1
s
∞∑
m=2
µ(m)
mln ζ(m) +
γ − 1
s+ 1log
1
s+O(1).
Inversion gives
ω(x) ∼ ln(lnx) + γ +∞∑
m=2
µ(m)
mln ζ(m) + (γ − 1)
li(x)x
.
Previously ω(n) ∼ ln(lnn) + γ +∑
p
ln
(1−
1
p
)+
1
p
.
Direct PNT – p. 22/28
![Page 65: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/65.jpg)
Asymptotics for ω
We can show that
ω(s) = ζ(s)P (s), and ω(x)M←→
ζ(s+ 1)
(s+ 1)P (s+ 1).
Expanding around the rightmost singularity at the origin,
1
slog
1
s+
1
s
∞∑
m=2
µ(m)
mln ζ(m) +
γ − 1
s+ 1log
1
s+O(1).
Inversion gives
ω(x) ∼ ln(lnx) + γ +∞∑
m=2
µ(m)
mln ζ(m) + (γ − 1)
li(x)x
.
Previously ω(n) ∼ ln(lnn) + γ +∑
p
ln
(1−
1
p
)+
1
p
.
Direct PNT – p. 22/28
![Page 66: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/66.jpg)
Asymptotics for Ω
Similarly,
Ω(s)− ω(s) = ζ(s)∞∑
k=2
P (ks),
Ω(x)− ω(x)M←→
ζ(s+ 1)
s+ 1
∞∑
k=2
P (k(s+ 1)),
Ω(x) ∼ ω(x) +∞∑
k=2
P (k).
(Old Ω(n) = ω(n) +
∑
p
1
p(p− 1)
).
Direct PNT – p. 23/28
![Page 67: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/67.jpg)
Asymptotics for Ω
Similarly,
Ω(s)− ω(s) = ζ(s)∞∑
k=2
P (ks),
Ω(x)− ω(x)M←→
ζ(s+ 1)
s+ 1
∞∑
k=2
P (k(s+ 1)),
Ω(x) ∼ ω(x) +
∞∑
k=2
P (k).
(Old Ω(n) = ω(n) +
∑
p
1
p(p− 1)
).
Direct PNT – p. 23/28
![Page 68: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/68.jpg)
Asymptotics for Ω
Similarly,
Ω(s)− ω(s) = ζ(s)∞∑
k=2
P (ks),
Ω(x)− ω(x)M←→
ζ(s+ 1)
s+ 1
∞∑
k=2
P (k(s+ 1)),
Ω(x) ∼ ω(x) +
∞∑
k=2
P (k).
(Old Ω(n) = ω(n) +
∑
p
1
p(p− 1)
).
Direct PNT – p. 23/28
![Page 69: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/69.jpg)
Asymptotics for Ω
Similarly,
Ω(s)− ω(s) = ζ(s)∞∑
k=2
P (ks),
Ω(x)− ω(x)M←→
ζ(s+ 1)
s+ 1
∞∑
k=2
P (k(s+ 1)),
Ω(x) ∼ ω(x) +
∞∑
k=2
P (k).
(Old Ω(n) = ω(n) +
∑
p
1
p(p− 1)
).
Direct PNT – p. 23/28
![Page 70: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/70.jpg)
Results for ω and Ω
n
Ave
rage
Ord
ers
0 250 500 750 10000
0.5
1
1.5
2
2.5
3
3.5
4
ω
Ω
~
~
(a)
n
Ave
rage
Ord
ers
0.0x10+00 2.5x10+06 5.0x10+06 7.5x10+06 1.0x10+072
2.5
3
3.5
4
(b)
ω
Ω
~
~
Direct PNT – p. 24/28
![Page 71: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/71.jpg)
Asymptotic Errors for ω and Ω
n
Err
ors
104 105 106 10710-5
10-4
10-3
10-2
10-1
ωΩ
Direct PNT – p. 25/28
![Page 72: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/72.jpg)
Conclusion
We have developed a generalization of Ikehara’s theorem that relates theasymptotic behavior of the average order of an arithmetic function to thesingularities in its Dirichlet series.
We have used this technique to prove the prime number theorem directly,without recourse to ψ(x), derived both the Riemann and “exact” forms ofπ(x), and found a correction to the classical ω, Ω average orderasymptotics.
Direct PNT – p. 26/28
![Page 73: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/73.jpg)
Further work:
Apply technique to other arithmetic functions whose Dirichletfunctions are known in closed form. Will the results improve theclassical results?
Reformulation of the twin prime conjecture:
π2(x) is the number of twin primes between 1 and x, and is x timesthe average order of t(n), where t(n) = p(n)p(n− 2)
Can we use results for p to find the Dirichlet series for t, find theform of the rightmost singularity of t, and find a result relating this
to the conjectured asymptotic π2(x) ∼2Cx
(log x)2, where
C =∏
p≥3
p(p− 2)
(p− 1)2?
Direct PNT – p. 27/28
![Page 74: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/74.jpg)
An Integral Proof That π < 355/113
∫ 1
0
x4(1− x)4
1 + x2dx =
22
7− π, which shows π <
22
7(Dalzell 1971, Mahler).
In fact Im,n =
∫ 1
0
xm(1− x)n
1 + x2dx = a+ bπ + c ln(2), (Backhouse 1995),
ab < 0, and if 2m− n(mod 4) ≡ 0, then c = 0.
Unfortunately, no integers m,n lead to Im,n involving other continuedfractions for π.
However, ∫ 1
0
x8(1− x)8(25 + 816x2)
3164(1 + x2)dx =
355
113− π,
which proves π < 355/113.
Direct PNT – p. 28/28
![Page 75: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/75.jpg)
An Integral Proof That π < 355/113
∫ 1
0
x4(1− x)4
1 + x2dx =
22
7− π, which shows π <
22
7(Dalzell 1971, Mahler).
In fact Im,n =
∫ 1
0
xm(1− x)n
1 + x2dx = a+ bπ + c ln(2), (Backhouse 1995),
ab < 0, and if 2m− n(mod 4) ≡ 0, then c = 0.
Unfortunately, no integers m,n lead to Im,n involving other continuedfractions for π.
However, ∫ 1
0
x8(1− x)8(25 + 816x2)
3164(1 + x2)dx =
355
113− π,
which proves π < 355/113.
Direct PNT – p. 28/28
![Page 76: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/76.jpg)
An Integral Proof That π < 355/113
∫ 1
0
x4(1− x)4
1 + x2dx =
22
7− π, which shows π <
22
7(Dalzell 1971, Mahler).
In fact Im,n =
∫ 1
0
xm(1− x)n
1 + x2dx = a+ bπ + c ln(2), (Backhouse 1995),
ab < 0, and if 2m− n(mod 4) ≡ 0, then c = 0.
Unfortunately, no integers m,n lead to Im,n involving other continuedfractions for π.
However, ∫ 1
0
x8(1− x)8(25 + 816x2)
3164(1 + x2)dx =
355
113− π,
which proves π < 355/113.
Direct PNT – p. 28/28
![Page 77: A Direct Proof of the Prime Number Theorem](https://reader034.fdocuments.us/reader034/viewer/2022051404/586a1aff1a28ab81568c138a/html5/thumbnails/77.jpg)
An Integral Proof That π < 355/113
∫ 1
0
x4(1− x)4
1 + x2dx =
22
7− π, which shows π <
22
7(Dalzell 1971, Mahler).
In fact Im,n =
∫ 1
0
xm(1− x)n
1 + x2dx = a+ bπ + c ln(2), (Backhouse 1995),
ab < 0, and if 2m− n(mod 4) ≡ 0, then c = 0.
Unfortunately, no integers m,n lead to Im,n involving other continuedfractions for π.
However, ∫ 1
0
x8(1− x)8(25 + 816x2)
3164(1 + x2)dx =
355
113− π,
which proves π < 355/113.
Direct PNT – p. 28/28