Sur une question d'Erdös et Schinzel

Gérald Tenenbaum (1)

1 IECN - Institut Élie Cartan de Nancy

Let F(n) denote a polynomial with integer coefficients and define H_F(x,y,z) to be the number of integers not exceeding x for which F(n) has at least one divisor d such that y

Mots clés: sieve; largest prime factor; polynomial values; divisors in an interval; Chebyshev problem

Domaines: Théorie des nombres [math.NT]

Gérald Tenenbaum. Sur une question d'Erdös et Schinzel. 1990, pp.405-443. ⟨hal-00021869⟩