Mathematics · Grade 11 · Sequences and Series · Term 4

Permutations and Combinations

Distinguishing between permutations and combinations and applying formulas to count arrangements and selections.

• Ontario Curriculum Expectations
• HSS.CP.B.9

About This Topic

Permutations count the arrangements of items where order matters, such as lining up players for a relay race or creating access codes. Combinations count selections where order does not matter, like picking a team from a roster or choosing toppings for a pizza. Grade 11 students learn to identify which formula fits each scenario: P(n,r) = n! / (n-r)! for permutations and C(n,k) = n! / (k!(n-k)!) for combinations. They solve problems by calculating total possibilities without exhaustive listing.

In the sequences and series unit, this topic builds counting principles toward probability and binomial expansions. Students analyze how 'n choose k' derives from Pascal's triangle and applies to real contexts, like election ballots or genetics. Key skills include logical differentiation of order-dependent situations and designing problems, such as scheduling tasks where sequence affects outcomes.

Active learning benefits this topic greatly since formulas can seem mechanical without context. When students manipulate objects to arrange seating or select groups, they experience why order changes counts. Collaborative challenges, like counting circuit paths or tournament brackets, spark discussions that clarify distinctions and reinforce formula use through trial and error.

Key Questions

1. Differentiate between situations that require permutations versus combinations.
2. Analyze how the 'n choose k' formula simplifies counting problems.
3. Design a scenario where the order of selection is critical to the outcome.

Learning Objectives

• Classify real-world scenarios as either permutations or combinations based on whether order is significant.
• Calculate the number of possible arrangements and selections using the permutation and combination formulas.
• Analyze the structure of the 'n choose k' formula to explain its derivation from factorial notation.
• Design a novel problem where the order of selection critically impacts the outcome, justifying the use of permutations.
• Compare and contrast the application of permutation and combination formulas in solving multi-step counting problems.

Before You Start

Introduction to Factorials

Why: Students need a solid understanding of how to calculate factorials before applying them in permutation and combination formulas.

Basic Counting Principles

Why: Familiarity with the fundamental counting principle (multiplication principle) helps students understand how permutations and combinations build upon basic enumeration methods.

Key Vocabulary

Permutation	An arrangement of objects in a specific order. The order of selection matters, so different orders are counted as distinct outcomes.
Combination	A selection of objects where the order of selection does not matter. Only the group of selected objects is considered, not the sequence in which they were chosen.
Factorial	The product of all positive integers up to a given integer, denoted by n!. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120.
'n choose k'	A notation, often written as C(n, k) or (n k), representing the number of combinations of choosing k items from a set of n items, where order does not matter.

Watch Out for These Misconceptions

Common Misconception

Order never matters, so always use combinations.

What to Teach Instead

Many scenarios depend on sequence, like passwords or race positions. Hands-on sorting of objects into ordered lines versus unordered sets helps students see the difference. Group debates on examples reveal when swapping items changes the count.

Common Misconception

Permutations and combinations give the same result for any n and k.

What to Teach Instead

P(n,k) exceeds C(n,k) except when k=1, due to order multiplication. Physical arrangements with blocks or cards let students count both ways and compare totals directly. Peer teaching in pairs corrects overgeneralization through shared trials.

Common Misconception

Factorials grow too fast to compute by hand.

What to Teach Instead

Students cancel terms in formulas before multiplying. Step-by-step simplification on whiteboards during group work builds confidence. Visual aids like tree diagrams show why shortcuts work without full factorial expansion.

Active Learning Ideas

Pairs Activity: Code vs Committee

Pairs list ways to arrange 4 digits into a PIN (permutation) and select 3 friends for a group project (combination). They calculate both using formulas, then swap papers to verify and discuss differences. Extend by adding repetitions or constraints.

25 min·Pairs

Small Groups: Scenario Sort and Solve

Provide cards with 8 real-world problems; groups sort into permutation or combination piles, justify choices, and compute answers. Share one from each pile with the class for consensus. Use problems like license plates or jury selection.

35 min·Small Groups

Whole Class: Path Counting Game

Project a grid; class votes on paths from start to end, treating as permutations of moves. Calculate total paths together, then modify for combinations by ignoring order. Record results on board for visual comparison.

30 min·Whole Class

Individual: Design Your Problem

Students create one permutation and one combination scenario from daily life, write formulas, and solve. Pair share before submitting. Provide rubric focusing on context clarity and accuracy.

20 min·Individual

Real-World Connections

• In cryptography, the number of possible passwords or encryption keys is often calculated using permutations, as the order of characters is critical for security.
• Professional sports draft lotteries, like those in the NBA or NHL, use combinations to determine the order in which teams select players, as the specific group of players chosen is more important than the exact sequence of picks for a given team.
• Event planners use combinations to determine the number of ways to select committees or guest lists for events, where the specific group of attendees matters more than the order they were invited.

Assessment Ideas

Quick Check

Present students with three scenarios: 1) Arranging books on a shelf, 2) Choosing a committee of 3 from 10 people, 3) Creating a 4-digit PIN code. Ask students to identify each as a permutation or combination and briefly explain why.

Exit Ticket

Provide students with the formula for combinations, C(n, k) = n! / (k!(n-k)!). Ask them to explain in their own words what each part of the formula represents and how it accounts for order not mattering.

Discussion Prompt

Pose the question: 'When might a seemingly order-dependent situation actually be a combination problem, or vice versa?' Facilitate a class discussion where students share examples and justify their reasoning, challenging each other's assumptions.

Frequently Asked Questions

How do you distinguish permutations from combinations in Grade 11 math?

Ask if rearranging items creates a new outcome: yes for permutations (e.g., race order), no for combinations (e.g., pizza toppings). Practice with mixed scenarios builds quick judgment. Formulas confirm: permutations multiply positions sequentially, combinations divide by internal arrangements. Real-world ties like lotteries solidify the rule.

What real-world examples teach n choose k formula?

Use committee formation, card hands in poker, or genotype probabilities. Students compute C(10,3) for choosing 3 officers from 10. Connect to binomial theorem previews. Scaffold with Pascal's triangle construction first, then formula derivation, ensuring pattern recognition before abstract application.

How does active learning help teach permutations and combinations?

Manipulating cards, blocks, or tokens to count arrangements makes abstract order tangible. Small group challenges, like optimizing team selections, prompt error-spotting and formula justification. Whole-class simulations of paths or codes build collective understanding, turning rote memorization into intuitive mastery through collaboration and iteration.

Why include problem design in permutations unit?

Designing scenarios forces students to apply distinctions deeply, like order-critical scheduling versus unordered picks. It reveals partial grasp and extends to probability. Share and critique designs in groups to refine thinking. This mirrors assessment tasks, preparing for complex applications in stats or computer science.