Goldbach Conjecture states that" Every even integer greater than 2 can be written as sum of two primes"
I think this might be a proof.
Let a number be 2k and let the two primes be 2n+1 and 2m+1. Therefore, 2k=2(m+n+1) k=m+n+1
Therefore, there are infinite many solutions and one of them satisfies the given equation. Goldbach conjecture is true. All who think this is wrong , please comment and make me realize my mistake
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
What is n and m? How do you determine them for a given k? E.g. If k=1000000000, what is n,m?
Log in to reply
I meant that prime is odd, so they can written in the form of 2n+1 and 2m+1. By the conjecture, let the sum of two numbers is a even number 2k=2m+2n+2 that is equal to k=m+n+1
I understood my mistake @Calvin Lin
Log in to reply
That's great! Understanding your own mistakes is the first step towards discovering new facts!
You can find infinitely many solutions for some random m and n. But how do you know you can find infinitely many solutions such that 2m + 1 and 2n + 1 are both prime?
Log in to reply
there are infinite but only one satisfies it
Log in to reply
How do you know that there will be one for sure that will satisfy it? What if there are none?