Counting Principles


Basic Counting Principles

  • The product rule Suppose that a procedure can be broken into a sequence of two tasks. If there are m ways $(|A|)$ to do the first task and n ways $(|B)$ to do the second task, then there are $m x n$ $(|A|$ x $|B|)$ to do the procedure.

  • Theorem: If $ S =n, then$ $ P(S) = 2^n$