Math Notes-P1M5 - Part 1 Module 5 PDF

Preview

Summary

Part 1 Module 5...

Description

Wednesday, October 24, 2018

Math Notes Part 1 Module 5!

- Factorial Functions! • N! Is the number of ways to arrange n objects! • P (n,r)=n!/(n,r)! Is the number of ways to choose and arrange r distinct objects from a set of n objects!

• An outcome (a monetary sum) is determined entirely by which two choices are selected. The order in which they are chosen or arranged doesn't matter!

- Combination Formula! • C (n,r) is the number of combinations of n things taken from r at a time! • C (n,r)=n!/(n-r)!r! Is the number of outcomes when a counting problem involves selecting but not arranging r distinct items from a set of n items!

• An outcome is determined by selecting two different items from a set of 6 items in a context where order doesn’t matter!

• Unlike n! Problems or p(n,r) problems, there is no alternative way to solve a combination problem without using the formula

1...