... I agree, I'll get to it this weekend. It is easier when folks submit their primes, but when they do not, I appreciate being notified. ... Yes, I am not...
... .. ... No, since they are of a very special form, even though they do not have BLS-worthy factorizations of N^2-1. However this a very interesting paper. ...
... Short summary: There is a 6-selfridge proof of the primality of 4*2^n + 2*V(1,2,n) + 1 for n = 1, 2, 3, 4, 5, 7, 9, 10, 17, 18, 28, 38, 49, 53, 60, 63, 65,...
... Here is the "blob" for the larger: http://gdailynews.files.wordpress.com/2011/04/ceb1cebdceb1cebacebfceafcebdcf89cf83ceb7.pdf Sanity check: Calling N+1 BLS...
Greek is not easy to translate on line ! As alway I need help to understand ( may be ) what I seen First I found that 6*prime(k)^(4*n)-1 for k>3 is never prime...
... 6*x^4-1 = 0 mod 5 if x != 0 mod 5, since then we know that x^4 = 1 mod 5. Now set x = prime(k)^n. ... 30*x^28-1 = 0 mod 29 if x != 0 mod 29, since then we...
... For each integer M > 2 there is an exponent n such that M*prime(k)^n-1 is composite for all k such that prime(k) > M-1. Proof: Let p be any prime dividing...
... Thanks Paul. There will be more of these. Andrew Sutherland has told me that the authors of http://arxiv.org/pdf/1202.3695v1.pdf now have two ECPP hits...
... Congrats to Peter Kaiser for a 3024 digit quadruplet of primes, http://primes.utm.edu/primes/page.php?id=105857 beating Reto Keiser at 2500 digits, ...
Hi, I have noticed a big slow down in pfgw64. For some work processing 10 million primorial type numbers at 1k digits, version 3.4.4 takes 3 days whereas the...
... That narrows down the problem. It could be the new primegenerator, but I can't imagine that it would be that much slower. I'll take a look. --Mark...
... Luckily, I have a back up of 3.4.9 which works for me. 3.4.4 leaks and aborts when all my 2GB of RAM has been used up, before it has processed my 10...
Congrats to Darren Bedwell, modulo PP verification, for the new #1 (Near-repdigit) Palindrome with 290,253 decimal digits: 10^290253-2*10^145126-1 prime:...
Hi, well done to David Broadhurst for raising the high jump pole for non-trivial N+-1 factorisable proofs with the 301,779 digit prime: (730443*2^501223+3)^2 +...
... The is an "official announcement": http://www.primegrid.com/download/SGS_666667.pdf It is interesting to see that the wisdom of sieving and searching for...
