20040322, 13:35  #23  
Banned
"Luigi"
Aug 2002
Team Italia
4,751 Posts 
Quote:
I am still working on source code to translate it into English and eliminate debug calls. Two people have already asked me for the source, if you are interested I can send it to you also. Meanwhile I will take the range of 3,321,928,171 a bit (or two...) further. Finally, I would like to thank Andreas Pipp's work (Andi314): he prompted me towards the right path with his program using Crandall libraries. Luigi 

20040322, 16:17  #24 
Banned
"Luigi"
Aug 2002
Team Italia
4,751 Posts 
3,321,928,171 no factor up to 63.001 bits, k=1,391,351,436
Going up to 67 bits... BTW, I also wrote a version of the program that accepts a batch textfile with exponents and startend bits... Luigi 
20040322, 22:41  #25  
Banned
"Luigi"
Aug 2002
Team Italia
4,751 Posts 
Quote:
I mean, we may have a batch of "billion" exponents and try them up to (say) 58 bits to gather some more fators and play with them. Luigi 

20040323, 02:59  #26  
"William"
May 2003
New Haven
2·3^{2}·131 Posts 
Quote:
M( 3321928189 )C: 312261249767 M( 3321928189 )C: 43284724302671 M( 3321928217 )C: 1166521668825287 But M(3321928217) is also stubborn. If you send the program, I'll start a machine on trial factoring this one. William 

20040323, 03:30  #27 
"William"
May 2003
New Haven
2·3^{2}·131 Posts 
Should be:
But M(3321928219) is also stubborn. If you send the program, I'll start a machine on trial factoring this one. William 
20040324, 08:09  #28 
Banned
"Luigi"
Aug 2002
Team Italia
4,751 Posts 
3,321,928,171 no factor up to 66.034 bits, k>11,000,000,000
Still going up to 67 bits... and working with an old 250 MHz PII. William, I'll repost my program as soon as I implement a stronger resuming algorithm (by the end of the week) Luigi Last fiddled with by ET_ on 20040324 at 08:10 
20040326, 12:39  #29  
Banned
"Luigi"
Aug 2002
Team Italia
4,751 Posts 
Quote:
Many thanks to Nick Fortino who implemented a trick to gain another 5% of speed Factor3_1 now can use the r switch to resume from his status.txt file. Now a question: I have a batch version of this program, and a list of about 3300 prime exponents starting from 3321928241,1,50 and ending with 3321999991,1,50 to feed it. We could start a *real* "Billion Project", sieving those exponents up to 50 bits, sending factors to Will Edgington and factoring deeper the tough ones. I could coordinate the ranges and the found factors. We won't find any prime number this way, but projects starting in the next 10 years will have to use our farseeing effort Is anybody interested in this work? Luigi Last fiddled with by ET_ on 20040326 at 12:40 

20040326, 13:20  #30  
Banned
"Luigi"
Aug 2002
Team Italia
4,751 Posts 
Quote:
Luigi 

20040326, 13:32  #31 
Banned
"Luigi"
Aug 2002
Team Italia
4751_{10} Posts 
Code:
M3321928171 no factor from 2^61 to 2^67. 
20040326, 15:24  #32  
"Mike"
Aug 2002
7462_{10} Posts 
Quote:


20040326, 16:27  #33  
Banned
"Luigi"
Aug 2002
Team Italia
4,751 Posts 
Quote:
I guess someone has the full list of found exponents, their factors and their bit depth... we could accomodate the results on a web page. Luigi 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
The "one billion minus 999,994,000" digits prime number  a1call  Miscellaneous Math  179  20151112 14:59 
Ten Billion Digits Mersenne Numbers  aketilander  Operation Billion Digits  13  20130203 21:15 
Operation Megabit Twin  Oddball  Twin Prime Search  370  20130103 21:26 
modulo operation for polynomials?  smslca  Math  3  20110418 17:18 
question range 1 billion to 2 billion?  Unregistered  Information & Answers  7  20100812 06:25 