The question whether P=NP is one of the famous unsolved problems, one of the Clay Millennium problems (with a prize each worth 1 Million Dollars). Apart from its fundamental relevance for theory and practice of computer science, its positive solution may have very important consequences for the tractability of many computations in physics. It may also shed a new light on the future of quantum computing.
After many years of very hard work, I finally found the correct approach to simplifying the problem. I was able to reduce the problem to the significantly simpler question of whether P=0 or N=1.
My most successful attempt to prove P=0 (which would have settled the conjecture in the affirmative) was by noting that for any X, we have P(X−X)=PX−PX=0. Thus after division by X−X, we find that P=0. Unfortunately, this argument proved to have a small gap, since for the argument to work, the divisor must be nonzero. Thus I would have to find an X such that X−X is nonzero. Unfortunately again, I could prove that this is never the case. Thus I couldn't close this gap in my argument.
If any of you is able to close the gap, we could share the prize....