Arrangement Probability- Calculating Permutations and Combinations

What Is Arrangement Probability?

Arrangement probability is about figuring out how likely specific outcomes are when you're arranging or selecting items. It's the math behind questions like: "What's the chance I'll draw a specific hand in poker?" or "How many ways can I arrange these letters?"

Most people get tripped up because they confuse two core concepts: permutations and combinations. The difference is simple. Permutations care about order. Combinations don't. That's it.

Master these two ideas and you can solve most probability problems without breaking a sweat.

Permutations: When Order Matters

A permutation is an arrangement where the sequence matters. If you have three books and want to know how many ways you can line them up on a shelf, you're dealing with permutations.

The Permutation Formula

For selecting r items from n total items, where order matters:

P(n,r) = n! / (n - r)!

The exclamation mark means factorial — multiply all positive integers up to that number. So 5! = 5 × 4 × 3 × 2 × 1 = 120.

Permutation Examples

Combinations: When Order Doesn't Matter

Combinations count groupings where the order is irrelevant. Picking committee members, lottery numbers, or a poker hand — these are combinations. The 5 of hearts and 3 of spades is the same hand as 3 of spades and 5 of hearts.

The Combination Formula

For selecting r items from n total items, where order doesn't matter:

C(n,r) = n! / [r! × (n - r)!]

You'll sometimes see this written as "n choose r" with the notation (n/r).

Combination Examples

Permutations vs Combinations: The Key Difference

The number of permutations is always greater than or equal to combinations. Why? Because every combination can be arranged in multiple ways.

Think about it: The committee {Alice, Bob, Carol} is one combination. But Alice-Bob-Carol, Alice-Carol-Bob, Bob-Alice-Carol — these are different permutations of the same group.

The relationship: P(n,r) = C(n,r) × r!

This means permutations = combinations × the number of ways to arrange those items.

Permutation and Combination Comparison Table

Feature Permutations Combinations
Order matters? Yes No
Formula n! / (n-r)! n! / [r!(n-r)!]
Result is usually Larger number Smaller number
Example Arranging books on a shelf Picking a card hand
Real-world use Rankings, PIN codes, race results Committees, lotteries, poker hands

How to Calculate Arrangement Probability

Once you know how many arrangements are possible, calculating probability is straightforward:

Probability = (Number of favorable outcomes) / (Total number of possible outcomes)

Practical Examples

Example 1: Drawing a Specific Hand

What's the probability of drawing exactly 2 aces in a 5-card hand?

Example 2: Password Strength

A 4-digit PIN using digits 0-9. What's the probability a random guess matches "1234"?

Quick Reference Formulas

Common Mistakes to Avoid

Getting Started: Step-by-Step

Step 1: Read the problem. Identify what you're arranging or selecting.

Step 2: Does order matter? If yes → permutations. If no → combinations.

Step 3: Plug numbers into the correct formula. Write out n, r, and your calculation step by step.

Step 4: If the problem asks for probability, divide favorable outcomes by total outcomes.

Step 5: Simplify your fraction if needed. Convert to decimal or percentage for clarity.

When to Use Each Approach

Permutations are your go-to for:

Combinations work best for:

The math here isn't complicated once you internalize the order distinction. Practice with a few real problems and it'll click fast.