Correct option is C
When selecting items one after another without replacement and where the order of selection matters, permutations are used. In this case, there are 42 cards in total (n = 42), and 3 cards are chosen (r = 3).
The formula for permutations without replacement is:
where:
is the total number of item.
is the number of items to choose and arrange
denotes the factorial function (e.g., )
Substituting the values into the formula:
The factorials can be expanded:
The 39! terms in the numerator and denominator cancel out, leaving:
Therefore, there are 68,880 ways to choose 3 cards one after the other from a pack of 42 cards without replacement.
Information Booster:
1. Permutation without replacement:
· Used when the order of selection matters, and no item is selected more than once.
· Formula: P(n, r) = n × (n−1) × (n−2)... up to r terms.