Hello




32  = 9,    4 = 16,   5 = 25


          9 + 16 = 25

        (5 - 4)*(5 + 4) = 1*9 = 25 - 16 = 9

       (5 - 3)*(5 + 3) = 2*8 - 25  - 9 = 16

  32  = 9 < 11 < 13 < 16 = 4

 Hence the open interval ((32, 4)) = ((9, 16)) contains two prime numbers 11 and 13.



  42  = 16 < 17 < 19 < 23 < 25 = 5

Hence the open interval ((42, 5)) = ((16, 25)) contains three prime numbers 17, 19, and 23.


  52  = 25 < 29 < 31 < 37 < 41 < 43 < 47 < 49 = 7

Hence the open interval ((52, 7)) = ((25, 49)) contains six prime numbers 29, 31, 37, 41, 43, and 47.


Note that 62  = 36.


  52  = 25 < 29 < 31 <  36 = 6 < 37 < 41 < 43 < 47 < 49 = 7


Let us denote  the set { x | a < x < b and x is a real nmber } by (( a, b )) which is called

an open interval with end points a and b.


Hence the open interval (( 52, 6)) = (( 25,  36 )) contains two prime numbers 29 and 31.

And the open interval (( 62, 7)) = (( 36,  49 )) contains four prime numbers 37, 41, 43, and 47.


Remember the Legendre's conjecture [1808]:

For each positive integer n = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...

the open interval (( n2,  (n+1))) contains as least one prime number.


It is very easy to check that the open interval (( 12,  2)) = (( 1, 4 )) contains two prime numbers 2 and 3.


The following is my modified conjecture:

For each positive integer n = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...

the open interval (( n2,  (n + 1))) = (( n*n,  (n+1)*(n + 1) )) contains as least two prime numbers.


How can prove that ?

Answer:   ??????????????????