[sva_]

Please show that P != NP to prove that you're human. (500 characters remaining)

[javajosh]

Let the proof of P != NP be A, where A is a proof expressible as a finite bitfield. The proof requires induction over an infinite sequence of proofs. But there is no mechanical way to move from the nth to the "n+1"th proof. Plus, "Galois", Gödel, Reimann and other intimidating names. QED.

[asddubs]

if P = NP, it logically follows that NP = NNP, and NNP = NNNP, etc. this violates the law of conservation of energy, qed

[chias]

Easier proof:

Assume N != 1.

[asddubs]

yes although technically my proof also proves that X != 1*X, so it's more broadly applicable