Ask Claude about this

Counting Ordered Selections: Permutations

When Order Matters

In probability, when we select items from a set without replacement and the order in which the items are selected is important, we are dealing with permutations. For example, drawing card A then card B is a different outcome from drawing card B then card A if order matters.

The total number of ways to arrange 'k' items selected from 'n' distinct items is given by the permutation formula P(n,k) = n! / (n-k)!. For selecting two cards sequentially from 100, the total number of ordered pairs is 100 × 99.

Identifying Specific Relationships

Some probability problems require identifying specific numerical relationships between the selected items. This involves careful enumeration of the pairs that satisfy the given condition. It's crucial to consider if the order of drawing affects whether a pair is "favorable." For example, if the condition is "one number is double the other," the pair (x, 2x) is distinct from (2x, x) if drawn sequentially.

Two Cards (1-100), One Double the Other

MODERATE

You draw two cards from a set of cards numbered 1 to 100. The cards are drawn without replacement. What is the probability that one of the numbers drawn is exactly double the other?

Ponder This: If the cards were drawn *with* replacement, how would the probability change? Would the number of favorable outcomes change? Would the total number of outcomes change?

 

Nerchuko Academy · Free DS Interview Prep