Legit give away, if you solve this math problem I will give you 100mill in 07 gp.

 

Prove P=NP

 

or

 

if instead you prove this one, I will give you 400mill 07 gp!!!

 

Prove P != NP

 

 

 

Details about the problem will be posted when I have the time. Or you can just google it...good luck

As time approches infinity P=NP, the problem is really solving a relative problem in a non-relative plain, in this case infinte time. 

If Time reaches infinite amounts, it's only logical to assume that every possible option to solving the problem has been exhasted, and eventually a solution, or in some cases the lack there-of would be discovered.

Also given an infinite amount of time and a finite set of options to derive the solution it's only logical to beleive that not only would the solution be discovered, but also the most easiest method at arriving at said solution.... thus P=NP

To be totally honest string theory pretty much makes this NP=P, but I don't think we have enough comment space for that.

Edited September 29, 201312 yr by Monroe

The Clay Mathematics Institute is offering $1,000,000 to the person that can solve this.

 

100M, £2500, $10,000... xD lols

The Clay Mathematics Institute is offering $1,000,000 to the person that can solve this.

 

100M, £2500, $10,000... xD lols

Not that we actually expected anybody to solve it :P All internet security basically works on the presumption that P=NP anyways

wait isnt this a question from the clay institute or something? with 1million dollars prize money if you solve a question? o.o 

^ yes lol

the answer is 32.31

 

 

 

im a robot,

 

gimme my money.

If this is unsolved, whatever you offer won't make a difference.

You'd be better off trying to solve the Navier-Stokes Equation

78,138548453
 

just won $1mil

1337.

If your able to solve that, you don't need 100M, you can penetrate any security defense on the internet or almost any...

 

With that you can make or obtain a lot more then 100M :P

If your able to solve that, you don't need 100M, you can penetrate any security defense on the internet or almost any...

 

With that you can make or obtain a lot more then 100M

If you prove P=NP you would just verify that the security works :P Proving P != NP on the other hand...I'd keep that to myself

If anyone solved this they would win a nobel prize, and they probably wouldnt have time to be on OSBot forums. ^.^

since when do letters apply in maths lol