On Thu, 2 Sep 2004 11:19:10 +0000 (UTC), Olivier Latinne wrote: > This program that I have built is a program of FACTORIZATION with a > size of the divisor factor less than 2^63. To made a single division > of a Mersenne number with a p of 1000 billion (to be clear: (2^p-1) / div) > it take about 100 hundred hours on one CPU of a SGI Origin 3400 (700Mhz). > This is a << classical division >> without the use of FFT and made with > an arithmetic program with arbitrary number of digits that I have made. > But the test issued of my theory that can say: THIS NUMBER CANNOT DIVIDE > 2^p-1, OR THIS NUMBER IS A POTENTIAL DIVISOR, is about a million times > faster for divisors less than 2^63 (and it's not optimized).
Thanks for replying. Yes, I realise that your program is trying to do factorization. Sorry, when you said you had tested all p up to 1000 billion, I didn't think you meant for a single divisor, I thought you meant for all divisors (and thus would be able to tell if the number was prime or not, ie: didn't have any factors besides itself and 1). So just to clarify, your software which uses your new theory, takes 10000 (100 hundred) hours on one 700MHz CPU to say that the number cannot divide 2^p-1 or that its a potential divisor? If it is a potential divisor, does it actually give the factors? What is magic about 2^63? Does it not work above 2^63 or you just haven't tried anything larger? Also, 2^63 is a very large number, and if your theory works with p of size 1000 billion, a million times faster and can say for certain that "THIS NUMBER CANNOT DIVIDE 2^p-1", wouldn't that make it good for primality testing, since at that speed, you could just try to divide odd numbers less than the sqrt(2^p-1) using your theory to test test p values large enough to win the large EFF prime number prize? Regards, Jeff. _______________________________________________ Prime mailing list [EMAIL PROTECTED] http://hogranch.com/mailman/listinfo/prime
