For each event, circle the most appropriate term. 50!/(50-5)!.5! Counting principle Combination Factorial Permutation
The number of ways of choosing r objects from a set that has n objects is the number of...
(The entire section contains 44 words.)
check Approved by eNotes Editorial
Combination of n element in k place with k<n is:
Thus `(50!)/(5!(50-5))! = [[50,],[5,]]`
Therefore is a combination.