Beruflich Dokumente
Kultur Dokumente
Ing. Pier Francesco Roggero, Dott. Michele Nardelli, P.A. Francesco Di Noto
Abstract
In this paper, we have described the proof of Andricas Conjecture and Minimum Gap between two
consecutive primes, plus other famous conjectures.
Versione 1.0
21/2/2013
Pagina 2 di 22
Index:
2
Versione 1.0
21/2/2013
Pagina 3 di 22
Andrica's conjecture is a conjecture regarding the gaps between two consecutive prime numbers.
( pn +1 pn ) <1
holds for all , where pn is the nth prime number. If (pn+1 - pn) denotes the nth prime gap, then
Andrica's conjecture can also be rewritten as
pn+1 - pn = ( p n +1 pn )( p n +1 + pn )
( pn +1 pn < 1 )
we must have at fortiori:
pn+1 - pn < ( pn +1 + pn )
This can be seen very simply, if we consider for example the two consecutive primes 127 and 113:
3
Versione 1.0
21/2/2013
Pagina 4 di 22
( pn +1 pn < 1 )
and then
14 = 21,89*0,639
pn+1 - pn < ( pn +1 + pn )
[We note that 0,639 is very near to the aurea section, i.e. 0,61803398 and we note that:
Its interesting to observe that 13 and 21 are Fibonaccis numbers and that, also here, there is a number
very near to the aurea section, number that is very important in various arguments of the string theory]
We see then to prove this inequality, so that it automatically shows also the other of Andrica.
If we assume that the maximum distance between two consecutive prime numbers with Bertrand's
postulate, which is a most extreme case, is then
pn+1 = 2 pn
replacing
pn < ( 2 pn + pn )
pn < pn ( 2 +1 )
pn < ( 2 +1 )
pn < ( 2 +1 )
2
4
Versione 1.0
21/2/2013
Pagina 5 di 22
0 pn <2 2 + 3 = 5,828
3
[We note that the value 5,828 is very near to the value 5,854 that is given by (1,61803398..) +
1,61803398 = 5,8541, thence to a multiple of the aurea ratio]
It is clear that if we take an extreme case as pn+1 = 2 pn the solution of pn will be very limited.
Already with pn = 6 does not work and the Andricas conjecture would not be valid.
For example:
11
pn+1 = pn
10
replacing
1 11
pn < pn + pn
10 10
1 11
pn < pn + 1
10 10
11
pn < 10 + 1
10
2
2 11
pn < 10 + 1
10
[Also here, we note that the mean between [(1,61803398)13 + (1,61803398)12] / 2 421,5. This value
is very near to the result 419,76. Its interesting to observe the relationship to some power of the aurea
ratio (5 + 1) / 2 = 1,61803398...]
5
Versione 1.0
21/2/2013
Pagina 6 di 22
In general we assume:
replacing
(k-1) pn < ( kp n + pn )
(k-1) pn < pn ( k +1 )
pn <
( k +1 )
(k 1)
(
k +1
pn <
) 2
(k 1)
(2)
k +1
0 pn <
( ) 2
(k 1)
pn+1 = pn + pn
then since
pn+1 = k pn
pn + pn pn
k= = 1+
pn pn
replacing in (2)
6
Versione 1.0
21/2/2013
Pagina 7 di 22
( k +1 ) 2
4
pn 1
(k-1)2 = ( 1 + -1)2 =
pn pn
So
(
k +1
0 pn <
) 4 p
2
n
(k 1)
pn+1 = pn + 2 pn + 1
pn+1 = pn + pn
that is a smaller amount and this shows that the Andricas conjecture is valid.
But until then we can narrow it down to the minimum gap between two successive prime numbers that
there is always at least one prime number?
7
Versione 1.0
21/2/2013
Pagina 8 di 22
pn+1 = pn + a pn
11 = 7 + a 7
4
a=
7
then we have
4
pn+1 = pn + pn
7
4
pn < x pn + pn
7
4
n< x n + n
7
8
Versione 1.0
21/2/2013
Pagina 9 di 22
4
n< p n + n
7
or
n < p n + 1,5118578920369089088580661449367.. n
pn+1 - pn = ( p n +1 pn )( p n +1 + pn )
4
pn+1 - pn = pn
7
( p n +1 pn )( p n +1 + pn )= 4
7
pn
4
pn
pn +1 pn = 7 << 1
( pn +1 + p n )
9
Versione 1.0
21/2/2013
Pagina 10 di 22
TAB. 1
10
Versione 1.0
21/2/2013
Pagina 11 di 22
11
Versione 1.0
21/2/2013
Pagina 12 di 22
The first two conjectures are valid because the interval found before is the absolute minimum
4
n< p n + n
7
In fact:
Legendre's conjecture, states that there is a prime number between n2 and (n+1)2 for every n.
n2 < p (n+1)2
This conjecture is shown also very easily with Andricas conjecture now that is true.
In fact
( pn +1 pn ) <1
replacing
( (n + 1) 2
n2 ) <1
n + 1 n < 1
it gives
1 < 1 but we can take it valid if we assume also the sign of equality
11
12
Versione 1.0
21/2/2013
Pagina 13 di 22
Oppermann's conjecture states that, for any integer x>1, there is at least one prime between
x(x1) < p x2
x2 < p x(x+1)
This conjecture is shown also very easily with Andricas conjecture now that is true.
In fact
( pn +1 pn ) <1
replacing
( x( x + 1) x2 ) <1
( x ( x + 1) ) < (x + 1)2
x>1
(x 2
x( x 1) ) <1
x -1 < x ( x 1)
x>1
13
Versione 1.0
21/2/2013
Pagina 14 di 22
Cramr's conjecture, is an estimate for the size of gaps between consecutive prime numbers:
intuitively, that gaps between consecutive primes are always small, and the conjecture quantifies
asymptotically just how small they can be. It states that
pn+1 = pn + (ln(p n ) )
2
or equivalently
n < p n + (ln(n) )
2
4
n< p n + n
7
n < p n + (ln(n) )
2
14
Versione 1.0
21/2/2013
Pagina 15 di 22
TAB. 2:
Prime number
x + 4radq(x/7) x+(ln(x))^2
x
2 4,138089935 2,480453014
3 5,618614683 4,206948961
5 8,380617019 7,590290394
7 11,000000000 10,78656631
11 16,014265364 16,74990174
13 18,451081151 19,57896521
17 23,233549780 25,02709785
19 25,590035768 27,6697209
23 30,250615737 32,83132398
29 37,141603914 40,33868121
31 39,417668493 42,79226812
37 46,196272537 50,03872817
41 50,680613912 54,79061749
43 52,913915185 57,14662631
47 57,364775513 61,82363655
53 64,006491591 68,76321788
59 70,612800819 75,62631161
61 72,807987611 77,89928393
67 79,375090187 84,67944002
71 83,739141034 89,17043973
73 85,917319492 91,40804222
79 92,437686876 98,09207454
83 96,773680907 102,5261523
89 103,262838828 109,1478565
97 111,890073395 117,9279805
101 116,193983772 122,2993374
103 118,343681808 124,4807128
107 122,638779638 128,8353293
109 124,784259791 131,008745
113 129,071269840 135,3481956
127 144,037773161 150,4661485
131 148,304004491 154,7675489
137 154,695842934 161,2062123
139 156,824541669 163,349033
149 167,454577442 174,0394786
15
Versione 1.0
21/2/2013
Pagina 16 di 22
16
Versione 1.0
21/2/2013
Pagina 17 di 22
n = n + (ln(n) )
4 2
n+
7
n = 7,811. and
n = 990,87.
for
2 < n 7,811.
and for
4
n 990,87 prevails the function n + n
7
for
7,811. < n < 990,87 prevails the function n + (ln(n) )
2
Then it follows that the interval of Cramer is not guaranteed, in fact this Cramr's conjecture is
probably false.
[However, its interesting to observe that 7,811 and 990,87 are values that are very near to the
following values: (1,618...)14 + (1,618...)10 + (1,618...)6 + (1,618)4 = 990,7886; (1,618...)4 + 1,618...
0,618... = 7,8541. Thence, also here mathematical connections with some powers of the aurea ratio!]
with this trick might be valid but we dont put my hand on fire!
CVD
17
Versione 1.0
21/2/2013
Pagina 18 di 22
Brocard's conjecture states that there are at least four prime numbers between (pn)2 and (pn+1)2, for n
> 1, where pn is the nth prime number.
Since Legendres conjecture is true, there is a prime between consecutive integer squares directly
implies that there are at least two primes between prime squares for pn 3 since pn+1 - pn 2.
But also there is a prime between integer squares n and n-1, that implies that there are other at least
two primes.
and
4
n< p n + n
7
or
18
Versione 1.0
21/2/2013
Pagina 19 di 22
n < p n + 1,5118578920369089088580661449367..
This is the result of the proof of the Andricas Conjecture! Now, we can predict with certainty, for
every value of n, what is the minimum gap when there is at least one prime number.
Thence, we obtain also the proofs of Legendres, Oppermanns and Cramers Conjectures and the
Cramers conjecture is more probabilistic.
4
The number or 1,5118578920369089088580661449367.. is also in the apparent magnitude,
7
where the 5nth root of 100 is (100)1/5 = 2,5118864315095801110850320677993..
n < p n +(phi) n
where (phi) = 1,6180339887498948482045868343656 is the famous number of the aurea ratio. In this
case, there is an harmony also between the prime numbers. However, the interval is very narrow.
For example, we take as numbers: 8, 24, 496, that are very important and fundamental in string theory.
With gap 1,618 we have:
Its clear that for small value of n, the two formulas coincide, so as also the primes that there are!
However, the aurea ratio is only an approximation for excess of the gap.
We put it for his beauty and because the gap is always good, also that superabundant, but, perhaps, the
nature takes a certain security margin.
19
Versione 1.0
21/2/2013
Pagina 20 di 22
More interesting is the fact of the apparent magnitude, where (100)1/5 -1 is about equal to
1,5118578920369089088580661449367, the first number slightly larger.
This number means that a star of first magnitude is found to be 2.512 times brighter than a star of
second magnitude. The fifth root of 100 (2.512) is known as Pogson ratio.
Pogson formula:
m = -2,512 LOG Fx + C
where Fx is the observed flux in the x-band, and C is a constant that depends from the units used. We
note that more an object is weaker, its magnitude is high, contrary to common sense. Furthermore, we
note that the scale is logarithmic. The logarithmic nature of the scale is due to the fact that the human
eye itself has a logarithmic response.
With regard the numbers 2,512 and 1,51185789 we note that these values are very near to
2,51026251 and 1,51083506 that are values concerning the new universal music system based on
fractional powers of Phi and Pigreco.
With regard the number 8 and 24, utilized in the examples above mentioned, we note that the number 8
is connected with the modes that correspond to the physical vibrations of a superstring by the
following Ramanujan function:
cos txw'
x 2 w '
0 cosh x e dx 142
4 anti log t 2 2
t w'
w' (itw')
w'
4
1 e
8= . (1)
3 10 + 11 2 10 + 7 2
log +
4 4
Furthermore, with regard the number 24, it is related to the physical vibrations of the bosonic strings
by the following Ramanujan function:
20
Versione 1.0
21/2/2013
Pagina 21 di 22
cos txw'
x 2 w '
0 cosh x e dx 142
4 anti log t 2 2
t w'
e 4 w' (itw')
w'
24 = . (2)
10 + 11 2 10 + 7 2
log +
4 4
Palumbo (2001) ha proposed a simple model of the birth and of the evolution of the Universe.
Palumbo and Nardelli (2005) have compared this model with the theory of the strings, and translated it
in terms of the latter obtaining:
g g Tr (G G ) f ( ) g =
R 1 1
d 26 x g
16G 8 2
( )
1 ~ 2 2
2
= 2 d 10 x( G ) e 2 R + 4 H 3 102 Tr F2 ,
1 1/ 2
(3)
0
2 10 2 g10
A general relationship that links bosonic and fermionic strings acting in all natural systems.
It is well-known that the series of Fibonaccis numbers exhibits a fractal character, where the forms
5 1
repeat their similarity starting from the reduction factor 1 / = 0,618033 = (Peitgen et al.
2
1986). Such a factor appears also in the famous fractal Ramanujan identity (Hardy 1927):
5 1 5
0,618033 = 1 / = = R(q) + , (4)
2 3+ 5 1 q f 5 (t ) dt
1+
2
exp
5
0 f ( t 1 / 5 ) t 4 / 5
3 5 ,
and = 2 R(q) + (5)
20 3+ 5 1 q f (t ) dt
5
1+ exp
4/5
5 0 f (t ) t
1/ 5
2
5 +1
where = .
2
Furthermore, we remember that arises also from the following identities (Ramanujans paper:
Modular equations and approximations to Quarterly Journal of Mathematics, 45 (1914), 350-372.):
21
Versione 1.0
21/2/2013
Pagina 22 di 22
=
12
log
( )(
2 + 5 3 + 13 )
, (5a) and =
24
log
10 + 11 2
+
10 + 7 2
. (5b)
130 2 142 4 4
142
24 = , (5c)
10 + 11 2 10 + 7 2
log +
4 4
22