Phil Carmody ... I repeated the calculation leaving out all primes divisible by 6. It apears that the conclusion is unchanged. David:-)...
4237
d.broadhurst@...
djbroadhurst
Dec 1, 2001 10:05 am
Phil: As for "triplet middles": try the analyis mod 30. David...
4238
Phil Carmody
thefatphil
Dec 1, 2001 12:06 pm
... As you may have worked out - I did have my doubts, then I had my doubts about my doubts :-|. However, I'm convinced that for at least 10 minutes last night...
4239
Phil Carmody
thefatphil
Dec 1, 2001 12:26 pm
... Given the two assumtions: If there is a positive and negative infinity which are distinct _AND_ Both the positive and negative infinities are in the set...
4240
d.broadhurst@...
djbroadhurst
Dec 1, 2001 6:11 pm
... Phil used his fingers and toes ... Err, what have you got against 2 mod 30, Phil? Example: take 13 from {11, 13, 17} and 19 from (17, 19, 23) to make 13 +...
4241
d.broadhurst@...
djbroadhurst
Dec 1, 2001 7:01 pm
... Exponentials are wonderful; they cut off real fast. Also sprach Rosinante failed 5751472 5823812 5950106 5972786 6025984 6112688 6168926 6246668 7226486 ...
4242
Hans.Rosenthal@...
prime13117532
Dec 1, 2001 11:15 pm
Definitions: " An ACF conjecture is a conjecture which is *Almost Certainly False* due to rigorous heuristical argumentation, but which is not proven to be...
4243
Hans.Rosenthal@...
prime13117532
Dec 1, 2001 11:16 pm
... I think that *both* backtracking AND more factorization power is most useful when you are tackling numbers beyond a certain (let's say 3k+) size. Hans...
4244
Paul Leyland
pleyland@...
Dec 2, 2001 12:13 am
... Ah, another question which has my favourite answer: it depends. The IEEE floating point standard has an encoding where the two infinities are distinguished...
4246
Dick
richard042
Dec 2, 2001 4:03 am
Hello, Is this formulation of Fermat's method a computationally faster way to apply Fermat's method because we are checking only for perfect integers vs...
4248
d.broadhurst@...
djbroadhurst
Dec 2, 2001 12:14 pm
Marcel Martin wrote ... I didn't dare tell you that I use it all the time, including the advanced set up. I thought you might foam at the mouth :-) if I showed...
4249
d.broadhurst@...
djbroadhurst
Dec 2, 2001 12:44 pm
Marcel Martin kindly pointed to the new Hanrot-Morain paper ftp:// lix.polytechnique.fr/pub/submissions/morain/Preprints/solvable.ps.gz but that is far too...
4250
Phil Carmody
thefatphil
Dec 2, 2001 3:31 pm
... I do, don't I :-) ... I find fingers and toes far superior to programs like Mathematica, but just this once Mathematica is capable of doing this vast...
4251
John W. Nicholson
reddwarf2956
Dec 2, 2001 3:58 pm
p(i)# | (n+1)! where p(i) is the largest prime <= n! and p(i)# is primorial. So a gap same size n can be found at (n+1)!/p(i)#. This helps to find g to be...
4252
Kaveh Vejdani
netkaveh
Dec 2, 2001 4:12 pm
... Hans, here's my ACT conjecture, of you like : For fixed, relatively prime naturals a,b, every large enough number of the form ax+b is the average of two...
4253
Kaveh Vejdani
netkaveh
Dec 2, 2001 4:22 pm
... also ... sort of ... There are ... is not ... I think "primes" satisfy GC not because of their "primality" but because of their "random enough"...
4255
d.broadhurst@...
djbroadhurst
Dec 2, 2001 4:58 pm
Thanks for the background, Marcel. In such a situation an author might perhaps have written: "I thank X for demonstrating that some of my earlier ideas were...
4256
William F Sindelar
w_sindelar@...
Dec 2, 2001 5:26 pm
Hi Everybody The recent discussions on the above subject reminded me that about a year ago I posted 2 questions to Primes L which seem related to it. Harvey ...
4257
d.broadhurst@...
djbroadhurst
Dec 2, 2001 5:30 pm
PS: I looked to see how many backtracks there were in ... answer = 15 backtracks in 353 steps For my money, that was a small price to pay, at this bitsize, for...
4258
David Litchfield
litchfield_d
Dec 2, 2001 7:25 pm
... ^ My method is not related to Fermat in the way you suggest (I qualify that with a big I think [and apology if I'm thinking wrong]!) Your suggestion works...
4259
Nuutti Kuosa
nkuosa
Dec 2, 2001 8:12 pm
Here is one gap over 3000 : Found gap of 3028 at 2^198+1561924005675 to 2^198+1 561 924 008 703 digits : 60 and D = 22.06 I checked all k's in the range from 1...
4260
David Litchfield
litchfield_d
Dec 2, 2001 9:26 pm
Just playing with this further there is more note worthy points. Given a number n which is the product of two factors both of which are odd you can derive at...
4263
Phil Carmody
thefatphil
Dec 3, 2001 12:38 am
I've never coded anything to do with Lucas sequences before, forgive my naivete, but I'm 'avin' a spo' of bovva. I'm using a hybrid between Riesel A3.24 and...
4265
David Litchfield
litchfield_d
Dec 3, 2001 4:04 am
... Cheers, David ... From: "Marcel Martin" <znz@...> Cc: <primenumbers@yahoogroups.com> Sent: Sunday, December 02, 2001 10:16 PM Subject: Re:...
4266
David Litchfield
litchfield_d
Dec 3, 2001 4:23 am
... Bad form answering your own emails (sorry) but I've just seen the relationship: Using 35 as the example 35 = 5 * 7 p. triangle is 35 -> 120 -> 125 120 / 5...
4267
Mark Underwood
marku606
Dec 3, 2001 4:37 am
Hello David, I don't even know what the 'Fermat method' is, and I don't entirely comprehend what has been exchanged thus far, but here are my gleanings on the...
4268
Marty Weissman
mweissm2@...
Dec 3, 2001 4:48 am
If I had to give my #1 reason for my interest in prime numbers, I'd have to say that it goes back to my first reading Euclid's proof of their infinity. How...
4269
fengsliu
fengsliu@...
Dec 3, 2001 8:00 am
Dear David: I am sorry, this few days I have otherwise job. ... Ok, ... Yes. ... Yes. Thank you read the original paper again. ... Not. ... "Except retainment...
4270
Phil Carmody
thefatphil
Dec 3, 2001 9:22 am
... A short and simple answer, thank you. Bleary-eyed, I incorrectly changed my code just now, and the code spewed out the correct answers, but on checking...
4271
Jose Luis Gomez Pardo
jlgomezpardo
Dec 3, 2001 9:42 am
I have found a gap of length L = 112194 and D = 14.0273 between prp3474-112194 and prp3474, where prp3474 is given below. The limiting numbers have passed the...
