DOI QR코드

DOI QR Code

IRREDUCIBLE POLYNOMIALS WITH REDUCIBLE COMPOSITIONS

  • Received : 2011.06.28
  • Accepted : 2011.07.16
  • Published : 2011.09.25

Abstract

In this paper we investigate criteria that for an irreducible monic quadratic polynomial f(x) ${\in}$ $\mathbb{Q}$[x], $f{\circ}g$ is reducible over $\mathbb{Q}$ for an irreducible polynomial g(x) ${\in}$ $\mathbb{Q}$[x]. Odoni intrigued the discussion about an explicit form of irreducible polynomials f(x) such that $f{\cric}f$ is reducible. We construct a system of infitely many such polynomials.

Keywords

References

  1. N. Ali, On the irreducibility for composition of polynomials. International Mathematical Forum, 4, (40), 2009, 2001-2008
  2. L. Danielson, B. Fein. On the irreducibility of iterates of $x^n-b$, The Americal Math. Soc. 130 (2011), 1589-1596.
  3. R.K.W. Odoni. The Galois theory of iterates and composites of polynomials, Prod. London Math Soc. (3), 51 (3), 1985, 385-414 https://doi.org/10.1112/plms/s3-51.3.385
  4. R.K.W. Odoni. On the prime divisors of the sequence $w_{n+1}=1+w_1{\cdot}{\cdot}{\cdot}w_n.$ J. London Math. Soc. 32 (1985), 1-11. https://doi.org/10.1112/jlms/s2-32.1.1