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)}.
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.