Scribd
Upload
13 views5 pages

Manuscript

The document attempts to prove Goldbach's conjecture, which states that every even integer greater than 2 can be expressed as the sum of two prime numbers. It introduces notation and theorems used. Functions f and g are constructed and graphed to show that for any even number N, there exist prime numbers P1 and P2 such that N = P1 + P2, proving the conjecture. Bertrand's postulate on the existence of primes between numbers is applied. Examples for even integers up to 10 are also provided before the general proof.

Uploaded by

Allan Beans
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views5 pages

Manuscript

The document attempts to prove Goldbach's conjecture, which states that every even integer greater than 2 can be expressed as the sum of two prime numbers. It introduces notation and theorems used. Functions f and g are constructed and graphed to show that for any even number N, there exist prime numbers P1 and P2 such that N = P1 + P2, proving the conjecture. Bertrand's postulate on the existence of primes between numbers is applied. Examples for even integers up to 10 are also provided before the general proof.

Uploaded by

Allan Beans
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Proving the Goldbach’s conjecture

Ninh Khac Son


Date Performed: 06 December 2019

Abstract
Goldbach’s conjecture is one of the oldest and best-known unsolved problems
in number theory and all of mathematics. It states:
”Every even integer greater than 2 can be expressed as the sum of two primes”.
Manuscript content: Prove that Goldbach’s conjecture is correct.
Key words: Prime numbers, Goldbach’s conjecture, number theory.

1. Notation system
We briefly mention the symbols and theorems in number theory to apply to
this manuscript.

1.1. Notation
- Symbol of positive natural number: N*
- Symbol of prime number greater than 2: P*
- Symbol of odd-number greater than 2: O*

1.2. The operations express odd and prime numbers


- For every odd natural number O greater than 2, it can always be expressed
as:

O = 2n + 1 (W ith : O ∈ O∗ , n ∈ N ∗ ) (1)
This deduces the result: For every odd natural number O’ greater than 5, it
can always be expressed as:

O0 = 2n0 + P (W ith : n0 ∈ N ∗ , P ∈ P ∗ , P < O0 ) (2)

Preprint submitted to Open Science Framework December 8, 2019


This also deduces the result: For every prime number P greater than 5, it
can always be expressed as:

P = 2m + P 0 (W ith : m ∈ N ∗ , P 0 ∈ P ∗ , P 0 < P ) (3)

1.3. Bertrand’s postulate


Bertrand’s postulate is a theorem stating that for any integer n > 3, there
always exists at least one prime number p with

n < p < 2n − 2
A less restrictive formulation is: for every n > 1 there is always at least one
prime p such that

n < p < 2n

2. Goldbach’s conjecture
Goldbach’s conjecture is one of the oldest and best-known unsolved problems
in number theory and all of mathematics. It states:
”Every even integer greater than 2 can be expressed as the sum of two primes”.

3. Proving the Goldbach’s conjecture


3.1. Consider even integer numbers 2 < N ≤ 10
- For N = 4, represent: N = 2 + 2
- For N = 6, represent: N = 3 + 3
- For N = 8, represent: N = 3 + 5
- For N = 10, represent: N = 3 + 7

3.2. Consider even integer numbers N > 10


Because N is an even integer greater than 10, N can always be expressed as
the sum of two odd numbers:

N = O1 + O2 (W ith : O1 , O2 ∈ O∗ , O1 < O2 ) (4)

2
Because the prime number P1 is greater than 2 in the set P ∗ , it also belongs
to the set O∗ . Therefore, N can always be expressed as the sum of a prime
number P1 and an odd number O:

N = P1 + O (W ith : P1 ∈ P ∗ , O ∈ O∗ , N/2 < O < N ) (5)


Based on the result of (2), we can express the odd number O to:

O = P1 + 2n (W ith : n ∈ N ∗ , P1 ∈ P ∗ , P1 < O) (6)


Finally, this is stated as follows: With every even natural number N > 10,
there is always at least a prime number P1 in the set P ∗ such that

N = P1 + (P1 + 2n) (W ith : P1 ∈ P ∗ , n ∈ N ∗ , n < N/2) (7)


Example: Any even natural number N greater than 10, it can be expressed by
N = 3 + (3 + 2n).

From expression (7), we transform to produce the result:


N
n= − P1 (W ith : P1 ∈ P ∗ , n ∈ N ∗ , n < N/2) (8)
2
In particular, N has a given value, so the value of n will vary with P1 . While
P1 ∈ P ∗ , we convert P1 into the set N* to construct a function f:
N
f= − x (W ith : x ∈ N ∗ , x < N/2) (9)
2
Thus, the value of f contains the value of n and the value of x contains the
value of P1 . This means that the values of n and P1 always belong the graph
of the function f.

On the other hand, based on the expressions (5) (6), since N/2 < P1 + 2n <
N , this results in the value of n also in the graph of the function g:
N
g =x− (W ith : x ∈ N ∗ , N/2 < x < N ) (10)
2
Thus, the value of g contains the value of n and the value of x contains the
value of 2n + P1 . This means that the values of n and 2n + P1 always belong
the graph of the function g.

3
Purpose of functions: We construct two functions f and g to refer to the gen-
eral method, then apply Bertrand’s theorem to find the value x of the function
g. In addition, it also determines the graph of the variation of n and two val-
ues P1 , 2n + P1 on the same coordinate system.

Graphing two functions f and g on the same coordinate system, we have:

(Two graphs f and g are on the same coordinate system)

Important argument:

- Based on the results of (5)(6)(7), we rewrite: N = P1 + (P1 + 2n).

- Where O = (P1 + 2n) with O ∈ O∗ , and O ∈ (N/2, N − 1). This leads to if


any of the prime exists P2 ∈ (N/2, N − 1), then it is also the value of O ∈ O∗ .

- On the other hand, applying Bertrand’s theorem to the value of x of the


function g = x− N2 , we have: There is always at least a prime number x = P2
such that N/2 < x = P2 < N − 1.

4
- Since the prime number P2 is determined, this results in the value of P2 can
always be expressed as P2 = P1 +2n, such that N = P1 +(P1 +2n) = P1 +P2 .

Conclusion: For every even natural number N > 10, it can always be ex-
pressed as the sum of two primes, with P1 , P2 ∈ P ∗ , and P2 = P1 + 2n.

Combining with even natural numbers 2 < N ≤ 10 has been expressed as the
sum of the two primes in section 3.1, leading us to prove that the Goldbach’s
conjecture is correct.

Proving end.

References
[1] Goldbach’s conjecture - Wikipedia

[2] Bertrand’s postulate - Wikipedia

You might also like