Difference between revisions of "Template:AotD"

Latest revision as of 18:28, 15 September 2008

Inactive.

@@ Line 1: / Line 1: @@
 <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours">
-===[[Euclidean algorithm]]===
+Inactive.
-The '''Euclidean algorithm''' (also known as the '''Euclidean division algorithm''' or '''Euclid's algorithm''') is an algorithm that finds the [[greatest common divisor]] (GCD) of two elements of a [[Euclidean domain]], the most common of which is the [[nonnegative]] [[integer]]s <math>\mathbb{Z}{\geq 0}</math>, without [[factoring]]
 </blockquote>