... Suggestion: Strip my Sophies ... and then the residual part of his diseased brain :-) resides in ... of Cunningham base-2 [pmain901] David (refusing to...
7436
Jon Perry
jon_perryuk
May 29, 2002 8:01 pm
... representable. So it would seem that the only AP's capable of such a feat are 1mod4 and 3mod4. We could define a covering set of AP's that do satisfy GC. ...
7437
Henri LIFCHITZ
HLifchitz@...
May 29, 2002 8:22 pm
For these theorems you can look at my Web site: http://ourworld.compuserve.com/homepages/hlifchitz a) Generalization of the Euler-Lagrange theorem and new...
7439
djbroadhurst
May 29, 2002 10:26 pm
... And even then the setter can return and say: you got the right answer for a different reason, perhaps. Frankly, I opted out, on the grounds that such...
7440
djbroadhurst
May 29, 2002 11:19 pm
PS: I hope you appreciate, dear Marcel, that Phil will probably slap your hand for suggesting that he ever said that 193949641=3863*50207 was part of his ... ...
7441
djbroadhurst
May 29, 2002 11:41 pm
For the truly perverse: 174143*2263847 > 193949641 = 3863*50207 However I wish it to be recorded that this true statement is in no way to be construed as a...
7442
Phil Carmody
thefatphil
May 29, 2002 11:43 pm
... The sequence was _generated_ by primes, I never promised it contained only primes. Maybe the fact that I owned up to it including the number 193949641...
7443
djbroadhurst
May 29, 2002 11:48 pm
... It is quite sufficient to shame you. David :-)...
7444
Phil Carmody
thefatphil
May 29, 2002 11:51 pm
... The 'simple script' was: $ calc 'p=1;while(p<999){p=nextprime(p);g=gcd(2^p-1,3^p-1);if(g>1)print g;}' i.e. you're spot on. Well done. I'm reading mail in...
7445
Phil Carmody
thefatphil
May 30, 2002 12:02 am
... Now that I've released the answer I have no problem re-posing the question without the obfuscation. The initial sequence I posed was the non-1 values for...
7446
djbroadhurst
May 30, 2002 12:09 am
It get's even more boring: 213407*2774279...
7447
Phil Carmody
thefatphil
May 30, 2002 12:10 am
... I just love the 'SoB' abbreviation. I won't explain any furhter. ... Name one thing that has no immediate target in sight that someone else couldn't call...
7448
Phil Carmody
thefatphil
May 30, 2002 12:13 am
... 3^p-1, that is And yes, I deny any inginuity in coming up with the sequence, and ascribe all whatevers to whomever. Phil ===== -- "One cannot delete the...
7449
djbroadhurst
May 30, 2002 12:19 am
... You said it, not me:-) ... Go for it! But, correct me if I'm wrong, suppose you made it it only up to 30G. Then those 17 would run 3% slower? Sob :-) David...
7450
Phil Carmody
thefatphil
May 30, 2002 8:12 am
... Oh dear. Maybe I should make some excuses. I went to see the great 70s band "Wigwam" last night, came home rather late, and shall we say don't now remember...
7451
djbroadhurst
May 30, 2002 3:00 pm
... gcd(2^1931-1,3^1931-1) trivially factors as: 3863*50207 gcd(2^87071-1,3^87071-1) has factors: 174143*2263847 gcd(2^106703-1,3^106703-1) has factors:...
7452
Phil Carmody
thefatphil
May 30, 2002 4:42 pm
I've found a way of making Fermat's method faster by a small scale factor! Oh joy - I'm hundreds of years behind the bleeding edge! I'm considering here the...
7453
Paul Leyland
pleyland@...
May 30, 2002 4:48 pm
... Check out Lehman's method. It's asymptotically n^{1/3} ... I will be very impressed if you have a method which is better than n^{1/4} which is what squfof...
7454
Phil Carmody
thefatphil
May 30, 2002 5:06 pm
... That's the trial-divide + repeatedly use fermat on scaled-up values? If so, then my technique is applicable to that algorithm too, but can't have quite the...
7455
Paul Leyland
pleyland@...
May 30, 2002 5:15 pm
... That's the one. I thought Knuth's implementation was also essentially division-free. Algorithm D in the second edition uses division only to set up the ...
7456
Phil Carmody
thefatphil
May 30, 2002 5:24 pm
... Oh indeed. I was contrasting the almost-only-addition fermat family to the one-division and several mults per step squfof. Oh my goodness - it's evolving...
7457
Jon Perry
jon_perryuk
May 30, 2002 5:58 pm
Talking of GC, has anyone heard a rumour that the prize for the conjecture is going to be re-instated? Jon Perry perry@... ...
7458
Payam Samidoost
samidoost
May 30, 2002 10:08 pm
New's Flash from dual Sierpinski search On May 31, 2002 Marcin Lipinski found the 42134 digit PRP 35461+2^139964 This is the 12th greatest PRP and the 4th...
7459
jim_fougeron
May 31, 2002 2:08 am
For people taking place in this (futile :) search, I have added support for the 2^n+k and 2^n-k (fixed k) output from NewPGen beta 2.70 to the native NewPGen...
7460
jim_fougeron
May 31, 2002 2:11 am
I guess I should have mentioned that PFGW/WinPFGW was the software I have updated (not NewPGen). Jim. ... participating ... known....
7461
Richard Traynham
therichardt
May 31, 2002 2:20 am
All of ya'll are cordial-ly invited to a new forum (as if primes don't consume enough of our time ;) It's a tribute site to the late, great Douglas...
7462
bharath ERakajj
lovebharath
May 31, 2002 6:38 am
Hi, Let p & q be primes such that q devides p-1. I want to find r & x when I know y, t in the following equation. y = r(x+t) mod q, Here, r,x,t all belong to...
7463
Phil Carmody
thefatphil
May 31, 2002 7:03 am
... So if you fix q then you've not uniquely defined p. ... So you've fixed q, then? ... But p doesn't have a uniquely defined value, as as yet indeterminate. ...
7464
jason
jasonmoxham
May 31, 2002 10:43 pm
A preliminary version of the distributed jacobi sum prime test is availible at http://217.35.81.229/primetest.html This is experimental code and has a few...
7465
Max B
zen_ghost_floating@...
May 31, 2002 11:54 pm
2,3,11,29,41,43,47,61,83,157,179,193,197,223,229, 241,359,487,797,1549,1567,1741,2153,2339,4139, Cevzrf c fhpu gung gur cebqhpg bs abamreb qvtvgf bs c! vf...
