... This stands, with justice, in the NTG top-20: http://groups.yahoo.com/group/primeform/files/NTG/gigantic.txt but Sean Irvine is pushing GMP-ECM hard to try...
... GULP. Heh, I remember that day when I found this PRP: http://www.primenumbers.net/prptop/searchform.php?form=97220%3F&action=Search Unfortunately this one...
... Absolutely! Francois did great! (quite a routine he's got there); and Phil is always ready to screen away, and I am proud of that article because I was...
This is really a major achievement! Congrats to everybody involved. But I noticed that the 6854-digit b[10] (also proved by Francois Morain) is not on Top-5000...
... When Bouk did b[9] is was up in the top 5 for ECPP--an excellent achievement at the time. However by the time Morain did b[10], it did not make the top...
... I thought that my plot was rather crude :-) [But I have chipped in some more cycles, from today.] PS: I was amused to find that the Dutch national motto is...
I was struck by two meritorious non-Chinese gaps between probable primes, found recently by Pierre Cami: http://www.trnicely.net/gaps/g100k.html ... [cf: it's...
... I am also impressed by them. I have compared the gaps by Cami's primorial to the Chinese construction by my program. The primorial and Chinese only use...
The high merit gap was found by sheer luck. I did interpolate roughly parameters used earlier and selected target sizes for the end primes. In this case the...
I just work empirically on the primes search and same for the gap hunt ! What I found is that it is easy to found gaps with merits > 10 using primorial ...
... The primes have 176 digits. In a couple of GHz hours I just found 116 gaps with merit>16. Top-10: 7582 C?P Andersen 2006 18.77 176 2553145968... 7592...
I begin with a theorem (sorry, folks) but the comments on supra-polynomial and sub-exponential growth of counts of special primes, obtained by intensive use of...
... Each of the first 8 odd values of k give at least one prime for both n=3 and n=5: For n=3, the primes are [ [17], [89, 233], [1097], [16649, 65033], [7577,...
A really intriguing post, David. ... [snip] ... For 10 <= c <= 520, ln(c) is indistinguishable (within your error margins) from c^(1/3). Building on this, I've...
You require n to be positive. If n=0 is permitted, your proof breaks down. One 3-way solution is:- 17 = 4^2+2^0 = 3^2+2^3 = 1^2 + 2^4 There may be others? (I...
David: In an attempt to make progress, and because it is intereting for its own sake, I have started to investigate the density of primes of your given form f...
... I have found the error. In computing P1 and P2, each candidate prime factor p is a factor for 2, not just 1, of the p residue values 0 .. p-1 MOD p; so the...
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.
