Can anyone clarify why induction method fails for this conjecture?
closed as off-topic by user21820, Lord Shark the Unknown, Namaste, Gibbs, Holo Oct 12 '18 at 1:45
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – user21820, Namaste, Gibbs, Holo
Let's prove the conjecture by induction.
Claim: For every even number $n≥4$, there exist primes $p$ and $q$ such that $p+q=n$.
Base case: $n=4$. Let $p=q=2$.
Induction step: Say that we know that the claim is true for every even number $k ≤ n$. We would like to prove that it is true for $n+2$ as well.
We have available for each even number $k≤n$ two primes, $p(k)$ and $q(k)$, with $p(k)+q(k) = k$. We need to find prime numbers $p$ and $q$ with $p+q = n+2$.
At this point I do not know how to proceed. Please help me out. How can I construct the desired $p$ and $q$ here?
Perhaps it can be done. But as far as I know nobody has yet thought of a way to do it.