Thanks for sharing the comments and analysis David! Your point is valid, but may be an oversimplification. The probability you mention appears to be the chance...
Andrew Steward maintains an amazing list of all known legal generalized repunit primes at http://www.primes.viner-steward.org/andy/titans.html . In Chris...
I need Winpfgw for AMD Sempron processor. What i have to do? I've tried to set CpuType (10 or 7) but it works very slow. Thank you. Giovanni Di Maria...
Hello, I've been playing about with prime numbers and came up with a program (C++) that tells you the next prime number following any integer you enter...
Hello ! What is your exact CPU Name and speed in MHz. How many time need your PC for n=199*2^33333-1 best ... Von: Di Maria Giovanni <calimero22@...> ...
... This an old message of Joe's, which took a long time to get through to the list. For the record, ... To: "Joe Crump" Subject: Re: New k=9, 10 record...
... Conventional methods are about 10,000,000 times faster: st=50000000;gettime;test=10^5 for(n=1,test,st=nextprime(st+1)); print(test" nextprimes in "gettime"...
We have answered this question more than once for you. I don't understand why you continue to ask. I develop PFGW (currently) and have worked with George...
... Thanks for posting those details, Ken. You were unlucky not to get an AP6 straight off, weren't you? 335 AP5s should have been enough. (Poisson up to his...
... I have found a polynomial that solves this puzzle, in spades, with all the bonuses asked for above, zero Crump penalty, plus an extra bonus, not asked for...
2009/11/24 djbroadhurst <d.broadhurst@...> ... Once you have such a nice polynomial in your hands, I will keep my fingers crossed to see 11 consecutive...
Cool, I'll be looking forward to hearing from you on your results. I found a few other promising polynomials, such as: n=subst(121*x^2-396*x^4+324*x^6, x,...
Interesting. For sextics, I get your exact same degree split if I substitute 18*x^3-10*x-1 instead of 18*x^2-11*x-2. i.e. n=subst(121*x^2-396*x^4+324*x^6, x,...
... But then you should divide x by 3, to optimize the sextics. Hence I have been running with n=subst(y*(2*y-11)^2/9,y,(2*x^3-10*x-3)^2); which is an integer...
Thanks for sharing, I think we help each other push forward. :) Here's my best one so far. n=(2*x^3 - 3*x^2 - 5*x + 2)^2 * (4*x^6 - 12*x^5 - 11*x^4 + 38*x^3 +...
... I had pondered that one too, in the guise print(polredabs(2*x^3-3*x^2-5*x+2)); x^3 - 13*x - 4 It trades an 18th order term for 9th order, at the expense of...
Hi David, ... Although being way out of my depth, I'm finding this an interesting thread. I was, however, wondering if the following type of substitution will ...
Of course you can really go to town with this method. { n=(2*x^3 - 3*x^2 - 5*x + 2)^2 * (4*x^6 - 12*x^5 - 11*x^4 + 38*x^3 + 13*x^2 - 20*x - 6)^2 / 16; ...
... Joe and I are limited by restricting SNFS targets to poldegree <= 6. So an overall poldegree = 18 is the maximum, if we are seeking to apportion 1/3 of the...
2009/11/25 djbroadhurst <d.broadhurst@...> ... I do not how you are performing the search, but doesn't the position of those factors count as well? ...
... Yes, but I already have all the 9's, 12's and 18's needed for a run of 11 consecutive factorizations :-) But the 6's in between are proving tough. I...
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.
