Count the ways to arrange r items chosen from n when order matters: rankings, passwords, seating plans.
P(n, r) = n! ÷ (n − r)! · with repetition: nʳ
Example: gold, silver and bronze among 10 runners: P(10, 3) = 10 × 9 × 8 = 720. A 4-digit PIN with repetition: 10⁴ = 10,000.
Permutation or combination?
Ask whether rearranging the same items creates a different outcome. Race positions, passwords and seating plans depend on order, so they are permutations. Lottery numbers, committee members and pizza toppings don’t, so they are combinations. For the same n and r there are always r! times more permutations than combinations.