Square-free values of reducible polynomials

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.

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