### Free Educational Resources

• > Mathematics
• > Combinatorics Principles: Rules of Sum and Product
+

# Combinatorics Principles: Rules of Sum and Product

(1)
• (1)
• (0)
• (0)
• (0)
• (0)
Author: c o
##### Description:

To introduce the principle of sum
To introduce the principle of product
To apply these principles to the problem of determining the total number of subsets of a set

In this packet we learn about the combinatorial principle of sum and of product and we see examples of their application.

(more)

Sophia’s self-paced online courses are a great way to save time and money as you earn credits eligible for transfer to over 2,000 colleges and universities.*

No credit card required

28 Sophia partners guarantee credit transfer.

281 Institutions have accepted or given pre-approval for credit transfer.

* The American Council on Education's College Credit Recommendation Service (ACE Credit®) has evaluated and recommended college credit for 25 of Sophia’s online courses. More than 2,000 colleges and universities consider ACE CREDIT recommendations in determining the applicability to their course and degree programs.

Tutorial

## Background And Introduction

Before starting with this lesson, you should be familiar with basic set theory and with the notion of combinations and permutations.

# Introduction

When a number of different events have the possibility of happening, some in conjunction, and some in mutual exclusion, keeping track of the bigger picture can be a challenge.  Part of understanding this "bigger picture" often involves knowing how many different arrangements of events are possible, so that each one can be examined in turn.

In this lesson we investigate two fundamental principles for taking such an account.

## Motivating The Rules - Planning A Weekend

This video uses an example about making plans for the weekend to motivate the concepts central to this packet.

## Counting Subsets

We apply the rule of product and the rule of sum to count the number of total possible subsets of a set with n elements, and use these two differenct counts to establish a useful identity.