The sum of square roots problem
Bound how close two sums of k square roots of integers up to n can be, and decide whether such sums can be compared in polynomial time.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No closed issues
Issues hold questions, sub-problems and requests for help.