The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved.
To cite Preprint
most simple solution to that or any problem: asking Jesus Christ.
Why? He knows all perfectly. Why?
All-knowing Source of Life gave us wisdom. You cannot know all and
at the same time doubt that the All-knowing One exists. One's existence
can explain how Prof. Srinivasa Ramanujan got his insights.
From this follows the equality P=NP of classes
as solution to another Millennium Prize problem.
The proof of Riemann Hypothesis is first step of proving the
generalized Riemann hypothesis; indeed, general L(s)-function
is proportional to Riemann's zeta(s) function: L(s) = tau(s) zeta(s).
Then, at least some zeroes of zeta-function are zeroes of the
L-function. If however, some zeroes of the L-function
are off the critical line Re(s)=1/2, they are zeroes of the coefficient tau(s).
Such functional precision means that tau(s) acts like L(s), but zeta(s) is not 1.
Therefore, proof of Riemann Hypothesis can imply proof of its generalization.
Latter consequence is many special cases of P=NP: Miller-Rabin test runs in polynomial time if general Riemann Hypothesis is true;
as well AKS primality test, Shanks-Tonelli algorithm, Ivanyos-Karpinski-Saxena deterministic algorithm.
To cite Preprint
most simple solution to that or any problem: asking Jesus Christ.
Why? He knows all perfectly. Why?
All-knowing Source of Life gave us wisdom. You cannot know all and
at the same time doubt that the All-knowing One exists. One's existence
can explain how Prof. Srinivasa Ramanujan got his insights.
From this follows the equality P=NP of classes
as solution to another Millennium Prize problem.
The proof of Riemann Hypothesis is first step of proving the
generalized Riemann hypothesis; indeed, general L(s)-function
is proportional to Riemann's zeta(s) function: L(s) = tau(s) zeta(s).
Then, at least some zeroes of zeta-function are zeroes of the
L-function. If however, some zeroes of the L-function
are off the critical line Re(s)=1/2, they are zeroes of the coefficient tau(s).
Such functional precision means that tau(s) acts like L(s), but zeta(s) is not 1.
Therefore, proof of Riemann Hypothesis can imply proof of its generalization.
Latter consequence is many special cases of P=NP: Miller-Rabin test runs in polynomial time if general Riemann Hypothesis is true;
as well AKS primality test, Shanks-Tonelli algorithm, Ivanyos-Karpinski-Saxena deterministic algorithm.
