ConceptStep · learning platform for computer science

Combinations with repetition

Combinatorics · Lesson

First biennium

Combinations with repetition

When choosing k objects from n types, a type may repeat and order does not matter. Stars and bars transforms the problem into a simple combination.

Key idea
Formula matematica
Similar example
Formula matematica

Prerequisites: Simple combinations

Goal: Count unordered selections with repetition using stars and bars and C(n+k-1,k).

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-08

Loading laboratory…

Try it now

Represent the k selections with stars and separate the n types with n−1 bars.

Guided

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

How to reason

With k stars and n−1 bars there are n+k−1 symbols in total; choose where the k stars go (or equivalently the bars).

Data / situation: Choose 3 scoops from 5 flavours; flavours may repeat and order does not matter.

Formula matematica
Your competency map

What you need to know for Combinations 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?