... I don't think that was the intended claim. I think the claim was probably meant to be that [GCD (n!, n+1 ) = 1] implies that [n! + n + 1] is prime. It...
19142
marioneves7
Nov 18, 2007 8:33 pm
Hi, all Some weeks ago I changed the motherboard of a computer Pentium 4 3.20Ghz, 1,00 GB RAM, with Windows XP 2002 SP2. Using Proth.exe, after a while I get...
19143
Mark Rodenkirch
mgrogue
Nov 18, 2007 9:37 pm
My first question would be, why are you using Proth instead of LLR or PFGW? --Mark ... [Non-text portions of this message have been removed]...
19144
marioneves7
Nov 18, 2007 11:24 pm
Hi, all Some weeks ago I changed the motherboard of a computer Pentium 4 3.20Ghz, 1,00 GB RAM, with Windows XP 2002 SP2. Using Proth.exe, after a while I get...
19145
Peter Lesala
plesala@...
Nov 20, 2007 11:19 am
Hi, I have just completed a nine page document (MS Word document) proving non-existence of odd perfect numbers. I would like to mail the document to this group...
19146
Jean Penné
jpyah2001
Nov 27, 2007 4:11 pm
Hi All, The new version, 3.7.1c of the LLR program is now available. The zipped binaries can be downloaded from the GIMPS site : http://www.mersenne.org/gimps/...
19147
Tim Brown
narepoba
Nov 29, 2007 4:13 am
Hi all, It is time to show that prime numbers are related. No kidding, string sequences of prime numbers do exist and they are related. See an example and...
19148
Mark Underwood
marku606
Nov 29, 2007 6:19 pm
... string sequences of prime numbers do exist and they are related. ... http://tech.groups.yahoo.com/group/gr84nrp/ ... proving/disproving the Riemann Zeta...
19149
alby7e7
Nov 29, 2007 11:34 pm
Take a decimal r belonging to R. Es. 13.77, Ok now raise the square and to do so using a linear combination: (13.77) ^ 2 = 13 ^ 2 + 13 * 0.77 + 13.77 * 0.77 /...
19150
Jack Brennen
jbrennen
Nov 30, 2007 12:52 am
... Without commenting on the stuff about prime numbers, I'd point out that the cardinality of the rational numbers is the same as the cardinality of the...
... string sequences of prime numbers do exist and they are related. ... http://tech.groups.yahoo.com/group/gr84nrp/ ... proving/disproving the Riemann Zeta...
19153
w_sindelar@...
Dec 2, 2007 3:55 pm
I discovered that certain primes have an elegant property. For convenience, call this type of prime Q. I think I can best explain what I mean by the following...
19154
w_sindelar@...
Dec 2, 2007 9:07 pm
... positional notation is 0, then the succeeding prime is 2 and the preceding prime is 0. If the term in the units position in the positional notation is 1,...
19156
Kermit Rose
kermit1941
Dec 12, 2007 3:34 am
Suppose that z is a composite odd integer for which we wish to know factors z = x y. Set x = 2^0 + 2^c2 + 2^c3 + . . . + 2^cm Notice that the subscripts...
19157
Paul Leyland
xilmanuk
Dec 13, 2007 9:20 pm
Very, very unlikely to be useful. This approach has been made many times in the last few centuries (entirely analogous equations can be set up in any radix,...
19158
Kermit Rose
kermit1941
Dec 17, 2007 1:20 am
http://www.mathreference.com/num,inf.html impressed me with this concise proof that there are Infinitely Many Primes Suppose there is a finite list of primes. ...
19159
Jens Kruse Andersen
jkand71
Dec 17, 2007 2:57 am
... Good old Euclid has impressed many people. This is one of the most famous proofs in the history of mathematics. I have probably seen it over 100 times. I'm...
19160
Werner D. Sand
theo2357
Dec 19, 2007 12:00 am
Who knows a good approximate formula for the number of prime powers up to x (without simple prime numbers): N = sum(1)(p^n <= x), p prime, n>1 ? Suggestion:...
19161
Kermit Rose
kermit1941
Dec 19, 2007 1:29 am
Here is a simple theorem related to twin primes. I wonder how many times it's been replicated. If the positive integer d cannot be equal to abs( [ (3* m + 1)...
19162
Kermit Rose
kermit1941
Dec 19, 2007 11:31 pm
1. number of prime powers Posted by: "Werner D. Sand" Theo.3.1415@... theo2357 Date: Tue Dec 18, 2007 4:00 pm ((PST)) Who knows a good approximate formula...
19164
Werner D. Sand
theo2357
Dec 20, 2007 2:45 pm
... up ... (1/5) ... That's allright. Can you sum it up into a closed form? WDS...
19165
aldrich617
Dec 20, 2007 2:59 pm
I offer a $50 prize to the first person who can submit a verifiable counterexample or proof by New Year's day for the following primality conjecture: ...
19166
Alan Eliasen
aeliasen
Dec 20, 2007 11:23 pm
... Wasn't much of a challenge. Is it a homework problem? The first counterexample is at x=5 (which we can all agree is prime.) Here, A=551 B=271 c=245 ...
19167
aldrich617
Dec 22, 2007 1:09 am
I offer a $51 prize to the first person who can submit a verifiable counterexample by New Year's day either for the following conjectures. (x,A,B,c,k,f :...
19168
aldrich617
Dec 22, 2007 9:20 am
A , A + 1*B*10 , A + 4*B*10 + 60, A + 9*B*10 + 360, S + 16* B*10 + 1200… should read: A^2, A^2 + 1*B*10 , A^2 + 4*B*10 + 60, A^2 + 9*B*10 + 360, A^2 + 16* B*10...
19169
aldrich617
Dec 22, 2007 9:28 am
Alan mistakenly believed he found valid counterexamples. Aldrich...
19170
aldrich617
Dec 22, 2007 6:24 pm
I felt that I needed to clarify another point in the second question. So here I will post the restated CONTEST++ in its entirety: I offer a $51 prize to the...
19171
Jacques Tramu
gbrougnard
Dec 25, 2007 5:40 pm
You have to read , Alan. (Furious activity is not substitue from carefully reading). The prime test is on A, not x . (I checked Aldrich conjecture for large...
19172
aldrich617
Dec 25, 2007 10:24 pm
I believe that it is possible to use the first conjecture from CONTEST++ as a starting point for a new factoring method, and that even if it is found to be not...
