# Rule of Sum and Rule of Product Problem Solving

This page is dedicated to problem solving on the notions of **rule of sum** (also known as **Addition Principle**) and **rule of product** (also known as **Multiplication Principle**). To solve problems on this page, you should be familiar with the following notions:

The rule of sum and the rule of product are two basic principles of counting that are used to build up the theory and understanding of enumerative combinatorics.

#### Contents

## Introduction

The rule of sum (Addition Principle) and the rule of product (Multiplication Principle) are stated as below.

Rule of Sum - Statement:If there are \( n\) choices for one action, and \( m\) choices for another action and the two actions cannot be done at the same time, then there are \( n+m\) ways to choose one of these actions.

Rule of Product - Statement:If there are \( n\) ways of doing something, and \( m\) ways of doing another thing after that, then there are \( n\times m\) ways to perform both of these actions.

Here is an example based on the above rules.

Calvin wants to go to Milwaukee. He can choose from \(3\) bus services or \(2\) train services to head from home to downtown Chicago. From there, he can choose from 2 bus services or 3 train services to head to Milwaukee. How many ways are there for Calvin to get to Milwaukee?

He has \( 3 + 2=5\) ways to get to downtown Chicago. (Rule of sum)

From there, he has \( 2+3=5\) ways to get to Milwaukee. (Rule of sum)

Hence, he has \( 5\times 5=25\) ways to get to Milwaukee in total. (Rule of product) \(_\square\)

Try the following problems.

Note: When you eat a course, you only pick one of the choices.

###### Image credit: Flickr Rasin Bun

## Examples

This section includes the basic examples and problems that will warm you up for the next section of problem solving.

Calvin wants to go to Milwaukee. He can choose from \(3\) bus services or \(2\) train services to head from home to downtown Chicago. From there, he can choose from 2 bus services or 3 train services to head to Milwaukee.

This time, he has to purchase a bus concession (which will only allow him to take buses), or a train concession (which will only allow him to take trains). If he only has money for \(1\) of these concessions, how many ways are there for him to get to Milwaukee?

If Calvin purchases a bus concession, he has \( 3 \times 2=6\) ways to get to Milwaukee. (Rule of product)

If Calvin purchases a train concession, he has \( 2\times3=6\) ways to get to Milwaukee. (Rule of product)

Hence, he has \( 6+6=12\) ways to get to Milwaukee in total. (Rule of sum) \(_\square\)

Six friends Andy, Bandy, Candy, Dandy, Endy and Fandy want to sit in a row at the cinema. If there are only six seats available, how many ways can we seat these friends?

For the first seat, we have a choice of any of the 6 friends. After seating the first person, for the second seat, we have a choice of any of the remaining 5 friends. After seating the second person, for the third seat, we have a choice of any of the remaining 4 friends. After seating the third person, for the fourth seat, we have a choice of any of the remaining 3 friends. After seating the fourth person, for the fifth seat, we have a choice of any of the remaining 2 friends. After seating the fifth person, for the sixth seat, we have a choice of only 1 of the remaining friend. Hence, by the rule of product, there are \( 6 \times 5 \times 4 \times 3 \times 2 \times 1 = 720\) ways to seat these 6 people. \(_\square\)

Note: More generally, this problem is known as a permutation. There are \( n! = n \times (n-1) \times (n-2) \times \cdots \times 1\) ways to seat \( n\) people in a row.

How many positive divisors does \( 2000 = 2^4 5^3\) have?

Any positive divisor of 2000 must have the form \( 2^a 5^b\), where \( a\) and \( b\) are integers satisfying \( 0 \leq a \leq 4, 0 \leq b \leq 3\). There are 5 possibilities for \( a\) and 4 possibilities for \( b\), and hence there are \( 5 \times 4 = 20\) (rule of product) positive divisors of 2000 in all. \(_\square\)

The following problems will take you through the practice of the two rules discussed above.

Then find the number of ways in which you can climb 11 steps?

**Bonus**: Generalize this for \(n\) steps.

## Problem Solving

This section contains the problems ranging from the simple problems to the hard ones. Try the listed problems and boost up your understanding in problem solving.

Naema goes to the store to buy juice for her birthday party. The store sells jugs of orange juice, apple juice, and cranberry juice. The store also sells frozen cans of grape juice, peach juice, mango juice, and pear juice. If Naema wants only one can or jug of juice, how many different choices does she have?

In an escape game, you have found a padlock with numbers from 1 to 60. You have previously found a piece of paper inside a clear bottle. On the piece of paper is a picture of a padlock and four clues:

1) Four numbers complete the sequence.

2) No two numbers are the same.

3) The second number is twice the third.

4) The third number is prime.

How many possible combinations exist for the padlock?

On the first day, he does \(1\) problem. On the second day, he does \(2\) problems. On the third day, he does \(3\) problems. This pattern continues on until the \(10\)th day. On the \(10\) th day, he does \(1+0=1\) problem. On the \(11\)th day, he does \(1+1=2\) problems. In general, on the \(\overline{ab}\)th day, he does \(a+b\) problems. Finally, on the \(100\)th day, he does \(1+0+0=1\) problem, completing his streak.

In total, how many problems did he do?

*Kaboobly Dooists*is a person who does a lot of Kaboobly Doo.

One winter evening, four Kaboobly Dooists, Alice, Bob, Charles and Dick come to see you. Unfortunately you had nothing for them except 5 apples, 4 oranges, 3 mangoes. And you do not wish to spend all 12 of the fruits on them as you wish to keep 8 for yourself. So, you give a total of 4 fruits, one fruit to each of them.

In how many ways can you do this?

Consider the pseudo-palindrome:

\[WAS IT A CAT I SAW.\]

In how many ways can \(WAS IT A CAT I SAW\) be read if you may start at any \(W\) and move only right, left, up, or down to adjacent letters? Keep in mind that each case can be counted twice since it is a palindrome and that the same letter can be used more than once in each sequence.

## See Also

**Cite as:**Rule of Sum and Rule of Product Problem Solving.

*Brilliant.org*. Retrieved from https://brilliant.org/wiki/rule-of-sum-and-rule-of-product-problem-solving/