Join
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.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.