加入
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)}.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
新建 PR
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)}.
PR 把工作从一条路线带到另一条；合并它就是采纳。