2n+1 = 2p+p
From ProofWiki
Conjecture
Every odd integer $> 5$ can be written as $2 p_1 + p_2$ where $p_1 \le p_2$ and both $p_1$ and $p_2$ are prime.
Sources
Hodges, Laurent. A Lesser-Known Goldbach Conjecture. Mathematics Magazine, 66.1 (1993): 45-47.
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
1922: Godfrey Harold Hardy and John Edensor Littlewood: Some problems of 'partitio numerorum'; 111: On the expression of a number as a sum of primes (Acta Math Vol. 44: 1 – 70)
Please fix formatting and $\LaTeX$ errors and inconsistencies.
It may also need to be brought up to our standard house style.
If you have done this or know it has been done, please remove {{Tidy}} from the code.
