The calculation that allows for calculating how many distinct objects can be placed in that same number of distinct places. It's defined as n x (n-1) x...x 2 x 1 = n!Permutation
The calculation that allows for calculating how many ways a number of objects n can be placed in distinct places k.and n is always greater than or equal to k.
Superpermutation
The string of terms that has within it all possible permutations. The minimum length of that string of terms is n! + (n-1)! + (n-2)! + n - 3
No comments:
Post a Comment
Hi there - I'm glad to see you are thinking about or maybe even getting ready to post a comment! I moderate all comments so please be patient while I hit the "ok" button on yours. Feel free to make suggestions on web resources to add, directions the entries should go,... whatever. And thanks again for leaving some feedback!