... It will let through the sieve only those that are likely to be twin or SG. The AND operation is used. The reason being at the point of examination of the...
... s/b by-products. Let's hope TPS/PG can swallow their pride and think again about their n=500000 singly-sieved twin attempt! I suggest they switched to a...
Hi All, After 6 months of searching for a CPAP4 this morning I thought I had one. Note the below can be reproduced (by me at least) using the official release...
... I have no previous experience with the JF format and have not seen it documented. I don't know how to fix it but will just observe what goes wrong using...
I have started looking into the cpap format (the JF CPAP-?? format) file processing. What is happening, is that "internally", the program (once it finds a AP...
... I guess there could also be AP's which were falsely found to not be CPAP, so Ken should test any reported AP by other means. -- Jens Kruse Andersen...
No, that situation could not happen. If a number was tested and found to be "not-cpap", then it means that one of the numbers in the middle was found to be...
Hi Jim, Having thought about it over the lt couple of days I had come to the same conclusion. The prp testing is fine and the original sieving wasn't by pfgw. ...
... means n<=7. How about the largest 8 consecutive integers with known factorization? It is interesting to know the largest example for the least n which ...
... That's neat! Given that we can factorize 111 digit numbers, without too much trouble, a 9th-order poly would be even neater. (8th order would do for Sean...
... I am not aware of any published result for 8 numbers, but I might consider lowering the 500-digit limit if I heard a non-trivial result. Of course, there...
... 11 or 12 factorizatons at 125 digits may be reduced to 8, by setting x = -13860*y^2, since then the remainder are trivial, at only half that size: ...
Congrats to Primegrid and, in particular, to Lasse Mejling Andersen for a 2 megabit Woodall prime: http://primes.utm.edu/top20/page.php?id=7 now being tested ...
... Congratulations! That was amazingly fast. I wondered whether anybody would even try 8 for years with the limit set at 500 digits. I guess you are also...
... Mainly thanks to Jarek, for his nice quartic Ansatz, which was easy to adapt, to give only 8 c125 factors, in 3 of the 8 targets, instead of the 11 that...
... Now, at last, some recognition of that obvious fact seems to be dawning in TPS: http://www.mersenneforum.org/showpost.php?p=111996&postcount=180 ... I do...
... Jarek's construction involves this Diophantine problem: Find a pair of positive coprime integers [a,b], with a<b, such that there exist two pairs of...
... Andrey's suggested method for 11 consecutive factorizations at 200 digits was to find factorizations of x^6-a, in the 5 hardest cases: a=2,3,5,6,7, and...
... Wow! Big congratulations on an astonishing record. ... After 5 days of the page, there are already more numbers above the 500-digit limit than I expected...
... I was also astounded. I had been doing some p25 work on a sample of 1158 (potential) factorizations of 5 consecutive integers at 500 digits, based on PFGW...
... I know the feeling of finding more than was searched. It's nice! ... Well, I didn't say what it was relative to ;-) But I have changed "relatively easy" to...
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.
