20040402, 03:07  #45 
Jun 2003
The Computer
2^{2}×5×19 Posts 
There are two things wrong with factor3_1.
1. It says it could not find cygwin1.dll and I need to reinstall the application. 2. I think it is in Italian. Perhaps me or someone could translate it to English. 
20040402, 04:35  #46  
"William"
May 2003
New Haven
4466_{8} Posts 
Quote:
William 

20040402, 07:38  #47 
"Sander"
Oct 2002
52.345322,5.52471
29·41 Posts 
You don't need to install cygwin, just google for the two dll's the program asks for and put them in the same directory.

20040402, 16:22  #48 
"William"
May 2003
New Haven
2×3^{2}×131 Posts 
The second smallest Billion Digit candidate, 3321928219, has no factors through 67 bits. Continuing onward.
William 
20040402, 18:51  #49  
Banned
"Luigi"
Aug 2002
Team Italia
4,751 Posts 
Quote:
Should you need any "factoring" help, just ask! Luigi 

20040402, 20:11  #50  
"William"
May 2003
New Haven
2·3^{2}·131 Posts 
Quote:
William 

20040403, 00:37  #51  
Banned
"Luigi"
Aug 2002
Team Italia
4,751 Posts 
Quote:
Luigi Last fiddled with by ET_ on 20040403 at 00:37 

20040403, 19:20  #52  
Jun 2003
The Computer
574_{8} Posts 
Quote:


20040403, 20:33  #53  
"William"
May 2003
New Haven
2×3^{2}×131 Posts 
Quote:
For example, if we pick a base of 67 bits and flat top, we would attempt to progress from one candidate at 67 bits to two candidates at 68 bits to three candidates at 69 bits etc. If we pick a base of 66 bits and slope top, we would attempt to go from one candidate at 66 bits to two at (67 and 66 bits) to three at (68, 67, 66 bits), etc. I like the 67 base, flat top approach. That would mean that you and I are presently working to take Operation Billion Digits to 2 candidates at 68 bits. If somebody else joins us, we could then all work towards 3 candidates at 69 bits. If nobody joins us, we probably take both candidates to 70 bits then find two more to jointly work towards four candidates at 70 bits. If you prefer more active candidates, we could set the base at 60 bits, the place where you originally quit. That would mean we should reach a good stopping place (68 bits for me), and then search for more candiidates  a flat top would require nine candidates at 68 bits. William 

20040403, 20:34  #54  
"Sander"
Oct 2002
52.345322,5.52471
10010100101_{2} Posts 
Quote:
If the program is running, the file is probably somewhere in your path so there's no need to download it. 

20040404, 03:23  #55 
Jun 2003
The Computer
2^{2}×5×19 Posts 
I'll try the cyggmp thing.
But my original plans were to find a digit that couldn't be factored out at a low level and stick to that one. However, if it's a different computer you could probably do something else. So basically wblipp's plan is a good idea. 
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 