Square-free values of reducible polynomials

Andrew Booker, Tim Browning

Research output: Contribution to journalArticle (Academic Journal)peer-review

4 Citations (Scopus)
319 Downloads (Pure)


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.
Original languageEnglish
Number of pages16
JournalDiscrete Analysis
Issue number8
Publication statusPublished - 1 Jun 2016

Bibliographical note

16 pages


  • math.NT
  • 11N36 (11N32)


Dive into the research topics of 'Square-free values of reducible polynomials'. Together they form a unique fingerprint.

Cite this