Mathematics · 11th Grade · Statistical Inference and Data Analysis · Weeks 19-27

Permutations and Combinations

Students will calculate permutations and combinations to determine the number of possible arrangements or selections.

• Common Core State Standards
• CCSS.Math.Content.HSS.CP.B.9

About This Topic

Counting methods are the backbone of probability calculations with large sample spaces. Permutations count ordered arrangements , the number of ways to arrange r items from n when order matters , while combinations count unordered selections when order does not matter. The key formulas are nPr = n!/(n-r)! and nCr = n!/[r!(n-r)!], and CCSS.Math.Content.HSS.CP.B.9 expects students to apply these in probability contexts.

Students often struggle to decide which formula to apply before calculating. The determining question is whether the order of selection changes the outcome. Seating 5 students in 5 chairs is a permutation (ABCDE is different from BACDE); choosing 3 students for a committee is a combination (ABC and BAC name the same committee). Building the habit of asking the order question before reaching for a formula is one of the most valuable things students can internalize in this topic.

Active learning is effective here because counting problems are puzzles that benefit from multiple perspectives. A problem that stumps one student often becomes clear when a partner draws a tree diagram or lists cases systematically. Structured partner work and problem-creating activities , where students write their own permutation and combination problems , deepen understanding more than solving sets of similar exercises.

Key Questions

1. Differentiate between permutations and combinations and when to apply each.
2. Explain how the concept of 'order' impacts the calculation of possibilities.
3. Construct a problem that requires the use of permutations and another that requires combinations.

Learning Objectives

• Calculate the number of permutations for arranging items when order is important.
• Calculate the number of combinations for selecting items when order is not important.
• Compare and contrast the application of permutation and combination formulas in problem-solving scenarios.
• Construct original word problems that require the use of permutation calculations.
• Construct original word problems that require the use of combination calculations.

Before You Start

Basic Probability

Why: Students need a foundational understanding of probability concepts to apply permutations and combinations in calculating the likelihood of events.

Introduction to Factorials

Why: The calculation of permutations and combinations relies heavily on the factorial operation, so students must be familiar with how to compute them.

Key Vocabulary

Permutation	An arrangement of objects in a specific order. The order in which items are selected or arranged matters.
Combination	A selection of objects where the order of selection does not matter. All that matters is which items are included.
Factorial	The product of all positive integers up to a given integer, denoted by n!. For example, 5! = 5 x 4 x 3 x 2 x 1 = 120.
Order Matters	A condition in counting problems where changing the sequence of selected items results in a different outcome or arrangement.

Watch Out for These Misconceptions

Common Misconception

Students use permutations when combinations are needed because they do not stop to ask whether order matters.

What to Teach Instead

Build the habit of making 'does order matter here?' the first written step for every counting problem. Small-group categorization activities using varied contexts , seating charts vs. selection committees , train this interrogative habit before any formula is introduced.

Common Misconception

Students treat n! as 'multiply n by itself', not as n × (n-1) × ... × 1.

What to Teach Instead

Explicitly connect factorial notation to its definition and have students expand several factorials by hand (or in small groups) before using a calculator. Misreading 5! as 5 × 5 leads to systematic errors throughout the unit.

Active Learning Ideas

Think-Pair-Share: Order or No Order?

Give pairs a list of ten word problems. Each pair independently labels each as a permutation or combination problem and writes a one-sentence justification before comparing with their partner. Disagreements are brought to the whole class for discussion, with students defending their reasoning.

20 min·Pairs

Inquiry Circle: Counting by Building

Small groups use physical objects (colored tiles, name cards) to manually list all permutations of 3 items from a set of 4, then all combinations. Groups count their results, apply the formula, and verify the match. The concrete count makes the division by r! in the combination formula tangible.

30 min·Small Groups

Problem Creation Workshop: Write Your Own Counting Problem

Each student writes one permutation problem and one combination problem set in a context meaningful to them (sports rosters, playlists, class schedules). Students exchange problems with a partner, solve each other's problems, and provide written feedback on whether the problem type matches the intended formula.

35 min·Pairs

Real-World Connections

• In cryptography, determining the number of possible passwords or encryption keys often involves permutations, as the order of characters is critical for security.
• Event planners use combinations to determine the number of ways to select guests for different table arrangements at a wedding reception, where the specific group of people at a table matters more than their seating order.

Assessment Ideas

Exit Ticket

Provide students with two scenarios: 1) Selecting the first, second, and third place winners in a race. 2) Choosing three students to represent the class on a committee. Ask students to identify which scenario requires permutations and which requires combinations, and to briefly explain why.

Quick Check

Present students with a problem: 'How many ways can you arrange the letters in the word MATH?' Ask them to write down the formula they would use (nPr or nCr) and calculate the answer. Check their work for correct formula application and calculation.

Discussion Prompt

Pose the question: 'Imagine you have 5 different colored marbles and you need to choose 2. When would the order you pick them in matter, and when would it not matter?' Facilitate a class discussion to help students articulate the difference between permutations and combinations.

Frequently Asked Questions

What is the difference between a permutation and a combination?

A permutation is an ordered arrangement , the sequence matters, so choosing A then B is different from choosing B then A. A combination is an unordered selection , the group is what matters, so {A, B} and {B, A} count as the same choice. Ask yourself: would switching the order produce a different result? If yes, use permutations; if no, use combinations.

How do I know which counting formula to use on a problem?

First, identify whether you are arranging (order matters) or selecting (order does not matter). If arranging, use nPr = n!/(n-r)!. If selecting, use nCr = n!/[r!(n-r)!]. Second, make sure you correctly identify n (total items) and r (items chosen). Writing these out explicitly before plugging into the formula prevents the most common errors.

Why does the combination formula divide by r factorial?

The permutation formula counts every ordering of the chosen items as distinct. When order does not matter, each group of r items has been counted r! times (once for each ordering of those same items). Dividing by r! collapses all those duplicate orderings into a single count, giving the number of unique selections.

How does active learning help students understand permutations and combinations?

The decision between permutations and combinations trips students up in algorithmic problem sets because they never practice the underlying judgment. Partner activities that require students to justify their formula choice before calculating , and problem-creation tasks where students design their own scenarios , build the conceptual reasoning that survives beyond the test.