http://openproblemgarden.org/op/sum_of_prime_and_semiprime_conjecture Comments for "Sum of prime and semiprime conjecture" en http://openproblemgarden.org/op/sum_of_prime_and_semiprime_conjecture#comment-78780 <p>Yes, apart from the "sufficiently large" and allowing prime + prime as well as prime + semiprime. The parity problem makes the latter hard, but some progress has been made, see <a href="http://arxiv.org/abs/math/0609615">arXiv:math/0609615</a> and <a href="https://arxiv.org/abs/0803.2636">arXiv:0803.2636</a>. (The key progress is their use of E2 = semiprimes rather than P2 = primes or semiprimes.)</p> Sun, 31 Jul 2016 21:02:14 +0200 Charles R Greathouse IV comment 78780 at http://openproblemgarden.org http://openproblemgarden.org/op/sum_of_prime_and_semiprime_conjecture#comment-7190 <p>Every sufficiently large even number is the sum of either 2 primes or a prime and a semiprime.</p> Sun, 01 Jul 2012 13:38:37 +0200 Anonymous comment 7190 at http://openproblemgarden.org http://openproblemgarden.org/op/sum_of_prime_and_semiprime_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/geoffrey_marnell">Geoffrey Marnell</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/number_theory_0">Number Theory</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Conjecture</b>&nbsp;&nbsp; Every even number greater than <img class="teximage" src="/files/tex/f9664c0e5fcffbbe88ed551c02b9275233d8f6b4.png" alt="$ 10 $" /> can be represented as the sum of an odd prime number and an odd <a href="http://en.wikipedia.org/wiki/semiprime">semiprime</a> . </div> </tr></td> </table> </td> </tr> </table> Geoffrey Marnell prime semiprime Number Theory http://openproblemgarden.org/op/sum_of_prime_and_semiprime_conjecture#comment Fri, 23 Mar 2012 06:32:39 +0100 princeps 37404 at http://openproblemgarden.org