1

From the weak Goldbachs Conjecture to the strong

Conjecture
(hints to the RH1)

Gruppo B. Riemann*

Francesco Di Noto, Michele Nardelli

*Gruppo amatoriale per la ricerca matematica sui numeri primi, sulle loro congetture e sulle
loro connessioni con le teorie di stringa.

Abstract

In this paper we show the connections between, strong Goldbachs conjecture and weak
Goldbachs conjecture, recently proved.


From the recent proof of the weak Goldbach's conjecture (N odd greater than 5, ie N 7), it
follows automatically the proof of the strong conjecture (N even 4 as the sum of two prime
numbers)



Before showing our proof, we report some piece of Wikipedia

Congettura debole di Goldbach (in Italian)
From Wikipedia.
In number theory, the weak Goldbachs conjecture, also known as the Goldbach conjecture on
odd or problem of the 3 primes, states that:
Every odd number greater than 7 can be expressed as the sum of three odd primes.
or equivalently:
Every odd number greater than 5 can be expressed as the sum of three prime numbers.
(A prime number can be used more than once in the sum.)
...
In 1997, Deshouillers, Effinger, Te Riele and Zinoviev showed [1] that the generalized Riemann
hypothesis implies the weak Goldbachs conjecture. This result combines a general statement for
2
numbers larger of 10
20
with extensive research on the computer for small cases. Furthermore, if
Levy's Conjecture is true, the weak Goldbachs conjecture would be true also.
In 2012 and 2013, Harald Helfgott has published two articles on internet that prove the
conjecture unconditionally for any integer greater than 7.

Remarks:

We have long showed that the minimum number as a sum of three primes is 7 (final References on
Goldbach), so no need of large numbers associated with the generalized Riemann hypothesis, and
also the truth of the Levys conjecture, from which we have obtained an RH equivalent hypothesis
(see final References regarding Riemann)

In addition, Wikipedia still seems skeptical about the recent proposals of proof by Harald Helfgott


Our new proposed of proof of the strong Goldbachs conjecture based precisely on the proposal
by Harald Helfgott


From N odd 7, sum of three primes, we remove any of the three (which is odd), remains an even
number N that is the sum of the remaining two prime numbers, just as says the strong Goldbachs
conjecture, so that it follows automatically, for all the odd numbers 7 and for all the even numbers
4

Examples:


5 +13 + 19 = 37 = N odd

37 - 5 = 32 = 13 + 19

37 - 13 = 24 = 5 + 19

37 19 = 18 = 13 + 5




The same also for all the other prime numbers, starting with 9 (7 is the exception), as well as all
those that contain 2 as addend, but also often have as addends three prime numbers greater than 2,
and therefore also applies to them (because 2 is even, and an odd number less an even number
provides another odd).


3

9 = 3 +3 + 3

9 - 3 = 6 = 3 +3

9 5 = 4 = 2 + 2


Once because the others are repetitions

11 = 3 + 5 +3

11 - 3 = 8 = 3 + 5

11 - 5 = 6 = 3 + 3

11 7 = 4 = 2 +2


13 = 3 + 5 + 5

13 - 3 = 10 = 5 + 5

13 - 5 = 8 = 3 + 5

13 - 7 = 6 = 3 +3


15 = 3 +7 + 5 = 5 + 5 + 5

15 - 3 = 12 = 5 + 7

15 - 5 = 10 = 3 + 7= 5 + 5

15 7 = 8 = 5 +3

15 11 = 4 = 2 + 2


17 = 2 + 3 + 5 + 7 = 11 + 3 + 3

17 3 = 14 = 2 + 5 + 7

4
17 5 = 12 = 5 + 7

17 7 = 10 = 3 + 7 = 5 + 5

17 11 = 6 = 3 +3

17 13 = 4 = 2 + 2

and so on: removing from each odd number N 7 gradually all the successive primes from 3 to N'
- 4 (excluding N' 2 because 2 is less than 4, the minimum number of the strong Goldbachs
conjecture, and therefore can not be the sum of two prime numbers), we obtain various even
numbers, in turn, sum of two prime numbers, and even more than once. Largest is then N ', there are
more possibilities that it is the sum of the three primes, and then there are no counter-examples, and
therefore the weak Goldbachs conjecture is true.
Finally, the even numbers of the form 6k and then multiples of 6, have more pairs of Goldbach
(about the double) compared to the even numbers near of the form 6k - 2 and 6k +2, and all the
even numbers are of the form 6k 2 , 6k and 6k + 2, as from the following Table 1, for k starting
from 1.
Recall that 2 is of form 6k +2 for k = 0, since 6*0 +2 = 0 +2 = 2

TABLE 1

6k -2 6k 6k+2
4 6 8
10 12 14
16 18 20
22 24 26



Since the approximate formula of the number G(N) of pairs of Goldbach is N/(ln N)
2
, and this
formula gives results always increasing for 6k -2 and 6k+2 (about the double for 6k), the strong
Goldbachs conjecture is also true.
(In the previous examples all the smaller even numbers appear always, and increasing N also
appear all the other largest even numbers in descending order, and always more times). The above
formula gives approximate results but very reliable, with small differences between estimated and
real values.









5

TABLE 2

N even (ln N)^2
increasing
N/(ln N)^2
increasing
Real value
increasing
irregular
Whole
difference

4 1,92 2,08 1 1
6 3,21 1,86 1 0
8 4,32 1.85 1 0
10 5,30 1,58 2 1
12 6,17 1,94 1 0
14 6,96 2,01 2 0
16 7,68 2,08 2 0
18 8,35 2,15 3 1
20 8,97 2,22 2 0
22 9,55 2,30 3 1
24 10,10 2,37 3 1
26 10,61 2,45 3 1

118 22,75 5,18 6 1
120 22,92 5,29 12 7
122 23,07 5,28 4 1




As seen, at the beginning, for even numbers small, the largest number of pairs of Goldbach not
notice much, but for larger numbers, for example 120, this difference is well known, since 12 of
120 is twice the 6 previous of 118 and three times 4 for 122. The reason is explained by the fact that
for even numbers N of the form 6k, the multiples of 3 and of other primes form many couples
between them, leaving more space for the prime numbers to form Goldbach couples, while for
numbers of the form 6k 2 and 6k + 2 are formed much more mixed couples between prime
numbers and composite numbers, decreasing the possibility of formation of Goldbach couples (both
primes). (See final reference on the primorial numbers and Goldbach's conjecture). In the primorial
numbers we have the maximum number of Goldbach couples with respect to the precedent even
numbers.

The terns of weak Goldbach's conjecture depend, as number, T (N) from the G(N) number of the
Goldbach couples of even numbers N that are obtained from the differences N = N p. If N p is
an even number of form 6k, and then with more Goldbach couples, then we have, also now, a
greater number of terns T(N).
Obvious that the Goldbachs Terns for a certain N odd are therefore more numerous of the
Goldbach couples for the two near even numbers N, namely, N 1 and N + 1.


6

Here we have the strong conjecture for two primes (k = 2), and the weak conjecture for three
primes. But the Goldbachs conjecture can be extended, and demonstrated, for any number k> 3,
and with minimum number N
min
= 2k if k is even, and 2k + 1 if k is odd.
We have that k = 2 for the strong conjecture, in fact N
min
is 2 * 2 = 4, while for the weak conjecture
we have N
min
= 2 * 3 + 1 = 7, this consistent with the proof of Harald Helfgott. (see final References
for Goldbach, especially 5a, on the extensions of the Goldbach conjecture to k primes).


Conclusions and consequences

We can conclude that from the proof of the weak Goldbach's conjecture it follows directly and
immediately, as we have seen, the proof of the strong Goldbachs conjecture, and, indirectly, all the
other conjectures extended concerning any number k of prime numbers whose sum is N even or
odd, respectively, with k even or odd, as long as the minimum number N
min
is 2k and 2k +1 for N
that is the sum of k primes.
Another very important link could be with the hypothesis RH1, RH equivalent hypothesis, since, for
even numbers N of the form 6k, the number of Goldbach couples is directly proportional to the
abundance (sum of divisors (n) / N) , very important in RH1 (we have demonstration proposals,
see Ref, 1a) and 2a) final)


On some equations concerning the major arcs for Goldbachs problem: possible
mathematical connections with some sectors of string theory.

The Fourier transform on R is normalized as follows:

( ) ( ) ( )

= dx x f xt e t f

(1)

for : f R C.
The trivial bound is
1

f f

. Integration by parts gives that, if f is differentiable k

times outside finitely many points, then

( )
( )
( )
( )
|
|

\
|
=
|
|
|

\
|
=

k
k
k
t
f
O
t
f
O t f
2 2

1
. (2)

Thence, from (1) and (2), we can to obtain the following relationship:

( ) ( ) ( )

= dx x f xt e t f

( )
( )
( )
|
|

\
|
=
|
|
|

\
|
=

k
k
k
t
f
O
t
f
O
2 2

1
. (3)


7
Now, we have that:

( ) ( ) ( ) ( )
( ) ( )
( )
( ) ( )
( )
( )

=
|
|

\
|

=
1
,
2
min
2 ,
3
2
0
3
2
0
,
,

q
r
x
r
q
q
d N q
q
N q
N e x x x

( ) ( ) ( ) ( )
( ) ( )
( )
( ) ( ) ( )
|
|

\
|
=

1
2
3
2
0
3
,
,

q
N q q
q
N q
d N e x x x

( ) ( ) ( ) ( )
( ) ( )
( )
( ) ( )
( )
( )

=
|
|

\
|
>

1
,
2
min
2 ,
3
2
0
3
2
0
,
,

q
r
x
r
q
q
d N q
q
N q
N e x x x

. (4)

By (2) (with 3 = k ), and the following equations:

( )
( )
( ) ( ) ( ) ( )
( )
( )

>

|
|

\
|

+ =
+
=
odd q
r q
odd b
b
odd a
b r a odd b p
r p p
p
r
b f
r a
a
b
b f
q
q
.. ..
1
..
/ .. 2
2 2
2
2 2
2
2
2
2
15502 . 2
1
1 2
1
1 12 1
2 / 1 1
4 / 2

, (5)


( )
( )
( )
( )


=
even q
r q
odd q
r q
r q
q
q
q
.. ..
2 /
2
2
2
2
31004 . 4

, (6)

this is at most

( )
( )

|
|

\
|
+
2 /
2 / 2 /
0
2
3
1
3
0
1
2
2
0
1
2
0
0 0
62008 . 8
2
2
31004 . 4

d
r
x d
r
x

( )
r
x
2
5
0
2
1
3
0 2
1
0 0
1
00113 . 0 31004 . 4
|
|
|

\
|
+

. (7)

It is easy to see that


( ) ( )
( )
( ) ( ) ( )
( ) ( )

|
|

\
|

+
|
|

\
|

=
1
3 2
2
3
1
1
1
1
1
1 ,
,
q N p N p
p p
N q q
q
N q

. (8)

Expanding the integral implicit in the definition of f

,

( ) ( ) ( ) ( ) ( ) ( ) ( )

\
|
+ =
0 0
2 1 2 1 2 0 1 0
2
0
1
dt dt t t
x
N
t t
x
d N e x x . (9)




8
Hence, the following equation

( ) ( )
( )
( ) ( ) ( ) ( ) ( ) ( ) ( )
( ) ( )
( )
( ) ( ) ( ) +

+
odd q
r q
qx
r
qx
r
even q
r q
N q q
q
N q
x d N e x x N q q
q
N q
x
..
2
2
..
2
2
3
3 2 2
3
3
0
0
,
,
,
,

( ) ( ) ( ) ( )

+

qx
r
qx
r
d N e x x
0
0

2

, (10)

is equals to

( ) ( ) ( )
( ) ( )

|
|

\
|

+
|
|

\
|

\
|
+
0 0
3 2 2 1 2 1 2 0 1 0
2
1
1
1
1
1
1
N p N p
p p
dt dt t t
x
N
t t x (11)

(the main term) plus

( )
( )
2
1
5
0
2
1
3
0 2
1
0 0
0 0
2
2
0
00113 . 0 31004 . 4
2 82643 . 2 x
r

|
|
|
|
|
|

\
|
+
+ +

. (12)

Thence, we can to obtain also the following expression:

( ) ( ) ( )
( ) ( )
+
|
|

\
|

+
|
|

\
|

\
|
+

0 0
3 2 2 1 2 1 2 0 1 0
2
1
1
1
1
1
1
N p N p
p p
dt dt t t
x
N
t t x
+ ( )
( )
2
1
5
0
2
1
3
0 2
1
0 0
0 0
2
2
0
00113 . 0 31004 . 4
2 82643 . 2 x
r

|
|
|
|
|
|

\
|
+
+ +

. (12b)

We will be working with

supported on the non-negative reals; we recall that

0
is
supported on [ ] 2 , 0 . Hence

( ) ( ) ( ) ( )( )



=
|

\
|
=
|

\
|
+
0 0 0
0 0 2 1 2 1 2 0 1 0
x
N
d
x
N
dt dt t t
x
N
t t
( ) ( ) ( ) ( )

+ =
|

\
|
+ =

x
N
x
N
d d
x
N
O
0 0
2
2
0
2
2
0
2
2
0
2 2
2
0
' 71 . 2 ' 2 71 . 2
( ) ( ) ( )
|
|

\
|
+

x
N
d x N O
0
2
/ 2 . (13)

9
Now we write
( ) ( ) u i u i
u
u log 2
2
2
= (14)

for u real or complex, so that

( )
( )

=
0
u
du
u e s F
u

. (15)

We wish to find a saddle point. At a saddle point, ( ) 0 ' = u . This means that

0 2 =
u
i
i u

, i.e., 0
2
= + i u i u l , (16)

where 2 = l . The solutions to ( ) 0 ' = u are thus


2
4
2
0
i i
u
+
=
l l
. (17)

The second derivative at
0
u is

( ) ( ) ( ) i u i
u
i u
u
u 2
1 1
' '
0 2
0
2
0 2
0
0
+ = + = l . (18)

Now recall that our task is to bound the integral

( ) ( ) ( )
( ) ( ) ( )
( ) ( )
( )

+ + =
+
2
1
0
1
0
2 2 2
, 0 0
2 2
1
0
1
0
1
C
u u
d
dr
du
e e d
d
dr
dr
du
e du u e

l l
l l
R R
(19)
Since
+ , 0
u is a solution to equation (16), we see from (14) that

( ) ( ) ( ) ( ) ( )
+ + +
+
+ +
+
+
+ =
|
|

\
|
+ + =
|
|

\
|
+ =
, 0 , 0 , 0
, 0
, 0 , 0
2
, 0
, 0
arg
2
1
arg
2 2
log
2
u iu u
i
iu
u i iu
u
u

l
l
l R R R R .
(20)
We defined ( )
0
iu y l = R and we computed ( )
+

, 0
arg 2 / u y in the following equation

( )
( )
( )
( )
( ) ( )
2
1 2 1
arccos
2
1
2
1
2 1
2
arccos
2
arg
2
, 0

|
|

\
|
=
|
|

\
|
|
|

\
|

+
= +
+
v
v
j
j
y
u
l
(21)

This given us

( ) ( )
( )
2
1 2 1
arccos
, 0

|
|

\
|

=
+
v
v u
e e
R
. (22)
10

If 1 , we can bound
( )
( )

< +

, 0 ... ..........
, 0 ..... .......... ..........
1
0 0
1
0 1
0

if
if
(23)

provided that 0
0 0
> + (as will be the case). If 1 > , then

( )
( )

> +

. 0 .. ..........
, 0 ... .......... ..........
1
0 1
1
0 1
0

if
if
(24)

By the following equation (the arc-length infinitesimal)


( )
dr
r
c
c
c
r
dr
r c
dr
dr
d
r du
2
1
0
2
1
2
2
2
2
1
2
1
cos
/
1 1
|
|

\
|

+ = + =
|

\
|
+ =
l
l
l

(25)

we have


( ) ( ) ( )
( )
2
1 0
2
0 1
2
2
1
sin 1
1
cos
/
1


c
c r c
dr
du

+
+ = + =
l
. (26)

We bound ( )
2
1
/ l r c from above by its value when the curve meets the x -axis. We
bound
2
cos from below by its value when
1
. We obtain


( )

+ =

+ =

2
2
0
2
1 1 0
2
0
cos
1
sin 1
1
c
c
c
dr
du
, (27)

where

is the value of when

1
= . Now, we complete the integral in (19), we
split it in two and use

=
1
0 0
2 / 1 2 2 2 2

l l
l
d e d e . (28)

Therefore,


( ) ( )
( )
( )
( ) ( )

= + + + =

|
|

\
|

2
1
0
1
0 2
2
0 2
1 2 1
arccos
1 2 /
cos
1
C
j
v
v u
c
e du e

l
l
R


( )

2
1 2 1
arccos
2
2
0
1
0
1
0
cos
1 1 1
2
|
|

\
|

|
|

\
|
+
|
|

\
|
|
|

\
|
+ + =
v
j
e c
r , (29)
11

where 0 =

j if 1 and 1 =

j if 1 > .

We note that this expression can be related with the Ramanujan modular equation
concerning :
(
(

|
|

\
|
+
+
|
|

\
|
+
=
4
2 7 10
4
2 11 10
log
142
24
.
We easily note that this equation is related also with the number 24, i.e. the number
regarding the modes corresponding to the physical vibrations of the bosonic strings.
Thence, we obtain the following mathematical connection:


( ) ( )
( )
( )
( ) ( )

= + + + =

|
|

\
|

2
1
0
1
0 2
2
0 2
1 2 1
arccos
1 2 /
cos
1
C
j
v
v u
c
e du e

l
l
R


( )

|
|

\
|
+
|
|

\
|
|
|

\
|
+ + =
|
|

\
|

2
1 2 1
arccos
2
2
0
1
0
1
0
cos
1 1 1
2
v
j
e c
r

(
(

|
|

\
|
+
+
|
|

\
|
+
=
4
2 7 10
4
2 11 10
log
142
24
. (29b)



Lemma 1

Let C R f
+
: be piecewise
1
C . Assume ( ) 0 log lim =

t t t f
t
. Then, for any 1 y ,

( ) ( ) ( ) ( ) ( ) ( ) ( )
( )

>

\
|
+ + =
y
trivial non
y y
dT T g T f y g y f O dT
qT
T f f

I
I
...
'
2
1
2
log
2
1
, (30)

where
( ) 7 . 17 log 5 . 0 + = qT T g

(31)

If f is real-valued and decreasing on [ ) , y , the second addend ( ) (
|

\
|
+

etc y f O ....
2
1
of
(30) equals


( )
|

\
|

y
dT
T
T f
O
4
1
. (32)

To bound the contribution of the zeros beyond
0
T , we apply Lemma 1, and get that

12
( ) ( )
( )

>

+
|

\
|
+
0
0
..
2 ,
4
1
2
log
2
1
T
trivial non
T
dT
T
T
T f M

I
, (33)

where
( ) ( )
( ) 4 / 2
2
17 . 1 log
2
1
log 5876 . 1
H
e x H T f

|

\
|
+ + =

. (34)

Thence, the eq. (33) can be rewrite also as follows:

( ) [
( )

>

+

0
0
..
2 ,
T
trivial non
T
M

I
( )
( )
] dT
T
T
e x H
H
|

\
|
+
|

\
|
+ +

4
1
2
log
2
1
2
17 . 1 log
2
1
log 5876 . 1
4 / 2

.
(34b)

Since 200
0
T T , we know that ( ) ( ) ( ) T T T log 216 . 0 4 / 1 2 / log 2 / 1 + . In general,

( ) ( ) ( )

|
|

\
|
+
0
0
4
2
0
2
0
2
0 0
4 / 2
log
/ 2
log
4
log
T
T
T
e T e
T
T T dT e T T

, (35)
( ) ( ) ( )

|
|

\
|
+
0
0
4
0
2
0
0 0
4 /
log
/ 2
log
4
log
T
T
T
e T e
T
T T dT e T T

, (36)

|
|

\
|
+ =
0
0
4
0
0
4 /
/ 2 4
T
T
T
e
T
T dT e T

, (37)

for 200
0
T , the quantities on the right are at most ( )
4 / 2
0 0
0
log 281 . 1
T
e T T

,
( )
4 /
0 0
0
log 279 . 1
T
e T T

, and
4 /
0
0
278 . 1
T
e T

, respectively. Thus, (33) gives us that

( ) ( ) ( ) ( ) ( )( ) ( )
( )
( )

>

+
+
0
0
..
4 / 2
0 0
2
0 0 0 2 ,
. log log 224 . 0 log 311 . 0 log 216 . 0 281 . 1
T
trivial non
H T
e T H T x T T f T M

I


Thence, we obtain:

( ) ( )
( )

\
|
+

>

+
0
0
..
2 ,
4
1
2
log
2
1
T
trivial non
T
dT
T
T
T f M

I


( ) ( ) ( ) ( ) ( )( ) ( )
( )
( )

>

+
+
0
0
..
4 / 2
0 0
2
0 0 0 2 ,
. log log 224 . 0 log 311 . 0 log 216 . 0 281 . 1
T
trivial non
H T
e T H T x T T f T M

I
(38)

13
And we have also the following connection:

( ) ( )
( )

>

+
|

\
|
+
0
0
..
2 ,
4
1
2
log
2
1
T
trivial non
T
dT
T
T
T f M

|
|

\
|
+ =
0
0
4
0
0
4 /
/ 2 4
T
T
T
e
T
T dT e T

. (39)


We note that ( )
0
log 216 . 0 281 . 1 T for 24
0
= T is 3818989 , 0 , value that is very near to
381966 , 0 that correspond at a musical aurea frequency. As also 273239 , 1 / 4 is very
near to 273220 , 1 that is another musical aurea frequency. As we know that 24 is the
number concerning the modes corresponding to the physical vibrations of the bosonic
string by the following Ramanujan function:



( )
(
(

|
|

\
|
+
+
|
|

\
|
+

(
(
(

4
2 7 10
4
2 11 10
log
'
142
'
cosh
' cos
log 4
24
2
'
'
4
0
'
2
2
w t
itw e
dx e
x
txw
anti
w
w
t
w x

.

Furthermore, we have also the following connection:

( ) ( )
( )

>

+
|

\
|
+
0
0
..
2 ,
4
1
2
log
2
1
T
trivial non
T
dT
T
T
T f M

|
|

\
|
+ =

0
0
4
0
0
4 /
/ 2 4
T
T
T
e
T
T dT e T

( )
(
(

|
|

\
|
+
+
|
|

\
|
+

(
(
(

4
2 7 10
4
2 11 10
log
'
142
'
cosh
' cos
log 4
2
'
'
4
0
'
2
2
w t
itw e
dx e
x
txw
anti
w
w
t
w x

. (39b)


Now we see the total major-arcs contribution. We must bound from below


( ) ( )

|
|

\
|

+
|
|

\
|

=
N p N p
p p
C
3 2 0
1
1
1
1
1
1 . (40)

The only prime that we know does not divide N is 2. Thus, we use the bound

14

( )

>

|
|

\
|

2
2 0
3203236 . 1
1
1
1 2
p
p
C . (41)

The other main constant is

,
0
C , which we define with the following expression

( ) ( ) ( )

\
|
+ =

0 0
2 1 2 1 2 0 1 0 ,
0
dt dt t t
x
N
t t C

, (42)

and already started to estimate in (13):

( ) ( ) ( ) ( )
|
|

\
|
+ + =

x
N
x
N
d x N O d C
0 0
2 2
2
0
2
2
0 ,
/ 2 ' 71 . 2
0


(43)

provided that x N 2 . Recall that ( )( ) t
M


=
2
, where ( )
2 / 2
2
t
e t t

= . Therefore,

( ) ( )( ) ( )

= |

\
|
= =

x N x N x N
w
dw
d
w
w d d
/
0
/
0
1
4 / 1
/
0
2 2

( ) ( )

=
1
4 / 1 /
2
1 1
2
1
xw N
dw d w

. (44)

Now
( )

|
|

\
|
+ < + =
2 /
2 / 2 /
2 2 2
2
2
y
y t
y
y
e
y
y dt e ye d . (45)

Hence
( ) ( )

|
|

\
|
+ <
xw N
e d d
/ 2
2
2
1
2

(46)

and so, since 1
1
2
= ,

( ) ( )

|
|

\
|
+
|
|

\
|
+
x N
e e dw w d
/
0
1
4 / 1
2
2
1 2
2 2
1
2 2
1
2
1
2

. (47)

Let us now focus on the second integral in (43). Write / 2 /
1
c x N + = . Then the
integral equals

( ) ( ) ( ) ( )( ) ( ) ( ) ( )

+

= = +

/ 2
0 0
1
4 / 1 0
2
1 2
3
2
2
1
2
2
1
1 1 1
/
c
M
dvdw v c vw w du u c u d c
( )

|
|

\
|
+ =
|
|

\
|
+ =
1
4 / 1
2
1 1
3
2
1 1
2
2
3
2 4
9
2 48
49 1
2
2 2
2
3
1
c c dw c w c w w

. (48)

15
We note that also this expression can be related with the Ramanujan modular
equations concerning the modes corresponding to the physical vibrations of the
bosonic strings, i.e. 24, as follows:

( ) ( ) ( ) ( )( ) ( ) ( ) ( )

+

= = +

/ 2
0 0
1
4 / 1 0
2
1 2
3
2
2
1
2
2
1
1 1 1
/
c
M
dvdw v c vw w du u c u d c
( )
|
|

\
|
+ =
|
|

\
|
+ =

1
4 / 1
2
1 1 3
2
1 1
2
2 3
2 4
9
2 48
49 1
2
2 2
2
3
1
c c dw c w c w w

( )
(
(

|
|

\
|
+
+
|
|

\
|
+

(
(
(

4
2 7 10
4
2 11 10
log
'
142
'
cosh
' cos
log 4
2
'
'
4
0
'
2
2
w t
itw e
dx e
x
txw
anti
w
w
t
w x

. (48b)



It is thus best to choose ( ) 89762 . 0 2 / 4 / 9
1
= = c Looking up
2
2
0
' that is equal to
7375292 . 2 '
2
2
0
= , we obtain

( ) ( ) ( )
( )

|
|

\
|
+

x
N
d x N
0
3
2
3
2 2
2
0
0002 . 2
2 2
4 / 9
2 48
49 1
4188 . 7 / 2 ' 71 . 2

. (49)

We conclude that

3
2
2
2
2
0
2
2
0
1
,
0002 . 2 1
2
1
2
0

|
|

\
|
+

e C . (50)

Setting 49 = and using the fact that 8001288 . 0 8001287 . 0
2
0
, we obtain

) 000834 . 0 (
1 2
2
0
1
,
0

C . (51)

Gathering the terms from the following expressions

( )

2
12
10 13 . 1 , 0
x
E x S

, (52) x T
5
10 894 . 3 , (53)
x x x x M 61765 . 0 12233 . 0 11742 . 0 3779 . 0 + + , (54)




16

we see that the minor-arc total

( ) ( )
( )


d x S x S Z
r
Z R
r
+
=
0
, 8
0
\ /
2
, ,
M
(55)

is bounded by

( ) ( ) ( )
|
|

\
|
+ +
|
|

\
|
+ +

2
12 5
1
2
1
10 13 . 1 10 894 . 3 61765 . 0 , 0
0

x x
E x S T M
x
Z
r

2
77417 . 0
x
(56)

for 150000
0
= r ,
28
10 9 . 4 x , where we use yet again the fact that 2 /
1
= . This is
our total minor-arc bound.




Appendix A




In this paper, we have various decimal numbers contained in various equations
regarding the chapter On some equations concerning the major arcs for
Goldbachs problem. The values are the following:

0,00113
0,61765
0,6366
0,77417
0,8862
1,2158
1,2732
1,3203
1,5876
2,1550
2,82643
3,894
4,31
8,62



17
Now, we see from the following table, the subsequent ratios from 1,2158:


1,2158 0,8862 1,3719
1,2732

1,2158 1,0472
1,3203 1,2732 1,03699
1,5876


1,3203 1,2024
2,1550 1,5876 1,3573
2,82643 2,1550 1,3115
3,894 2,82643

1,3777
4,31 3,894 1,1068
8,62 4,31 2

The subsequent ratios, in the third column, are in close couples (of the same
colour, except the 2 final).


Those close to 1,37 are close to the fourth root of = 1,3311
Those close to 1,04 are close to the 2
5
root of = 1,03640
The values 1,2024 and 1,1068 are close to the 2
3
root of = 1,1537, that is about
the mean value: (1,2024 + 1,1068) /2 = 1,1734.
The value 2 is 3,14 /1,57 about the mean between the square root of 3,14
(1,7724) and the fourth root of 3,14 (1,3313). Indeed, we have:

(1,7724+1,3313)/2 = 1,5518

So it seems all linked to the roots of 3,14.

The arithmetic mean of the four numbers close to 1,3 is
4
1,3546 1.3311=3,14

The mean of the numbers 1,0472 and 1,03699 = 1,042 is close to the 2
5
root of
3,14. The total arithmetic mean of all the numbers of the series is, instead, 2,67
e =2,718, so it may be involved also the Euler number e.

Now we see a table with the subsequent roots of 3,14



18
n
2^n
3,14
Subsequent ratios
between the Numbers of
the series
1
3,14
-
2
1,77
-
4
1,33
1,3719, 1,3573, 1,3777
8
1,15 mean
1,176
1,2024, 1,1068
16
1,07
-
32
1,0364 mean
1,0420
1,0472, 1,03699








See also with
2,718

n
2^n
2,718
Subsequent ratios
between the Numbers of
the series
1
-
-
2
1,64
-
4
1,28
1,3

(1,28 +1,13)/2 =
1,205
1,2024
8
1,13
1,1068
16
1,06
-
32
1,03
1,0369, 1,0472


We see with 1,618

n
2^n
1,618
Subsequent ratios
between the Numbers of
the series
1
-
-
2
1,27

4
1,12
1,1068

1,06

8
1,03
1,0369, 1,0472
19


The best results seem to be those with the roots of 3,14 and 2,718, a little less,
instead, with the roots of 1,618.


We also note that all the numbers of the series, multiplied by 10, are close to the
Fibonaccis numbers or to their mean between two consecutive Fibonaccis
numbers .






Numbers of the series Multiplied by 10
(considered only the first
decimal digit of the result)

Fibonaccis numbers or
their arithmetic mean
0,00113 0,0 0
0,61765 6,1 5
0,6366 6,3 5
0,77417

7,7 8
0,8862 8,8 8
1,2158 12,1 13
1,2732 12,7 13
1,3203

13,2 13
1,5876

15,8 17 mean between 13- 21
2,1550 21,5 21
2,82643 28,2 27,5 mean betw. 21 - 34
3,894 38,9 34
4,31 43,1 44,5 mean betw. 34 - 55
8,62 86,2 89







20
But also the consecutive ratios between the smaller numbers reflect those between
the larger numbers, except for the initial anomaly 546,59, in any way connected to
1,21:



0,00113

0,61765 0,61765/ 0,00113 = 546,59 , con 1,21 = 32 root di 546

0,6366 0,6366 /0,61765 = 1,030 1,03699

0,77417 0,77417/0,6366 = 1,21 1,2024

0,8862 0,8862 / 0,77417 = 1,14 1,1546 mean (1,2024 + 1,1068)/2






References


a) On the Goldbachs Conjecture


1a) I numeri primoriali p# alla base della dimostrazione definitiva
della congettura di Goldbach (nuove evidenze numeriche)
Francesco Di Noto, Michele Nardelli

2a) CONCETTO MATEMATICO DI ABBONDANZA E
IL RELATIVO GRAFICO PER LA RH1 - Francesco Di
Noto, Michele Nardelli (Gruppo B. Riemann)

3a) NOVITA SULLA CONGETTURA DEBOLE DI GOLDBACH
Gruppo B.Riemann - Francesco Di Noto,Michele Nardelli




21



4a) TEORIA COMPUTAZIONALE DEI NUMERI E
IL PROBLEMA P = NP: i tempi di calcolo per la fattorizzazione
come sottoproblema di P = NP, in particolare per i numeri RSA
con la congettura forte p primo minimo = 2n/3 67% di n =
N Gruppo B. Riemann - Francesco Di Noto, Michele Nardelli

5a) ESTENNSIONI DELLE CONGETTURE, FORTE E DEBOLE,
DI GOLDBACH (a k = primi , con N e k entrambi pari o dispari)
Gruppo B. Riemann* - Francesco Di Noto, Michele Nardelli

6a) IL TEOREMA FONDAMENTALE DELLA
FATTORIZZAZIONE Gruppo B.Riemann* - Francesco Di Noto,
Michele Nardelli

7a) FATTORIZZAZIONE VELOCE COME PROBLEMA NP
(NON POLINOMIALE) Gruppo B.Riemann* - Francesco Di Noto,
Michele Nardelli

8a) PROBLEMI NP: LE APPROSSIMAZIONI DELLA NATURA
E QUELLE DEI MATEMATICI - Gruppo B. Riemann

9a) Alcuni metodi noti di fattorizzazione veloce (crivello quadratico,
radici quadrate di 1 mod N, algoritmo di fattorizzazione di
Fermat, di Pollard, congettura debole e forte e ipotesi percentuale
per i numeri RSA con un attendibile rapporto q/p 2)
Francesco Di Noto, Michele Nardelli

10a) Matematica con i numeri primi e le forme 6k + 1
Francesco Di Noto, Michele Nardelli, Pier Francesco Roggero

b) On the hypothesis RH equivalent

1b) IPOTESI SULLA VERITA DELLE CONGETTURE SUI
NUMERI PRIMI CON GRAFICI COMET E CONTRO ESEMPI
NULLI (Legendre, Goldbach, Riemann...)
Michele Nardelli ,Francesco Di Noto

22
2b) La funzione di Landau come ipotesi RH equivalente II
(La nostra proposta di dimostrazione empirica con tabelle e
grafico comet; ulteriori connessioni con le partizioni di numeri)
Francesco Di Noto e Michele Nardelli


3b) Ipotesi sulle funzioni zeta per altre serie numeriche simili alla
serie dei numeri primi (I parenti poveri dei numeri primi : numeri
fortunati, numeri di Polignac, numeri di Cramer ecc. Analogie con i
numeri primi, relative funzioni zeta con probabile parte reale anche per
essi). Francesco Di Noto, Michele Nardelli

4b) Congettura di Levy come ipotesi RH equivalente e relativo
grafico comet Gruppo B. Riemann* - Francesco Di Noto, Michele
Nardelli

5b) Ipotesi RH equivalenti, le funzioni (n), (n), (n) e le forme
numeriche 6k + 1 (Accenno finale alla relazione Fattorizzazione
veloce RH) Gruppo B. Riemann* - Francesco Di Noto, Michele
Nardelli, Pier Francesco Roggero


c) On the factorization and the RSA numbers


1c) Connessione tra ipotesi RH e crittografia RSA: un mito da
sfatare - Francesco Di Noto, Michele Nardelli

2c) Ipotesi su p < n come possibile percentuale di n = N per una
fattorizzazione pi veloce - Francesco Di Noto, Michele Nardelli

3c) I numeri semiprimi e i numeri RSA come loro sottoinsieme
Francesco Di Noto, Michele Nardelli

4c) I NUMERI RSA : UNA PICCOLA STATISTICA SUI
RAPPORTI r = q/p E RELATIVE OSSERVAZIONI
Gruppo B. Riemann- Francesco Di Noto , Michele Nardelli



23
5c) INFINITE ESTENSIONI DEI NUMERI PRIMI DI SOPHIE
GERMAIN (connessioni con test di primalit e fattorizzazione
veloce) Gruppo B. Riemann - Michele Nardelli, Francesco Di Noto

6c) PROPOSTA DI FATTORIZZARE IL NUMERO RSA- 2048
cercando p tra il 70 % e il 71% della sua radice quadrata,
corrispondente ad un rapporto r = q/p 2)
Gruppo B. Riemann - Nardelli Michele, Francesco Di Noto


d) Paper of Helfgott

1d) H. A. Helfgott Major Arcs For Goldbach Problem arXiv:1305.2897v2
[math.NT] 14.06.2013