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
Publié le : 1990-07-05
Classification:
sieve,
largest prime factor,
polynomial values,
divisors in an interval,
Chebyshev problem,
11N32,
[MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]
@article{hal-00021869,
author = {Tenenbaum, G\'erald},
title = {Sur une question d'Erd\"os et Schinzel},
journal = {HAL},
volume = {1990},
number = {0},
year = {1990},
language = {fr},
url = {http://dml.mathdoc.fr/item/hal-00021869}
}
Tenenbaum, Gérald. Sur une question d'Erdös et Schinzel. HAL, Tome 1990 (1990) no. 0, . http://gdmltest.u-ga.fr/item/hal-00021869/