This post is from a low-reputation account and contains an unverified outbound link. Be cautious before clicking external links.
RE: RE: The P vs. NP Problem
You are viewing a single comment's thread from:

RE: The P vs. NP Problem

Words
101
Reading
1 min
9y

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 an+bn=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

@skyr0ck3t: This is a very | Ecency