This analysis reveals polynomial factorization behavior with prime numbers, indicating new irreducibility criteria.
In this paper, we study the irreducibility of polynomials of the form \( f(X) + p^k g(X) \), where \( f(X) \) and \( g(X) \) are polynomials with integer coefficients, \( p \) is a prime number, and \( k \) is a positive integer. Unlike previous results, we do not require \( f(X) \) and \( g(X) \) to be relatively prime or impose any conditions on \( (k, g) \). We prove that, for all but finitely many primes \( p \), the polynomial \( f(X) + p^k g(X) \) is either irreducible over \( Q \) or factors into polynomials whose degrees are multiples of \( (k, g) \). This generalizes and extends earlier work on the irreducibility of such polynomials.
No takes yet. Share an insight, caveat, or question.
Chandoul et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: