Perms and Coms Theory November 23/ 09

On this Monday morning we furthered into probability by beginning on Permutation and Combination. Permutation is a group of things organized where the order matters, and Combination is a group of things organized where the order is irrelevant. Examples of both are on the sheets below that were created by Mr. Maks during class.

This page simply explains both words and exemplifies their meanings.

This first page above shows an example of Perms where order matters and then also displays the formula to use when calculating Permutations. 'n' is the original number of options, which is factorial, you then divide that by the same number but subtract the amount of places to put the numbers into, this number is also factorial.

The next page beside it is pretty much self explanitory of what factorial means and further explains it.

This was a quick example of two poker hands that are the exact same, but doesn't matter! It is a combination not a permutation. Calculating card hands is one example of using the following formula.

This is the formula to evaluate combinations, not permutations.

I'm not too sure where in the lesson this was included, but it may be valuable to someone in the fundamental counting system. The numbers 33, 21, and 7 are irrelivant, but the fact that there are three numbers and you order them in 3 places. Which as shown is 3*2*1 and equals 6 ways to set up these numbers.