Difference between revisions of "Template:AotD"
(more link) |
(wotw also) |
||
| Line 1: | Line 1: | ||
<blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
===[[Euclidean algorithm]]=== | ===[[Euclidean algorithm]]=== | ||
| + | {{WotWalso}} | ||
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]]... [[Euclidean algorithm|[more]]] | 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]]... [[Euclidean algorithm|[more]]] | ||
</blockquote> | </blockquote> | ||
Revision as of 16:29, 21 January 2008
Euclidean algorithm
Template:WotWalso 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 integers
, without factoring... [more]
, without 
