B+g=2a

.30

B +G=2A

Christian Goldbach’s conjecture

Goldbach’s conjecture was formulated in 1742 by the Russian mathematician Chtistian

Goldbach and remains unproven to date. The reason for lack of proof is basically due to the
inability to find a formula, that could determine the number π(χ) of primes and their exact
position in the body of integers (zeta function j(s)).Attempts to verify the conjecture so far
have shown that there is no regularity. These attempts have been described approximately
by the Mathematicians Euler, Gauss, Riemann, Descartes, Vinogradov and others.

The proposition is formulated as follows:

Every even integer n greater than two is the sum of two primes.
Every even positive integer is always equal to the sum of two positive primes. Expressed in
terms of symbols : β+γ+2 α.

Proof:

( Goldbach conjecture)
The proposition for a small number,2 α, is proven.
So, for 2 α = 4 or 6 or 8 or 10, it is 4=2+2, 6=3+3, 8= 3+5, 10= 5+5 =3+7.

We will prove the conjecture for 2 α >10 ( ∀ 2 α ) Α.

I ) Lemma 1. If the integers β and γ have a common factor gcd(β, γ)=δ, then β=γ.
Proof: Given β>γ and γ is a prime, then the only divisor of γ is γ=δ itself. As for
β > γ =δ, there is a number β 1>1, so that β=δ β 1(Euclidean division), then β is a
complex number for δ≠ 1 and therefore δ=1 and β=γ.
Result. If β≠γ every two integers β, γ,α do not have a common divisor.
Proof: Given gcd(β, α)=δ>1, then δ=β, because β is a prime and because
α>β=δ → α=βα 1. From β+γ=2 α→ β+γ=2βα 1 → γ=β(2α 1-1), therefore γ is a
complex number, which is contrary to the hypothesis that γ is a prime
( applies only when 2a 1 -1 = 1, therefore α 1 = 1 and α=β=γ).

Lemma 2. If β=γ then β=γ=α.

Proof: From β=γ → β+γ=2 β=2 γ =2 α → β=γ=α. If α is prime, the conjecture is

proven true , because α+α=2 α.

Lemma 3. If β=2, then also γ=2

B+g=2a

Proof: From β+γ=2 α → 2+γ =2 α, consequently γ is an even number, and

therefore γ=2, because the only even prime is 2 and β+γ =2+2=4, therefore
α=2.

Note 1: If { β , γ } ≠ { 2, χ } → from (1) and (3) it is concluded that β and γ are odd
numbers.
Note2: If 2 <γ ≤ α→ α ≤ β< 2α ,because β=2 α - γ≥ 2 α−α =αand β= 2 α –γ
<2 α. II). We
divide the set of primes less than 2 α into two classes Γ΄ =

{ χχ : prime ∈¿} and B΄=

{ χχ : prime ∈( α , 2 α )} Since
gcd(γ,α)=gcd(β,α) =1, the number β (if β exists and is a prime)
belong to sets Β΄ and the number γ belong to

{χ
Γ =Γ΄─ χ :divisor of α . } ( Ν 1) I

specify that φ ( ν i ) =2 α - νi , where νi are the primes less than α

and which do not divide α, namely QUOTE νi ∈ Γ . Therefore,
φ ( ν i ) exist, are odd numbers (not necessarily primes) and
κ
χ
positive with {
φ ( ν i ) ∈ : α < ∏ ν κρ <2 α
χ λ=1
λ

λ }
= Β. ( a larger set of Β’, containing all unnecessary numbers
and prime numbers).

From νλ ≠ ν λ
1 with λ 1 ≠ λ → 2 α - ν λ ≠ 2 α−ν λ→
1 → φ ( ν λ ) ≠ φ ( ν λ ).
1

Note 3. The sets (2, α] and (α, 2 α) have the same measure α-2.
α
The number of elements (prime number) of Γ (< 2 ) is smaller than
α
the number of elements (odd number) of Β (= 2 ).

Consequently, the function νi → φ ( ν i ) is a one-way

representation of set Γ within set Β.

III). If there is φ ( ν χ ) = 2 α - ν χprime, then the pair ( ν χ , φ ( ν χ ) )

satisfies Goldbach’s conjecture.
B+g=2a

Given that the numbers from φ ( ν i )= 2 α - νi , which are

complex numbers, are κ΄, therefore i-κ΄ are the primes. I
will prove that i-κ΄≥ 1.

The divisors (primes) of φ ( ν i ) belong to set Γ, because they

2α
are less than 2 =α, or φ ( ν i ) itself, when it is the only
divisor, in which case it is a prime and the previous case
applies.
λ΄

Therefore, φ ( ν i ) for i = ρ take the form φ ( ν i )=∏ ν τρ = λ

λ
(2 α - ν ρ
λ=1

), where τ λ ≥ 1, ν ρ ∈ Γ , λ΄ the number of basis ν ρ and ν ρ ≠ ν ρ , ∀ ν ρ.

λ λ λ

Since ∀i, φ ( ν i )> α ≥ ν ρ applies, there is not complex φ ( ν ρ )with

λ΄=λ=1 and τ λ =1. If λ΄=λ=1 → τ λ>1.

Note 4. If the factor ν ρ of φ( νi ) is ν ρ >α ,then φ ( ν ρ ) is prime

λ λ

number.

Β.
α
If φ( ν i ) has a factor νρ >
2 , then it does not contain power
α
of ν ρ, because ν ρ > λ
2 and α>8 → ν 2ρ > 2 α, Lemma 3 Note 2 (The
λ

2
a
inequality ν 2ρ >
λ ( ) >2 α has a solution α>8).
2
Therefore, the
λ΄
α
formula is φ ( ν i ) =∏ ν ρ . From νρ > → 4 ν ρ > 2 α.
λ=1
λ λ
2 λ

Consequently the maximum value of λ ΄❑ is 2 with ν ρ =2, or ν ρ =3 λ 2

and φ ( ν i ) does not contain power, ∀ ν ρ . λ

λ΄❑
α
1. If ν ρ =2, Then φ ( ν ρ ) = ∏ ν ρ =2 ν χ, where ν χ is a prime between
2
λ=1
λ
2
and α. Since φ ( ν ρ ) is an odd number, Lemma 3 Note 1, it
cannot take the value φ ( ν ρ )=2 ν χ.
B+g=2a

2. If α ν ρ is divided by 3, then φ ( ν ρ ) = 2 α - ν ρ is not divided by

2

3 and is prime number. Proof:

Supposing that 3 divides α, because gcd(φ ( ν ρ ),α) =1, then
φ ( ν ρ )=3 ν χis rejected and φ ( ν ρ ) is a prime → → φ ( ν ρ )+ ν ρ
=2 α. Supposing that ν ρ=3,
(gcd(φ( ν ρ), ν ρ) = 1) thenφ ( ν ρ ) is not divided by 3, and
therefore it is a prime and φ ( ν ρ ) +3 = 2 α. Note:
α
φ ( νρ ) >
❑
2

3.Supposing that α ν ρ is not divided by 3, then we have

φ ( ν ρ ) = 2 α - ν ρ , which is not divided by 3.
χ χ

Proof:
Supposing that the complex number have the formula
2 α−ν ρ
3φ ΄ ( ν ρ ) = 2 α – ν ρ, where ν ρ ∈Γ, therefore 3
is an
integer prime, φ ΄ ( ν ρ ) ∈¿ , α ) and φ ( νρ )
i΄ i΄

= 3 φ ΄ ( νρ ) ∈ Β are number i’ < i, so ∏ φ ΄ ( ν ρ ) ¿ 3 ∏

ρ=1
i΄

ρ=1
( 2α −ν
3 )
. ρ

Let’s say, that there are other prime numbers φ ΄ ( νρ )

with 2 α−ν λ=3φ΄( ν λ) of the crowd κ΄ all φ( ν ρ)

The numbers with 3φ( ν ρ) greater than α > 3.
2α 2α
The numbers with νφ( ν ρ) < 2 α are φ( ν ρ) < ν < 3 , so
the numbers φ( ν ρ) are all the prime numbers between
a
∧2 a
2
3
i΄ κ΄

I form ∏ 3 φ ΄ ( ν ρ )=∏ ( 2 α −ν λ ) →
ρ=1 λ=1
i΄ κ΄
2 α−ν ρ
→ 3 i΄
∏
ρ=1
( 3 ) = 3 ∏ φ ΄ ( ν ) and so κ΄= i΄.
κ΄

λ=1
λ Ie the
numbers of unnecessary complexes in space (α,2 α)
α
with a factor greater than 2, satisfying the
B+g=2a

interval Goldbach equality, equals the number

α
i΄ < i of the number of the factors in space ( 2 , α),
therefore the function ν →φ ( ν ) is one to one, ρ ρ

because λ ≠ λ→ φ ( ρ )≠ φ ( ρ ).
1 λ1 λ

Let all the complex numbers in the interval

α< φ( ν ) < 2 α, with
ρ νρ in the interval 2< ν ρ< α,
α
have factor 3 and ν > 2 . ρ΄

Since the number of composites is equal to the

number of i of the ν ( Ν ) in interval 2 < ν < α ρ 1 i

α
and the number νρ ΄ in <φ ¿ ¿< α is i΄< i, there will
2
be at least two values ν ,=ν , to define the φ( ν ) i > 1 2 ρ

i΄, thus the compositeάρα φ( ν ) = φ( ν ), so it’s 1 2

atop. .
Therefore, or there exist φ( ν ) with λ ≥1 ρλ

α
and a factor greater than 2 , which is not divided
by 3 ,so it is prime number and φ ( ν ) + ν = 2 α, ρ ρ

or all composite φ( ν ) ≠ 3 φ ΄ ( ν ) of the number i < i΄,

ρ ρ 1

α
have exclusive factors ≤
2 . (Γ ii) Γ.
Consider that there is no φ( ν ) with a prime factor ρ

α α 2
νρ between and α ( exactly < ν < 3 α ), or the
ρλ
λ
2 2
α
number of φ( ν ) = 3 φ ΄ ( ν ) with
ρ ρ φ ΄ ( νρ ) > 2 is κ = i΄< i.
Therefore,
2 α −ν ρ
I) or φ( ν ) has a prime factor
ρ ν ρ >α >
λ
2
thus (from
ΑIII) 2 α - ν = ν and
ρ ρλ ν ρ +ν ρ λ = 2 α ο.ε.δ.
B+g=2a

α
II) or ν ρλ < for all ρλ ,
2 ( except for the value in the case
φ( ν ) = 3 ν ). ρ ρλ

I form all the redundant numbers φ( ν )=2 - ν , where ρ ρ

2< ν < α and ν does not divide α.

ρ ρ

If the prime ν numbers in the interval 2 < ν <α are the

ρ ρ

number i, and φ( ν ) will be a number i. The factors in ρ

α
2<ν < ρλ
2 present in the analysis of the 2α- ν is λ < ρλ

λ΄

i. Therefore 2 α - ν ρ= φ( ν ρ)= ∏ ν τρ , τ ρ ∈ { 0 , τ }/τ <i.

ρλ

λ λ
λ=1

τρ log 2 α
Note: You must: ∀ νρ λ
λ

< 2α → τ ρλ log ν ρ < log2α

λ , τρ λ < log ν ρ
λ

λ΄

and ∑ τ ρ log ν ρ < log2α.΄ λ λ

λ=1

Note: According to AIII there exists with φ

λ΄

( ν ρ ) =∏ ν ρ
τρ
λ
λ
From φ( ν ) =2 ρ
λ=1

α - ν , I form the product

ρ

'
i κ λ΄❑ i
τρ α
∏ Φ(ν ρ )=∏ ∏ ν ρ
ρ=1 ρ=1 λ=1
λ
λ

= ∏ ¿ ¿) ,
ρ=1
where 2 < ν < 2 of ρλ

number λ (Γ II) and 2< ν < α number I, where λ < i . ρ

' ΄
κ΄ λ κλ
τρ
Set ρ = ρ΄, → ∏ ∏ ν = ∏ ν ,
λ
ρ=1 λ=1
ρλ
λ Τ ρ΄
ρ΄
κ ΄λ the number of ν in ρλ
ρ΄=1
κ ΄λ
α
2α -νρ with 2< ν ρ < λ
2 and Τ ν ρ =∑ τ ρ
λ
λ=1
λ
is the
sum of the exponents for each force on the same basis
΄
κλ i
νρ ,
λ → →∏ ν Τ ρ΄
ρ΄ =∏ ( 2 α −ν ρ ).
ρ΄=1 ρ=1
B+g=2a

All the factors of the product are only the factors

present un the composites in 2 α - ν . ρ

i κ΄
i Τ ρ΄
Therefore 2 α ¿ +(−1 ) ∏ ν = ∏ ν → ρ=1
ρ
ρ΄=1
ρ΄

'
κ κ΄ i

→2α{ }= ∏ νρ
ρ=1
[ ∏ ν Τρ ΄ −1−(−1 )i
ρ ΄=1
ρ΄
∏
ρ=i−κ ΄
νρ ] (1)
κ΄

Therefore the { } is divided by ∏ ν , because gcd(α, ν ) ρ=1

ρ ρ

κ΄

=1 → 2 α { } = 2 α σ ∏ ν . ρ=1
ρ σ
α
does not have a factor νρ < 2 , because in the loop the
i
α
(−1 )i ∏ νρ is not divisible by the factor νρ < 2
who is
ρ=i−κ ΄

factor of the first addition ( and in the case where Τ =0 ρ΄

ν remains in the second addition and does not divide

ρ

the first additive )

α
And the first adjective is not divisible by a factor ν ρ>
2
of the second adder.
α
So the factors of σ belongs to 2 < ν < α ≠ ν , or to ν >
ρ ρ΄ ρ

α.
Lemma 4. The dividers of the sum (difference) of two
addressees, which are prime among them and the
prime ones with the terms of the sum (difference) are
prime numbers smaller than the largest addendum
(reduction), or the sum itself (difference), if it the
prime number.
B+g=2a

Proof:
The prime divisors of a z-number is the same number if
z
it is prime or less than 2 . From β –γ < β, it follows that
β−γ β
the divisors of β-γ are smaller than 2 < 2.
β+ γ β+ γ
From β ¿ γ → 2 < β , therefore its 2 divisors are
smaller than β.
i

If νχ is a primer divisor of ∏ ( 2 α −ν ), it will divide a ρ

ρ=1

factor (2 α - ν ), thus less than 2 α

ρ

i i κ΄

It is ∏ ( 2 α −ν ρ ) = 2 α {} + (−1 )i ∏ ν ρ = = 2 ασ∏ ν +(−1 ) ρ

i

ρ=1 ρ=1 ρ=1

i i κ΄

∏ νρ → → ∏ ( 2 α −ν ) = ∏ ν [2 ασ
ρ ρ
ρ=1 ρ=1 ρ=1
i
α
+ (−1 )i ∏ ν ρ] The loop is not divisible by < ν < α , the
ρ΄
ρ=i−κ ΄ 2

first additive factor, because the second additive is not

divided by ν ≠ ν in this interval.
ρ΄ ρ Also, the
α
loop is not divisible by ν < 2 , because the first adder is
ρ

not divisible by the second factor of the second adder .

Therefore the loop
α
Α) or divisible by ¿ν <α
2 ρ , when the ασ is divided by ν > ρ

α and there is a composite 2 α - ν , with a factor ν ρ ρ

κ΄
α Τρ
between 2 and α, ( product ∏ ν with ρ≠ ρ ΄ , thus ρ=1
ρ

α
divisible only with νρ > 2 ) , so case A applies.
B+g=2a

α) If there is an exact φ( ν ) = 3 φ΄( ν ) with factor 3 and

ρ ρ

α
there are others with factor greater than 2 , then
these are prime numbers.
β) If there are more than one φ( ν ) with factor 3, the ρ

τ −1
first insert of the loop is divided by 3 , ( τ number of
i
α
factor 3 in ∏ ( 2 α −ν ) ) and since 3 < 2 , doas not divide
ρ=1
ρ

the second adjective, so the bracket is not divided by 3

α
and there are 2 α - ν with factor > 2 , not divisible by 3
ρ

and the guesswork has been proven.

Β) or divided by ν > α , when the ασ is divided by only
ρ΄

α
2
< ν < α , thus 2 α - ν = ν and ν +ν = 2 α ο.ε.δ.
ρ ρ ρ΄ ρ ρ΄

Algorithm Apps.

Finding pairs (β,γ) that satisfy Goldbach’s speculation.

( κεφ.Β, κεφ.Γ )
α
1. We write all the prime numbers νρ between and α. (
2
thus, the 2 α - ν ρ, do not have a divisor factor of ν ρ divisor of
α
α, because the divisors a are less than 2 and are not equal to
α, or to 2 α- ν ρ > α ).

2. We delete all complexes 2 α - ν ρ ( with difference of the

sum of the votes of ν ρ and of the sum of the votes of 2 α)
divided by 3.

3. We delete ( ν ρ, 2 α- ν ρ), when 2 α- ν ρ do not have factor

α
greater than 2 ( complexes 2 α - ν ρ ¿.

Example :
B+g=2a

α
2 α = 182, α = 91, 2 = 45,5, ν ρ= prime, divisors α=7, 13 45,5< ν ρ<
α
91 -divisor α -factor3 –factor > ( ν ρ,2 α- ν ρ)
2

47 no 11-11=0 no 135(:3,comp.)

53 no 11-8=3 no 129(:3,comp.)

59 no 11-14=3 no 123(:3,comp.)

61 no 11-7=4 no 121(112 ,comp.)

67 no 11-13=2 no 115(5.23,comp.)

71 no 11-8=3 no 111(:3,comp.)

73 no 11-10=1 yes (73,109)=182

79 no 11-16=5 yes (79,103)=182

83 no 11-11=0 no 99(:3,conp.)

89 no 11-17=6 no 93(:3,conp.)

The prime numbers can take the form 6κ± 1. Need

α α α ∓2 α ∓1
2
< 6κ± 1< α → 2
∓ 1< 6κ < α ∓ 1 → 12
<κ< 6

For α=91 → 8 ≤ κ ≤ 15 → ν ρ =(47. 49 ),(53,55), ……,(89,91)

i j
κ
Note 2*. Is 2 α= 2∑ α κ 10 , νρ = ∑ α ΄κ 10κ .
κ =0 κ =0

The coefficient of κ condition 2 α - ν ρ, when κ ≤ j is 2 α κ−α ΄κ

and when κ > j is 2 α κ . Thus the sum of digits of 2 α - ν ρ is 2
i j i j j i

∑ α κ + ∑ (2 α κ −α ΄κ ) = =2 ∑ α κ +2 ∑ α κ −∑ α ΄κ =∑ 2 α κ -
κ= j+1 κ =0 κ= j+1 κ=0 κ=0 κ =0
j

∑ a ΄k equal with the difference of the sum of e.c.t.

κ =0

Symbols:
Φ( ν )= the numerical value of 2α- ν
ρ ρ
B+g=2a

κ = the number of all complex numbers with type

2α - ν ρ

κ΄= the number of prime factors that exist in a φ( ν )

ρ

=2 α - ν ρ

τρ λ = the exponent of factor νρ λ of φ( ν )

ρ

Β = total of unnecessary in (α,2α)

Β΄= the set of primes in (α,2α)
Γ = the set of primes in (2,α) outside of the divider of
α
Γ΄= the set of primes in (2,α)