20040101, 01:08  #1 
Jun 2003
The Computer
110001000_{2} Posts 
M100,000,000+
I need someone to TF 100,000,001. We will do P1, LL, and DC later. Post if you want to do it and how long it will take.
Thanks, Clowns789 
20040101, 02:17  #2 
Sep 2003
2×5×7×37 Posts 
There's no point, this is not a prime.
A nonprime exponent cannot produce a Mersenne prime. The two nearest primes are: 99999989 100000007 Last fiddled with by GP2 on 20040101 at 02:18 
20040101, 02:21  #3 
Sep 2002
2·331 Posts 
100,000,001 has 4 positive integer factors
1, 17, 5882353, 100 000 001 so it isn't prime. The mersenne numbers 2^p  1 that are worked on by prime95 have a prime p. I am not sure but since your exponent 100 000 001 has the factors mentioned 17 and 5882353 may also be factors of 2^100 000 001  1. 
20040101, 02:42  #4 
Sep 2002
2×331 Posts 
I have attached a small windows console program that checks integers for factors.
It brings up a console window ( like a DOS prompt ) and asks Number to test: where you enter a positive integer and press Enter The program will display the factors it finds or will display number is prime. It will also give the result of the number mod 8, only with a result of 1 or 7 ( mod 8 ) is the number a possible factor of a mersenne. It also has to be prime. It must also be equal to 2*k*p + 1 with k a positive integer. The program is zipped so you need some program to unzip it before you can use it. 
20040101, 03:35  #5 
Sep 2002
60_{10} Posts 
Has there been any work done above the 79M exponents? Prime95 can't go above a certain exponent because the FFT hasn't been implemented?, I think, but does that restriction apply for factoring also?

20040101, 03:51  #6 
Sep 2002
2·331 Posts 
Trial factoring doesn't use FFT (IDWT) from what I understand so it could do larger numbers as long as it can handle the bit depth of the factors. It can at least do 72 bit factors.
There are a few members of this forum that have programs they wrote that can trial factor way past the 79M size. For example ewmayer just the other day trial factored this amazing mersenne number mersenne 2^618970019642690137449562201  1 factor 302234395011250596454696928877487 
20040101, 04:03  #7  
Aug 2002
2^{6}×5 Posts 
Quote:
Last fiddled with by ColdFury on 20040101 at 04:06 

20040101, 19:20  #8 
Jun 2003
The Computer
2^{3}·7^{2} Posts 
OK, then do 100,000,007. Also someone could modify the source code for higher exponents or GLucas. I don't really know, so tell me if there's anything Windowscompatible for these high exponents. We will have to do LLs eventually.
by the way, could someone LL 21154097? I already P1ed. 
20040101, 19:35  #9 
Banned
"Luigi"
Aug 2002
Team Italia
2×29×83 Posts 
If all you need is a factoring program to boldly go beyond 79M, try mine:
http://www.mersenneforum.org/showthr...&threadid=1487 It runs under Windows' command line. After a short testing of 2^100.000.007 (53 bit depth) no factor has been found, so you can safely start from 53 bit to (say) 100 bit Luigi 
20040101, 19:57  #10  
Banned
"Luigi"
Aug 2002
Team Italia
12CE_{16} Posts 
Quote:
Luigi 

20040101, 23:39  #11 
Jun 2003
The Computer
2^{3}·7^{2} Posts 
I'll need someone to LL 21154097 and skip P1(I already did it) so I could go over 100M.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
M100,000,039 hourly progress report  jinydu  LMH > 100M  106  20111009 10:43 
M100.000.007 and M1.000.000.007  too big for prime95 ???  stippix  Software  3  20040625 15:34 