Counting Principles: Combinations

Active learning helps students internalize the difference between permutations and combinations by moving beyond abstract formulas. When students physically sort and count groups, they confront the moment where order matters versus where it does not, creating lasting clarity. This hands-on engagement reduces reliance on rote memorization and builds intuitive understanding of why division by r! adjusts for overcounting in combinations.

• Grade 12
• Mathematics
• 4 activities
• 30 min–45 min

Learning Objectives

1. Calculate the number of combinations for selecting items from a set where order is irrelevant using the formula C(n, r) = n! / (r!(n-r)!).
2. Compare and contrast scenarios requiring permutations versus combinations, justifying the choice of method.
3. Analyze and apply adjustments to combination calculations when dealing with indistinguishable items within a set.
4. Explain the relationship between Pascal's Triangle and the combination formula, demonstrating how each row represents C(n, r) for a given n.

Stations Rotation

⏱ 35 min·Pairs

Sorting Cards: Permutations vs Combinations

Prepare 20 scenario cards, such as 'choose 3 toppings for pizza' or 'arrange 3 books on shelf'. Pairs sort cards into combinations or permutations piles and write justifications. Regroup to share and refine categorizations as a class.

Prepare & details

Compare permutations and combinations, identifying when each counting method is appropriate.

Facilitation Tip: During the Sorting Cards activity, circulate and listen for pairs debating whether two lists represent the same group; this is the moment to reinforce the definition of order irrelevance.

Setup: Tables/desks arranged in 4-6 distinct stations around room

Materials: Station instruction cards, Different materials per station, Rotation timer

• Remember
• Understand
• Apply
• Analyze
• Self-Management
• Relationship Skills

Stations Rotation

⏱ 45 min·Small Groups

Committee Selection Simulation

Give small groups 10 student name cards. Task them to count ways to select committees of 4 or 5 members, first assuming all distinct, then adjusting for identical roles. Groups record formulas and verify with calculators.

Prepare & details

Analyze how to adjust counting methods when items in a set are indistinguishable.

Facilitation Tip: In the Committee Selection Simulation, limit the group size to 8 to ensure manageable counts and visible repetition when order is ignored.

Setup: Tables/desks arranged in 4-6 distinct stations around room

Materials: Station instruction cards, Different materials per station, Rotation timer

• Remember
• Understand
• Apply
• Analyze
• Self-Management
• Relationship Skills

Stations Rotation

⏱ 40 min·Small Groups

Pascal's Triangle Build

Start with whole class modeling the first rows on board. In small groups, students use grid paper and colored markers to extend to row 10, verifying combinations formula for select entries. Discuss patterns observed.

Prepare & details

Justify why Pascal's Triangle is a visual representation of the combinations formula.

Facilitation Tip: When building Pascal's Triangle, have students label each entry with the corresponding C(n,r) value immediately to link visual patterns to combinatorial meaning.

Setup: Tables/desks arranged in 4-6 distinct stations around room

Materials: Station instruction cards, Different materials per station, Rotation timer

• Remember
• Understand
• Apply
• Analyze
• Self-Management
• Relationship Skills

Stations Rotation

⏱ 30 min·Individual

Indistinguishable Objects Puzzle

Individuals solve puzzles like counting distinct hands from identical/deck cards. Pairs compare solutions, adjust formulas, and present adjustments. Class votes on correct counts.

Prepare & details

Compare permutations and combinations, identifying when each counting method is appropriate.

Setup: Tables/desks arranged in 4-6 distinct stations around room

Materials: Station instruction cards, Different materials per station, Rotation timer

• Remember
• Understand
• Apply
• Analyze
• Self-Management
• Relationship Skills

Teaching This Topic

Teach combinations by anchoring them in real scenarios students find relevant, such as team selections or committees. Avoid starting with the formula; instead, let students grapple with counting identical outcomes to appreciate why division by r! is necessary. Research shows that students grasp the subtraction in n-r more easily when they first see why some items are excluded from the group entirely. Emphasize peer explanation over teacher correction to build durable understanding.

What to Expect

By the end of these activities, students will confidently distinguish when to use combinations versus permutations and correctly apply the formula C(n, r) = n! / (r!(n-r)!). They will justify their choices with concrete examples and adjust calculations for indistinguishable items without prompting. Peer discussion and shared corrections will strengthen both accuracy and conceptual reasoning.

Watch Out for These Misconceptions

Common Misconception

During the Sorting Cards activity, watch for students who treat two ordered lists as different even when they contain the same names, indicating they still confuse order with combination principles.

What to Teach Instead

Ask them to physically rearrange the cards and recount, then compare totals when order is ignored versus when it matters. Prompt them to explain why identical groups should count once in combinations.

Common Misconception

During the Indistinguishable Objects Puzzle, watch for students who count all arrangements as unique despite identical items, inflating the total.

What to Teach Instead

Have them swap identical objects within a group and ask if the arrangement has truly changed. Guide them to adjust the formula by dividing by the factorial of the counts of each indistinguishable type.

Common Misconception

During Pascal's Triangle Build, watch for students who see the triangle as a decorative pattern unrelated to combinations.

What to Teach Instead

After building each row, ask them to calculate C(n,0), C(n,1), C(n,2) for that row and compare results. Connect each entry to a concrete selection task to anchor meaning.

Assessment Ideas

Quick Check

After the Sorting Cards activity, present two scenarios: selecting 3 officers from 10 members versus selecting 3 members for a committee. Ask students to identify which scenario requires combinations and to write the correct formula with an explanation of their choice.

Discussion Prompt

During the Indistinguishable Objects Puzzle, pose the question: 'How would the count change if you had 5 identical red balls and 3 identical blue balls instead of distinct balls?' Facilitate discussion on adjusting the combination formula for indistinguishable items and compare strategies.

Exit Ticket

After the Pascal's Triangle Build activity, provide a triangle up to row 4 with blanks for rows 5 and 6. Ask students to fill in the next two rows, then identify which row corresponds to combinations of 6 items taken 0 through 6 at a time and write the C(n,r) notation for each value.

Extensions & Scaffolding

• Challenge students to create a scenario where the number of combinations with repetition exceeds the number of permutations without repetition for the same n and r.
• For students who struggle, provide sets of identical objects (e.g., counters, colored tiles) and ask them to list all unique groups before applying any formula.
• Deeper exploration: Have students research and present historical applications of combinations in voting systems or lottery designs, linking math to societal decisions.

Key Vocabulary

Combination	A selection of items from a set where the order of selection does not matter. For example, choosing two fruits from a basket of three.
Permutation	An arrangement of items from a set where the order of arrangement is important. For example, arranging letters in a word.
Indistinguishable Items	Items within a set that are identical and cannot be differentiated from one another, requiring modified counting methods.
Pascal's Triangle	A triangular array of binomial coefficients, where each number is the sum of the two numbers directly above it, visually representing combination values.