Square-free values of reducible polynomials
Discrete analysis (2016) Cet article a éte moissonné depuis la source Scholastica

Voir la notice de l'article

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.
Publié le :
@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/}
}
TY  - JOUR
AU  - Andrew Booker
AU  - Tim Browning
TI  - Square-free values of reducible polynomials
JO  - Discrete analysis
PY  - 2016
UR  - http://geodesic.mathdoc.fr/item/DAS_2016_a11/
LA  - en
ID  - DAS_2016_a11
ER  - 
%0 Journal Article
%A Andrew Booker
%A Tim Browning
%T Square-free values of reducible polynomials
%J Discrete analysis
%D 2016
%U http://geodesic.mathdoc.fr/item/DAS_2016_a11/
%G en
%F DAS_2016_a11
Andrew Booker; Tim Browning. Square-free values of reducible polynomials. Discrete analysis (2016). http://geodesic.mathdoc.fr/item/DAS_2016_a11/