AFDA.DA.3.h

Calculate the number of permutations of 𝑛 objects taken 𝑟 at a time, without repetition.

Example Problems
Ravi bought 4 newly released comic books and wants to line them up on his shelf in some order.

How many
unique arrangements can Ravi make?
A digital security lock uses the six distinct letters A – F, and its code requires all six letters with none repeated.

How many unique codes can be formed?
A service robot has 6 maintenance tasks to perform overnight. Each task must be done exactly once, and the sequence affects efficiency.

How many
unique task schedules can the robot follow?
Khan Academy Resources
Goblins

1-on-1 AI tutoring aligned to AFDA.DA.3.h. 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 →