If you denote this number by f(n), then we have the following equation by subtracting the bad possibilities from all possibilities: f(n)=n^n-sum_{k=1}^{n-1} f(k){n\choose k}(n-k)^{n-k} If by induction, you suppose that f(k)=k^{k-1} for k
|
1 | [made Community Wiki] | ||
|
|
||||
