You are on page 1of 1

# COUNTING

The Product Rule applied when a procedure is made up of separate tasks Examples: 1. A company with just two employees Sanchez and Patel rents a floor of a building with 12 offices. How many ways are there to assign different offices of these two employees? Sol. Sanchez Patel n1 = 12 n2 = 11 n1n2 = (12)(11) = 132 ways

2. How many bit strings of length seven are there? Sol. 2 . 2 . 2 . 2 . 2 . 2 . 2 = 27 = 128 ways 3. How many different license plates are available if each plate contains a sequence of three letters followed by 3 digits (and no sequence prohibited, even if they are obscene)? 26 . 26 . 26 . 10 . 10 = 17,576,000 ways [aA-zZ] [0-9]

The Sum Rule if a task can be done in one of n1 or in one of n2 ways where none of the set of n1 ways is the same as any of the set of n2 ways, then there are n1 + n2 ways to do the task. 1. Suppose that either a member of the mathematics faculty or a student who is a mathematics major is chosen a s a representative to a University committee. How many different choices are there for this representative if there are 37 members of the mathematics faculty and 83 mathematics majors and no one is both a faculty member and a student? Sol. (one way) Faculty = 37 ways Student = 83 ways 37 + 83 = 120 ways to choose a representative