Prime values of reducible polynomials, II

DOI10.4064/AA104-2-2zbMATH Open1152.11340arXivmath/0510357OpenAlexW2059208884MaRDI QIDQ4548874FDOQ4548874

Gabor Kun, Gábor Pete, Imre Z. Ruzsa, Ádám Timár, Yonggao Chen

Publication date: 27 August 2002

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: The Schinzel hypothesis claims (but it seems hopeless to prove) that any irreducible Q[x] polynomial without a constant factor assumes infinitely many prime values at integer places. On the other hand, it is easy to see that a reducible Q[x] polynomial can have only finitely many such places. In this paper we prove that a reducible Z[x] polynomial of degree n (where n is not 4 or 5) can have at most n+2 such places, and there exist examples with n+1 places. If the Schinzel hypothesis and the k-prime-tuple conjecture are true, then there are also polynomials with n+2 such places. (For n=4 or 5 the maximum possible value is 8.) If a Z[x] polynomial is the product of two non-constant integer-valued Q[x] polynomials, then there are at most 1.87234...n+o(n) such places. Even in this case, the number of integer places with positive prime values is at most n. More generally, if f=gh in R[x] is a product of two non-constant real polynomials, then the number of real places x such that |g(x)|=1 or |h(x)=1|, while f(x)>1, is at most n. For a natural complex version of this last statement we give a counterexample. Furthermore, we briefly consider the generalized problem of assuming values in a fixed finite set of integers.

Full work available at URL: https://arxiv.org/abs/math/0510357

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32)

Cited In (2)

• On prime values of reducible quadratic polynomials
• Prime values of reducible polynomials, I

   Recommendations

• Irregularities in the Distribution of Irreducible Polynomials 👍 👎
• On polynomials with only rational roots 👍 👎
• On the number of irreducible polynomials with 0,1 coefficients 👍 👎
• The distance to square-free polynomials 👍 👎
• Prime values of polynomials and irreducibility testing 👍 👎
• Reducibility of polynomials \(f(x,y)\) modulo \(p\) 👍 👎
• On the characterization of additive functions with quadratic arguments 👍 👎
• On the greatest prime factor of $prod^{x}_{k=1}f(k)$ 👍 👎
• Title not available (Why is that?) 👍 👎
• Reducibility of lacunary polynomials, VIII 👍 👎

This page was built for publication: Prime values of reducible polynomials, II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4548874)