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)}.
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)}.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.