You are viewing a single comment's thread from:

RE: The P vs. NP Problem

in #steemstem7 years ago

This is a very interesting post I am going to have to look more into this. This problem reminds me of Fermat's last theorem. It states that a^n+b^n=c^n when greater then two will have no possible positive integers for n that can be true. It took centuries in order to solve this problem but eventually in 1994 a successful proof showing how the statement above was true by a man named Andrew Wiles. I just found this pretty similar to that math equation discussed in this post. If you want to read about Fermat's Last Theorem here is the Wikipedia link: https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem

Sort:  

Ah, Fermat's last theorem is a classic. The result looks too simple but took us around 400 years to prove it!

Coin Marketplace

STEEM 0.21
TRX 0.25
JST 0.040
BTC 98656.44
ETH 3524.63
USDT 1.00
SBD 3.25