![]() |
![]() |
#1 |
Dec 2003
3 Posts |
![]()
The result of 2, raised to the power of a prime number, less 1 equals another prime number.
There is always one larger. |
![]() |
![]() |
#2 |
Aug 2002
22·5·13 Posts |
![]()
Not absolutely correct. The vast majority of them do not generate prime numbers. That is why we have found only 40 of them so far, even though we have been at it for a fairly long time....
PM |
![]() |
![]() |
#3 |
Aug 2002
2×7×13×47 Posts |
![]()
11 is prime...
211-1 = 2047 2047 = 23 × 89 |
![]() |
![]() |
#4 |
Dec 2003
3 Posts |
![]()
http://www.utm.edu/research/primes/l...mall/10000.txt
there are over 10,000 primes. pi(x) = the number of primes less than or equal to x. There are only 39 known Mersenne primes ... http://www.pen.k12.va.us/Div/Winches...cts/prime.html However, even that appears to follow the aforemetioned formula. |
![]() |
![]() |
#5 |
Dec 2003
3 Posts |
![]()
true.
|
![]() |
![]() |
#6 |
Aug 2002
22×5×13 Posts |
![]()
The Mersenne primes follow the 2P-1 where P is a prime.
The GIMPS project is more or less systematically testing primes to see if they will generate a new Mersenne prime. PM |
![]() |
![]() |
#7 |
4,493 Posts |
![]()
Thanks.
|
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Number of distinct prime factors of a Double Mersenne number | aketilander | Operazione Doppi Mersennes | 1 | 2012-11-09 21:16 |
prime formula | meeztamike | Miscellaneous Math | 11 | 2010-07-18 04:13 |
A prime finding formula. what do you think? | cipher | Math | 15 | 2009-06-08 05:19 |
formula for largest prime found | debasish | Miscellaneous Math | 20 | 2007-09-28 03:48 |
Formula to calculate number of potential factors? | Fusion_power | Miscellaneous Math | 13 | 2005-10-24 17:58 |