Combinatorics and Probability

Combinatoric Basics:
Permutations: the number of ways to choose n elements from a set with order
mattering
Combinations: the number of ways to choose n elements from a set without order
mattering
There will always be more permutations than combinations
For example: set (A,B,C); choose 2 without order mattering => (A,B),(A,C),(B,C)
However, for order mattering => (A,B),(B,A)…..
Factorials
n! = n(n-1)(n-2)(n-3)…(2)(1)
n! represents the number of ways a set with n elements can be ordered, assuming all
elements are distinct
For example: how many ways are there to order 4 people in a line?
Permutation Formula
n!/(n-r)! where n is the number of elements in the set and r is the number of elements
being chosen from the set
For use when order matters!
Ex: find the number of ways you can choose 3 elements from a set of 7 elements with
order mattering

]
Problem1
AMC Problems