As a research funding agency, this house would prioritize proving that P = NP over other unsolved mathematical problems.
P = NP.
P = NP problem is a famous unsolved problem within the field of informatics. To put it simply, the problem asks whether or not if a problem's solution can be checked quickly, would it also be able to be solved as quick? In technical level, P refers to problems that are fast-solved (e.g. knapsack problem, pigeonhole, etc.) whereas NP refers to problems that are fast-checked.
An example of NP problems are sudoku, where it would take a very long time for an algorithm to solve a sudoku board, but a very quickly for an algorithm to check if a filled sudoku board is correctly solved.
It can be assumed that if P = NP is proven by one algorithm, that algorithm can be utilized to solve a lot of the world's problem, but also comes with a risk as it makes it easier to solve harder problems like password-breaking, crypto hacking, etc.
Tags:
SCI-5
ECO-6