Integer factorization for large integers appears to be a difficult problem.

Roughly, this means that these quantities approximate each other for all sufficiently large integers 'n'.

Any larger integer can be obtained by adding some number of 6's to the appropriate partition above.

In this form, the integers larger than 11/2 appear as negative numbers.

It is often not convenient to square a large integer so a selected part of the key may be squared instead.

It allowed a quantum computer to factor large integers quickly.

The result depends on how division is implemented, and can either be zero, or sometimes the largest possible integer.

For instance, a practical quantum computer could easily factor large integers, allowing them to break most cryptographic systems.

Despite having larger integers 128:81 is less dissonant than 14:9, as according to limit theory.

Although the regular numbers appear dense within the range from 1 to 60, they are quite sparse among the larger integers.