Jean wrote ... and sure enough another project came in with a big one: http://primes.utm.edu/primes/page.php?id=76631 It seems that 0.5M decimal digits is...
I believe the search limits are quite a lot higher than what you indicate. I also have a large number of known composites (through sieving) that I will send...
From: "Sean A. Irvine" <sairvin@...> ... I've written a sieve much faster than multisieve, and have been sieving solidly on one machine for about 2-3...
Happy New Year! On the prime list I have changed how credit is listed in the proof-codes. Instead of usernames I am using surnames. This should be clearer...
I just set up a website listing more than 300,000 factors of n!+/-1. Thanks to Sean A. Irvine for the data. If anybody has more factors, please let me know!...
... Thanks to Sean, who sent me a list of factors, I set up a website where I put those data. There is still much work to do there, but you can already have a...
Hi Phil, I have all your old results from several years ago. I sieved both sides for n<100K up to 2*10^10. I kept all the factors found since I am more ...
From: Bernardo Boncompagni <RedGolpe@...> ... My sieve has reached p=58.7G, and is still ongoing. I'm knocking out about one candidate (in the range...
... That would be great. I'll do some polishing to the site meanwhile. Bernardo Boncompagni ________________________________ "Wars not make one great" Yoda ...
David, Thank you. The CHG proof in 41 steps took the total of 676 hours with a single step (h=16) taking 228 hours! At least another 100 hours were spent on...
I suspected that some /heavy/ factoring had been done, but Predrag's details are awesome. I guess here is as good a place as any to remark on how amazing the...
I have twenty-eight ten million digit integers that were found prime by the old Primeform. Anyone who can use PFGW Primeform or any other accepted Applet can...
Dear fellow OpenPFGW users, Danny Karl Fleming has a 100% record of failure to deliver any sensible result, so please do not feed this patently absurd troll, ...
... Damn! I hate records that can't be beaten! Bernardo Boncompagni ________________________________ "Wars not make one great" Yoda When's who A timeline of...
Hello David, Congratulations for your efforts to find prime numbers. I remeet you on the top20 page for searching primenumbers and saw that you own the 7....
A sequence of m primes in arithmetic progression is:- {p+a*k: p prime, a fixed, k=0..m-1} Clearly, a must be even. For the smallest value of a, namely a=2, the...
... No wonder, since the method is well known. Most people don't bother responding to novices who haven't read the literature yet think they've discovered...
... Yes, David, I did notice that too - your least-favourite prime, as I recall from our off-list discussions of a while back :-) But Z[sqrt(-37)] /doesn't/...
... No accident at all, Mike! You simply rediscovered Euler's trinomial: leonhard(x)=x^2+x+41 mike(m)=163+(2*m)^2 if(4*leonhard(m-1/2)==mike(m),print("ancient...
Hi, I searched a couple of hours in the docs and did not find a quick way to do what I want below. Noting first that 17^0+2 = 3 prime I can quickly get the...
Have you seen: http://www.uow.edu.au/%7Eajw01/ecm/curves.html Andrew Walker has been maintaining ECM effort and factorization status for the smaller n!+/-1 for...
... way to do ... using pfgw ... just ... The files pfgw.log and pfgw-prime.log will contain just the PRP's and primes Jim. ... form 6k - ... n=6k-5 or ... and...
... Thanks. Paul Jobling suggested the same. I think Yahoo is getting caught up or something as this appears to be a dupe email. However, It seems to me a...
You can suppres screen output so that only PRPs are shown by selecting Output->Verbose->Screen->Screen Normal. You can also try "Screen Super Quiet". Finally,...
Hi Primeform group ... Ok. Pari has been running for 2 days on this (08:58) gp > g2(n)=forstep(x=1,n,6,if(ispseudoprime(17^x+2),print1(x","));if(is ...
... Thanks for the info. However, it seems that even the most recent factors (up to Dec 29, 2005) were already included in the list. I am now contacting the...