Join
Chowla's cosine problem
Show that every sum of N cosines cos(ax) with distinct positive integers a dips below −c√N; the best bound is N^{1/5−o(1)}.
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.