Number TheoryHardFactors & Multiples
Factors & Multiples · Hard problem
Running the Euclidean algorithm on and starts with , takes exactly three divisions in all, and gives . How many values of are possible?
Running the Euclidean algorithm on and starts with , takes exactly three divisions in all, and gives . How many values of are possible?