Veeky Forums can't prove that all even numbers can be represented as the sum of two primes

Veeky Forums can't prove that all even numbers can be represented as the sum of two primes

2 = 1 + 1
4 = 3 + 1
6 = 5 + 1
Etc.
Solved by induction

Isn't one excluded from the set of all prime numbers?

If so then OP is a cum-guzzling faget who can't even bait correctly

Not OP, but is this sum of two primes thing one of those theorems that can't be proven?

I have discovered a truly remarkable proof of this theorem which this post's character limit is too small to contain.

It's the Goldbach conjecture and it's for all even numbers greater than 2.

I don't know if it can't be proven, but it hasn't been proven yet.

Doesn't work for 10 senpai.

10 = 9 + 1

9 isn't prime.

7+3
now
go
kill
your
self

why can't it be proven
it seems pretty easy to prove it by contradiction r something

0 is even, and cannot be represented as a sum of prime numbers.
Checkmate, queer.

Then do it

>queer
Obviously OP meant even numbers greater than 2, you homophobic cretin.

> homophobic
Check out the sociologist

Veeky Forums can't prove every odd number greater than 5 is the sum of a prime number and a double of a prime.

7 = 3 + 2 * 2
9 = 5 + 2 * 2
11 = 5 + 3 * 2
13 = 3 + 5 * 2
etc.

I actually have proved this on toilet paper while drunk.
Unfortunately I used the paper and could not recognize anything written on it in the morning.

>solved by induction
kek

You can't write 2 as the sum of two primes.

p+q=2 where p and q are primes
QED

Well he's right that we cannot prove a false statement

I can if you allow prime numbers to be negative

...