... Hash: SHA1 While I do agree that such testing would be reassuring and consume few resources, it is my experience that coding an FFT for the 1 million digit...
'Thanks to Hollywood, a number of moviegoers will have the impression that 1 is a prime number. The sequence of the first few primes were used as a password...
In a message dated 01/04/03 13:25:21 GMT Daylight Time, ... As is coding an FFT for 100 Million digits: size has nothing to do with it. What is /not/ trivial...
11987
Décio Luiz Gazzoni...
decio@...
Apr 1, 2003 2:36 pm
... Hash: SHA1 ... The choice of FFT parameters for a given operand size has all to do with the speed, memory usage and correctness of an FFT implementation....
Hi all, A new version - 2.81 - of NewPGen is available at the primes site. There are linux and windows versions; the only change over 2.80 is a bug fix in the ...
Hi, I think we are getting confused here between roundoff errors (which are implementation independent assuming the exact same FFT algorithm, limb size, etc....
11990
Paul Leyland
pleyland@...
Apr 1, 2003 3:58 pm
Will Edgington and I try to keep our tables of Mersenne factorizations up to date by synchronizng every week or so. The latest indicated that another...
11991
Décio Luiz Gazzoni...
decio@...
Apr 1, 2003 4:08 pm
... Hash: SHA1 ... Exactly. Since SoB already found 5 or 6 primes, I assume their code has no errors of the latter kind. The only errors that might creep up...
... Except that George's code uses different assembler routines for each FFT length, so that doesn't really hold. ... Indeed, I should think this is pretty...
Hi, Well I would do, but Primo doesn't seem to like wine. Has anyone had any success with that, or does anyone know of a Linux ECPP tool with comparable ...
Let x^n+y^n=z^n Then (x+y)^n-z^n = x^n+y^n-z^n + [] = [] where [] is the 'innards' of (x+y)^n However every term in [] contains at least an xy component. x+y=Z...
... About as well as the factorization of 2^(2^n)+1 (the Fermat numbers). ... 2^(2^n)-1 == prod(i=0,n-1,2^(2^i)+1) So, completely factored up to 2^(2^12)-1. ...
Has anyone else experienced this? It seems that Proth 7.1, which I have been running continuously for months, is causing my newly-installed Windows XP OS to...
A quick test on linux 2.81 version showed that it is about 30% slower than linux 2.70 (both for statically linked version). I tested with k.2^n-1 with n fixed...
Let R(n) be the number of unique representations of n, e.g. R(8) = 2 as 8=1*8, 8=2*4 and no others. R is NOT multiplicative, R(72) != R(8)*R(9) as: 72=1*72,...
... Yes, I should have said that the original question "It is true that if finding primes is P then so is finding factors of composites?" is not known to be...
