We define the regular Euclidean algorithm and the general form which leads to the method of least absolute remainders and also the method of negative remainders. We show that if looked from the perspective of subtraction, the method of least absolute remainders and the regular method have the same number of steps which is in fact the minimal number of steps possible. This enables us to determine the most efficient way to untangle a rational tangle.
David Gauld, Professor of Mathematics, University of Auckland, Auckland, New Zealand
Johar, M. Syafiq
"Minimal Number of Steps in the Euclidean Algorithm and its Application to Rational Tangles,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 16
, Article 3.
Available at: https://scholar.rose-hulman.edu/rhumj/vol16/iss1/3