We will investigate how to evaluate the permutations.
A permutation is a special function that is used for counting principle. It allows for counting objects in a space of ( n ) with ( r ) number of objects to be re-arranged in that space with significance given to the order in which the objects are arranged.
The general notation used to evaluate permutations is as such:
The special function of permutations ( P ) is approximated by the factorial composition as follows:
We will use the above notation and relation to determine the number of ways 5 objects can be arranged regardless of order in a space of 8.
Therefore, the solution to the expression is: