When selecting subsets of a larger set in which order is not important, you are finding the number of ________ of n elements taken r at a time.
Fill in the blanks.

Respuesta :

Answer:

When selecting subsets of a larger set in which order is not important, you are finding the number of combination of n elements taken r at a time.

Step-by-step explanation:

We have to fill the blank.

When selecting subsets of a larger set in which order is not important, you are finding the number of combination of n elements taken r at a time.

Combination:

  • A combination is a selection of all or part of a set of objects from a larger set such that the order of selection is not important.
  • This is given by the formula:

[tex]C(n,r) = ^nC_r = \dfrac{n!}{r!(n-r)!}[/tex]

where n is the number of objects in consideration or the larger set from which we have to choose r with no repetition.