![]() |
|
|
#12 |
|
Nov 2008
2×33×43 Posts |
|
|
|
|
|
|
#13 |
|
Oct 2008
n00bville
2D816 Posts |
|
|
|
|
|
|
#14 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
224068 Posts |
Quote:
Short answer: this is how much work was so far done on this particular bitlevel. (in your case checking all qualified k, so that 2kp+1 is in range 2^68 to 2^69). Note that every next bitlevel is roughly 2 times more work that the previous one. Longer answer: there's a caveat in this process. Because of how the code could be best optimized, there are 16 passes, from 2^68 to 2^69 upward using different 'classes' of primes (based on residue mod 120); as you know, the possible factors must be 1 or 7 (mod 8), they can also be 1 or 2 (mod 3) and 1, 2, 3, or 4 (mod 5). So if a mersenne composite has two factors in range from 2^68 to 2^69, there's an equal chance that a larger factor will be reported first or second! ____ Ah, while I was typing... now I've looked at that other thread and realized that my typing was only an excercise for my arthritic fingers. So, yes! Let's be facetiuos.
|
|
|
|
|
|
|
#15 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·7·677 Posts |
Quote:
1. you signed up your computer for a job 2. you don't have to know what this job is 3. your computer received a work unit - "paint this part of the wall which is called M58703971 to 2^69, whatever that means". 4. when you look at the screen, this job is x% complete 5. when x% will reach 100%, you've done well, and your computer will receive more work 6. if you shut down your computer (or kill the program or run out of batteries, etc) before x% reaches 100% - then you will have thrown your work away. Someone else will later paint this part of the wall. Or it could be you, if/when you restart the program later.* (ok, end of coffee break)
Last fiddled with by Batalov on 2009-06-17 at 19:42 Reason: * right! |
|
|
|
|
|
|
#16 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
10AB16 Posts |
Well, this isn't entirely true. You can shut down your computer or close Prime95 and it will save its progress and continue when you let it. What you said after that part is true if you abandon the test completely before x reaches 100 and communicates with the PrimeNet server.
|
|
|
|
|
|
#17 |
|
Jun 2009
Athens Greece
5 Posts |
So is there a practical use for these prime numbers?
|
|
|
|
|
|
#18 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
Short answer: no, not really
Just like there's no practical use for a million dollar diamond. Or for scaling Mt. Everest. Here's a very good list of reasons why we search for these primes: http://primes.utm.edu/notes/faq/why.html Last fiddled with by Mini-Geek on 2009-06-19 at 12:08 |
|
|
|
|
|
#19 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
9,787 Posts |
|
|
|
|
|
|
#20 |
|
Oct 2008
n00bville
13308 Posts |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Landau Notation question | flouran | Information & Answers | 2 | 2009-09-06 23:20 |
| ???Math. notation??? | mgb | Lounge | 5 | 2007-06-16 20:54 |
| Congruence notation | meknowsnothing | Math | 1 | 2007-05-31 03:32 |
| Twin prime conjecture work, notation question | eepiccolo | Math | 7 | 2005-06-04 23:01 |
| Mersenne-Number Notation? | Unregistered | Math | 4 | 2004-09-30 21:32 |