Prove that every even integer above 2 can be expressed as a sum of 2 primes

Prove that every even integer above 2 can be expressed as a sum of 2 primes.

Other urls found in this thread:

youtu.be/Lme-uNPrry8
twitter.com/SFWRedditGifs

6 = 2 + 5

Easy

youtu.be/Lme-uNPrry8

If it isn't my nigga Golbach... 'sup ?

3+3

Never understood why this is important in any way shape or form.

Number theory is literally just autists jerking each others cocks off

But thats 1 prime, not two primes.

4 = 3+3

Nice one OP I fucking LOVE math

1 * 2 = 3
2 * 2 = 6
3 * 2 = 9
4 * 2 = 12

>my nigga
Kys nigger

better than jerking your own cock off

4 = 2 + 2

0 mod 3: 3 + 3 + ... + 3
2 mod 3: 3 + 3 + ... + 2
1 mod 3: 3 + 3 + ... + 7

You didn't say how many copies we're allowed to use.

that's a nice shitpost you've concocted sir.
wonder how it got to us error-free?

hes right u kno

The Goldbach conjecture was already debunked by Wildberger.

I'm sorry, who?

I'm not sure what are you trying to say.

1) prime numbers exist
2) p is the largest prime number (p*(every prime before it))+1 must be a prime or must contain a prime factor greater than p.
3) thus no largest prime number
4) which implies that the there are infinity many number
5) prime numbers don't exist
Q.E.D

there are finitely many primes

1. let P be the product of all the primes
qed

I don't think so Tim.

what don't you get?

t. brainlet

>look up binary

finitecucks at it again

Let a + b be an arbitrary even integer where a and b are both prime. QED

This statement is false. What about 3? 1 is not a prime number you, 2+2 != 3 there bud

3 is not even

Fuck off smartass

Are you for real?

You would only need 1 prime in that case
2+2+...+2

>every integer
11 = 9 + 2... oh wait