In the Euclidean algorithm, which statement is always true?
The remainder is always greater than the divisor
The remainder is always less than the divisor AND the next step uses the current remainder as the new divisor
The quotient decreases at each step
The algorithm terminates when the remainder equals the divisor