ConceptStep · learning platform for computer science

Permutations with repetition

Combinatorics · Lesson

First biennium

Permutations with repetition

When some elements are equal, swapping equal copies does not create a new arrangement. We therefore divide by the factorials of the multiplicities.

Key idea
Formula matematica
Similar example
Formula matematica

Prerequisites: Simple permutations and factorial

Goal: Remove duplicates caused by repeated elements using n!/(n1!n2!…).

Interactive laboratory

Explore before calculating

Change the data, observe how the number of cases changes, and use the lab to understand the counting structure you are using.

M-COMB-04

Loading laboratory…

Try it now

First count the total number of symbols, then the repetitions of each symbol.

Guided

Completed exercises: 0/5 · Correct on first attempt: 0

How to reason

Imagine temporarily labelling the equal copies: you would have n! arrangements, but many represent the same anagram.

Data / situation: How many distinct anagrams does the sequence AABBCC have?

Formula matematica
Your competency map

What you need to know for Permutations with repetition

ConceptStep separates what is required from what is recommended or useful as reinforcement. Only required prerequisites block your progress.

Current topic Strong skill Review due Needs reinforcement To be mastered Optional support

Relationships: solid line = required · dashed line = recommended · dotted line = reinforcement.

GUIDED LEARNING PATHS

Want to choose the next skill to develop?