![]() |
![]() |
#1 |
Mar 2016
6448 Posts |
![]()
A peaceful night for you,
Is there a relationship between the primes of the form 2^p-1 and (2^p+1)/3. Or in other words, there are two quadratic polynomials: f(n)=2n^2-1 =(sqrt (2)n-1)*(sqrt (2)n+1) and f(m)=2m^2+1=(sqrt (2)m-i)*(sqrt (2)m+i) (i is the complex part) Both could be used for primesieving by a described algorithm: http://devalco.de/quadr_Sieb_2x%5E2-1.php http://devalco.de/quadr_Sieb_2x%5E2+1.php Is there a conection between these two prime generators what the new Mersenne conjecture suggest ? Greetings from the primes ![]() ![]() ![]() Bernhard |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
New Mersenne Conjecture | ATH | Math | 28 | 2021-08-05 05:50 |
Mersenne Conjecture | sascha77 | Math | 15 | 2010-05-08 00:33 |
conjecture about mersenne numbers | sascha77 | Math | 2 | 2010-01-07 08:06 |
The New Mersenne Conjecture | Dougy | Math | 32 | 2008-10-26 07:17 |
New Mersenne and Cunningham conjecture | olivier_latinne | Math | 54 | 2008-03-12 10:04 |