A Supplement to J. Shallit's Paper 'Origins of the Analysis of the Euclidean Algorithm'

As early as the 16th century, Simon Jacob, a German reckoning master, noticed that the worst case in computing the greatest common divisor of two numbers by the Euclidean algorithm occurs if these numbers are equimultiples of two consecutive members of the Fibonacci sequence.