Le jeudi 28 juin 2012 18:35:37 UTC+2, Michael Stemper a écrit : > In article <email@example.com>, mluttgens <firstname.lastname@example.org> writes: > >On 25 juin, 18:48, mstem...@walkabout.empros.com (Michael Stemper) wrote: > >> In article <bf3323b9-6c3e-43e8-a01f-cee5b6c3e...@m10g2000vbn.googlegroups.com>, mluttgens <lutt...@gmail.com> writes: > > >> >Why don't you react more positively instead of quibbling about the > >> >meaning of proof. > >> > >> Because you don't have anything vaguely resembling a proof, all you > >> have are the same observations that led to the conjecture being made.
You are right. The problem has to be tackled from another side:
Proof of the validity of Goldbach's conjecture ______________________________________________
According to the conjecture, every even integer greater than 4 can be expressed as the sum of two primes.
Let?s consider the infinite series of uneven integers. Such series contains an infinite number of products p = ab, where a and b are primes. To each product p corresponds a single sum s = a + b, s being of course an even integer.
The question is, are all even integers the sum of two primes? In other words, could an even integer be the sum of two uneven integers, at least one of them not being a prime?
The answer looks straightforward:
A sum s can be written as s = (a+n) + (b-n), where n is an even integer less than b. The terms (a+n) and/or (b-n) can be prime numbers, but being ordinary uneven numbers does not imply that an even number cannot be a sum of two primes.
This answer leads to the conclusion that any even integer can indeed be expressed as the sum of two primes.
July 19, 2012
> >> > >> >During those 270 years, nobody tried to correlate log N with log n. > >> > >> Others have already pointed out that this is incorrect. > > > >Could you give a reference? > > Gus Gassmann already posted a reference, in Message-ID: > <email@example.com>. > > You replied to his post in Message-ID: > <firstname.lastname@example.org>. > You posted your reply on Fri, 22 Jun 2012 03:40:51 -0700 (PDT). The link > was still in what you posted. > > <http://en.wikipedia.org/wiki/Goldbach%27s_conjecture#Heuristic_justification> > > >If you looked at http://luttgens.monsite-orange.fr/page1/ > >you would find the formlula log(n) = 0.770535 log(N) - 0.564174, which > >represents a straight line relation. > > If you look at the second graph at: > <http://www.cogsci.ed.ac.uk/~richard/goldbach.html> > you'll see that any relationship as simple as what you've put forth doesn't > begin to describe the behavior. > > -- > Michael F. Stemper > #include <Standard_Disclaimer> > Life's too important to take seriously.