Difference between revisions of "Template:AotD"

Revision as of 17:39, 22 January 2008

Permutation

A permutation of a set of $r$ objects is any rearrangement (linear ordering) of the $r$ objects. There are $r!$ (the factorial of $r$ ) permutations of a set with $r$ distinct objects.
One can also consider permutations of infinite sets. In this case, a permutation of a set $S$ is simply a bijection between $S$ and... [more]

@@ Line 1: / Line 1: @@
 <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours">
-===[[Euclidean algorithm]]===
+===[[Permutation]]===
-{{WotWAlso}}
+A '''permutation''' of a [[set]] of <math>r</math> objects is any rearrangement (linear ordering) of the <math>r</math> objects.  There are <math>r!</math> (the [[factorial]] of <math>r</math>) permutations of a set with <math>r</math> distinct objects.
-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]]]
+One can also consider permutations of [[infinite]] sets.  In this case, a permutation of a set <math>S</math> is simply a [[bijection]] between <math>S</math> and... [[Permutation|[more]]]
 </blockquote>

Page

Toolbox

Search

Difference between revisions of "Template:AotD"

Revision as of 17:39, 22 January 2008

Permutation