[ot] Re: [PD] permutations

Krzysztof Czaja czaja at chopin.edu.pl
Fri Jan 25 14:43:38 CET 2002


hi Orm,

this is from MathWorld:

Permutation: The rearrangement of elements in an ordered list S
into a one-to-one correspondence with S itself, also called an
"arrangement number" or "order."  The number of permutations on
a set of elements is given by n! (n factorial).

Combination: The number of ways of picking k _unordered_ outcomes
from n possibilities.  Also known as the binomial coefficient or
choice number [...] For example [for n==4, k==2] there are 6
combinations on {1,2,3,4}, namely {1,2}, {1,3}, {1,4}, {2,3},
{2,4}, and {3,4}.

yKzzsofrt

Orm Finnendahl wrote:
> 
> hi Krzyzstof,
...




More information about the PD-ot mailing list