Help ye please
What is P vs NP
I googled it and found this:
The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified (technically, verified in polynomial time) can also be solved quickly (again, in polynomial time).
There's more, if you want to google it yourself.