RE: [PrimeNumbers] Find the next prime
- If 2^n+1 is prime, n must be a power of 2 (2^0, 2^1, ...) and only the five are known.
So for 2^((p-1)/2) + 1 to be prime, p must also be a Fermat prime.
From: firstname.lastname@example.org [mailto:email@example.com] On Behalf Of Sebastian Martin Ruiz
Sent: Tuesday, September 30, 2008 11:41 AM
Subject: [PrimeNumbers] Find the next prime
2^((pn-1)/2) + 1 is prime for n=2,3,7 (the primes are 3, 5, 257)
Find the next. (Are all Fermat Primes?)
Sebastián Martin Ruiz
[Non-text portions of this message have been removed]
Unsubscribe by an email to: firstname.lastname@example.org
The Prime Pages : http://www.primepages.org/
Yahoo! Groups Links
- --- In email@example.com, "David Broadhurst" <d.broadhurst@...> wrote:
>Congrats! That size of 15537 digits is nearly 25% bigger than the next 12 on that "Top-20" Lehmer Primitive Part list, which all date from more than 3 years ago. So, a massive improvement!
> --- In firstname.lastname@example.org,
> "David Broadhurst" <d.broadhurst@> wrote:
> > The Society for Suppression of Square Roots hopes to
> > be able to announce, within a few days, the proof of
> > a unique Lehmer prime with more than 15000 digits
> > (wenn die Frau Göttin probiert hat).
> > If proven, it will also become the largest known prime at
> > http://primes.utm.edu/top20/page.php?id=68
> Consummatus est in brevi explevit tempora multa [Wisdom:4:13]