# For each event, circle the most appropriate term. 50!/(50-5)!.5! Counting principle Combination Factorial Permutation

*print*Print*list*Cite

Expert Answers

justaguide | Certified Educator

The number of ways of choosing r objects from a set that has n objects is the number of possible combinations. C(n, r) = `(n!)/(r!*(n-r)!)`

Here, `(50!)/((50-5)!*5!)` = C(50, 5); this is the number of combinations of 5 elements from a set containing 50 distinct elements.

Student Comments

oldnick | Student

Combination of n element in k place with k<n is:

`[[n,],[k,]]=(n!)/(k!(n-k)!)`

Thus `(50!)/(5!(50-5))! = [[50,],[5,]]`

Therefore is a combination.