Journal of Mathematics and System Science 10 (2020)

doi: 10.17265/2159-5291 D
DAV ID PUBLISHING

Each Integer Number is a Center Symmetry of at Least

Two Prime Numbers: Christian Goldbach’s Conjecture
Stamatopoulos Spyridon
Mathematics School, University of Athens, Greece

Abstract: Goldbach’s conjecture was formulated in 1742 by the Russian mathematician Christian Goldbach and remains unprove in
date. The proposition is as follows: Every even integer number greater than two is the sum of two positive primes: (2α = β + γ). The
search for lack of proof is basically due to the inability to find a formula, that could determine the number π(χ) of prime numbers and
their exact position in the body of integers (zeta function j(s)). Practikal applications to date show, that there is no regularity. These
attempts have from been described approximately by the Mathematicians Euler, Gauss, Riemann, Descartes, Binograntof and others.

Key words: Common factor, prime numbers, multiplication of Binomials.

1. Introduction
The search for a pair (β.γ), that proves Goldbaxh; s
conjecture true depends on α, which is positioned
within the body of integers. If we assume that one of
these numbers, e.g., γ = ν ρ , is a prime number, then
we observe that the other number β = 2α - ν ρ , if it is a
composite number, is positioned in a soace smaller
2α
than (2, ). If we include number β, not necessarily
3
a composite number, in the product of all β then if it r
2a
a factor prime number greater than , it will divide
3
the product itself and consequently one exclusive ΑΜ = ΜΒ, ΜΜ΄ of vertical ΑΒ, ΑΔǁ ΒΕǁ ΜΜ΄
exact factor of the product of β = 2α –γ and is proved therefore have the same unit μ. If
to be a prime number. ( ΑΑ ΄ )=γ , ( ΒΒ ΄ ) =¿ β , ( ΜΜ ΄ ) = α, then ΑΑ΄ = γμ,
Proof 1: ΒΒ΄ = βμ, ΜΜ΄ = αμ. Given that Α΄ can be found
If α is a prime number, then the conjecture is true betweenΑ and Δ and takes every value ν ρ of a prime
because α+α = 2 α. Given that α is a composite number in the space (α, 2α), which does not divide α
number. In the following figure and is a multiplicity of i. Correspondingly, Β΄ is
defined by the line Α΄ΜΒ΄ one-to-one with Α΄ and can
be found between Β and Ε and (ΒΒ΄) = β, which is not
necessarily a prime number and is also a multiplicity
of i. The change in γ ranges from 2 up to the bigest
prime number less than 2α. The change in β ranges
from 2α - ν ρ down to the number 2.
From the table ΑΑ΄Β΄Β → ΑΑ΄+ΒΒ΄ = 2ΜΜ΄→
γμ+βμ = 2αμ → ( β +γ ) μ=2 αμ→ β+γ = 2α. So β

= 2α-γ, or β = 2 α−ν ρ .
Corresponding author: Stamatopoulos Spyridon, Ph.D.,
Professor, research fields: Algebraic theory numbers. E-mail:
spyrosstamatopoulos891@gmail.com. Chapter 1: Study of parameter
2 Each Integer Number is a Center Symmetry of at Least Two Prime Numbers:
Christian Goldbach’s Conjecture

It is true that there exist β,γ, which are true λ

Goldbach conjecture. in one β = 2α - ν ρ the β = ( 2 α −ν ρ ) = ∏ ν τρ΄ with λ ρ΄

Note 1 ρ΄=1

If the integers β and γ have a common factor cd τ ρ ΄>1 If κ the number of ν ρ , there exist in the
(β,γ) = δ, then β = γ. factorization of all 2α−ν ρ , therefore λ < κ < I, then
Proof 2. i κ
Given: β > γ and γ is a prime number, then the only for ν ρ < 2α, ∏ ( 2 α −ν ρ ) = ∏ ν Τρ΄ When ρ΄
Τ ρ ΄=
divisor of γ is γ = δ itself. As for β > γ = δ, there is a ρ=1 ρ΄=1
κ
number β 1 > 1, so that β = δ β 1 (Eukleidean division),
then β is a complex number for β 1 ≠ 1 and therefore
∑ τ ρ΄ the sum of the exhibitors with the base ν ρ ΄.
ρ΄=1
β 1= 1 and β = γ. Therefore, α = β = γ from β+γ = 2α We have:
i i κ
→ β+β = γ+γ = 2α → 2β = 2γ = 2α.
Result 2. ∏ ( 2 α −ν ρ ) = ∏ φ ( ν ρ ) = ∏ ν Τρ΄ (1) ρ΄

ρ=1 ρ=1 ρ΄=1

If β≠ γ , then every two integers α, β, γ, do not have Since between β, γ (Α΄,Β΄) there is one -to-one
a common divisor (c .d.).
correspondence, the number of β =( 2 α −ν ρ ) =
Proof 3.
λ κ
Given cd(β,α)=δ>1. Then δ=β because β is a prime
number and because α>β=δ → α =α 1δ. From β+γ= 2 ∏ν τ ρ΄
ρ΄ in ∏ ν ΄Τρ΄ ρ
is i.
ρ΄=1 ρ΄=1
α → β+γ = 2βα 1 → γ=β( 2 α 1−1 ), therefore γ is a From equation (1) We have:

{ }
complex number, which is contrary to the hypothesis i

that γ is a prime number (apples only when 2 α 1−1 = ( 2 α )i−1+ ∑ ν ρ ( 2 α )i−2+ . i

1, therefore α 1= 1 and α = β = γ . 2α ρ=1

i i
+ (−1 )
i
∏ ν ρ=
1 ρ=1
So, when c.d.(α,γ) = δ. .+ (−1 ) i−1
∑ ∏ν
ν ρ ρ=1 ρ
Result 3. ρ=1
Because γ is a prime number, β-2 α- γ is odd κ κ i
number. The ν ρ ΄divisors of β = 2α - ν ρ are smaller ∏ ν Τρ '
ρ΄
→ 2α{} = ∏ ν Τρ΄=1−(−1 )i ∏ ν ρ
ρ΄
→ 2α
2 α−γ ρ΄=1 ρ΄=1 ρ=1

[ ]
than < α and thus belong to ΒΜ 2. From β =2 κ κ i
2 {}= ∏ ν ρ ΄ ∏ ν ρ΄ Τ ρ΄−1
−(−1 )
i
∏ νρ (2)
α- γ < 2 α, if β is a complex number, β = νν΄, then νν΄ ρ ΄=1 ρ΄ ρ=κ+1
2α 2α
( )
κ κ
< 2 α → ν΄ < < . (3 is the smallest prime
ν 3 Since g.c.d 2 a , ∏ ν ρ΄ =1, ∏ ν ρ΄ divide the
number) and the divisors of β are belong to ΒΣ. ρ΄=1 ρ΄=1
κ
If β = 2α - γ is divided by a number greater than
2α 2α
loop, so 2α{}=¿2ασ ∏ ν ρ΄ and from equation (2), σ
ρ΄=1
, or equality to , then it is prime number
3 3 κ

(divided only by itself) and the conjecture is right.

is the quotient {}/ ∏ ν ρ΄
ρ΄=1

[ ]
Result 4 κ κ κ i
i 2 ασ ∏ ν ρ ΄=¿ ∏ ν ρ ΄ ∏ ν Τρ ΄ −1+ (−1 )i
ρ΄
∏ νρ ¿
Because β = 2α - ν ρ < 2 α→ ∏ ( 2 α −ν ρ ) < (2) I
ρ ΄=1 ρ ΄=1 ρ ΄=1 ρ=κ+1
ρ=1 (3)
κ i
Chapter 2 : Calcutations
Given that exist not number prime β (all the
2ασ = ∏ ν Τρ΄ −1− (−1 )i ∏
ρ΄
ν ρ (4)
ρ΄=1 ρ=κ+1
numbers β are composite). If i is the number of the We prove that the Loop, therefore σ, has no factor
prime numbers between 2 and 2α, which do not divide less than 2α ( all ν ρ >2 α ).
2α Proof 4.
α, λ the number of factors ν ρ ΄< according to
3 The second member of equality (4), is not divisible
result 3, which are present in a β = 2α - ν ρ ( ν ρ ΄ ≠ ν ρ ) 2α
by the ν ρ ΄ < because the ν ρ ΄ is factor of first
according to result 2, thus λ < i, τ ρ ΄ the degree of ν ρ ΄ 3
3 Each Integer Number is a Center Symmetry of at Least Two Prime Numbers:
Christian Goldbach’s Conjecture

addition and this do not divide the second addition (In divide by ν ρ < 2 α (see proof 4). Thus, if χ ρ of
the case where Τ ρ ΄= 0, then ν ρ ΄ remains in the Equality (7) is less than 2 α, it will not divide the sum
secondly addition and do not divide the first additive, of the addends of the second member of Equality (7):
or in the case Τ ρ ΄=1! ,exist one divisor exactly, which therefore σ 1 is divisible by ν ρ > 2 α, given that (2 α +
is outside the bracket and the sloop divided by ν ρ ΄, χ ΄ ρ).
i
Supposing i 2 are the factors (2 α + χ ΄ ρ) of σ 1 and
the ∏ ( 2 α −ν ρ ) divided by ( ν ρ ΄ )2 that is Τ ρ ΄= 2, that Equality (7) becomes:
ρ=1 i2
contrasting to Τ ρ =1!). The second member of equality ( 2 α )2 ∏ ( 2 α + χ ΄ ρ )= .
2α ρ=1
(4), is not divisible by < ν ρ< 2 α because the ν ρ is κ i i2
3
factor of the second addition and this do not divide the ∏
ρ΄=1
ν
Τ ρ΄−1
ρ΄ −(−1 )
i
∏
ρ=κ+1
ν ρ −2 α ∏ χ ΄ ρ (8)
ρ=1
first addition (see result 3). i2
So the second member do not divided by ν ρ <¿ 2α,
therefore the first member, so σ, is not divisible by
Upon analysis of ∏
ρ=1
( 2 α + χ ΄ ρ ) and replacement
ν ρ <2 α . Given that σ has i1 factors ( 2 α + χ ρ ) with χ ρ into (8)

[ ]
i2 i2
< 2α (generally μα + χ ρ with μ≥ 2), therefore 1
+ ..+ ∑ ∏ χ = 2ασ 2, we have
i 2−1
i1
2α ( 2 α )
χ ρ΄ ρ ΄=1 ρ ΄
∏ (2 α + χ ρ )
ρ ΄=1
2ασ = 2α = 2α κ i i1 i2

i (2 α ) σ2=∏ ν ∏ ν ρ−2 α ∏ χ ΄ ρ −( 2 α ) ∏
ρ=1 3 Τ ρ΄−1 i 2
−¿ (−1 ) χ
{ }
i1 i 1❑ i ρ΄
1
1 1

+∑ χ ρ ( 2 α ) +…+ ∑ ∏ χ ρ ⌉ + ∏(9)
i1 −1 i 1−2 ρ ΄=1 ρ=κ +1 ρ=1 ρ=1
2 α ⌈ (2 α ) χρ
ρ=1 ρ=1 χ ρ ρ=1 ρ=1 κ
.
I set [ ] = σ1, hence
So ∏ ν Τρ΄ −1> ρ΄
( 2 α )3 σ 2 + C. The sum of three
ρ΄=1
i1
prime addends of Equality (9) is not divisible by νρ
2ασ = 2α{2α σ 1+ ∏
ρ=1
χ ρ} (5)
< 2α according to proof (5). If χ < 2α, then χ does
΄΄
ρ
΄΄
ρ
Equality (4) because equality (5) becomes: not divide the sum of the previous addends, and thus

{ }
i1 κ i the 2nd member is not divisible by ν ρ < 2α. Hence, the
2α 2 α σ 1 + ∏ χρ =∏ ν Τ ρ ΄−1
ρ΄ −¿ (−1 ) ∏ ν ρ ¿ (6)
i
1st member of (9), and by extension σ 2, is divided by
ρ=1 ρ ΄=1 ρ=1
κ i1 i
ν ρ > 2α only.
∏ ν Τρ΄ −1= ( 2 α )2 σ 1 + 2α∏ χ ρ + (−1 )i ∏
κ
νρ
∏ ν Τρ ΄ −1 > ( 2 α ) ε σ ε + C, for every ν ρ .
ρ΄

ρ΄=1 ρ=1 ρ=++κ +1

Finally ρ΄

ρ΄
> (2 α)
2
σ 1 + C. Proof of the formula
i κ i iμ iμ κ
I set (−1 )
i
∏ ν ρ = C. ( 2 α ) μ+1 σ μ+1=∏ νΤρ ΄ −1−(−1 )i ρ΄
∏ ν ρ−∑ ( 2 α ) ∏ χ μρ = ∏
μ
ρ=κ +1 ρ΄ ρ=κ+ 1 μ=1 ρ=1 ρ΄=1
Equality (6) becomes: ❑
κ i i1 κ i iμ iμ
(2 α )2 σ 1= ∏ ν ∏ ν ρ −2 α ∏ χ ρ ¿ ∏ ν ρ΄ −(−1 ) ∏ ν ρ −∑ ( 2 α ) ∏
Τ ρ΄−1 i Τ ρ΄−1 i μ
ρ΄ – (−1 ) χ μρ if μ>0
ρ΄=1 ρ=κ +1 ρ=1 ρ΄ =1 ρ=κ +1 μ=1 ρ=1
(7) by complete induction (Mathematical Induction).
I will prove that σ 1 is not divisible by ν ρ < 2 α. (Method: infinite Ascent).
Proof 5. In accordance Proof 6.
(4), all prime numbers ν ρ < 2 α belong to the sum of Α) for μ < 3 applies (see proof 4).
the two prime addends of Equality (7) Every prime
number less than 2α, will either divide the 1 st addend
and not divide the 2nd addend, or divide the 2nd addend
and not divide the 1st addend τον 1ο. In any case, the
sum of the 1st and 2nd addends (and Τ ρ=1!) is not
4 Each Integer Number is a Center Symmetry of at Least Two Prime Numbers:
Christian Goldbach’s Conjecture

Β) I will prove that this applies for every μ. Given Given that λ΄ > 0 are the factors of σ, which belong
κ i in the space (2, 2α), this proves Goldbach’s conjecture
that ( 2 α ) μ σ μ =∏ ν Τρ΄ −1−(−1 )i ρ΄
∏ ν ρ−¿ ¿ true. Since each divisor greater than α exists once, and
i μ −1 i μ−1
ρ΄ ρ=κ +1
only once (∃1 !), in Equality (5), i΄-- λ΄ are the factors
of σ, which are greater than 2α.
∑ ( 2α )μ −1 ∏ χ μρ holds for μ-1. (10) i
μ=1 ρ=1
In accordance with Proof 4 for every ν ρ prime
So ∏ ( 2 α −ν ρ ) =
ρ=1
number between 2 and 2α, ν ρ either belongs to the 1 st κ΄ λ΄ i
2α
addend and does not divide the 2 nd addend or ν ρ ∏ ν ρ΄ ∏ ν ρ ⌈ 2 ασ ΄+ (−1 )i ∏ ν ρ ⌉ , ν ρ ΄<
3
ρ΄=1 ρ=1 ρ=κ ΄+ λ΄ +1
belongs to the 2nd addend and does not divide the 1st 2α
addend. If the factor χ μρ of the 3rd addend is less than and ν ρ > being the numbers outside the brace
3
2α, it either divides the 1st addend . ( multiplicity λ΄.
2α The pairs that prove Goldbach’s conjecture true are λ΄.
χ μρ =ν ρ ΄ < ) and does not divide the 2nd addend, or
3 The value of the bracket (see equality 4 ) is
divides the 2nd addend ( χ μρ ≠ ν ρ ΄ ) and does not divide
[ ]
i κ΄

the 1st addend. In any case, χ μρ does not divide the

2 ασ ΄+ (−1 )i ∏ νρ = ∏ ν Τρ΄ −1, κ΄ = κ-λ΄.
ρ΄

ρ=κ ΄+ λ΄+1 ρ΄=1

sum of the two prime addends and consequently the Proof 7.
second member of Equality (10) is not divisible by ν ρ The brace is not divisible by a number greater than
iμ
2α, because the 1st addend is divisible exclusively by a
< 2 α. Hence σ μ = ( 2 α ) ∏
μ =1
( 2 α + χ μρ ) follows suit.
number greater than 2α and the 2nd addend is not
Upon analysis (Proof 5), it is concluded that divisible by a number greater than 2α. Furthermore,
κ i iμ iμ
ν
σ μ+1= ∏ ν ∏ ν ρ−∑ ( 2 α ) ∏theχ μρbrace is not divisible by ρ , which belongs in the
μ+1 Τ ρ ΄−1 i ❑ μ
(2 α) ρ΄ −(−1 )
ρ ΄=1 ρ−κ+ 1 μ=1 ρ=1 2α
Hence space ( , 2α), because the 2nd addend is divisible by
κ i 3
∏ ν Τρ΄ −1=( 2 α ) μ+1 σ μ+1+
ρ΄
(−1 )i ∏ ν ρ+ number ν ρ and the 1st addend is not divisible by ν ρ <
ρ΄=1 ρ=κ +1
iμ iμ 2α. Therefore, the brace is divisible by ν ρ ΄ ∈¿) ≠ ν ρ
∑ ( 2α )μ ∏ χ μρ >( 2 α ) μ+1+C.
μ=1 μ =1 4. Remark
i κ
Equality (1) expressed ∏ ( 2 α −ν ρ ) = ∏ ν Τ ρ΄
ρ΄ = Due to the symmetry of β, γ in Fig. 1 (β+γ = γ+β), if
κ κ
ρ=1 ρ΄=1 β takes the values of γ, -β∈ ( 2 , 2 α ) -, then γ will take
∏ ν ρ΄ ∏ ν Τρ ΄ −1 > ( 2 α ) ε σ ε + C. When ε assumes a
ρ΄ the values of β (Chapter 4) and there are again λ΄ pairs
( γ,β) = (γ, β).
ρ΄=1 ρ ΄=1
i
relatively great valye, ∏ ( 2 α −ν ρ ) becomes greater
ρ=1
i
than ( 2 α ) , which contradicts (result 4), because the
5. Conclusion
product of β cannot be found in the neighbourhood of When the variables present in the problem we are
( 2 α )i and exceed the value ( 2 α )i . Therefore, there is studying belong in the commutative ring of integers,
χ these variables are defined and accord to the structure
∏ ( 2 α −ν ρ ) with factor (2α−ν ρ ) in (α, 2α) for of that same ring. The process leading to proof is safe
and convincing when it is consistent with the structure
ρ=1
every ρ = 1 up to χ, which prove Goldbach’s of this ring, In case of a gap, we prove general
conjecture true (see result 3). propositions (lemma).
If the variables move — in the open sets — towards
Chapter 3.Calculated estimation infinity, it is safer to examine the movement using
finite values, because there it is defined that << for
5 Each Integer Number is a Center Symmetry of at Least Two Prime Numbers:
Christian Goldbach’s Conjecture

eve ν exist the ν+1 >ν>>. Entry from infinite part to We extract outside the bracket only the common
the finite part is impossible because, with the entry 2 α κ΄
3 ∏
and the definition of the element ν, it holds that <<for divisors that are less than , ν ρ΄ = 3.5.7 →κ΄=3
every ν exist the ν+1 > ν>>, so that the previous ρ΄=1

element of infinity+1 is not recognized and what remains is.

(Dedekind numbers). Transferring the solution to an From

[ ]
κ΄ κ΄ 5 7
ISOMORPHIC structure involves the risk of error.
Accurate and complete determination of isomorphism 2ασ ∏ ν ρ΄ = ∏ ν ρ΄ ∏ νρ ΄ + ∏ νρ
Τ ρ ΄−1

ρ΄=1 ρ΄=1 ρ ΄=1 4

is required. A long-term and difficult task, sometimes 4
precations. 2.13σ = 23.19.7.3 +11.17.19.23 = 329498 =
=2.13.19.23.29.
Application Therefore σ = 19.23.29.
2 α 26
2α =26, α = 13. The greatest of the = are 19, 23 and the
ν ρ = { 3 , 5 ,7 ,11 , 17 ,19 , 23 } 3 3
7 pairs are ( 3,23 ) , ( 7,19 )∧( 13,13 )
∏ ν ρ=3 . 5. 7 . 11. 17 . 19 .23 Symbols
ρ=1
( 2 α −ν ρ )= { 23 , 21 ,19 , 15 , 9 ,7 , 3 } φ ( ν ρ ) = the numerical value of ( 2 α −ν ρ )
7

∏ ( 2 α −ν ρ )= 23.21.19.15.9.73= 23. 19.7 .5.3 → 2 5 λ = the number of the prime factors in a φ ( ν ρ )

ρ=1 κ = the number ( ν ρ ) of all prime numbers in ( α ,2 α )
κ=5. with the exception of the divisiors of α.
5 7
τ ρ = the value of the expoment of the factor ν ρ = ρ΄ of
2α {} = ∏ν Τ ρ΄
ρ΄ −(−1 )
7
∏ νρ= 2
=23.19.7 .5.3 5
λ λ

ρ΄ ρ=1 the φ ( ν ρ )
+3.5.7.11.17.19.23. Τ ρ = the sum of all exponents of the factor

( )
7 λ

Common factors {}, ∏ νρ = { 3,5,7,19,23 } .

i
ν ρ = ρ΄≠ ν ρin the product ∏ ( 2 α −ν ρ )
ρ=1 λ
ρ=1
References
[1]. Walter Rudin’s Real and Complex Analysis 1986 [5]. Edmund I. Elementary Number Theorem
[2]. I. Hunder Number Theorem Athens 1974 AMS Chelsea Publiching 1966
[3]. Adolph Hurwitz Number Theorem G,A, [6]. Ronald .Graxam Donald E. Kouth and Oren
PNEYMATIKOS Athens 1981 Patamaitland wrigth OXFORD 1988
[4].G.H.HARDY E.M.WRIGHT AN INTRODUCTION [7]. PAUL DUCHATEAU – DAVID
Of Theory of Numbers OXFORD 1959 wzachmann Theory and problems 1988