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
Radical of an integer no known polynomial-time algorithm for computing the square-free part of an integer. The definition is generalized to the largest "t"-free divisor of "n", formula_5, which are multiplicative functions which act on prime powers as The cases "t"=3 and "t"=4 are tabulated in and . The notion of the radical occurs in the abc conjecture, which states that, for any "ε" > 0, there exists a finite "K" such that, for all triples of coprime positive integers "a", "b", and "c" satisfying "a" + "b" = "c", For any integer formula_8, the nilpotent elements of the finite ring formula_9 are all