How many prime numbers are there that can't be written as a sum of two composite numbers? [duplicate]
$begingroup$
This question already has an answer here:
Prove by contradiction that every integer greater than 11 is a sum of two composite numbers
4 answers
Obviously $2,3,5,ldots$ but I'm not sure for what other numbers does it hold, or if there are infinitely many.
elementary-number-theory
$endgroup$
marked as duplicate by lulu, Servaes, Song, J. M. is not a mathematician, Shaun 10 hours ago
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
add a comment |
$begingroup$
This question already has an answer here:
Prove by contradiction that every integer greater than 11 is a sum of two composite numbers
4 answers
Obviously $2,3,5,ldots$ but I'm not sure for what other numbers does it hold, or if there are infinitely many.
elementary-number-theory
$endgroup$
marked as duplicate by lulu, Servaes, Song, J. M. is not a mathematician, Shaun 10 hours ago
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
1
$begingroup$
Are you talking about only Natural numbers? Otherwise $2=12+(-10)$ or like that.
$endgroup$
– Love Invariants
13 hours ago
add a comment |
$begingroup$
This question already has an answer here:
Prove by contradiction that every integer greater than 11 is a sum of two composite numbers
4 answers
Obviously $2,3,5,ldots$ but I'm not sure for what other numbers does it hold, or if there are infinitely many.
elementary-number-theory
$endgroup$
This question already has an answer here:
Prove by contradiction that every integer greater than 11 is a sum of two composite numbers
4 answers
Obviously $2,3,5,ldots$ but I'm not sure for what other numbers does it hold, or if there are infinitely many.
This question already has an answer here:
Prove by contradiction that every integer greater than 11 is a sum of two composite numbers
4 answers
elementary-number-theory
elementary-number-theory
edited 13 hours ago
Daniele Tampieri
2,3972922
2,3972922
asked 13 hours ago
Darko DekanDarko Dekan
342113
342113
marked as duplicate by lulu, Servaes, Song, J. M. is not a mathematician, Shaun 10 hours ago
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
marked as duplicate by lulu, Servaes, Song, J. M. is not a mathematician, Shaun 10 hours ago
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
1
$begingroup$
Are you talking about only Natural numbers? Otherwise $2=12+(-10)$ or like that.
$endgroup$
– Love Invariants
13 hours ago
add a comment |
1
$begingroup$
Are you talking about only Natural numbers? Otherwise $2=12+(-10)$ or like that.
$endgroup$
– Love Invariants
13 hours ago
1
1
$begingroup$
Are you talking about only Natural numbers? Otherwise $2=12+(-10)$ or like that.
$endgroup$
– Love Invariants
13 hours ago
$begingroup$
Are you talking about only Natural numbers? Otherwise $2=12+(-10)$ or like that.
$endgroup$
– Love Invariants
13 hours ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Any $nge 13$, prime or otherwise, is either $8$ or $9$ more than an even number $ge 4$. Therefore, any such $n$ is a sum of two composite numbers. We can exhaustively check the only primes lacking such an expression are the primes from $2$ to $11$ inclusive, i.e. $5$ of them.
$endgroup$
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Any $nge 13$, prime or otherwise, is either $8$ or $9$ more than an even number $ge 4$. Therefore, any such $n$ is a sum of two composite numbers. We can exhaustively check the only primes lacking such an expression are the primes from $2$ to $11$ inclusive, i.e. $5$ of them.
$endgroup$
add a comment |
$begingroup$
Any $nge 13$, prime or otherwise, is either $8$ or $9$ more than an even number $ge 4$. Therefore, any such $n$ is a sum of two composite numbers. We can exhaustively check the only primes lacking such an expression are the primes from $2$ to $11$ inclusive, i.e. $5$ of them.
$endgroup$
add a comment |
$begingroup$
Any $nge 13$, prime or otherwise, is either $8$ or $9$ more than an even number $ge 4$. Therefore, any such $n$ is a sum of two composite numbers. We can exhaustively check the only primes lacking such an expression are the primes from $2$ to $11$ inclusive, i.e. $5$ of them.
$endgroup$
Any $nge 13$, prime or otherwise, is either $8$ or $9$ more than an even number $ge 4$. Therefore, any such $n$ is a sum of two composite numbers. We can exhaustively check the only primes lacking such an expression are the primes from $2$ to $11$ inclusive, i.e. $5$ of them.
answered 13 hours ago
J.G.J.G.
30.1k23048
30.1k23048
add a comment |
add a comment |
1
$begingroup$
Are you talking about only Natural numbers? Otherwise $2=12+(-10)$ or like that.
$endgroup$
– Love Invariants
13 hours ago