Théorèmes de type Fouvry--Iwaniec pour les entiers friables

Abstract

An integer n is said to be y-friable if its largest prime factor $P^{+}(n)$ is less than y. In this paper, it is shown that the y-friable integers less than x have a weak exponent of distribution at least $3/5-\epsilon$ when $(\log x{)}^c\le y\le x^{1/c}$ for some $c=c(\epsilon )\ge 1$, that is, they are well distributed in the residue classes of a fixed integer $a$, on average over moduli $\le x^{3/5-\epsilon }$ for each fixed $a\ne 0$ and $\epsilon >0$. We present an application to the estimation of the sum ${\sum }_{2\le n\le x,P^{+}(n)\le y}\tau (n-1)$ when $(\log x{)}^c\le y$. This follows and improves on previous work of Fouvry and Tenenbaum. Our proof combines the dispersion method of Linnik in the setting of Bombieri, Fouvry, Friedlander and Iwaniec, and recent work of Harper on friable integers in arithmetic progressions.

27 pages, in French, English abstract

Cited by in corpus (9)

• Sums of Kloosterman sums in arithmetic progressions, and the error term in the dispersion method
• Rigorous Analysis of a Randomised Number Field Sieve
• Combinatorial identities and Titchmarsh's divisor problem for multiplicative functions
• One-level density estimates for Dirichlet L-functions with extended support
• Sur les plus grands facteurs premiers d'entiers consécutifs
• Smooth-supported multiplicative functions in arithmetic progressions beyond the $x^{1/2}$-barrier
• Large sieve inequalities for exceptional Maass forms and the greatest prime factor of $n^2+1$
• On Gaussian primes in sparse sets
• Smooth numbers in arithmetic progressions to large moduli