... I believe that I have a time-consuming double-loop strategy that would eventually work for n = 3 and for n = 5. Hint: n = 9 seems to be next candidate. ...
... In fact, most n > 5 seem to be possible, with these percentages (I hope!): [ 6, 36.3] [ 7, 30.7] [ 8, 40.0] [ 9, 47.0] [10, 31.5] [11, 38.0] [12, 43.4] ...
... I was extraordinarily lucky to find a gigantic PRP after only about 0.3% of the Poisson mean for the double loop, at 2.8k + 10k digits. Primo is now...
Sorry to have to reply to myself, but I still need an answer on this one. I forgot to mention in my first post that I would like to do this on multiple Linux...
... I now realize that it will not work for k = 33 mod 80. Here is a success with k = 1 mod 80. Let k = 4*x^2 + 1 and p = (x*k^m + x)^2 + k^m. Then p = (x*k^m...
Hello everybody, it seems to me I found a quite large CC3 1st kind. 164210699973*2^(26327-1)-1 164210699973*2^26327-1 164210699973*2^(26327+1)-1 NewPGen,...
... Big congratulations! This also sets an impressive record for 3 simultaneous primes. http://hjem.get2net.dk/jka/math/simultprime.htm is updated. ... Easier:...
Here is a new AP10 record at 260 digits:- (1079682357+109393276*n)*607#+1 is prime for n=0..9 All confirmed prime with PFGW -tc Input/output statistics:- ...
Can people who are currently looking for multifactorials please make themselves known. I'm looking at an optimised sieve for such forms, and before I devote...
... Congratulations! http://hjem.get2net.dk/jka/math/aprecords.htm is updated. ... Too much for me. I don't expect to go after this one anytime soon. -- Jens...
... Congrats for topping the list, beating the previous record which was set over two and half years ago :O http://primes.utm.edu/top20/page.php?id=15 Paul...
Hi, Here is an efficient algorithm to compute the nth prime or prime(n). Some here may be interested. I first learned of Gram's R(x) = Rg(x) here from...
... I first learned of it from Paulo Ribenboim's delightful book. Like Cino, I was mightily impressed to see how quickly it gives good estimates, using...
You improved the old CC3 record by nearly 2000 digits! That is VERY impressive. Big Congrats! I udated the Cunningham Chain record list in the files section. ...
... Erm, sorry Phil, not me, but... ... I've released code under GPL (and a few other licenses) over the years without any problems. Personally, I prefer...
... Primes spaced at the same interval are called primes in arithmetic progression. I don't know a special name for your cases. ... And the largest known x is...
... Phil A little while back I was looking at deficient primorials with a view to taking Buss's conjecture further. So these a highly deficient factorials. ...
Posted by: "Robert" rw.smith@... robert44444uk ... The B(n) require calculation of nextprime(some deficient factorial), but that's not sieving along...
... Hi Phil, I've been away, so pardon my tardy reply. As far as I know the current searchers for multifactorial and the state of the overall search can be...
Posted by: "kradenken" kradenken@... kradenken ... Great - still very active, I see. As my sieve can currently only do one multiplicative stream at a...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
