Search the web
Sign In
New User? Sign Up
primeform · User group for PFGW & PrimeForm programs
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Show off your group to the world. Share a photo of your group with us.

Best of Y! Groups

   Check them out and nominate your group.
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.

Messages

  Messages Help
Advanced
Messages 9831 - 9860 of 9860   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
9831
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...
jkcmagic
Offline Send Email
Nov 21, 2009
9:18 am
9832
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...
Bernardo Boncompagni
redgolpe
Offline Send Email
Nov 21, 2009
9:23 am
9833
See http://linux.softpedia.com/get/Science-and-Engineering/Mathematics/PARI-GP-35205.shtml ________________________________ From: sopadeajo2001...
Danesh Forouhari
dforouhari
Offline Send Email
Nov 21, 2009
9:23 am
9834
Hi Can somebody compile pfgw for AMD processor? Thank you. Giovanni...
Di Maria Giovanni
calimero22
Offline Send Email
Nov 21, 2009
9:23 am
9835
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...
Di Maria Giovanni
calimero22
Offline Send Email
Nov 21, 2009
9:23 am
9836
Hi I must test number in the form k*2^n+1. Is Pfgw faster than prp.exe? Thank Giovanni Di Maria...
Di Maria Giovanni
calimero22
Offline Send Email
Nov 21, 2009
9:23 am
9837
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...
johnprime13
Offline Send Email
Nov 21, 2009
9:24 am
9838
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@...> ...
Norman Luhn
nluhn
Offline Send Email
Nov 21, 2009
10:12 am
9839
IIRC, latest port PFGW uses Woltman's GWNUM library v25 and should be faster. Luigi...
Luigi Morelli
et_cygni_61
Offline Send Email
Nov 21, 2009
11:53 am
9840
... 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...
djbroadhurst
Offline Send Email
Nov 21, 2009
12:18 pm
9841
... 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"...
djbroadhurst
Offline Send Email
Nov 21, 2009
12:43 pm
9842
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...
Mark Rodenkirch
mgrogue
Offline Send Email
Nov 21, 2009
1:32 pm
9843
... 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...
mikeoakes2
Offline Send Email
Nov 22, 2009
6:01 am
9844
... Yes, I think I was unlucky. Especailly since I extended all the ap4's and 5's ... Oops! forgot all about that. thanks ... cheers ken...
kraDen
kradenken
Offline Send Email
Nov 23, 2009
12:22 am
9845
Let x = (1320*(5*10^23 + 7574922))^3 y = (x*(5*x + 9)/2 - 31)^2 N = (y - 3^4)*(y - 2^10)/55440 then p628 = (N + 2)/(7621*10607*83911) p641 = (N + 3)/2 p637 =...
djbroadhurst
Offline Send Email
Nov 23, 2009
10:00 am
9846
... Congratulations. You were first this time. I haven't heard factorizations from Joe Crump yet. ...
Jens Kruse Andersen
jkand71
Offline Send Email
Nov 23, 2009
6:58 pm
9847
... 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...
djbroadhurst
Offline Send Email
Nov 24, 2009
12:46 am
9848
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...
Jaroslaw Wroblewski
jarek372000
Offline Send Email
Nov 24, 2009
4:49 am
9849
... Thanks Jarek. That is indeed my aim. But I may need to cross my toes, as well as my fingers :-) David...
djbroadhurst
Offline Send Email
Nov 24, 2009
5:51 am
9850
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,...
Joe
jkcmagic
Offline Send Email
Nov 24, 2009
5:32 pm
9851
... {for(k=0,10,f=factor(n-k)[,1]; print([k,vector(#f,j,poldegree(f[j]))]))} [0, [2, 4]] [1, [3, 3, 6]] [2, [4, 8]] [3, [12]] [4, [2, 2, 4, 4]] [5, [12]] [6,...
djbroadhurst
Offline Send Email
Nov 25, 2009
1:57 am
9852
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,...
Joe
jkcmagic
Offline Send Email
Nov 25, 2009
7:35 am
9853
... 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...
djbroadhurst
Offline Send Email
Nov 25, 2009
2:11 pm
9854
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 +...
Joe
jkcmagic
Offline Send Email
Nov 25, 2009
3:06 pm
9855
... 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...
djbroadhurst
Offline Send Email
Nov 25, 2009
5:38 pm
9856
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 ...
Kevin
kevinacres
Offline Send Email
12:50 am
9857
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; ...
Kevin
kevinacres
Offline Send Email
1:31 am
9858
... 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...
djbroadhurst
Offline Send Email
3:30 am
9859
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? ...
Jaroslaw Wroblewski
jarek372000
Offline Send Email
5:29 am
9860
... 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...
djbroadhurst
Offline Send Email
8:53 am
Messages 9831 - 9860 of 9860   Oldest  |  < Older  |  Newer >  |  Newest
Advanced
Add to My Yahoo!      XML What's This?

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help