---
title: "Fundamental Counting Principle | Combinatorics"
description: "Fundamental Counting Principle is the rule for counting multi-step outcomes by multiplying choices in Combinatorics, like passwords, permutations, and sequences."
canonical: "https://fiveable.me/combinatorics/key-terms/fundamental-counting-principle"
type: "key-term"
subject: "Combinatorics"
unit: "Unit 2"
---

# Fundamental Counting Principle | Combinatorics

## Definition

The Fundamental Counting Principle says that if one step has n choices and another has m choices, the total number of outcomes is n × m. In Combinatorics, you use it to count multi-step arrangements and sequences.

## What It Is

The Fundamental Counting Principle is the multiplication rule you use in Combinatorics when a process happens in stages. If one step can happen in n ways and a second step can happen in m ways, then the full process can happen in n × m ways.

That idea extends to any number of steps. If a problem has three choices, four choices, and two choices in order, the total number of outcomes is 3 × 4 × 2 = 24. You do not list every possibility one by one unless the problem is tiny. Instead, you break the task into stages and multiply.

This works best when the choices are independent in the counting sense, meaning you can count each stage separately. For example, if you are making a code with 3 letters followed by 2 digits, and repetition is allowed, you count letters and digits separately, then multiply the results. The principle is about structure, not about whether the items are “related” in a real-world sense.

A common place this shows up is permutations without repetition. There, the number of choices changes after each pick because you remove items from the pool. If you arrange 5 distinct books in order, the first spot has 5 choices, the second has 4, then 3, then 2, then 1. The Fundamental Counting Principle turns that into 5 × 4 × 3 × 2 × 1.

The main habit to build is this: look for stages, count each stage carefully, then multiply. If the situation has a condition like “no repetition,” “must start with a vowel,” or “cannot repeat a digit,” that condition changes the number of choices in one or more steps. The principle still works, but you have to update the counts before multiplying.

## Why It Matters

The Fundamental Counting Principle is the starting move for a lot of Combinatorics problems. Before you can count permutations, restricted arrangements, or password-style codes, you need a reliable way to combine several choice sets into one total.

It also keeps you from making the two classic counting mistakes: adding when you should multiply, or multiplying without adjusting for restrictions. If a problem asks for the number of license plates, seating orders, or multi-part codes, the setup usually comes down to identifying each stage and deciding whether the choices stay the same or shrink after each step.

That matters again in probability. To find the chance of a sequence of events, you often need the total number of possible outcomes first. The counting principle gives you that denominator, especially when the sample space is built from several positions or decisions.

Once you are comfortable with this rule, more advanced topics like permutations, restricted permutations, and combinations feel less random. You start seeing that many combinatorics problems are really just careful multiplication with the right restrictions attached.

## Connections

### Permutations

Permutations use the Fundamental Counting Principle when you arrange distinct objects in order. Each position has a number of choices, and those choices usually change as you place items. That is why permutation formulas are really counting-principle arguments written in a compact form.

### Factorial

Factorial notation is a shortcut for repeated multiplication, which is exactly what the Fundamental Counting Principle produces in many arrangement problems. For example, 5! means 5 × 4 × 3 × 2 × 1, the count you get when you place five distinct objects in order without repetition.

### [Restricted Permutations](/combinatorics/key-terms/restricted-permutations)

Restricted permutations add conditions like no adjacent items, a fixed starting position, or a banned arrangement. You still use the counting principle, but you count only the choices that satisfy the restriction at each step. The restriction changes the multiplication setup.

### Combinations

Combinations also involve counting, but order does not matter. The Fundamental Counting Principle often appears first when you count ordered outcomes, then combinations step in when you need to remove overcounting caused by different orders representing the same group.

## On the AP Exam

On a problem set or quiz, you usually use the Fundamental Counting Principle by labeling each stage of the situation and multiplying the number of choices in each stage. If the question says a password has 2 letters followed by 3 digits, you count letters for the first part and digits for the second part, then multiply. If repetition is not allowed, you reduce the available choices after each pick.

You may also see it inside permutation questions, especially when the arrangement has a condition like “all different,” “no repeats,” or “specific positions.” The fastest path is often to write the stages in order, count each stage, and check whether any restriction changes later choices. A good answer shows the setup, not just the final number.

## Fundamental Counting Principle vs Combination

The Fundamental Counting Principle counts total outcomes across stages, while combinations count selections where order does not matter. If you are building a multi-step arrangement, you usually multiply. If you are choosing a group and the order is irrelevant, you usually use combinations instead.

## Key Takeaways

- The Fundamental Counting Principle says to multiply the number of choices for each step of a multi-step process.
- It is the main counting move for ordered outcomes, especially when you are arranging items or building codes.
- If repetition is not allowed, the number of choices usually drops after each selection.
- Many permutation and restriction problems are really counting-principle problems in disguise.
- Always ask whether the problem has stages, because that is the signal to count each stage and multiply.

## FAQs

### What is the Fundamental Counting Principle in Combinatorics?

It is the rule that says if one step has n choices and another step has m choices, then together they produce n × m outcomes. In Combinatorics, you use it for multi-step counting problems like arrangements, codes, and ordered selections.

### How do you use the Fundamental Counting Principle with no repetition?

You still multiply, but the number of choices changes after each pick. For example, if you arrange 4 distinct items, the first spot has 4 choices, the second has 3, then 2, then 1. The restriction changes the counts, not the rule itself.

### Is the Fundamental Counting Principle the same as a permutation?

No. The counting principle is the method, while a permutation is a type of counting problem where order matters. Permutations are often solved by applying the Fundamental Counting Principle repeatedly.

### What is a common mistake with the Fundamental Counting Principle?

The biggest mistake is adding choices when the situation has multiple steps. If the choices happen in sequence, you usually multiply. Another common error is forgetting that restrictions like no repetition change the number of choices in later steps.

## Related Study Guides

- [2.1 Permutations without repetition](/combinatorics/unit-2/permutations-repetition/study-guide/ygPSGuFNZ4EG76yw)

## About This Document

Canonical Fiveable pages are available as Markdown at the same path plus `.md`.

- [llms.txt](https://fiveable.me/llms.txt): index of Fiveable's sections and URL patterns
- [llms-full.txt](https://fiveable.me/llms-full.txt): complete subject and unit listing
- [MCP server](https://fiveable.me/mcp): call Fiveable as tools instead of fetching pages (`https://fiveable.me/api/mcp`)
- [MCP server for AP teachers](https://fiveable.me/mcp/teachers): a teacher's classes, assignments and AP-rubric grading (`https://fiveable.me/api/mcp/teacher`)

## Structured Data

```json
{"@context":"https://schema.org","@graph":[{"@type":"LearningResource","@id":"https://fiveable.me/combinatorics/key-terms/fundamental-counting-principle#resource","name":"Fundamental Counting Principle | Combinatorics","url":"https://fiveable.me/combinatorics/key-terms/fundamental-counting-principle","learningResourceType":"Concept explainer","educationalLevel":"AP® / High School","about":{"@id":"https://fiveable.me/combinatorics/key-terms/fundamental-counting-principle#term"},"audience":{"@type":"EducationalAudience","educationalRole":"student"},"dateModified":"2026-07-03T02:21:06.613Z","isPartOf":{"@type":"Collection","name":"Combinatorics Key Terms","url":"https://fiveable.me/combinatorics/key-terms"},"author":{"@type":"Organization","@id":"https://fiveable.me/editorial#content-team","name":"Fiveable Content Team","url":"https://fiveable.me/editorial","parentOrganization":{"@id":"https://fiveable.me/#organization"},"member":[{"@type":"Person","name":"Amanda DoAmaral","sameAs":["https://www.linkedin.com/in/adoamaral"]},{"@type":"Person","name":"Becky Bahr","sameAs":["https://www.linkedin.com/in/becky-bahr-b52743132"]}]},"publisher":{"@type":"Organization","name":"Fiveable","url":"https://fiveable.me"}},{"@type":"DefinedTerm","@id":"https://fiveable.me/combinatorics/key-terms/fundamental-counting-principle#term","name":"Fundamental Counting Principle","description":"The Fundamental Counting Principle says that if one step has n choices and another has m choices, the total number of outcomes is n × m. In Combinatorics, you use it to count multi-step arrangements and sequences.","url":"https://fiveable.me/combinatorics/key-terms/fundamental-counting-principle","inDefinedTermSet":{"@type":"DefinedTermSet","name":"Combinatorics Key Terms","url":"https://fiveable.me/combinatorics/key-terms"}},{"@type":"FAQPage","mainEntity":[{"@type":"Question","name":"What is the Fundamental Counting Principle in Combinatorics?","acceptedAnswer":{"@type":"Answer","text":"It is the rule that says if one step has n choices and another step has m choices, then together they produce n × m outcomes. In Combinatorics, you use it for multi-step counting problems like arrangements, codes, and ordered selections."}},{"@type":"Question","name":"How do you use the Fundamental Counting Principle with no repetition?","acceptedAnswer":{"@type":"Answer","text":"You still multiply, but the number of choices changes after each pick. For example, if you arrange 4 distinct items, the first spot has 4 choices, the second has 3, then 2, then 1. The restriction changes the counts, not the rule itself."}},{"@type":"Question","name":"Is the Fundamental Counting Principle the same as a permutation?","acceptedAnswer":{"@type":"Answer","text":"No. The counting principle is the method, while a permutation is a type of counting problem where order matters. Permutations are often solved by applying the Fundamental Counting Principle repeatedly."}},{"@type":"Question","name":"What is a common mistake with the Fundamental Counting Principle?","acceptedAnswer":{"@type":"Answer","text":"The biggest mistake is adding choices when the situation has multiple steps. If the choices happen in sequence, you usually multiply. Another common error is forgetting that restrictions like no repetition change the number of choices in later steps."}}]},{"@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Combinatorics","item":"https://fiveable.me/combinatorics"},{"@type":"ListItem","position":2,"name":"Key Terms","item":"https://fiveable.me/combinatorics/key-terms"},{"@type":"ListItem","position":3,"name":"Unit 2","item":"https://fiveable.me/combinatorics/unit-2"},{"@type":"ListItem","position":4,"name":"Fundamental Counting Principle"}]}]}
```