Capítulo 914: Chapter 468: You damn... really are a genius!_3

```

This problem is known as 'NP,' which can be simply understood as 'not knowing exactly how many times one has to calculate,' while the verification process to solve this problem is P, which means 'the problem is solved with just one computation.'

For instance, what is the next prime number after 5? If one doesn't know the next prime, this can be considered an 'NP problem,' and the approach is to verify each possibility one by one.

6, not it.

7, it is.

The problem is solved.

By verifying that 7 is the next prime number after 5, one can consider that this computational process, which is the solution to the problem, is P.

It may sound simple, but when it comes to finding very large prime numbers, the amount of computation involved is enormous, and verifying each number one by one eventually becomes unfeasible.