![]() |
|
|
#1 |
|
"Phil"
Sep 2002
Tracktown, U.S.A.
3×373 Posts |
I see that the 35th Mersenne prime, the very first discovery of GIMPS, is about to be pushed off the list of the 100 largest known primes:
http://primes.utm.edu/primes/search.php?Number=100 This was the first discovery made on a PC, while the previous few Mersennes had all been discovered on supercomputers. Just for fun, if you were searching for Mersenne primes from scratch, how long would it take for a single fast quad processor system of today to search from the beginning up to M1398269? I'm guessing around 1 year, assuming that you could eliminate around half of the candidates by factoring, but I would be interested if anyone has a better estimate. |
|
|
|
|
|
#2 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
I don't know, I'll have to try and figure that out later. I remember verifying all found up though the 70's or 80's (and I mean all, not factored) in a couple hours at the most on a single core of a 2.5 GHz Athlon (or was I still using my 1.6 GHz Athlon? I can't remember).
|
|
|
|
|
|
#3 | |
|
"Lucan"
Dec 2006
England
647410 Posts |
Quote:
of finding one, using a tiny fraction of the time for an LLtest. About 4 years ago I wrote my own programs for a K6 (using school multiplication) and found all the Mersenne primes up to and including Colquitt and Welsh's one (notable for showing up Slowinsky's gaps) David |
|
|
|
|
|
|
#4 |
|
∂2ω=0
Sep 2002
República de California
19×613 Posts |
We need to take Bill Gates' advice and organize a project to factor some of these larger-prime-wannabes, in order to boost M35's ranking. "All your non-Mersenne primes are belong to us" [AYNMPABTU for short] or something like that.
Any volunteers? |
|
|
|
|
|
#5 | |
|
Feb 2007
24×33 Posts |
Quote:
|
|
|
|
|
|
|
#6 |
|
∂2ω=0
Sep 2002
República de California
19·613 Posts |
Easy - just keep crunching on those, um, "subprime factors", until you break them into smaller ones. [Requires Vista© OS installation and MSFactorPrimesTM Professional Premium Edition© license upgrade].
Last fiddled with by ewmayer on 2008-04-30 at 16:19 |
|
|
|
|
|
#7 |
|
"Phil"
Sep 2002
Tracktown, U.S.A.
21378 Posts |
Looks like it just fell to #101:
http://primes.utm.edu/primes/search.php?Number=101 We'd better get to work on that factoring project. |
|
|
|
|
|
#8 | |
|
Feb 2007
24·33 Posts |
Quote:
a prime could be classified according to the number of times it can be broken into "subprime factors"... or in analogy to Erdös-Selfridge classification, the Gates classification: G(p) = 1+max{ G(s); s in subprime factors of the prime p }, and G(p)=0 if p has no subprime factors (it is conjectured that such p exist, so we add this clause "just in case", to ensure G(p) is always well-defined. ;-) I fear there will never be a linux port of the relevant code... |
|
|
|
|
|
|
#9 | |
|
1976 Toyota Corona years forever!
"Wayne"
Nov 2006
Saskatchewan, Canada
10010010101112 Posts |
Quote:
|
|
|
|
|
|
|
#10 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
22·32·173 Posts |
Hehe, look who got caught. Um, yeah, we need to factor those pesky top primes, so as to drop them drop the list. I'll start by suggesting they will all have at least one factor on common.
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| (M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED! | dabaichi | News | 571 | 2020-10-26 11:02 |
| Largest known prime | Unregistered | Information & Answers | 24 | 2008-12-13 08:13 |
| Largest known prime not Mersenne? | Orgasmic Troll | Lounge | 5 | 2005-12-23 22:00 |
| Largest 64 bit prime? | amcfarlane | Math | 6 | 2004-12-26 23:15 |
| need Pentium 4s for 5th largest prime search (largest proth) | wfgarnett3 | Lounge | 7 | 2002-11-25 06:34 |