World's Hardest Math Problem: 1

[Guilty_Biscuit]

Anyone feel like offering a year's free premium for answering some hard puzzle?

OK, OK

1 Year's premium mebership for the first person to post a rigorous mathematical proof of the statement:

"Every even integer greater than 2 can be written as the sum of two primes"

For example

4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7 = 5 + 5
12 = 5 + 7
14 = 3 + 11 = 7 + 7
and so on...

No cheating! I'll know

[Syzygy]

Anyone feel like offering a year's free premium for answering some hard puzzle?

OK, OK

1 Year's premium mebership for the first person to post a rigorous mathematical proof of the statement:

"Every even integer greater than 2 can be written as the sum of two primes"

For example

4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7 = 5 + 5
12 = 5 + 7
14 = 3 + 11 = 7 + 7
and so on...

No cheating! I'll know

You promise.

Because I'll take a crack at it then.

[Syzygy]

Wait a second... This hasn't been solved ever before has it.

[Guilty_Biscuit]

Oh and by the way wrightfan123

wtf do you mean by this

h=6
k=hSQUARED=6

so...

k=36=6

That statement is complete bollocks.

[Guilty_Biscuit]

You promise.

Because I'll take a crack at it then.

I promise.

[spinwizard]

3= 1+2
4= 2+2
5= 2+3
6= 3+3
7= 5+2
8= 5+3
9= 7+2

(BTW, 1 IS NOT PRIME (I THINK) BUT IT IS THE ONLY WAY 2 SOLVE IT!!!)

[Titanic]

Anyone feel like offering a year's free premium for answering some hard puzzle?

OK, OK

1 Year's premium mebership for the first person to post a rigorous mathematical proof of the statement:

"Every even integer greater than 2 can be written as the sum of two primes"

For example

4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7 = 5 + 5
12 = 5 + 7
14 = 3 + 11 = 7 + 7
and so on...

No cheating! I'll know

If there is a proof for that, its gunna take a while to sort out...I'll try it for 30 mins tomorrow, but I'm not expecting much.

If you want a hard math problem, try proving that if an integer n is greater than 2, then the equation an + bn = cn has no solutions in non-zero integers a, b, and c.

[edit: sorry, that should read a to the power of n, b to the power of n and c to the power of n)

You didn't state that the following is false:
a=b
b=c
c=a

Thus, here is my counter example: a=b=c=1

If you make a,b and c all one, that makes 1+1=1, so its wrong...

Btw, there is a proof for Fermats Last Theorem, it was solved in 1994 I think, by an English guy. Took something like 7 years for him to solve it, so we stand no chance.

[dcowboys055]

G=F=Y

[Fircoal]

This makes me want to post a hard puzzle.

[Jehan]

If you want a hard math problem, try proving that if an integer n is greater than 2, then the equation an + bn = cn has no solutions in non-zero integers a, b, and c.

[edit: sorry, that should read a to the power of n, b to the power of n and c to the power of n)

You didn't state that the following is false:
a=b
b=c
c=a

Thus, here is my counter example: a=b=c=1

1+1=1 ??????
hmmmmm

EDIT: I just read titanics post which already pointed this out. my bad.

[diddle]

the answer is 7

[edbeard]

Wait a second... This hasn't been solved ever before has it.

you are correct. it's a famous math problem

[diddle]

Wait a second... This hasn't been solved ever before has it.

you are correct. it's a famous math problem

i solved it, the answer is 7

[Jehan]

Wait a second... This hasn't been solved ever before has it.

you are correct. it's a famous math problem

according to wikipedia it was solved.

[AtomicSlug]

All I think about math is that all irrational numbers should be put on medication.

[edbeard]

Wait a second... This hasn't been solved ever before has it.

you are correct. it's a famous math problem

according to wikipedia it was solved.

I'm not sure what you're looking at. I thought this was unlikely so I looked it up.

"As with many famous conjectures in mathematics, there are a number of purported proofs of the Goldbach conjecture, none of which are currently accepted by the mathematical community."

Goldbach's Conjecture

[civver]

Anyone feel like offering a year's free premium for answering some hard puzzle?

OK, OK

1 Year's premium mebership for the first person to post a rigorous mathematical proof of the statement:

"Every even integer greater than 2 can be written as the sum of two primes"

For example

4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7 = 5 + 5
12 = 5 + 7
14 = 3 + 11 = 7 + 7
and so on...

No cheating! I'll know

What do you mean by rigorous proof? It can be proven with a few sentences.

[Jehan]

Wait a second... This hasn't been solved ever before has it.

you are correct. it's a famous math problem

according to wikipedia it was solved.

I'm not sure what you're looking at. I thought this was unlikely so I looked it up.

"As with many famous conjectures in mathematics, there are a number of purported proofs of the Goldbach conjecture, none of which are currently accepted by the mathematical community."

Goldbach's Conjecture

my mistake i thought we were still talking about fermat's last theorem still.

[pancakemix]

Anyone feel like offering a year's free premium for answering some hard puzzle?

OK, OK

1 Year's premium mebership for the first person to post a rigorous mathematical proof of the statement:

"Every even integer greater than 2 can be written as the sum of two primes"

For example

4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7 = 5 + 5
12 = 5 + 7
14 = 3 + 11 = 7 + 7
and so on...

No cheating! I'll know

It cannot be proven. That's the answer. There are an infinite number of integers. So you could spend a lifetime trying to prove it and never finish.

I'll take my premium now.

[Titanic]

Anyone feel like offering a year's free premium for answering some hard puzzle?

OK, OK

1 Year's premium mebership for the first person to post a rigorous mathematical proof of the statement:

"Every even integer greater than 2 can be written as the sum of two primes"

For example

4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7 = 5 + 5
12 = 5 + 7
14 = 3 + 11 = 7 + 7
and so on...

No cheating! I'll know

It cannot be proven. That's the answer. There are an infinite number of integers. So you could spend a lifetime trying to prove it and never finish.

I'll take my premium now.

Thats not a reason for it not being able to be proved. Theres an infinate amount of possibilities to Pythagoras, but it has around 400 different proofs.

[pancakemix]

Anyone feel like offering a year's free premium for answering some hard puzzle?

OK, OK

1 Year's premium mebership for the first person to post a rigorous mathematical proof of the statement:

"Every even integer greater than 2 can be written as the sum of two primes"

For example

4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7 = 5 + 5
12 = 5 + 7
14 = 3 + 11 = 7 + 7
and so on...

No cheating! I'll know

It cannot be proven. That's the answer. There are an infinite number of integers. So you could spend a lifetime trying to prove it and never finish.

I'll take my premium now.

Thats not a reason for it not being able to be proved. Theres an infinite amount of possibilities to Pythagoras, but it has around 400 different proofs.

Yes, it works hundreds of different ways. No, it has not been proven as fact. It's the Pythagorean Theorem. In other words, not proven. It will never be proven as fact, as there are infinite possibilities. So that is a reason why it cannot be proven.

[Titanic]

Anyone feel like offering a year's free premium for answering some hard puzzle?

OK, OK

1 Year's premium mebership for the first person to post a rigorous mathematical proof of the statement:

"Every even integer greater than 2 can be written as the sum of two primes"

For example

4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7 = 5 + 5
12 = 5 + 7
14 = 3 + 11 = 7 + 7
and so on...

No cheating! I'll know

It cannot be proven. That's the answer. There are an infinite number of integers. So you could spend a lifetime trying to prove it and never finish.

I'll take my premium now.

Thats not a reason for it not being able to be proved. Theres an infinite amount of possibilities to Pythagoras, but it has around 400 different proofs.

Yes, it works hundreds of different ways. No, it has not been proven as fact. It's the Pythagorean Theorem. In other words, not proven. It will never be proven as fact, as there are infinite possibilities. So that is a reason why it cannot be proven.

From Wikipedia : "a key property of theorems is that they are both true and possess proofs"

[pancakemix]

Anyone feel like offering a year's free premium for answering some hard puzzle?

OK, OK

1 Year's premium mebership for the first person to post a rigorous mathematical proof of the statement:

"Every even integer greater than 2 can be written as the sum of two primes"

For example

4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7 = 5 + 5
12 = 5 + 7
14 = 3 + 11 = 7 + 7
and so on...

No cheating! I'll know

It cannot be proven. That's the answer. There are an infinite number of integers. So you could spend a lifetime trying to prove it and never finish.

I'll take my premium now.

Thats not a reason for it not being able to be proved. Theres an infinite amount of possibilities to Pythagoras, but it has around 400 different proofs.

Yes, it works hundreds of different ways. No, it has not been proven as fact. It's the Pythagorean Theorem. In other words, not proven. It will never be proven as fact, as there are infinite possibilities. So that is a reason why it cannot be proven.

From Wikipedia : "a key property of theorems is that they are both true and possess proofs"

If one were to try hard enough, one could succeed.

I will not, as I am not a mathematician, nor do I care to be one.

[spinwizard]

is'nt an intiger a whole number from 1-9

[Chad22342]

is'nt an intiger a whole number from 1-9

No an integer is any whole number...I think