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
Algebraic integer a finite extension . Algebraic integer In algebraic number theory, an algebraic integer is a complex number that is a root of some monic polynomial (a polynomial whose leading coefficient is 1) with coefficients in (the set of integers). The set of all algebraic integers, , is closed under addition and multiplication and therefore is a commutative subring of the complex numbers. The ring is the integral closure of regular integers in complex numbers. The ring of integers of a number field , denoted by , is the intersection of and : it can also be characterised as the maximal