Factors & Multiples · Medium problem

How many divisions does the Euclidean algorithm perform to compute $\gcd(1001, 767)$, counting the final division that leaves remainder $0$?