Documente Academic
Documente Profesional
Documente Cultură
Email: Spyrosstamatopoulos891@gmail.com
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.
Proof: Given β>γ and γ is a prime, then the only divisor of γ is γ=δ itself. As for
β > γ =δ, there is a number 𝜷𝟏 >1, so that β=δ𝜷𝟏 (Euclidean division), then β is a
complex number for δ≠ 𝟏 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
α>β=δ → α=β𝜶𝟏 . From β+γ=2 α→ β+γ=2β𝜶𝟏 → γ=β(2𝜶𝟏 -1), therefore γ is a
complex number, which is contrary to the hypothesis that γ is a prime
( applies only when 2𝒂𝟏 -1 = 1, therefore 𝜶𝟏 = 1 and α=β=γ).
Lemma 2.
If β=γ then β=γ=α.
1
Proof: From β=γ → β+γ=2 β=2 γ =2 α → β=γ=α. If α is prime, the conjecture is
proven true , because α+α=2 α.
Lemma 3.
If β=2, then also γ=2
Note 1: If {𝜷, 𝜸} ≠ {𝟐, 𝝌} → from (1) and (3) it is concluded that β and γ are
odd numbers.
Note2: If 2 <γ ≤ 𝜶 → α ≤ 𝜷 < 2 𝜶, because β=2 α - γ≥ 𝟐𝜶 − 𝜶 = 𝜶 and
β= 2 α –γ <2 α.
II). We divide the set of primes less than 2 α into two classes
𝝌
Γ΄ ={ ⁄𝝌 : 𝒑𝒓𝒊𝒎𝒆 ∈ (𝟐, 𝜶]} and
𝝌
B΄= { ⁄𝝌 : 𝒑𝒓𝒊𝒎𝒆 ∈ (𝜶, 𝟐𝜶)}
Since gcd(γ,α)=gcd(β,α) =1, the number β (if β exists and is a prime)
belong to sets Β΄ and the number γ belong to
𝝌
Γ =Γ΄─{ ⁄𝝌 : 𝒅𝒊𝒗𝒊𝒔𝒐𝒓 𝒐𝒇 𝜶}. ( 𝜨𝟏 )
I specify that 𝝋(𝝂𝒊 ) =2 α - 𝝂𝒊 , where 𝜈𝑖 are the primes less
than α and which do not divide α, namely QUOTE 𝜈𝑖 ∈ 𝛤.
Therefore, 𝜑 (𝜈𝑖 ) exist, are odd numbers (not necessarily
primes) and positive with
𝝌 𝜅
𝝋(𝝂𝒊 ) ∈ { ⁄𝝌 : 𝜶 < ∏𝜅𝜆=1 𝜈𝜌𝜆𝜆 < 2𝜶} = Β. ( a larger set of Β’,
containing all unnecessary numbers and prime numbers).
Note 3. The sets (2, α] and (α, 2 α) have the same measure α-2.
𝜶
The number of elements (prime number) of Γ (< ) is smaller than
𝟐
𝜶
the number of elements (odd number) of Β (= ).
𝟐
Β.
𝜶
If φ(𝝂𝒊 ) has a factor 𝝂𝝆 > , then it does not contain power
𝟐
𝜶
of 𝝂𝝆 , because 𝝂𝝆𝝀 > and α>8 → 𝝂𝟐𝝆𝝀 > 2 α, Lemma 3 Note 2
𝟐
𝟐 𝒂 𝟐
(The inequality 𝝂𝝆𝝀 > ( ) >2 α has a solution α>8).
𝟐
Therefore, the formula is 𝝋(𝝂𝒊 ) =∏𝝀΄
𝝀=𝟏 𝝂𝝆𝝀 .
𝜶
From 𝝂𝝆𝝀 > → 4𝝂𝝆𝝀 > 2 α. Consequently the maximum value
𝟐
𝜶
of 𝝀΄ is 2 with 𝝂𝝆 > , 𝝂𝝆𝟐 =2, or 𝝂𝝆𝟐 =3 and 𝝋(𝝂𝒊 ) does not
𝟐
contain power, ∀ 𝝂𝝆𝝀 .
3
𝝀΄
1. If 𝝂𝝆𝟐 =2, Then 𝝋(𝝂𝝆 ) = ∏𝝀=𝟏 𝝂𝝆𝝀 =2𝝂𝝌 , where
𝛂
𝛎𝛘 𝐢𝐬 𝐚 𝐩𝐫𝐢𝐦𝐞 𝐛𝐞𝐭𝐰𝐞𝐞𝐧 and α. Since 𝝋(𝝂𝝆 ) is an odd
𝟐
number, Lemma 3 Note 1, it cannot take the value
𝝋(𝝂𝝆 )=2𝝂𝝌 .
Proof:
Supposing that the complex number have the formula
𝟐𝜶−𝝂𝝆
3𝝋΄ (𝝂𝝆 ) = 2 α – 𝝂𝝆 , where 𝝂𝝆 ∈ Γ, therefore is an
𝟑
𝜶
integer prime, 𝝋 ΄(𝝂𝝆 ) ∈ ( , α ) and
𝟐
𝝋(𝝂𝝆 ) = 3 𝝋΄ (𝝂𝝆 ) ∈ 𝜝 are number i’ < i, so
𝟐𝜶−𝝂𝝆
∏𝒊΄𝝆=𝟏 𝝋΄(𝝂𝝆 ) = 𝟑𝒊΄ ∏𝒊΄𝝆=𝟏 ( ).
𝟑
Let’s say, that there are other prime numbers 𝝋΄(𝝂𝝆 )
with 2 α−𝝂𝝀 =3φ΄(𝝂𝝀 ) of the crowd κ all φ(𝝂𝝆 )
The numbers with 3φ’(𝛎𝛒 ) greater than α > 3. (cap.3/2)
4
𝟐𝜶 𝟐𝜶
The numbers with νφ’(𝝂𝝆 ) < 2 α are φ’(𝝂𝝆 ) < < , so
𝝂 𝟑
the numbers φ’(𝝂𝝆 ) are all the prime numbers between
𝒂 𝟐𝒂
𝒂𝒏𝒅
𝟐 𝟑
I form ∏𝒊΄𝝆=𝟏 𝟑𝝋΄ (𝝂𝝆 )=∏𝜿΄ 𝝀=𝟏(𝟐𝜶 − 𝝂𝝀 ) →
𝟐𝜶−𝝂𝝆
→ 𝟑𝒊΄ ∏𝒊΄𝝆=𝟏 ( ) = 𝟑𝜿΄ ∏𝜿΄
𝝀=𝟏 𝝋΄(𝝂𝝀 ) and so κ΄= i΄.
𝟑
Ie the numbers of unnecessary complexes in space
𝜶
(α,2 α) with a factor greater than , satisfying the
𝟐
interval Goldbach equality, equals the number
𝜶
i΄ < i of the number of the factors in space (𝟐, α),
therefore the function 𝝂𝝆 → 𝝋(𝝂𝝆 ) =3𝝋΄(𝝂𝝆 ) is
one to one, because 𝝀𝟏 ≠ 𝝀→ 𝝋(𝝆𝝀𝟏 ) ≠ 𝝋(𝝆𝝀 ).
Let all the complex numbers in the interval
α< φ(𝝂𝝆 ) < 2 α, with 𝝂𝝆 in the interval 2< 𝝂𝝆 < α,
𝜶
have factor 3 and 𝝂𝝆΄ > 𝟐 .
Since the number of composites is equal to the
number of i of the 𝝂𝝆 (𝜨𝟏 ) in interval 2 < 𝝂𝒊 < α
𝜶
and the number 𝝂𝝆΄ in 𝟐 < 𝝋(𝝂𝝆 ) < α is i΄< i, there
will be at least two values 𝝂𝟏 , ≠ 𝝂𝟐 , to define the
φ(𝝂𝝆 ) i > i΄, thus the compositeάρα φ(𝝂𝟏 ) = φ(𝝂𝟐 ),
so it’s fals (Lemma3/II). .
Therefore, or there exist φ(𝝂𝝆𝝀 ) with λ ≥𝟏
𝜶
and a factor greater than , which is not divided
𝟐
by 3 ,so it is prime number and 𝝋(𝝂𝝆 ) + 𝝂𝝆 = 2 α,
or all composite φ(𝝂𝝆 ) ≠ 𝟑𝝋΄(𝝂𝝆 ) of the number
5
𝜶
𝒊𝟏 < i΄, have exclusive factors ≤ . (Γ ii)
𝟐
Γ.
Consider that there is no φ(𝝂𝝆 ) with a prime factor
𝜶 𝜶 𝟐
𝝂𝝆𝝀 between and α ( exactly < 𝝂𝝆𝝀 < 𝟑α ), or
𝟐 𝟐
𝜶
the number of φ(𝝂𝝆 ) = 𝟑𝝋΄(𝝂𝝆 ) with 𝝋΄(𝝂𝝆 ) > 𝟐
is κ = i΄< i.
Therefore,
𝟐𝜶−𝝂𝝆
I) or φ(𝝂𝝆 ) has a prime factor 𝝂𝝆𝝀 > 𝛼 > 𝟐
thus (from ΑIII) 2 α -𝝂𝝆 = 𝝂𝝆𝝀 and 𝝂𝝆 + 𝝂𝝆𝝀 = 2 α
QED.
𝛂
II) or 𝛎𝛒𝛌 < 𝐟𝐨𝐫 𝐚𝐥𝐥 𝛒𝛌 , ( except for the value
𝟐
in the case φ(𝝂𝝆 ) = 3𝝂𝝆𝝀 ).
6
Note: According to AIII there exists with
𝝉𝝆
φ(𝝂𝝆 ) = ∏𝝀΄
𝝀=𝟏 𝝂𝝆𝝀
𝝀
7
𝜶
𝝂𝝆 < 𝟐 who is 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 𝝂𝝆 >𝟐
of the second adder.
𝜶
So the factors of σ belongs to < 𝝂𝝆 < α ≠ 𝝂𝝆΄ , 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.
Proof:
The prime divisors of a z-number is the same number if
𝒛
it is prime or less than 𝟐. From β –γ < β, it follows that
𝜷−𝜸 𝜷
the divisors of β-γ are smaller than < 𝟐.
𝟐
𝛃+𝛄 𝜷+𝜸
From β > 𝛾 → < β , therefore its divisors are
𝟐 𝟐
smaller than β.
8
It is ∏𝒊𝝆=𝟏(𝟐 𝜶 − 𝝂𝝆 ) = 2 α {} + (−𝟏)𝒊 ∏𝒊𝝆=𝟏 𝝂𝝆 =
= 2 ασ∏𝜿΄ 𝒊 𝒊
𝝆=𝟏 𝝂𝝆 +(−𝟏) ∏𝝆=𝟏 𝝂𝝆 →
𝒊 𝒊
→ ∏𝒊𝝆=𝟏(𝟐𝜶 − 𝝂𝝆 ) = ∏𝜿΄
𝝆=𝟏 𝝂𝝆 [2 ασ + (−𝟏) ∏𝝆=𝒊−𝜿΄ 𝝂𝝆 ]
𝜶
The loop is not divisible by < 𝝂𝝆΄ < α , the first
𝟐
additive factor, because the second additive is not
divided by 𝝂𝝆΄ ≠ 𝝂𝝆 in this interval.
𝜶
Also, the loop is not divisible by 𝝂𝝆 < 𝟐, because the
first adder is not divisible by the second factor of the
second adder .
Therefore the loop
𝜶
Α) or divisible by < 𝜈𝝆 < 𝛼 , when the ασ is divided
𝟐
by 𝝂𝝆 > α and there is a composite 2 α - 𝝂𝝆 , with a
𝜶 𝜯
factor 𝝂𝝆 between and α, ( product ∏𝜿΄
𝝆=𝟏 𝝂 𝝆
𝝆 with
𝟐
𝜶
ρ≠ 𝝆΄ , thus divisible only with 𝝂𝝆 >𝟐) , so case A
applies.
α) If there is an exact φ(𝝂𝝆 ) = 3 φ΄(𝝂𝝆 ) with factor 3
𝜶
and there are others with factor greater than , then
𝟐
these are prime numbers.
β) If there are more than one φ(𝝂𝝆 ) with factor 3, the
first insert of the loop is divided by 𝟑𝝉−𝟏 , ( τ number of
𝜶
factor 3 in ∏𝒊𝝆=𝟏(𝟐𝜶 − 𝝂𝝆 ) ) and since 3 < , doas not
𝟐
divide the second adjective, so the bracket is not
9
𝜶
divided by 3 and there are 2 α -𝝂𝝆 with factor > 𝟐 , not
divisible by 3 and the guesswork has been proven.
Β) or divided by 𝝂 𝝆΄ > α , when the ασ is divided by
𝜶
only < 𝝂𝝆 < α , thus 2 α - 𝝂𝝆 = 𝝂𝝆΄ and 𝝂𝝆 + 𝝂𝝆΄ = 2 α
𝟐
QED.
Algorithm Apps.
Example :
𝜶
2 α = 182, α = 91, = 45,5, 𝝂𝝆 = prime, divisors α=7, 13
𝟐
𝜶
45,5<𝝂𝝆 < 91 -divisor α -factor3 –factor > (𝝂𝝆 ,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.)
10
67 no 11-13=2 no 115(5.23,comp.)
71 no 11-8=3 no 111(:3,comp.)
83 no 11-11=0 no 99(:3,conp.)
89 no 11-17=6 no 93(:3,conp.)
Symbols:
Φ(𝝂𝝆 )= the numerical value of 2α-𝝂𝝆
κ = 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α)
11
Β΄= the set of primes in (α,2α)
Γ = the set of primes in (2,α) outside of the divider of α
Γ΄= the set of primes in (2,α)
12