Integer (computer science) at least 32 bits on any computer. Programmers may also incorrectly assume that a pointer can be converted to an integer without loss of information, which may work on (some) 32-bit computers, but fail on 64-bit computers with 64-bit pointers and 32-bit integers. A "short integer" can represent a whole number that may take less storage, while having a smaller range, compared with a standard integer on the same machine. In C, it is denoted by short. It is required to be at least 16 bits, and is often smaller than a standard integer, but this is not required. A
Integer-valued polynomial Integer-valued polynomial In mathematics, an integer-valued polynomial (also known as a numerical polynomial) "P"("t") is a polynomial whose value "P"("n") is an integer for every integer "n". Every polynomial with integer coefficients is integer-valued, but the converse is not true. For example, the polynomial takes on integer values whenever "t" is an integer. That is because one of "t" and "t" + 1 must be an even number. (The values this polynomial takes are the triangular numbers.) Integer-valued polynomials are objects of study in their own right in algebra, and frequently appear in algebraic topology. The class of integer-valued polynomials