Ugh, I don't see what all the fuss is about. Here, let me do you all a favor:
P = NP
P/P = NP/P
N = 1
Which is absurd, because N is a letter. Therefore, P != NP.
You're welcome.
P = NP
P/P = NP/P
N = 1
Which is absurd, because N is a letter. Therefore, P != NP.
You're welcome.
Suppose, P = NP
P² = P(NP)
(subtracting (NP)²)
P² - (NP)² = P(NP) - (NP)²
(dividing both sides by P-(NP)):
P + (NP) =(NP)
since P = NP (initial assumption):
2*P = P
(dividing by P):
2 = 1
which is a contradiction, therefore P \not= NP
I think that mistake shows that even finding a mock proof for the fact that P != NP is hard.