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 complexity Integer complexity In number theory, the integer complexity of an integer is the smallest number of ones that can be used to represent it using ones and any number of additions, multiplications, and parentheses. It is always within a constant factor of the logarithm of the given integer. For instance, the number 11 may be represented using eight ones: However, it has no representation using seven or fewer ones. Therefore, its complexity is eight. The complexities of the numbers 1, 2, 3, ... are The smallest numbers with complexity 1, 2, 3, ... are The question of expressing integers in