Square-free values of reducible polynomials
Discrete analysis (2016)
Cet article a éte moissonné depuis la source Scholastica
We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes.
@article{DAS_2016_a11,
author = {Andrew Booker and Tim Browning},
title = {Square-free values of reducible polynomials},
journal = {Discrete analysis},
year = {2016},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DAS_2016_a11/}
}
Andrew Booker; Tim Browning. Square-free values of reducible polynomials. Discrete analysis (2016). http://geodesic.mathdoc.fr/item/DAS_2016_a11/