Theorem 1.7. There is an algorithm to find the quotient $q=[a / b]$, when the $2 n$-bit integer $a$ is divided by the integer $b$ having no more than $n$ bits, using $O(M(n))$ bit operations, where $M(n)$ is the number of bit operations needed to multiply two $n$-bit integers.