AFM.8.c

Using application-based problems, calculate the number of subsets of size r that can be chosen from a set of n elements, explaining this number as the number of combinations “n choose r.”

Example Problems
How many unique ways are there to arrange the letters in the word BALLOON?
How many unique ways are there to arrange the letters in the word COMMITTEE?
How many numbers between 1 and 100 (inclusive) are divisible by 4 or 5?
Goblins

1-on-1 AI tutoring aligned to AFM.8.c. Instant help for students, real-time insights for teachers.

Used in classrooms by 100,000+ students at Baltimore County, Plano ISD, Deer Valley USD, KIPP, and districts nationwide.

Free for teachers, forever →