![]() |
|
|
#67 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
641910 Posts |
How did I get 94 months?
Well, the calculation takes 960 months now, and we want a point at which it would take 26 months, so speed needs to double log_2(960/26) = 5.2 times, and each doubling takes 18 months. |
|
|
|
|
|
#68 | |
|
Oct 2008
n00bville
10110110002 Posts |
Quote:
But you can imagine if you upgrade your hardware to the coming quantum cpus it will get faster ;). |
|
|
|
|
|
|
#69 | |
|
Oct 2008
n00bville
23×7×13 Posts |
Quote:
(have found it:tron 332199223 F 2008-10-15 22:40 1.7 8183174245366243263319 ... but its nothing special??) 100,000,007 wasn't prime - they have found a factor (have read it in the forum). Last fiddled with by joblack on 2008-12-30 at 23:14 |
|
|
|
|
|
|
#70 |
|
Dec 2003
Hopefully Near M48
2×3×293 Posts |
|
|
|
|
|
|
#71 | |
|
Oct 2008
n00bville
72810 Posts |
Quote:
|
|
|
|
|
|
|
#72 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17·251 Posts |
When someone says M100,000,007 they're referring to 2^100,000,007-1, not the 100,000,007th mersenne prime or a 100,000,007 digit mersenne candidate. Generally, M(a large number e.g. >100) refers to 2^(a large number)-1, M(a small number e.g. <50) refers to that (a small number)th mersenne prime, while things like 100M+ can be confusing due to referring to 2^(n>100,000,000)-1 or 10^(n>100,000,000) i.e. the mersenne number of the number of decimal digits.
Last fiddled with by Mini-Geek on 2008-12-31 at 03:02 |
|
|
|
|
|
#73 | |
|
Oct 2008
n00bville
23×7×13 Posts |
Quote:
tron 332199223 F 2008-10-15 22:40 1.7 8183174245366243263319 But it´s over two months ago (and I didn´t think it´s a big deal??) ... or what did dominicanpapi82 mean by "At least one 100M mersenne has been finished by SOMEONE, right?" Last fiddled with by joblack on 2008-12-31 at 03:36 |
|
|
|
|
|
|
#74 | |
|
"James Heinrich"
May 2004
ex-Northern Ontario
3,407 Posts |
Quote:
Finding a factor is a good way to consider a Mersenne number "done", since that proves it's not prime. But this thread is about when will the first Lucas-Lehmer test be completed on a number that large. This test would take anywhere from 2-5+ years on current good computers -- that's the part that's a big deal. |
|
|
|
|
|
|
#75 |
|
Oct 2008
California
22·59 Posts |
(poll expires tomorrow)
|
|
|
|
|
|
#76 | |
|
Dec 2003
Hopefully Near M48
2·3·293 Posts |
Quote:
|
|
|
|
|
|
|
#77 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
183416 Posts |
Perhaps we could have some form of forum convention.
M[i]number[/i] refers to: number = exponent Mnumber refers to: number = numberth mersenne prime eg. M43112609 = M46 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| 332.2M - 333.9M (aka 100M digit range) | Uncwilly | LMH > 100M | 684 | 2018-07-01 10:52 |
| overclocking an i7-2600 to finish an 100M exponent in less than a year :) | emily | Hardware | 4 | 2013-02-28 20:11 |
| I want a 100M digit Mersenne that.... | JuanTutors | PrimeNet | 8 | 2012-12-06 13:47 |
| 100M-digit n/k pairs | __HRB__ | Riesel Prime Search | 0 | 2010-05-22 01:17 |
| 100M digit prime | Unregistered | Information & Answers | 10 | 2010-03-24 20:16 |