B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

.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 ( ∀ 𝟐𝜶)

Α.
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, 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 β=γ=α.

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

proven true , because α+α=2 α.

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

B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

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 {𝜷, 𝜸} ≠ {𝟐, 𝝌} → 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).

From 𝝂𝝀𝟏 ≠ 𝝂𝝀 with 𝝀𝟏 ≠ 𝝀 → 2 α - 𝝂𝝀𝟏 ≠ 𝟐 𝜶 − 𝝂𝝀 →

→ 𝝋(𝝂𝝀𝟏 ) ≠ 𝝋(𝝂𝝀 ).

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 Β (= ).
𝟐

Consequently, the function 𝝂𝒊 → 𝝋(𝝂𝒊 ) is a one-way

representation of set Γ within set Β.

III). If there is 𝝋(𝝂𝝌 ) = 2 α -𝝂𝝌 prime, then the pair

(𝝂𝝌 , 𝝋(𝝂𝝌 )) satisfies Goldbach’s conjecture.
B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

Given that the numbers from 𝝋(𝝂𝒊 )= 2 α -𝝂𝒊 , which are

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

The divisors (primes) of 𝝋(𝝂𝒊 ) belong to set Γ, because they

𝟐𝜶
are less than =α, or 𝝋(𝝂𝒊 ) itself, when it is the only
𝟐
divisor, in which case it is a prime and the previous case
applies.

Therefore, 𝝋(𝝂𝒊 ) for i = ρ take the form

𝝉𝝀
𝝋(𝝂𝒊 )=∏𝝀΄
𝝀=𝟏 𝝂𝝆𝝀 = (2 α -𝝂𝝆 ), where 𝝉𝝀 ≥ 𝟏, 𝝂𝝆𝝀 ∈ 𝜞, λ΄ the
number of basis 𝝂𝝆𝝀 and 𝝂𝝆𝝀 ≠ 𝝂𝝆 , ∀ 𝝂𝝆 .
Since ∀i, 𝝋(𝝂𝒊 )> α ≥ 𝝂𝝆 applies, there is not complex
𝝋(𝝂𝝆 ) with λ΄=λ=1 and 𝝉𝝀 =1. If λ΄=λ=1 → 𝝉𝝀 >1.

Note 4. If the factor 𝝂𝝆𝝀 of φ(𝝂𝒊 ) is 𝝂𝝆𝝀 > 𝛼, then 𝝋(𝝂𝝆 ) is

prime number.

Β.
𝜶
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, ∀ 𝝂𝝆𝝀 .
𝝀΄
1. If 𝝂𝝆𝟐 =2, Then 𝝋(𝝂𝝆 ) = ∏𝝀=𝟏 𝝂𝝆𝝀 =2𝝂𝝌 , where
𝛂
𝛎𝛘 𝐢𝐬 𝐚 𝐩𝐫𝐢𝐦𝐞 𝐛𝐞𝐭𝐰𝐞𝐞𝐧 and α. Since 𝝋(𝝂𝝆 ) is an odd
𝟐
B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

number, Lemma 3 Note 1, it cannot take the value

𝝋(𝝂𝝆 )=2𝝂𝝌 .

2. If α𝝂𝝆𝟐 is divided by 3, then 𝝋(𝝂𝝆 ) = 2 α - 𝝂𝝆 is not

divided by 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: 𝝋(𝝂𝝆 ) >
𝟐

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
𝟐𝜶−𝝂𝝆
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.
𝟐𝜶 𝟐𝜶
The numbers with νφ(𝝂𝝆 ) < 2 α are φ(𝝂𝝆 ) < < , so
𝝂 𝟑
the numbers φ(𝝂𝝆 ) are all the prime numbers between
𝒂 𝟐𝒂
𝒂𝒏𝒅
𝟐 𝟑
B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

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 𝝂𝝆 → 𝝋(𝝂𝝆 ) 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 atop. .
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
𝜶
𝒊𝟏 < i΄, have exclusive factors ≤ . (Γ ii)
𝟐
Γ.
Consider that there is no φ(𝝂𝝆 ) with a prime factor
B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

𝜶 𝜶 𝟐
𝝂𝝆𝝀 between and α ( exactly < 𝝂𝝆𝝀 < 𝟑α ), or
𝟐 𝟐
𝜶
the number of φ(𝝂𝝆 ) = 𝟑𝝋΄(𝝂𝝆 ) with 𝝋΄(𝝂𝝆 ) > 𝟐
is κ = i΄< i.
Therefore,
𝟐𝜶−𝝂𝝆
I) or φ(𝝂𝝆 ) has a prime factor 𝝂𝝆𝝀 > 𝛼 > 𝟐
thus (from ΑIII) 2 α - 𝝂𝝆 = 𝝂𝝆𝝀 and 𝝂𝝆 + 𝝂𝝆𝝀 = 2
α ο.ε.δ.
𝛂
II) or 𝛎𝛒𝛌 < 𝐟𝐨𝐫 𝐚𝐥𝐥 𝛒𝛌 , ( 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 < 𝝂𝝆𝝀 < present in the analysis of the
𝟐
𝝉𝝆
2α-𝝂𝝆𝝀 is λ < i. Therefore 2 α - 𝝂𝝆 = φ( 𝝂𝝆 )= ∏𝝀΄ 𝝀
𝝀=𝟏 𝝂𝝆𝝀 ,
𝝉𝝆𝝀 ∈ {𝟎, 𝝉}/τ <i.
𝝉𝝆
Note: You must: ∀ 𝝂𝝆𝝀𝝀 < 2α → 𝝉𝝆𝝀 log𝝂𝝆𝝀 < log2α ,
𝒍𝒐𝒈𝟐𝜶
𝝉𝝆𝝀 < 𝒍𝒐𝒈𝝂 and ∑𝝀΄
𝝀=𝟏 𝝉𝝆𝝀 log𝝂𝝆𝝀 < log2α.΄
𝝆𝝀

Note: According to AIII there exists with

𝝉𝝆
φ(𝝂𝝆 ) = ∏𝝀΄
𝝀=𝟏 𝝂𝝆𝝀
𝝀

From φ( 𝝂𝝆 ) =2 α - 𝝂𝝆 , I form the product

B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

′ 𝛌΄ 𝛕𝛒
∏𝐢𝛒=𝟏 𝚽(𝛎𝛒 ) = ∏𝛋𝛒=𝟏 ∏𝛌=𝟏 𝛎𝛒𝛌𝛌 = ∏𝐢𝛒=𝟏(𝟐 𝛂 − 𝛎𝛒 ) ,
𝜶
where 2 < 𝝂𝝆𝝀 < 𝟐 of number λ (Γ II) and 𝟐 < 𝝂𝝆 < α
number I, where λ < i .
𝝀′ 𝝉𝝆 𝝀 𝜿΄𝝀 𝜯
Set 𝛒𝛌 = ρ΄, → ∏𝜿΄ ∏ 𝝂
𝝆=𝟏 𝝀=𝟏 𝝆𝝀 = ∏𝝆΄=𝟏 𝝂𝝆΄𝝆΄ , 𝜿΄𝝀
𝜶
the number of 𝝂𝝆𝝀 in 2 α -𝝂𝝆 with 2<𝝂𝝆𝝀 <𝟐 and
𝛌 𝛋΄
𝜯 𝝂𝝆𝝀 =∑𝛌=𝟏 𝛕𝛒𝛌 is the sum of the exponents for each
force on the same basis 𝝂𝝆𝝀 , →
𝛋΄𝛌 𝚻
→∏𝛒΄=𝟏 𝛎𝛒΄𝛒΄ = ∏𝐢𝛒=𝟏(𝟐𝛂 − 𝛎𝛒 ).

All the factors of the product are only the factors

present un the composites in 2 α - 𝝂𝝆 .
Therefore 𝟐𝛂 {(𝟐 𝜶)𝒊−𝟏 −
𝟏
− ∑𝒊𝝆=𝟏 𝝂𝝆 (𝟐 𝜶)𝒊−𝟐 + . . . +(−𝟏)𝒊−𝟏 ∑𝒊𝝀=𝟏(𝝂 ∏𝒊𝝆=𝟏 𝝂𝝆 )} +
𝝀
𝚻
+(−𝟏)𝐢 ∏𝐢𝛒=𝟏 𝛎𝛒 = ∏𝛋΄ 𝛒΄
𝛒΄=𝟏 𝛎𝛒΄ →
′ 𝜯 −𝟏
→2α{ }= ∏𝜿𝝆=𝟏 𝝂𝝆 [∏𝜿΄ 𝝆΄
𝝆΄=𝟏 𝝂𝝆΄ − (−𝟏)𝒊 ∏𝒊𝝆=𝒊−𝜿΄ 𝝂𝝆 ] (1)

Therefore the { } is divided by ∏𝜿΄

𝝆=𝟏 𝝂𝝆 , because
gcd(α,𝝂𝝆 ) =1 → 2 α { } = 2 α σ ∏𝜿΄
𝝆=𝟏 𝝂𝝆 .
𝜶
σ does not have a factor 𝝂𝝆 < 𝟐 , because in the loop
the (−𝟏)𝒊 ∏𝒊𝝆=𝒊−𝜿΄ 𝝂𝝆 is not divisible by the factor
𝜶
𝝂𝝆 < 𝟐 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 )
B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

𝜶
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 β.

If 𝝂 𝝌 is a primer divisor of ∏𝒊𝝆=𝟏(𝟐 𝜶 − 𝝂𝝆 ), it will

divide a factor (2 α - 𝝂𝝆 ), thus less than 2 α

It is ∏𝒊𝝆=𝟏(𝟐 𝜶 − 𝝂𝝆 ) = 2 α {} + (−𝟏)𝒊 ∏𝒊𝝆=𝟏 𝝂𝝆 =

= 2 ασ∏𝜿΄ 𝒊 𝒊
𝝆=𝟏 𝝂𝝆 +(−𝟏) ∏𝝆=𝟏 𝝂𝝆 →
𝒊 𝒊
→ ∏𝒊𝝆=𝟏(𝟐𝜶 − 𝝂𝝆 ) = ∏𝜿΄
𝝆=𝟏 𝝂𝝆 [2 ασ + (−𝟏) ∏𝝆=𝒊−𝜿΄ 𝝂𝝆 ]
𝜶
The loop is not divisible by < 𝝂𝝆΄ < α , the first
𝟐
additive factor, because the second additive is not
B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

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
𝜶
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 α
𝟐
ο.ε.δ.
Algorithm Apps.
B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

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

( κεφ.Β, κεφ.Γ )
𝜶
1. We write all the prime numbers 𝝂𝝆 between and α.
𝟐
( thus, the 2 α - 𝝂𝝆 , do not have a divisor factor of 𝝂𝝆 divisor
𝜶
of α, because the divisors a are less than 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 ( complexes 2 α - 𝝂𝝆 ).
𝟐

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.)

61 no 11-7=4 no 121(𝟏𝟏𝟐 ,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.)
B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.

The prime numbers can take the form 6κ±𝟏.

𝜶 𝜶 𝜶∓𝟐 𝜶∓𝟏
Need < 6κ±𝟏 < α → ∓ 𝟏 < 6κ < α ∓ 𝟏 → <κ<
𝟐 𝟐 𝟏𝟐 𝟔

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

𝒋
Note 2*. Is 2 α= 2∑𝒊𝜿=𝟎 𝜶𝜿 𝟏𝟎𝜿 , 𝝂𝝆 = ∑𝜿=𝟎 𝜶΄𝜿 𝟏𝟎𝜿 .

The coefficient of κ condition 2 α - 𝝂𝝆 , when κ ≤ j is 𝟐𝜶𝜿 −𝜶΄𝜿

and when κ > j is 𝟐𝜶𝜿 . Thus the sum of digits of 2 α - 𝝂𝝆 is
𝒋
2∑𝒊𝜿=𝒋+𝟏 𝜶𝜿 + ∑𝜿=𝟎(𝟐 𝜶𝜿 −𝜶΄𝜿 ) =
𝒋 𝒋 𝒋
=2∑𝒊𝜿=𝒋+𝟏 𝜶𝜿 + 𝟐 ∑𝜿=𝟎 𝜶𝜿 − ∑𝜿=𝟎 𝜶΄𝜿 =∑𝒊𝜿=𝟎 𝟐𝜶𝜿 - ∑𝜿=𝟎 𝒂΄𝒌
equal with the difference of the sum of e.c.t.

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α)
Β΄= the set of primes in (α,2α)
Γ = the set of primes in (2,α) outside of the divider of
α
Γ΄= the set of primes in (2,α)
B + g = 2 aΠληκτρολογήστε την εξίσωση εδώ.