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 this way was originally considered by . They asked for the largest number with a given complexity ; later, Selfridge showed that this number is For example, when , and the largest integer that can be expressed using ten ones is . Its expression is Thus, the complexity of an integer is at least . The complexity of is at most (approximately ): an expression of this length for can be found by applying Horner's method to the binary representation of . Almost all integers have a representation whose length is bounded by a logarithm with a smaller constant factor,