06/11/2010, 03:26 AM

Just stumbled with this:

"Bertrand's postulate implies that there are infinitely many numbers a for which floor(2^a), floor(2^2^a), floor(2^2^2^a), ... are all prime. The smallest of these is a = 1.25164 75977 90463 01759 44320 53623... and generates the Bertrand primes: 2, 5, 37, 137438953481, .... The next Bertrand prime has 41,373,247,571 digits. [Caldwell]"

Source: http://primes.utm.edu/curios/page.php/137438953481.html

deep links around?

"Bertrand's postulate implies that there are infinitely many numbers a for which floor(2^a), floor(2^2^a), floor(2^2^2^a), ... are all prime. The smallest of these is a = 1.25164 75977 90463 01759 44320 53623... and generates the Bertrand primes: 2, 5, 37, 137438953481, .... The next Bertrand prime has 41,373,247,571 digits. [Caldwell]"

Source: http://primes.utm.edu/curios/page.php/137438953481.html

deep links around?