TOPICS
Search

Integer Polynomial


A polynomial of the form

 f(x)=a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0

having coefficients a_i that are all integers. An integer polynomial gives integer values for all integer arguments of x (Nagell 1951, p. 73). The set of integer polynomials is denoted Z[x]. Integer polynomials are sometimes also called "integral polynomials," although this usage should be deprecated due to its confusing use of the term "integral" as an adjective.

An integer polynomial is called primitive if the greatest common divisor (a_0,a_1,...,a_n)=1.


See also

Algebraic Equation, Gauss's Polynomial Theorem, Integer-Representing Polynomial, Polynomial, Prime Divisor

Explore with Wolfram|Alpha

References

Nagell, T. "Prime Divisors of Integral Polynomials" and "Divisibility of Integral Polynomials with Regard to a Prime Modulus." §25 and 29 in Introduction to Number Theory. New York: Wiley, pp. 73, 81-83, and 93-98, 1951.

Referenced on Wolfram|Alpha

Integer Polynomial

Cite this as:

Weisstein, Eric W. "Integer Polynomial." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/IntegerPolynomial.html

Subject classifications