The Euclidean algorithm offers a recipe for finding the greatest common divisor of two whole numbers. Suppose the given numbers are 12 and 18.

Niels Möller, On Schönhage's Algorithm and Subquadratic Integer GCD Computation, Mathematics of Computation, Vol. 77, No. 261 (Jan., 2008), pp. 589-607 ...

Applied Statistics of the Journal of the Royal Statistical Society was founded in 1952. It promotes papers that are driven by real life problems and that make a novel contribution to the subject.