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...
Does anyone know of some code (Fortran preferably) which solves a single linear Diophantine equation? Thanks Hugo Scolnik [Non-text portions of this message...
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...
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...
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...
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...
... 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...
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...
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,...
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...
... 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...
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...
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...
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...
Peter Lesala
plesala@...
Nov 20, 2007 11:19 am
19146
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/...
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...
... string sequences of prime numbers do exist and they are related. ... http://tech.groups.yahoo.com/group/gr84nrp/ ... proving/disproving the Riemann Zeta...
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 /...
... 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...
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...
w_sindelar@...
Dec 2, 2007 3:55 pm
19154
... 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,...
w_sindelar@...
Dec 2, 2007 9:07 pm
19156
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...
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,...
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. ...
... 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...
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:...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
