Square-free values of reducible polynomials
Number Theory
2017-01-20 v3
Abstract
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.
Cite
@article{arxiv.1511.00601,
title = {Square-free values of reducible polynomials},
author = {Andrew Booker and Tim Browning},
journal= {arXiv preprint arXiv:1511.00601},
year = {2017}
}
Comments
18 pages; the new version of this article has been reformatted for Discrete Analysis but it is otherwise identical to the previous version, in Discrete Analysis 2016:8