The application solves one of the 7 millennium problems, more specifically the PvsNP problem. Demonstrating that P=NP, specifically the application solves the problem posed by the Clay Institute of Mathematics on its page (https://www.claymath.org/millennium/p-vs-np/) In which it generally proposes to generate a program that selects from a list of 400 applicants to 100 (25%) that comply with exclusion rules where if candidate A is on the final list, candidate B cannot be on the final list and vice versa.
This program solves just that problem with the flexibility that the total list of applicants can be adjusted, in short it solves for 400 applicants or any other number of applicants, always returning 25% of selected applicants.
Thus proving that (it is easy to find the answer)P=NP (it is easy to verify that the given answer is correct)
A complement to this app that is also an NP problem is the Hamiltonian path problem where a traveler must visit N number of cities without passing through the same city twice and you can find this NP problem solved in the following application

https://play.google.com/store/apps/details?id=pvsnp.p_vs_np

Both programs are developed in Python using libraries such as numpy and matplotlib to generate calculations and graphs.
SOMETHING INTERESTING IS THAT BOTH PROGRAMS ARE SOLVED WITH THE SAME CODE BASE, LEAVING THE QUESTION OPEN WHETHER ALL NP PROBLEMS WOULD BE SOLVED WITH THE SAME CODE BASE


programmer:Geovanni Burgos Dzul
Ucu,Yucatan,Mexico