Exponential sums over integers without large prime divisors
Abstract
We obtain a new bound on exponential sums over integers without large prime divisors, improving that of Fouvry and Tenenbaum (1991). For a fixed integer 0, we also obtain new bounds on exponential sums with -th powers of such integers. The improvement is based on exploiting more precisely the factorisation of integers without large prime divisors, along with existing Type~I and Type~II bounds. For =1 we use the classical bounds of Vinogradov (1937), while for ≠ 1 we use bounds of Vaughan (1975) as well as of Fouvry, Kowalski and Michel (2014).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.