论文信息 - Cribler les entiers sans grand facteur premier

Cribler les entiers sans grand facteur premier

Let F(x,y) (resp. F q(x,y)) denote the number of integars at most x (resp. and coprime to q) whose largest prime factor does not exceed y. We give both optimal range of validity and remainder term for the approximation of (resp. Fq(x,y) by ((p(q)/q)lF(x,y). This yields an extension of the range of validity of the smooth approximation of de Bruijn type given by Fouvry and the author for (resp. Fq(x,y).

Gérald Tenenbaum | G. Tenenbaum

[1] Andrew Granville. Integers, without large prime factors, in arithmetic progressions, I , 1993 .

[2] H. Diamond,et al. The combinatorial sieve , 1985 .

[3] Antal Balog,et al. The distribution of smooth numbers in arithmetic progressions , 1992 .

[4] G. Tenenbaum,et al. Integers without large prime factors , 1993 .

[5] E. Saias. Applications de la méthode du col à certains problèmes de crible , 1990 .

[6] Gérald Tenenbaum,et al. ENTIERS SANS GRAND FACTEUR PREMIER EN PROGRESSIONS ARITHMETIQUES , 1991 .

[7] Gérald Tenenbaum,et al. Introduction à la théorie analytique et probabiliste des nombres , 1990 .

[8] John B. Friedlander,et al. Integers Free From Large and Small Primes , 1976 .

[9] de Ng Dick Bruijn. On the number of positive integers $\leq x$ and free of prime factors $>y$ , 1951 .

[10] Adolf Hildebrand,et al. On integers free of large prime factors , 1986 .