![]() |
![]() |
#540 |
Mar 2004
Belgium
839 Posts |
![]()
3321932969 from 60 to 63 [Reserved]
Can I use P5v246 for offline factoring exponents? Last fiddled with by ValerieVonck on 2005-02-14 at 19:08 |
![]() |
![]() |
![]() |
#541 |
Mar 2004
Belgium
839 Posts |
![]()
M3321932969 no factor from 2^60 to 2^63.
|
![]() |
![]() |
![]() |
#542 |
Banned
"Luigi"
Aug 2002
Team Italia
112728 Posts |
![]()
What should one do if he takes a range, say, from 63 to 66 bits, and finds a factor at 64 bits?
Today we have completed the whole range before quitting, but I must admit that it's going to be time-consuming as our bit level grows up. Our Italian Billion Project web pages will soon reflect the time spent in the search, so I for myself would complete the whole range, credit it (and have the tiny chance to find another factor), but we should discuss it here and decide together the default behavior. Any ideas? Luigi |
![]() |
![]() |
![]() |
#543 |
Mar 2004
Belgium
83910 Posts |
![]()
IMHO, when I find a factor, for let's say 15k or RieselSieve, I think it is removed from the range of LLR. For what purpose do you want to search further if a factor is found?
|
![]() |
![]() |
![]() |
#544 |
"William"
May 2003
New Haven
23×5×59 Posts |
![]()
Personally, I would finish a level only if it's a short time. I'd probably finish any level under 68, but my P-Pro is taking months getting from 72 to 73. If it found a factor now, at 72.8, I would not let it run another six weeks to reach 73.
As for why to continue, the only output from this project is going to contributions to Will Edgington's list of Mersenne factors. If anybody is ever interested in finding factors (as opposed to determining compositeness), then continuing to an even stopping point makes it easier for that person to pick up the work and continue. I ask people if they finished only so that the data will be clean for successors, not to pressure anyone into doing work they don't want to do on a silly pointless project. |
![]() |
![]() |
![]() |
#545 | |
Banned
"Luigi"
Aug 2002
Team Italia
112728 Posts |
![]() Quote:
Knowing more factors may help the hard work of factoring the number itself. It doesn't apply to today computation, but factors over 55 bits are out of reach of today's ECM factoring technologies, and having them known may help future research more than actual efforts for factorization. It doesn't cost as much time as ECM, and it's fun. ![]() Thank you for your help. Luigi |
|
![]() |
![]() |
![]() |
#546 |
Banned
"Luigi"
Aug 2002
Team Italia
2×3×17×47 Posts |
![]()
As previously announced, the Italian Web page of Operation Billion Digits has had some restyling. Now you can see detailed statistics about exponents, factors and users' resources.
If you like to give them a look, the address is the following: http://www.moregimps.it/billion/stats.php I kindly ask for comments, new ideas, corrections in both functionality and grammar (I'm obviously NOT an English mothertongue). You can reach me here, PM me or send an email to mc5225 AT mclink dot it. A new download page with executables for Windows, Linux, BSD and MAC will soon follow: if you want to help compiling new binaries, you are obviously welcome. Luigi |
![]() |
![]() |
![]() |
#547 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23×401 Posts |
![]()
In updatting my spreadsheet I found that I have 2 expos list at a higher level than moregimps.it and one at a much lower level.
...30371 70vs69 ...31099 73vs72 ...32889 60vs69 Also, I have 219 expos with 124 factored vs 220 and 125 on the .it site. (I will look more into that later. |
![]() |
![]() |
![]() |
#548 | |
Banned
"Luigi"
Aug 2002
Team Italia
2×3×17×47 Posts |
![]() Quote:
As for the 219 vs 220, let me know about it ![]() Luigi |
|
![]() |
![]() |
![]() |
#549 | |
Banned
"Luigi"
Aug 2002
Team Italia
2×3×17×47 Posts |
![]() Quote:
http://www.mersenneforum.org/showpos...5&postcount=51 Do you know who worked the first two from 68 to 69? Luigi Last fiddled with by ET_ on 2005-03-05 at 14:30 |
|
![]() |
![]() |
![]() |
#550 | |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
922310 Posts |
![]() Quote:
M3321929551 has a factor: 8174238826850191 ![]() M3321929531 must have confused me. ![]() I don't record results of who is doing what.... , however I will see if I dig up the data for the first 2 numbers. |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
The "one billion minus 999,994,000" digits prime number | a1call | Miscellaneous Math | 179 | 2015-11-12 14:59 |
Ten Billion Digits Mersenne Numbers | aketilander | Operation Billion Digits | 13 | 2013-02-03 21:15 |
Operation Megabit Twin | Oddball | Twin Prime Search | 370 | 2013-01-03 21:26 |
modulo operation for polynomials? | smslca | Math | 3 | 2011-04-18 17:18 |
question range 1 billion to 2 billion? | Unregistered | Information & Answers | 7 | 2010-08-12 06:25 |