http://tech.groups.yahoo.com/group/primeform/ User group for PFGW & PrimeForm programs Thu, 19 Nov 2009 03:21:16 GMT djbroadhurst http://tech.groups.yahoo.com/group/primeform/message/9830 http://tech.groups.yahoo.com/group/primeform/message/9830 ... Watch this space, folks. Mike's code is already rather nifty; Ken's might get even niftier. Per ardua ad astra David Thu, 19 Nov 2009 03:10:10 GMT kraDen http://tech.groups.yahoo.com/group/primeform/message/9829 http://tech.groups.yahoo.com/group/primeform/message/9829 Hi Mike, ... sieved n=100,000,000-200,000,000 to 10^12 30,873,079 tests 306917 prps 147359 ap4s 335 ap5s 0 ap6s extended ap5's (up 77 and down 70) no ap6 Thu, 19 Nov 2009 02:21:22 GMT djbroadhurst http://tech.groups.yahoo.com/group/primeform/message/9828 http://tech.groups.yahoo.com/group/primeform/message/9828 ... And renewed congratulations, for another: http://primes.utm.edu/primes/page.php?id=90907 Where PrimeGrid and TPS failed, Minnesota, Stanford and Eötvös Wed, 18 Nov 2009 14:39:16 GMT jkcmagic http://tech.groups.yahoo.com/group/primeform/message/9827 http://tech.groups.yahoo.com/group/primeform/message/9827 Letting f(x) be your polynomial, you can eliminate one sextic (replacing it with a quartic) by using f(5*x^3-x^2-x-1). i.e. h(x) = (x*(5*x + 9)/2 - 31)^2; d(x) Wed, 18 Nov 2009 12:42:18 GMT Jens Kruse Andersen http://tech.groups.yahoo.com/group/primeform/message/9826 http://tech.groups.yahoo.com/group/primeform/message/9826 ... Congratulations. http://users.cybercity.dk/~dsl522332/math/aprecords.htm is updated with the assumption that NewPGen and PrimeForm were used again. -- Jens Wed, 18 Nov 2009 08:34:46 GMT mikeoakes2 http://tech.groups.yahoo.com/group/primeform/message/9825 http://tech.groups.yahoo.com/group/primeform/message/9825 ... Congrats, Ken! (We are playing leap-frog on this one:-) Did you sieve k=1..250million, or what? Any other stats on your run? -Mike Oakes Wed, 18 Nov 2009 05:49:17 GMT kraDen http://tech.groups.yahoo.com/group/primeform/message/9824 http://tech.groups.yahoo.com/group/primeform/message/9824 Hi All (19303382 + $n*41724940)*5011#+1 (n=0-5) describes an AP6 of 2152-2153 digit primes. cheers Ken Primality testing (19303382 + 0*41724940)*5011#+1 [N-1, Wed, 18 Nov 2009 05:44:20 GMT Robin Garcia http://tech.groups.yahoo.com/group/primeform/message/9823 http://tech.groups.yahoo.com/group/primeform/message/9823 "By my records, Joe announced his at ... and I posted mine here at ... so assuming that both the clocks use GMT I missed out by almost an hour. This was an Wed, 18 Nov 2009 05:41:53 GMT djbroadhurst http://tech.groups.yahoo.com/group/primeform/message/9822 http://tech.groups.yahoo.com/group/primeform/message/9822 ... Joe pointed out, off list, that one of the 6 remaining quadratics can be factored by modifying the final cubic substitution. Let's look again at my 6 Wed, 18 Nov 2009 04:54:13 GMT djbroadhurst http://tech.groups.yahoo.com/group/primeform/message/9821 http://tech.groups.yahoo.com/group/primeform/message/9821 ... http://users.cybercity.dk/~dsl522332/math/consecutive_factorizations.htm ... Thanks Jens. That's quite right and fair. By my records, Joe announced his at Wed, 18 Nov 2009 02:43:19 GMT Jens Kruse Andersen http://tech.groups.yahoo.com/group/primeform/message/9820 http://tech.groups.yahoo.com/group/primeform/message/9820 ... The Crump record was announced first and submitted first to me, so your nice 641-digit case for k=8 is not listed in the record history at Wed, 18 Nov 2009 01:01:28 GMT djbroadhurst http://tech.groups.yahoo.com/group/primeform/message/9819 http://tech.groups.yahoo.com/group/primeform/message/9819 ... I meant to say GMP-ECM + GNFS. The largest GNFS dificulty, after GMP-ECM, was 117, which is not hard: http://homepage2.nifty.com/m_kamada/math/graphs.htm Wed, 18 Nov 2009 00:46:02 GMT djbroadhurst http://tech.groups.yahoo.com/group/primeform/message/9818 http://tech.groups.yahoo.com/group/primeform/message/9818 ... Aha, I have just seen that the Crump team has used my Ansatz to go up to 703 digits: http://immortaltheory.com/cnt/c703.html They were prepared for SNFS Wed, 18 Nov 2009 00:03:52 GMT djbroadhurst http://tech.groups.yahoo.com/group/primeform/message/9817 http://tech.groups.yahoo.com/group/primeform/message/9817 ... After using GMP-ECM to depth p35, I was left with a pair of composites, with 147 and 148 digits, at an SNFS difficulty of about 161 digits, which is rather Tue, 17 Nov 2009 22:27:24 GMT djbroadhurst http://tech.groups.yahoo.com/group/primeform/message/9816 http://tech.groups.yahoo.com/group/primeform/message/9816 ... It's a sextic for the benefit of SNFS. For most purposes we only need the fact that it is a quadratic in v = w^3. I found it by taking the 12 roots R[k] of