Hi all, happy new year! Hopefully 2001 will be a good one for OpenPFGW. ... uint64, which is the correct type. I'm currently using the primeserver for primes...
Michael Bell
mdb36@...
Jan 1, 2001 10:50 pm
193
... Just so. At present I use Chris_N's laborious hack: I compile a big factorfile (say hack.txt) of primes p = x mod y and then do pfgw -f -e2 -hhack.txt...
David Broadhurst
d.broadhurst@...
Jan 2, 2001 7:33 pm
194
... In the long term, the parser might do this automatically: if input is Phi(n,b) and -f is set, only screen for factors that are 1 mod n (or divide n). On...
David Broadhurst
d.broadhurst@...
Jan 2, 2001 9:14 pm
195
Bits and bobs here. 1st, powered up the laptop for the first time in ages - got my head back into erat again... The problem with inexact _skiptos is that I...
Phil Carmody
fatphil@...
Jan 2, 2001 9:24 pm
196
... Well suppose that you are hunting for large PrP Phi's. (This thread is about sieving, not proving!) As in any hunt, you should set the factor limit...
David Broadhurst
d.broadhurst@...
Jan 2, 2001 9:50 pm
197
... And if you are looking for large PrP GRUs, then each of the Phi-iform factors of GRU-1 would also maybe want a similar attack (though I'm sure the rho etc...
Phil Carmody
fatphil@...
Jan 2, 2001 10:23 pm
198
... I haven't found a way of telling ECM that factors are 1 mod y where y divides (p-1) ... The former came from Michael Bell's posting, not from me; I'm...
David Broadhurst
d.broadhurst@...
Jan 2, 2001 11:01 pm
199
... Mind you Phil, you better watch out for that cunning person Nash, who is a "generic Lenstra" freak, whatever that might be. (Can you tell us Chris?) See...
David Broadhurst
d.broadhurst@...
Jan 2, 2001 11:28 pm
200
... It seems frustrating. I've been throwing random huge numbers at Mathematica to see if I can see any heuristics pointing towards factorisation hints, but...
Phil Carmody
fatphil@...
Jan 2, 2001 11:55 pm
201
... I think that if it could be done, then Richard Brent would have done it, since all that Cunningham work is Phi-ish. Which reminds me, can anyone please...
David Broadhurst
d.broadhurst@...
Jan 3, 2001 12:09 am
202
Bugs found in the modular sieve... The exact erat_skipto() and erat_peek() work, but the underlying sieve barfs on some mod/rem combos. I'll keep you posted. ...
Phil Carmody
fatphil@...
Jan 3, 2001 12:22 am
203
... Can someone independently verify that the following numbers are the correct subsequent primes given the indicated skipto values for primes 1 mod 2018: 1->1...
Phil Carmody
fatphil@...
Jan 3, 2001 1:02 am
204
... This code will generate all primes 1 mod 2018. This is NOT efficient, but it works for verification, since verification should be a one time shot, and...
Jim Fougeron
jfoug@...
Jan 3, 2001 4:43 am
205
... Indeed! I recommend Pari for such checks: p=1009; nm=ceil(10^9/2/p); for(n=1,nm,q=2*p*n+1;if(isprime(q),print(q))); gives 50,472 primes less than 10^9...
David Broadhurst
d.broadhurst@...
Jan 3, 2001 5:30 am
206
Hi folks ... Gnomic? If you think I'm going to stand in the yard with a bobble hat and a fishing pole at this time of year... it's freezing! I think I ...
Chris Nash
chris_nash@...
Jan 3, 2001 1:22 pm
207
... Believe it or not I don't have pfgw on my system at the moment. Windows did some nasty things through my samba mounts, and destroyed most of my home...
Phil Carmody
fatphil@...
Jan 3, 2001 1:35 pm
208
Hi there Philip ... that ... number ... Many many thanks for the feedback! While of course I apologize that you've stumbled across a bug, I have the strangest...
Chris Nash
chris_nash@...
Jan 3, 2001 1:42 pm
209
... Ah, Thanks. I see the final part of APR-CL here. ... Yes please ! David...
David Broadhurst
d.broadhurst@...
Jan 3, 2001 3:39 pm
210
... just that it's confusing learning just from the online help. Generation of these primes in a bc script is: /* returns: p^e%n */ define expmod(p,e,n) { ...
Jim Fougeron
jfoug@...
Jan 3, 2001 3:56 pm
211
... I guess that means you want my sieve to actually work... Hmmm, I'm at work waiting for an upload to complete, I guess I could start debugging now... Phil ...
Phil Carmody
fatphil@...
Jan 3, 2001 4:09 pm
212
... Well that would, indeed, be particularly neat. But as all this is done for love, take your own time please. David...
David Broadhurst
d.broadhurst@...
Jan 3, 2001 6:39 pm
213
... Agreed. Chris, Here is what is happening, I am not sure how to fix it just yet. the problem is in this constructor: GWContext::GWContext(DWORD N,DWORD X)...
Jim Fougeron
jfoug@...
Jan 3, 2001 7:45 pm
214
... I have a PrP record-breaking GRU candidate at almost 32%. Fat lot of good! Last APR-CL assist, at merely 4999 digits, took 10 Alpha-days. This one would be...
David Broadhurst
d.broadhurst@...
Jan 4, 2001 4:47 pm
215
The 'modular sieve can't skipto() properly is 'solved' (in my head). I'd like to share my programming gotcha, caused by possibly being to clever, and seeing...
Phil Carmody
fatphil@...
Jan 4, 2001 5:57 pm
216
... Amen to that (is it a number 30 bus, by any chance) My welsh grandmother used to complain: Dai bach, you have a mind like a sieve! Would that she had been...
David Broadhurst
d.broadhurst@...
Jan 4, 2001 6:20 pm
217
This is off-topic, but as it contained info you don't necessarily wish to share with the whole group, I didn't move it onto a more relevant forum. Feel free to...
Phil Carmody
fatphil@...
Jan 4, 2001 6:29 pm
218
... I did that thusly: Do a double sieve on Phi(q,x) with pfgw -f -d -hhack<q>.txt where hack<q>.txt contains only primes 1 mod q and q is not necessarily...
David Broadhurst
d.broadhurst@...
Jan 4, 2001 7:36 pm
219
... I'm 38 digits short of a new record. The PC running MPQS on a c91 just crashed about 12 hours short. Bugger! Luckily I had taken a couple of breakpoints...
Andy Steward
aads@...
Jan 5, 2001 2:24 am
220
... I'm 100+ digits short of something else, so you should be pretty safe for a few months :-) Best of luck with the Tomabechi! David...
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.
