Square-free values of reducible polynomials

2015/11/02 by Booker, Andrew, Browning, Tim · 2 citations
#11N32 #11N36 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1511.00601

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.

Cited by

• Monogenic sextic trinomials x⁶+Ax³+B and their Galois groups
• Unit lattices of D₄-quartic number fields with signature (2,1)

Related

• Square-free smooth polynomials in residue classes and generators of irreducible polynomials
• Power-free values, repulsion between points, differing beliefs and the existence of error
• Square-free values of polynomials evaluated at primes over a function field
• Squarefree parts of polynomial values
• Irreducible integer-valued polynomials with prescribed minimal power that factors non-uniquely