Answer:C. [tex]\frac{n!}{k!(n-k)!}[/tex]
Step-by-step explanation:
We know that a combination is a collection of the items where the order doesn't matter. It is a way to calculate the total outcomes of an event where order of the outcomes does not matter. It is denoted by C(n,k) or (n,k) or (n/k).
The formula for the number of combinations of n things taken r at a time is given by :-
[tex]C(n,k)=(n/k)=\frac{n!}{k!(n-k)!}[/tex]
Hence, C is the right option.
Combination helps us to find the number of ways. The correct definition that describes the combination (n/k) is [tex](n/k) = \dfrac{n!}{k!(n-k)!}[/tex].
A combination helps us to find the number of ways something can be selected from a set. It is given by the formula,
[tex]^nC_r = C(n,r) = (n/r) = \dfrac{n!}{r!(n-r)!}[/tex]
Where n is the total number of choices in the set, r is the number of choices we want.
Given to us
(n/k)
The correct definition that describes (n/k) using the combination formula
[tex](n/k) = \dfrac{n!}{k!(n-k)!}[/tex]
Hence, the correct definition that describes the combination (n/k) is [tex](n/k) = \dfrac{n!}{k!(n-k)!}[/tex].
Learn more about Combination:
https://brainly.com/question/11732255
