Join
Integers not overtaken by m + τ(m)
Find n > 24 such that m + τ(m) ≤ n + 2 for every m < n, where τ counts divisors, or prove that none exists.
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.