Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
We prove that the Kloosterman sum changes sign infinitely often as runs over squarefree moduli with at most 10 prime factors, which improves the previous results of Fouvry and Michel, Sivak-Fischler and Matomaki, replacing 10 by 23, 18 and 15, respectively. The method combines the Selberg sieve, equidistribution of Kloosterman sums and spectral theory of automorphic forms.