Lemoine's Conjecture

Becker-Sievert Conjectur

Every odd number >5 can be written as 2p+pi ; p<=pi

If you accept 1 as prime then:

Every odd number >1 can be written as 2p+pi
p and pi are primes

Examples:

3 = 1+1+1 = 2*1+1

5 = 1+1+3 = 2*1+3, 2*2+1

7 = 3+3+1 = 2*3+1, 2+2+3

9 = 3+3+3 = 2*3+3, 2*2+5, 2*1+7

11= 5+5+1, 3+3+5 = 2*5+1, 2*3+5, 2*2+7 101 = 47+47+7 = 2*47+7 1011 = 7+7+997 = 2*7+997 100000000003 = 13+13+99999999977 = 2*13 + 99999999977

2n+1 = 2p+pi

Maik Becker-Sievert

Verify with

http://mathdl.maa.org/images/cms_upload/Lesser-Known-Hodges18520.pdf

"In fact, Hardy and Littlewood [4] listed as their Conjecture I: Every large odd number n is the sum of a prime and the double of a prime." P.46