Our Discord hit 10K members! 🎉 Meet students and ask top educators your questions.Join Here!

## Educators

### Problem 1

Use mathematical induction to verify the formula derived in Example 2 for the number of moves required to complete the Tower of Hanoi puzzle.

Bryan L.

### Problem 2

a) Find a recurrence relation for the number of permutations of a set with n elements.
b) Use this recurrence relation to find the number of permutations of a set with n elements using iteration.

Bryan L.
A vending machine dispensing books of stamps accepts only one-dollar coins, $\$ 1$bills, and$\$5$ bills.
a) Find a recurrence relation for the number of ways to deposit $n$ dollars in the vending machine, where