Permutations and Combinations
Factorial
In probability, a system of counting occurs frequently which involves a series of multiplications of the form:
$$n! = n ⋅ (n - 1) ⋅ (n - 2) ⋅ (n - 3) .... 2 ⋅ 1$$This function has the name factorial, and has the symbol '!'.
For example, 6! = 6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 ( = 720)
1! = 1, and 0! = 1 (careful: 0! is NOT equal to zero)
Factorials can be divided by other factorials: ${6!}/{4!} = {6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1}/{4 ⋅ 3 ⋅ 2 ⋅ 1} = {6 ⋅ 5} = 30$
Permutations
A permutation of a group of symbols is this group in any arrangement in a definite order.
e.g the numbers 1, 2, 3 may be organised in the orders: 123, 132, 213, 231, 312, 321.
There are 6 (3!) possible permutations for 3 symbols. There are 24 (4!) possible permutations for 4 symbols, and 120 possible permutations for 5 (5!) symbols.
Rule: n symbols may be arranged n! ways.
Permutations of sub-sets
The number of ways 5 items may be arranged, taking 3 at a time is: ${5!}/{2!} = 5 ⋅ 4 = 20$
Rule: n symbols taken r at a time may be arranged in ${n!}/{(n - r)!}$ ways.
6 cards taken two at a time form ${n!}/{(n - r)!} = {6!}/{(6 - 2)!} = {6!}/{4!} = 6 ⋅ 5 = 30$ pairs, where the order is important: (1,2) is different to (2,1).
This can be written as:
$$_nP_r = {n!}/{(n - r)!}$$Combinations
In $_nP_r$ the order of the sub-set of r items is important. In many cases, the order is not relevant. For example, in dealing hands of cards, the player can rearrange the cards he is dealt.
Therefore, if the order of the sub-set is not important, there are fewer combinations possible. This quantity is given the symbol C.
$$_nC_r = {n!}/{{(n - r)!}r!}$$Content © Andrew Bone. All rights reserved. Created : January 1, 2015
Latest Item on Science Library:
The most recent article is:
Air Resistance and Terminal Velocity
View this item in the topic:
and many more articles in the subject:
Subject of the Week
Resources
Science resources on ScienceLibrary.info. Games, puzzles, enigmas, internet resources, science fiction and fact, the weird and the wonderful things about the natural world. Have fun while learning Science with ScienceLibrary.info.
Great Scientists
Charles Babbage
1791 - 1871
Charles Babbage was a polymath, who is most famous for his development of mechanical computational machines.
- No matches
Quote of the day...
Nature and nature's laws lay hid in night;
God said "Let Newton be" and all was light.
