(The values this polynomial takes are the triangular numbers.)
[1] The class of integer-valued polynomials was described fully by George Pólya (1915).
of polynomials with rational number coefficients, the subring of integer-valued polynomials is a free abelian group.
In other words, every integer-valued polynomial can be written as an integer linear combination of binomial coefficients in exactly one way.
The proof is by the method of discrete Taylor series: binomial coefficients are integer-valued polynomials, and conversely, the discrete difference of an integer series is an integer series, so the discrete Taylor series of an integer series generated by a polynomial has integer coefficients (and is a finite series).
Integer-valued polynomials may be used effectively to solve questions about fixed divisors of polynomials.
For example, the polynomials P with integer coefficients that always take on even number values are just those such that
Those in turn are the polynomials that may be expressed as a linear combination with even integer coefficients of the binomial coefficients.
In questions of prime number theory, such as Schinzel's hypothesis H and the Bateman–Horn conjecture, it is a matter of basic importance to understand the case when P has no fixed prime divisor (this has been called Bunyakovsky's property[citation needed], after Viktor Bunyakovsky).
By writing P in terms of the binomial coefficients, we see the highest fixed prime divisor is also the highest prime common factor of the coefficients in such a representation.
So Bunyakovsky's property is equivalent to coprime coefficients.
the product is divisible by 3, which follows from the representation with respect to the binomial basis, where the highest common factor of the coefficients—hence the highest fixed divisor of
[citation needed] The K-theory of BU(n) is numerical (symmetric) polynomials.