20040301, 16:50  #12 
Bronze Medalist
Jan 2004
Mumbai,India
2^{2}×3^{3}×19 Posts 
Strange symbol
[QUOTE=eepiccolo]Well, you have to look at all numbers <= to N!+1 to try to find a factor, not just numbers <=N.
Ex) 4! + 1 = 2*3*4 + 1 = 25, and 5 divides 25. Pray, tell me what this strange symbol < means? Mally. 
20040301, 18:18  #13  
"Mark"
Apr 2003
Between here and the
2^{6}×3×31 Posts 
[QUOTE=mfgoode]
Quote:
So who can find the first factor of 1,737,411!+1? 

20040406, 11:53  #14 
Mar 2003
3^{4} Posts 
Why the 10,000,000 digits prime is expected to be Mersenne?
As to Generalized Fermat b^(2^n)+1, they are much more and more frequient, raise faster due to base and superexponent, and also quick tested  one can use WDT and so one... However, it seems the largest pseudoFermat found is about only 500,000 digits... This is because of lack of public spinup comparing to GIMPS... 
20040408, 03:47  #15  
Aug 2002
Portland, OR USA
100010010_{2} Posts 
Quote:


20040416, 14:21  #16 
Mar 2003
3^{4} Posts 
the LL primality test that works for Mersenne numbers is much faster than tests that work for GF numbers.
I dont' think so. I believe that all classical N +/ 1 tests have the same laboriousness. For instance, a*2^n+1 requires only one powermod to be proved, i.е. about n squares. I don't know if WDT suits here, but for b^n+/1, i.e. for GF, it suits. 
20040502, 05:26  #17 
Bemusing Prompter
"Danny"
Dec 2002
California
2^{2}·577 Posts 
Most likely a troll. Notice how he only has one post?

20040515, 20:23  #18  
Jun 2003
Pa.,U.S.A.
11000100_{2} Posts 
probably not prime.
Quote:
What I was doing, having noticed that when composite,c(c1)! with anywhere down to about 1/3 of the number not as zero's as 2 divides, was to pick a number that would multiply with all zeros cancelled when from its half point defined, as to 10001630, as =(a)(a). Then if a is composite (a+1)(a1)! or as 10001631(10001629)! with anywhere up to but not much greater than 2/3 of the numbers being a zero string. As a preliminary check, or prime to be found in a region of numbers(as in just above 10000000), it appears as a first step, logical, .......though not a guarantee of primeness, unless it can be shown the 2 division is definitely impossible with a whole number result, in looking for primes.Of course if the number given is not composite, it is .............prime.It might be possible to work this method in tandem with the prime number theorem, for detail accuracy, especially when fourier tranforms are producing ambiguity. I am sure this approach , as aligning fermat with Wilson, has potential. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Odditities in the 100 Million Digit Prime Award  joblack  Information & Answers  20  20091111 10:27 
When will the first 10 million digit prime be reported?  Uncwilly  Lounge  13  20090722 13:56 
How do I prove a 4000 digit number is prime??  VJS  Lounge  4  20050509 20:56 
Smallest tenmilliondigit prime  Heck  Factoring  9  20041028 11:34 
100 MILLION DIGIT NUMBER  lpmurray  Software  8  20040531 19:22 