Blog 1:

Title: P=NP ? A million dollar question.

If it’s easy to check if the solution to a problem is correct, is it also
easy to solve the problem?

One of the unanswered questions in computer science is a problem

called P vs. NP. In 2000 the Clay Institute offered 1 Million dollars
each for the solutions to seven key problems, called the Millennium
Prize problems. Of the seven problems, P vs. NP is both the most
recently conceived -- in 1971, and by far the easiest one to understand
and explain..

What’s does P and NP mean?

A
In simple terms, P refers to the set of problems that can be solved in polynomial time.
superset of P is a class called NP, a set of problems whose solutions
can be verified in polynomial time. But as far as anyone can tell, many
of those problems take exponential time to solve.

Interestingly, sometimes we get lucky and find that an NP problem is

actually a part of P and we'd have our fast program. But, for a lot of
them that didn't seem to be happening.

So people started to wonder whether everything in NP would

turn out to be in P or if there were some NP problems that
were truly harder than the ones in P.
Why answering this question is worth a million dollar?
The interest in the P vs NP problem lies in its profound implications for computer
science and cryptography. Solving it would have far-reaching consequences, as it
relates to whether certain computational problems can be efficiently solved. If P
equals NP, it would mean that problems for which solutions can be verified
quickly could also be solved quickly. This could revolutionize fields such as
cryptography, optimization, and algorithm design. However, if P doesn't equal NP,
it implies that there are problems for which no efficient algorithm exists, which
has significant implications for the limitations of computation.