Re: Is this ℙ≠ℕℙ proof 'humiliating'?

wij <wyniijj5@gmail.com> writes:

ℙ≠ℕℙ Proved. https://sourceforge.net/projects/cscall/files/MisFiles/PNP-proof-en.txt/download
...[cut]
   Proof2: Let p="Given a number n, determine whether or not n is even". If
          ℙ=ℕℙ, then p∉ℕℙℂ is a false proposition because all ℕℙ problems
          including ℕℙℂ are mutually Ptime reducible. Since p∉ℕℙℂ is true,
          ℙ≠ℕℙ is concluded.

Where is your proof that p is not NP-complete?  Since you don't know
this subject very well, you would benefit more from asking people to
direct you to resources from which you could learn, rather than posting
provocative messages.

--
Ben.