1

DEMONSTRATION OF GOLDBACH CONJECTURE.

BADO Olivier Idriss

(ISE 2)
Ecole Nationale Supérieure de Statistique et d'Economie.
08 BP 03 Abidjan 08, COTE D'IVOIRE.

E-mail : virostake@gmail.com

Abstract : In this paper we are going to give the proof of Goldbach conjecture by intro-
ducing a new lemma which implies Goldbach conjecture .By using Chebotarev-Artin theorem
, Mertens formula and Poincare sieve we establish the lemma .

1 Introduction

The Goldbach conjecture was introduced in 1742 and has never been proven though it has
been veried by computers for all numbers up to 19 digits.
It states that all, even numbers above two are the sum of two prime numbers. All studies
on Goldbach conjecture have failed.So we are going to give a complete proof of Goldbach
conjecture.

1.1 Principle of the Demonstration

Let n an even integer such as above 20 and denote by Cn the set of the composite integers of
fn : Cn → 7 n − Cn
[1, n−1] to what we add 1 and let fn be the bijective mapping such that :
m → 7 n−m
Denote by Gn the subsect of n − Cn consisting of prime numbers and Gn that of composite
0

numbers we have n − Cn = Gn ∪ G0n .Let Pn the set of prime numbers less than or equal to n .
Let
δ(n) = card(Gn ), α(n) = card(Pn \Gn ), Π(n) = card(Pn )
then Π(n) = δ(n) + α(n) ,obviously α(n) represents the number of ways to write n as the sum
of two primes

1.2 Lemma 1

∀n ∈ N , we have Pn \Gn 6= ∅
As we said we are going to give later the proof the lemma 1 .Without loss of generality
,suppose that the lemma 1 is true then we have :

1.3 Lemma 2

∀p ∈ Pn \Gn ,we have n − p ∈ Pn

DEMONSTRATION OF GOLDBACH CONJECTURE .

 2

1.4 Proof of lemma 2

Let n be an even integer above 20 , and suppose that n-p is not prime, then
n − p ∈ Cn

, as
p = n − (n − p)
hence
p ∈ Gn
.The lemma is thus proven . √
Observe that each integer m ∈ Cn such that m ≥ 4 has at least one prime divisor p ≤ n .
Let P≤√n = {p1 , p2 , ...., pr } where p1 = 2,p2 = 3,...pr = max(P≤√n ).
Moreover, remembering that [
Cn = A2p ∪ {1}
p∈P≤√n ,p≥2

where
n−1
A2p = {2p, 3p, 4p, .......(b c)p}
p
. We notice that A2p is an arithmetic sequence of rst term 2p and reason p .
So [
n − Cn = fn (Cn ) = fn (A2p ) ∪ {n − 1}
p∈P≤√n ,p≥2

As
n−1 n−1 n−1
fn (A2p ) = {n−2p, n−3p, n−4p, .......n−b cp} = {n−b cp, n−(b c−1)p......, n−3p, n−2p}
p p p

Then fn (A2p ) is an arithmetic sequence of rst term n − b n−1

p
cp and reason p .
We will evaluate the quantity of prime numbers in p∈P≤√n ,p≥2 fn (A2p )
S

by applying the principle -exclusion of Moivre and Chébotarev -Artin theorem in each fn (A2p )
in the case where p - n

2 Chebotarev-Artin 's Theorem

Let a, b > 0 such that gcd(a, b)√ = 1,Π(X, a, b) = card(p ≤ X, p ≡ a[b]) then ∃c > 0 such
that Π(X, a, b) = Lφ(b)
i (X)
+ (cXe− ln X )
The prime number theorem states
√
that Π(X) = Li (X) + ( lnX2 X ) so
Π(X)
Π(X, a, b) = φ(b)
+ (cXe− ln X
)

3 corollary

Let a, b > 0 such that gcd(a, b) = 1,Π(X, a, b) = card(p ≤ X, p ≡ a[b]) then ∃c > 0 such
that √
Π(X, a, b) 1
= + (c ln Xe− ln X
)
Π(X) φ(b)
.
From probabilistic point of view, the probability of prime numbers less than or equal to X in
an arithmetic progression of reason b and of the rst term has such that gcd(a, b) = 1 is worth

DEMONSTRATION OF GOLDBACH CONJECTURE .

 3

√
1
φ(b)
+ (c ln Xe− ) for X large enough .In the following we will justify the application of
ln X

Chebotein-Artin's theorem for sets kj=1,pi ∈P≤√n fn (A2pij )

T
j
for 1 ≤ i1 < i2 < ..... < ik

3.1 Remarks

It is obvious to note that for k > 2, A2pij is the set of multiples of

Tk Qk
j=1,pij ∈P≤√n j=1 p ij
which allows us to write
k k
\ Y n−1
fn (A2pij ) = {n − m pij |1 ≤ m ≤ b Qk c}
j=1,pij ∈P≤√X j=2 p
j=2 ji

This set is an arithmetic sequence of reason kj=2 pij and rst term n − b Qkn−1p c kj=2 pij .
Q Q
j=2 ij
The hypothesis of application of Chebotarev-Artin's theorem will be justied if and only if
gcd(2 j=2 pij , j=2 pij + n) = 1 which is the case if j=2 pij - n
Qk Qk Qk

4 Demonstration of Goldbach 's conjecture

4.1 Theorem

Let n an even integer be arbitrarily large ,

α(n) = card(Pn \Gn )

the numbers of way to write n in sum of two prime numbers ,

√ √
n n
Y p(p − 2) Y p − 1
βn =
p=3
(p − 1)2 p−2
p=3,p|n

∃n0 such that ∀n ≥ n0

2βn Π(n)
α(n) ≥
ln n

4.2 Useful Lemma

Let a1 , a2 , ......ar be r numbers then

r r
X 1 X 1 (−1)r Y ai − 1
1− + + ..... + =
a
i=1 i
aa
1≤i<j≤r i j
a1 a2 ....ar i=1
ai

4.3 Proof

Let us consider the polynomial :P (X) = from the coecient-root relations

Qr 1
i=1 (X − ai
)
r
r
X X (−1)k X r−k
P (X) = X + Qk
k=1 1≤i1 <i2 <....<ik ≤r j=1 aij

taking X = 1, the lemma is thus proved.

DEMONSTRATION OF GOLDBACH CONJECTURE .

 4

4.4 Proof of Theorem

According to the principle of inclusion -exclusion of Moivre we have :

[ r
X X k
\
%( fn (A2p )) = (−1)k %( fn (A2pij ))
p∈P≤√n ,p≥3,p-n k=2 2≤i2 <i3 <....<ik ≤r j=2,pij ∈P≤√n ,pij -n

où % represents the probability of prime numbers so

[ δ(n) − ψn−1
%(n − Cn \n − 1) = %( fn (A2p )) =
Π(n)
p∈P≤√n ,p≥3,p-n

. where ψn−1 = 1, 0 according to n-1 is prime or not According to Chebotarev's theorem -Artin :
∀k ≥ 2
k
\ 1
%( fn (A2pij )) = Qk + h(n)
j=2,pij ∈P≤√n ,pij -n
φ( j=2 pij )

∀i ≥ 2
1 ψn−pi
− + h(n)
%(fn (A2pi ,pi -n )) =
φ(pi ) Π(n)
where ψn−pi = 1, 0 depending
√ on whether n − pi is a prime number or not
with h(n) = (c ln(n)e − ln(n)
)
Thus r r
δ(n) − ψn−1 X ψn−pk X X (−1)k
= g(n) − + Qk
Π(n) Π(n) j=2 (pij − 1), pij - n
k=2 k=2 2≤i 2 <i3 <...<ik ≤r

where r
X X
g(n) = (−1)k h(n)
k=2 2≤i2 <i3 <....<ik ≤r

.Noting that
r
X X X
ψn−pk = 1= 1 = α(pr )
k=2 n−p∈Pn ,p≤pr p∈Pn \Gn ,p≤pr

and applying the useful lemma, we have :

r
δ(n) − ψn−1 α(pr ) Y pi − 2
= g(n) − + (1 − )
Π(n) Π(n) pi − 1
i=2,pi -n

As
r r   r−1  
g(n) k r−1 k r−1
X X X X
| |=| (−1)k 1| = | (−1) |=|− (−1) |=1
h(n) 2≤i ≤r
k−1 k
k=2 2 <i3 <....<ik k=2 k=1

So r
δ(n) − ψn−1 α(pr ) Y pi − 2
∼+∞ − + (1 − )
Π(n) Π(n) pi − 1
i=2,pi -n
√
As δ(n) = Π(n) − α(n) et r = max(i|pi ≤ n) hence
√
n
√ Y p−2
α(n) − α( n) ∼+∞ Π(n) − ψn−1
p−1
p=3,p-n

DEMONSTRATION OF GOLDBACH CONJECTURE .

 5

Q √n
.In the following we will apply the Mertens' theorem to evaluate cn = p−2
p=3,p-n p−1 .
As √ √ √
n n n
Y p−2 Y p−2 Y p−2
=
p=3
p − 1 p−1 p−1
p=3,p-n p=3,p|n

hence √ √
n n
Y p−2Yp−1
cn =
p − 1 p=3 p − 2
p=3,p|n

Mertens formula is written

Y 1 e−γ 1
(1 − ) = (1 + ( ))
p≤n
p ln n ln n

therefore
Y 1 2e−γ 1
(1 − ) = (1 + ( ))
√ p ln n ln n
p≤ n

Let's put √ √ √
n n n
Y p(p − 2) Y p Y p−2
c2 (n) = =
p=3
(p − 1)2 p=3
p − 1 p=3 p − 1
hence √ √
n n
Y 1 Y p−1
cn = 2c2 (n) (1 − )
p=2
p p−2
p=3,p|n

From the previous part

√
−γ n
4c2 (n)e 1 Y p−1
cn = (1 + ( ))
ln n ln n p−2
p=3,p|n
√
n
√ 4c2 (n)e−γ Y p − 1
α(n) − α( n) ∼+∞ Π(n)[ ]
ln n p−2
p=3,p|n

Let √
n
Y p−1
βn = c2 (n)
p−2
p=3,p|n

then ∃n0 ∀n ≥ n0
√ 2βn Π(n)
α(n) ≥ α(n) − α( n) ≥
ln n

4.5 proof of lemma 1

According to the theorem the lemma is proven asymptotically .by computing we can conclude
and for an even integer given the pairwise of Goldbach prime is (p, n − p) where p ∈ Pn \Gn

4.6 Acknowledgments

The author wish to express their appreciation and sincere thanks to Professor Tanoé Fran-
çois(Université Félix-Houphouet Boigny Ufr de Maths-info) and Professor Pascal Adjamogbo
(Université Paris 6) for their encouragements

DEMONSTRATION OF GOLDBACH CONJECTURE .

 6

Références

[1] Not always buried deep selection from analytic and combunatorial number theory
2003,2004 Paul POLLACK
[2] An amazing prime heuristic Chris K. CALDWELL
[3] ON EXPLORATION ABOUT GOLDBACH'S CONJECTURE BY E-
Markakis,C.Provatidis,N.Markakis
[4] Elementary number theory a revision by Jim Heferon,st Michael's college 2003-Dec
[5] generatingfunctionology ,Herbert S.Wilf
[6] Lecture on NX(p) Jean pierre serre

DEMONSTRATION OF GOLDBACH CONJECTURE .