Talk:Lemoine's conjecture

This should probably say something about Stern primes. Anton Mravcek 22:09, 31 July 2007 (UTC)

Another version of "Levy's conjecture"

There was apparently another version of "Levy's conjecture", related to stochastic processes/Brownian motion (and named after a different Levy, and settled as a theorem now). Anyway, if anyone's interested, you can read this article. DavidCBryant 19:57, 7 August 2007 (UTC)

So what would be the appropriate Wikipedia article if we want to properly direct those who might be looking for the stochastic Levy's conjecture or theorem? Anton Mravcek 20:43, 8 August 2007 (UTC)

"Levy's conjecture" is Lemoine's conjecture

The correct name for this is "Lemoine's conjecture" (as e.g. used in "Goldbach, Lemoine, and a Know/Don't Know Problem" by John O. Kiltinen and Peter B. Young, Mathematics Magazine, Vol. 58, No. 4 (Sep., 1985), pp. 195-203 - cf. http://www.jstor.org/stable/2689513?seq=7), since it has been published by E. Lemoine around 1895 ["L'intermédiare des mathématiciens", n° 1 (1894), 179; n° 3 (1896), 151.], cf. also the page Emile Lemoine.— MFH:Talk 14:06, 11 June 2008 (UTC)

"Levy's conjecture" a simple proof

PROOF: ( 1 is here prime)

Let n be prime number out of N and a an even number out of N with a>n

=> (n+a) = 2n + (a-n) is allways true for all n, a in N.

Let (a-n) a prime number.

=> n+a is an odd number prime or not prime.

=> n+a odd nummber is 2n double-prime + (a-n) prime.

q.e.d.

Maik Becker-Sievert — Preceding unsigned comment added by M-B-Sievert (talk • contribs) 07:30, 6 September 2012 (UTC)

This only works if a-n is indeed a prime number. You haven't shown you can always make that happen for a given sum. PrimeHunter (talk) 10:32, 6 September 2012 (UTC)