Prove Theorem 2.6.6 by induction on the number of elements.
Theorem 2.6.6
The number of permutations of a set of n elements is n!.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.