2^9689-1 is prime! This was first "proved" by computer in 1963. There has been controvercy since the 4 color theorem was allegedly proved with use of a...
Hello all: I send you a new formula (In MATHEMATICA) for the nth prime number L[1]=1; L[n_]:=L[n]=LCM[L[n-1],n] LG[n_]:=L[n]/L[n-1] FL[n_]:=Quotient[LG[n],n] ...
Hello: This is the formula it will be published in the Smarandache Notions Journal 15. I write it in MATHEMATICA code: L[1]=1; L[n_]:=L[n]=LCM[L[n-1],n] ...
Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the primenumbers group. File :...
primenumbers@yahoogro...
Apr 1, 2004 9:15 pm
14727
... And who should rather be trusted on April 1? ;-) Has anybody made a program which deliberately gave a bogus result on April 1? A mean example would be...
... The search is nearly finished for 35 digit factors (B1=1M). A special thank-you to the person that contributed two machines for few days. I'm going to...
Hi, I have been running the Proth program for a number of years and would now like to be able to run it as a service on my Win XP home machine so that I don't...
I finished that larger run I mentioned, on a range of 800 million, which sieved down to just over 3 million. Stage one yielded 50,000 candidates and stage two...
Hi Peter, Proth doesn't contain a specific code to run as a Windows NT/2000/XP service (Win95 service is not similar). However, you can use a free tool to do...
Question one: For some odd reason I decided to put together a talk on prime numbers and lines, and use that to give a rough history of prime numbers. I...
I'm sure this is covered somewhere, but... Let Gfp(n) = the pair (a,b) leading to the smallest prime of the form a^(2^n)+b^(2^n). Gfp(1) = (1,2) [1 digit] ...
In a message dated 08/04/04 02:37:42 GMT Daylight Time, ... In August 2000 I did a complete search for primes of the form a^(2^n)+b^(2^n) for 2<=n<=13 and...
Chris: good idea. If you don't mind having more than one line in a plot, I strongly recommend the Ulam spiral. Paul...
Paul Leyland
pleyland@...
Apr 8, 2004 11:30 am
14737
Wilfrid Keller informed me that David Broadhurst had found 25*2^130407 to be prime. I had searched that range & not found it. My lresults.txt file reads, in...
Could some one please explain why I am getting differnet residues for the same number. Result from PFGW: 90527*2^40055+1 is composite: [2C95BADDFCB96B0E]...
Well, then read my primespiral.pdf first. It is in files. Paul Leyland <pleyland@...> wrote:Chris: good idea. If you don't mind having more than one...
Has anyone looked at consecutive primes from this perspective? Here's my simple-minded idea: Visualize the positive integer number line. Keep the zero mark and...
w_sindelar@...
Apr 11, 2004 1:50 pm
14741
Hello Primehunters ! I will inform all of you, in few days I have found on a 1300 MHz Duron a 10-tuplet with more than 100 digits. Best wishes Norman Mit...
Hi All, To-day, I replaced the three new LLR zip files after having fixed several bugs : - In SSE2 mode, false negatives with all zeroes in the 64 bits residue...
... Congratulations on that big improvement: http://www.ltkz.demon.co.uk/ktuplets.htm#largest10 A few days sounds either lucky or efficient. I see you also...
Over the last few hours, I have thought of measuring how large a "prime gap" is in terms of the ratio of the number of possible smallest prime factors to the...
Is anyone alive in here? Just in case, I'll provide an update on that larger range I mentioned. A range of 1.8 billion sieved down to 5.5 million candidates...
Can someone please let me know the most up to date source for k*2^n-1 ranges reserved. According to http://www.prothsearch.net/riesel2.html k=23 has been...
... Thanks to everyone who replied to me. To summarise, the link above is as accurate as it could be, it appears many people have searched higher without...
Here is a preprint of a paper by Ben Green and Terence Tao which proves that for every k >= 3 there exist infinitely many arithmetic sequences of primes of...
The Strong Merten's Conjecture was disproven, but does anyone have a figure for the Merten's Function at the number for which it was proven? Is it 1 +...