20050307, 21:57  #551  
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
24016_{8} Posts 
Quote:
Aitsen M3321930371 no factor from 2^60 to 2^69. http://www.mersenneforum.org/showthr...ht=M3321930371 Joshua2 M3321931099 no factor from 2^67 to 2^69. http://www.mersenneforum.org/showthr...ht=M3321931099 

20050313, 18:11  #552 
"Curtis"
Feb 2005
Riverside, CA
2^{3}×3×5×43 Posts 
Software question
Luigi
Would it be difficult to allow tenths of a bit to be entered for factoring limits? It appears we're all intimidated by the time requirements to factor from 73 to 74 bits, but if (for example) I could divide the work into 2 (or more) pieces, I'd tackle 73 to 73.6 on one machine, 73.6 to 74 on a second machine, and make getting numbers to 74 bits (and thus level 8!) feasible. Can the program be altered easily to accept such entries? Is this more bookkeeping trouble than it's worth? Curtis 
20050313, 19:41  #553  
Banned
"Luigi"
Aug 2002
Team Italia
4838_{10} Posts 
Quote:
I'm just looking for some free time to implement also a couple of improvements, as the time needed for each search and a new sieve to speed up the search. If you have requests, this is the right time to write them down Luigi 

20050314, 00:21  #554  
"William"
May 2003
New Haven
23×103 Posts 
Quote:
I've been thinking about trial factoring in other bases, but I don't know if it makes sense to adapt your program. The parameters of interest are pretty far from Operation Billion Digits, so the design choices may make adapation infeasible. Factors of p^q1 are either q or 2kq+1. But the exponent q I'm interested in is tiny compared to OBD  usually less than 100 and nearly always less than 1000. On the other hand, the base b of interest can be large compared to "2"  often 10^7 and occasionally 10^150. William 

20050314, 09:53  #555  
Banned
"Luigi"
Aug 2002
Team Italia
2·41·59 Posts 
Quote:
Three questions: 1  May you point me to links with heuristics (like mod reductions to speed up the process)? 2  Are you sure that programs like LLR, PRP, PFGW, NewPgen don't offer that feature? They are far better optimized and tested. 3  Are you sure that trial factoring on your numbers would be more efficient than, say, ECM or QS? If the answer is "yes" for all questions, I will gladly start a new project to help your search Luigi 

20050314, 21:49  #556 
Sep 2004
13·41 Posts 
I only have two requests.
Main request is to have it search faster, while still being sure it finds all factors. :) Although, if it was way way faster, it might be worth it to miss some, cause so many more numbers could be searched. Also, I second the request to be able to not have to do whole bits at a time, ie 73.0 to 73.5. 
20050315, 04:57  #557  
"William"
May 2003
New Haven
23×103 Posts 
Quote:


20051029, 15:57  #558 
Oct 2005
18_{10} Posts 
New search
Hello,
I'm totally new to this, and I hope I'll do this right. I'm gonna try the M3321928241 exponent. 
20051029, 16:15  #559  
Banned
"Luigi"
Aug 2002
Team Italia
2×41×59 Posts 
Quote:
M3321928241 has been factored up to 73 bits, so if you want to try it you should test it from 73 to 74 bits: it's a long way, maybe more than a week... Are you still interested in it or you want to change to an easier one? Luigi 

20051029, 20:47  #560 
Mar 2005
Internet; Ukraine, Kiev
11·37 Posts 
I'm going to try new Linux 64bit binary. I reserve M3321928241.

20051029, 21:07  #561  
Banned
"Luigi"
Aug 2002
Team Italia
12E6_{16} Posts 
Quote:
And check your mail as well... it seems that I resolved the segmentation fault problem on 32bit pentium4 version... at least on my computer. Luigi 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Ten Billion Digits Mersenne Numbers  aketilander  Operation Billion Digits  14  20210227 07:14 
The "one billion minus 999,994,000" digits prime number  a1call  Miscellaneous Math  179  20151112 14:59 
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 