Answer:
40320 different ways
Step-by-step explanation:
That problem is a permutation one
We have eight people to occupy one position in a team, without any constraint at all
So
Total number of events = P(8)
P (8) = 8!
P (8) = 8*7*6*5*4*3*2*1
P (8) = 40320 different ways
Answer:
I think its correct
Step-by-step explanation:
booooooooom
Whole number
integer
natural number
rational
<span>To do this, let f(1) = 5 and f(n) = f(n-1) for n greater than 1. This is recursive rule and each term is the same because it eventually becomes f(1), which is 5.</span>
