Search results
Jump to navigation
Jump to search
- ...'', resulting from division of ''a'' by ''b''. This is the basis for the [[Euclidean algorithm]] for computing [[greatest common divisor]]s.10 KB (1,566 words) - 08:34, 2 March 2024
- ...is not immediately obvious. In fact, it is a significant result.<ref>The [[Euclidean algorithm]] may be used to show that <math>\scriptstyle\mathbb{Z}</math> is a [[princ14 KB (2,281 words) - 12:20, 13 September 2013
- (the [[Euclidean algorithm]]; ''Elements'', Prop. VII.2) and the first known proof of the [[infinitude ...t., p. 42).</ref> this is a procedure close to (a generalisation of) the [[Euclidean algorithm]], which was probably discovered35 KB (5,526 words) - 11:29, 4 October 2013