... string sequences of prime numbers do exist and they are related. ... http://tech.groups.yahoo.com/group/gr84nrp/ ... proving/disproving the Riemann Zeta...
... 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...
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 /...
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...
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...
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/...
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...
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...
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]...
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...
19141
Steve Palmer
unixinu
Nov 18, 2007 3:07 pm
... 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...
19140
Kermit Rose
kermit1941
Nov 18, 2007 1:28 pm
******* On Sat Nov 17, 2007 12:30 pm ((PST)) "alby7e7" alby7e7@... alby7e7 Posted I suppose... if GCD(n! , n + 1) = 1 if GCD(n! , n + 1 ) != 1 also...
19139
alby7e7
Nov 17, 2007 8:30 pm
I suppose... if GCD(n! , n + 1) = 1 if GCD(n! , n + 1 ) != 1 also (n+1)+1 so I do GCD(n!, n+2) = 1? if yes I do the sum n! + n+2 also I do another GCD with n+3...
19138
Jean Penné
jpyah2001
Nov 15, 2007 7:08 am
Seeing the second red line on the status page : 5345289*2^5345289-1 1609100 L498 Nov 2007 Woodall I am now almost convinced there are hoaxes... Sorry for him,...
19137
Jean Penné
jpyah2001
Nov 15, 2007 6:33 am
If I submit the posted candidate to LLR, I get immediatly that : 1562533*2^6250134-1 has a small factor : 3 !! So, if this number has really been tested using...
19136
Paul Underwood
paulunderwooduk
Nov 14, 2007 9:44 pm
... I guess this is an arithmetical error, and the number should be something like: woodall(3125066). This would fit in with PrimeGrid's current testing...
Hmmmmm... 3 | 1562533*2^6250134-1, but what for 1562533*2^6250134+1 ? At first sight, this Cullen candidate has no small divisor... Mr Karsten Haesslich, I...
19134
leavemsg1
Nov 12, 2007 11:50 pm
Hi, Group, et al. the famous Fermat function: F(x) = 2^(2^x) +1 let x be from the set of whole numbers: Does F(x) have Q= 2*floor(sqrt((x+3)/2)) number of...
19133
Dan Morenus
dan_morenus
Nov 8, 2007 3:45 pm
Hi all! I am using Proth.exe version 7.1 to search for Keller primes. I am a little concerned about the ranges of numbers I'm testing though. Will Proth.exe...
19132
edgar_james2002
Nov 5, 2007 11:01 am
PQ? Cito un passo del discorso di H.W. Lenstra jr. al Congresso Internazionale di Matematica, tenutosi a Berkley (USA) nel 1986: "Supponiamo di avere...
19129
scolnik
scolnik2003
Nov 2, 2007 5:53 pm
Does anyone know of some code (Fortran preferably) which solves a single linear Diophantine equation? Thanks Hugo Scolnik [Non-text portions of this message...
19128
ldurman
Nov 2, 2007 9:09 am
So fast we have 2 a new solution and numbers very close. Hmm... 1787882337^4=1662997663^4+1237796960^4+686398000^4 http://www.euler413.narod.ru Leonid Durman...
19127
ldurman
Nov 1, 2007 5:53 am
Using Robert Gerbicz program, I found new primitive solution for Euler Quartic Conjecture 1871713857^4=1593513080^4+1553556440^4+92622401^4 At first Fray using...
19126
George Woltman
woltman9999
Oct 31, 2007 3:32 pm
... Special congratulations to Sturle. He's been hunting for big primes for a decade. Patience pays off - he's finally snared a big one. [Non-text portions of...
19125
Paul Underwood
paulunderwooduk
Oct 31, 2007 12:54 pm
... It seems to be the season for double-checking-found primes: http://www.rieselsieve.com/forum/viewtopic.php?t=1372 496,473 digits this time:...
19124
Paul Underwood
paulunderwooduk
Oct 31, 2007 4:11 am
Hi, Congratulations to the Seventeen-or-Bust team for their latest prime: Sturle Sunde discovers prime #11!, 33661•2^7031232+1 with 2116617 decimal digits: ...
19123
Roger Lee Bagula
rlbagulatftn
Oct 23, 2007 2:20 pm
After a nice article in this month's American Mathematical Monthly I found this article online that downloads: ...
19122
Roger L. Bagula
rlbagulatftn
Oct 23, 2007 8:04 am
I think "Jens Kruse Andersen" is more cool from my personal experience! ... <jens.k.a@...> wrote: This Wikipedia edit is 10 minutes old as I write: ...
19121
Jens Kruse Andersen
jkand71
Oct 22, 2007 3:35 am
This Wikipedia edit is 10 minutes old as I write: http://en.wikipedia.org/w/index.php?title=Prime_Pages&diff=166202401&oldid=165149465 Some sceptic reverted it...
