| June 2013 | ||||||
|---|---|---|---|---|---|---|
| Sun | Mon | Tue | Wed | Thu | Fri | Sat |
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
| 30 | ||||||
Mon, 16 Nov 2009
I am 2 workers
[Worker #2 Nov 16 11:54] Resuming primality test of M22697959 using FFT length 1280K
[Worker #2 Nov 16 11:54] Iteration: 892644 / 22697959 [3.93%].
[Worker #1 Nov 16 11:54] Resuming primality test of M22697947 using FFT length 1280K
[Worker #1 Nov 16 11:54] Iteration: 881449 / 22697947 [3.88%].
My computer is helping to find out whether the numbers 2^22697959 and 2^22697947 are prime. If it keeps working on this 24/7, it's expected to finish around 3 December.
Links: Mersenne prime (Wikipedia), GIMPS.
Posted on 16 Nov 2009 at 13:15 in /technology. -- Permalink
RSS feed:
/index.rss