20041210, 07:11  #34  
"William"
May 2003
New Haven
940_{16} Posts 
Quote:
2. Is M3321931993 still running? 3. I confirm every reported factor by using the Zmath Excel addin, and confirming that zpowmod(2, exponent, prime) is 1. Zmath is free and handles numbers up to 256 digits. 4. I don't think Luigi has discussed the full details of how the program works. We know that every divisor of 2^{p}1 is of the form 2kp+1, so Luigi starts with a large list of k values (probably as a bit map rather than a real list). Then he knows that every 3rd number is divisible by 3 and every 5th one is divisible by 5, etc, so he knocks out all the k's for which 2kp+1 is divisible by some small prime. I don't know how high he goes. I don't know if it is then quicker to do a PRP test on the remaining 2kp+1 values or just do the trial division. William 

20041211, 01:20  #35 
Sep 2004
13×41 Posts 
1. I continued through 2^70. (70.023 actually) 69.87 was that factors bit depth. The last factor I found (the one before this) I think I might have stopped as soon as I saw it and not let it continue. Not sure. Should I let it finish that bit depth next time, or no?
2. M3321931993 no factor from 2^62 to 2^64. (sorry) 3. Aren't these billion digit numbers? ie greater than 256 ;) i suppose the factors have to be shorter than 256 digits is all it means. 4. As long as using more memory or hard drive space wouldn't speed it up its fine with me. :) I've taken 3321931831 to 67 (67.781) no factors found. It appears that Carlo and I are working on the same number. Don't know what to do, but i am continuing for now. M3321931099 no factor under 2^72. Continiuing to 73. M3321931289 no factor under 2^70. Continiuing to 73. Last fiddled with by Joshua2 on 20041211 at 01:23 
20041211, 05:32  #36  
"William"
May 2003
New Haven
2368_{10} Posts 
Quote:


20041211, 16:29  #37  
Banned
"Luigi"
Aug 2002
Team Italia
4829_{10} Posts 
Quote:
Carlo si doing 3321931363 not 3321931381, so 3321931381 would be free. According to http://www.mersenneforum.org/showpos...1&postcount=28 Thomasn is doing 3321931919 to 70 bits. Luigi Last fiddled with by ET_ on 20041211 at 16:34 

20041211, 16:52  #38 
Sep 2004
13·41 Posts 
I'm sorry I had a typo. I did mean ...1381. So I have taken that to 68 now. no factors yet. ...1831 is still at 64. Sorry guys.
Do you think that doing multiple numbers at once like newpgen would speed things up? 
20041218, 17:06  #39 
Jun 2003
2×59 Posts 
M3321931919 no factor from 2^60 to 2^70.
Thomasn 
20041220, 17:19  #40 
Apr 2004
PDX
2×3^{2} Posts 
3321928601 no factor 2^73
Make that 4@ 2^73 no factor What next.... Mark 
20041221, 03:49  #41 
Aug 2004
12_{10} Posts 
M3321930323 no factor to 2^72, taking it to 73.

20041227, 21:39  #42 
Banned
"Luigi"
Aug 2002
Team Italia
11×439 Posts 
Matteo Monti wrote:
"M3321931993 no factor from 2^64 to 2^66." He will take the search to 2^68 Luigi 
20050112, 12:31  #43 
Banned
"Luigi"
Aug 2002
Team Italia
11×439 Posts 
M3321931363 no factor from 2^60 to 2^72.
Luigi & Carlo 
20050113, 18:02  #44 
Sep 2004
1000010101_{2} Posts 
No factors in M3321931099 to 73.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
What does * represent on Recent Results report?  petrw1  PrimeNet  5  20180709 21:14 
Report for PRP  houding  PrimeNet  15  20180110 19:24 
How to report GPU results  dcorbit  Information & Answers  4  20120813 21:53 
How to report P1 results  James Heinrich  Marin's Mersennearies  6  20040527 05:47 
Bug report  remaker  Software  4  20021017 08:18 