Martin Michael Musatov wrote: > Listen to the nonsense you speak. Do you recognize the only > individuals able to respond carry the name Mariano and Victor with a > "666" in the email address for the U.K.? That is not a coicidence.
Yes... most of the people in this newsgroup know better than to respond to yet another claim of proof of a major unsolved problem by someone with no credentials whatsoever.
This is, what, the fourth one I've seen in the past year?
JSH first attempted it by finding a polynomial algorithm to the Traveling Salesman Problem last August... granted it neither worked nor solved the problem, although that last part was eventually ironed out. That's actually three attempts, all of which have known counterexamples.
Then there was the person who "solved" 3-SAT... a counterexample took I think a week or so, but eventually it was found.
Next was the proof that solved equations over GF-2; in here, the NP-completeness of the problem being solved was in question.
And then here's yours... to quote someone else: > It is surprising that P=NP is still an open problem; after all, we get a > new proof every month!
-- Beware of bugs in the above code; I have only proved it correct, not tried it. -- Donald E. Knuth
