Applications in Counting and Probability

Master counting principles and probability applications: permutations, combinations, and real-world scenarios through these 5 detailed exercises.

Counting and Probability Concepts
\(P(n,r) = \frac{n!}{(n-r)!}\)
Permutations
\(C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}\)
Combinations
\(P(A) = \frac{\text{Number of favorable outcomes}}{\text{Total number of outcomes}}\)
Probability Formula
Key Definitions:

Permutation: An arrangement of objects where order matters.

Combination: A selection of objects where order does not matter.

Factorial: n! = n × (n-1) × (n-2) × ... × 1, with 0! = 1.

Fundamental Counting Principle: If one event can occur in m ways and a second event can occur in n ways, then both events can occur in m × n ways.

Sample Space: The set of all possible outcomes of an experiment.

Event: A subset of the sample space.

Decision Framework:
  1. Does order matter? If yes, use permutations. If no, use combinations.
  2. Are objects being arranged? If yes, permutation formula.
  3. Are objects being selected? If yes, combination formula.
  4. Is it a probability problem? Count favorable outcomes and divide by total outcomes.
Permutations: P(n,r) = n!/(n-r)! - Order matters
Combinations: C(n,r) = n!/[r!(n-r)!] - Order doesn't matter
Tip 1: Use "arrange" or "order" for permutations, "select" or "choose" for combinations.
Tip 2: For large factorials, use calculator or approximation formulas.
Tip 3: Always verify that your answer makes sense in the context of the problem.
Solution: Exercises 1 to 3
1 Committee Formation
Exercise 1
A committee of 3 people is to be formed from a group of 8 people. How many different committees can be formed?
Analysis:

Order does not matter in committee formation. We're selecting 3 from 8 people.

Step 1: Identify the type of problem

This is a combination problem since order doesn't matter (committee members are not ranked).

Step 2: Apply the combination formula

\(C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}\)

Here: n = 8, r = 3

Step 3: Calculate the combination

\(C(8,3) = \frac{8!}{3!(8-3)!} = \frac{8!}{3! \cdot 5!} = \frac{8 \times 7 \times 6 \times 5!}{3! \times 5!}\)

\(C(8,3) = \frac{8 \times 7 \times 6}{3!} = \frac{8 \times 7 \times 6}{3 \times 2 \times 1} = \frac{336}{6} = 56\)

C(8,3) = 56
Final Answer:

56 different committees can be formed from 8 people.

2 Race Placements
Exercise 2
In a race with 10 runners, how many different ways can the gold, silver, and bronze medals be awarded?
Analysis:

Order matters since medals are ranked (gold, silver, bronze). We're arranging 3 positions from 10 runners.

Step 1: Identify the type of problem

This is a permutation problem since order matters (first place ≠ second place ≠ third place).

Step 2: Apply the permutation formula

\(P(n,r) = \frac{n!}{(n-r)!}\)

Here: n = 10, r = 3

Step 3: Calculate the permutation

\(P(10,3) = \frac{10!}{(10-3)!} = \frac{10!}{7!} = \frac{10 \times 9 \times 8 \times 7!}{7!} = 10 \times 9 \times 8 = 720\)

Step 4: Alternative approach using Fundamental Counting Principle

Gold medal: 10 choices

Silver medal: 9 remaining choices

Bronze medal: 8 remaining choices

Total: 10 × 9 × 8 = 720

P(10,3) = 720
Final Answer:

There are 720 different ways to award the gold, silver, and bronze medals.

3 Card Hands
Exercise 3
From a standard deck of 52 cards, how many 5-card hands contain exactly 3 aces?
Analysis:

We need to select 3 aces from 4 available aces AND 2 non-aces from 48 non-aces.

Step 1: Break down the problem

Select 3 aces from 4 aces: C(4,3)

Select 2 non-aces from 48 non-aces: C(48,2)

Use multiplication principle since both selections must happen.

Step 2: Calculate C(4,3) - ways to select 3 aces from 4

\(C(4,3) = \frac{4!}{3!(4-3)!} = \frac{4!}{3! \cdot 1!} = \frac{4}{1} = 4\)

Step 3: Calculate C(48,2) - ways to select 2 non-aces from 48

\(C(48,2) = \frac{48!}{2!(48-2)!} = \frac{48!}{2! \cdot 46!} = \frac{48 \times 47}{2 \times 1} = \frac{2256}{2} = 1128\)

Step 4: Apply multiplication principle

Total number of 5-card hands with exactly 3 aces = C(4,3) × C(48,2) = 4 × 1128 = 4512

4512 hands
Final Answer:

There are 4,512 different 5-card hands that contain exactly 3 aces.

Solution: Exercises 4 to 5
4 Password Security
Exercise 4
A computer password consists of 4 letters followed by 3 digits. Letters cannot be repeated, but digits can be repeated. How many different passwords are possible?
Analysis:

Letters: 4 positions, no repetition, 26 letters available (order matters)

Digits: 3 positions, repetition allowed, 10 digits available (order matters)

Step 1: Calculate possibilities for letters

First letter: 26 choices

Second letter: 25 remaining choices

Third letter: 24 remaining choices

Fourth letter: 23 remaining choices

Total for letters: 26 × 25 × 24 × 23 = 358,800

Alternatively: P(26,4) = 26!/(26-4)! = 26!/22! = 26 × 25 × 24 × 23 = 358,800

Step 2: Calculate possibilities for digits

First digit: 10 choices

Second digit: 10 choices (repetition allowed)

Third digit: 10 choices (repetition allowed)

Total for digits: 10 × 10 × 10 = 1,000

Step 3: Apply multiplication principle

Total number of passwords = (Ways to arrange letters) × (Ways to arrange digits)

Total = 358,800 × 1,000 = 358,800,000

358,800,000 passwords
Final Answer:

There are 358,800,000 different possible passwords.

5 Election Results
Exercise 5
In a class election, there are 6 candidates running for 3 positions: President, Vice President, and Secretary. How many different ways can the 3 positions be filled? Also, what is the probability that a specific candidate (Alice) gets elected to one of the positions?
Analysis:

Positions are distinct (President ≠ Vice President ≠ Secretary), so order matters. This is a permutation problem.

Part 1: Calculate total ways to fill 3 positions from 6 candidates

This is a permutation since positions are distinct.

\(P(6,3) = \frac{6!}{(6-3)!} = \frac{6!}{3!} = \frac{6 \times 5 \times 4 \times 3!}{3!} = 6 \times 5 \times 4 = 120\)

Part 2: Calculate probability that Alice gets elected

Method 1: Count favorable outcomes

If Alice is President: P(5,2) = 5 × 4 = 20 ways

If Alice is Vice President: P(5,2) = 5 × 4 = 20 ways

If Alice is Secretary: P(5,2) = 5 × 4 = 20 ways

Total favorable outcomes = 20 + 20 + 20 = 60

Part 3: Calculate probability

\(P(\text{Alice elected}) = \frac{\text{Favorable outcomes}}{\text{Total outcomes}} = \frac{60}{120} = \frac{1}{2}\)

Part 4: Alternative method for probability

Probability Alice is NOT elected: She's not in any of the 3 positions

Ways to fill 3 positions from remaining 5 candidates: P(5,3) = 5 × 4 × 3 = 60

P(Alice not elected) = 60/120 = 1/2

P(Alice elected) = 1 - P(Alice not elected) = 1 - 1/2 = 1/2

120 ways, P(Alice elected) = 1/2
Final Answer:

There are 120 different ways to fill the 3 positions. The probability that Alice gets elected to one of the positions is 1/2 or 50%.

Comprehensive Summary: Counting and Probability Applications
Core Concepts:

Permutations: Arrangements where order matters. Use when positioning, ranking, or sequencing is involved.

Combinations: Selections where order doesn't matter. Use when choosing groups or subsets.

Fundamental Counting Principle: If one event can occur in m ways and another in n ways, both can occur in m × n ways.

Essential Formulas:
  1. Permutations: \(P(n,r) = \frac{n!}{(n-r)!}\)
  2. Combinations: \(C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}\)
  3. Probability: \(P(E) = \frac{\text{Number of favorable outcomes}}{\text{Total number of outcomes}}\)
  4. Factorial: \(n! = n \times (n-1) \times (n-2) \times ... \times 1\), with \(0! = 1\)
  5. Complement Rule: \(P(A') = 1 - P(A)\)
Decision Making:

Permutation vs Combination: Does order matter? Yes → Permutation, No → Combination

Repetition: Allowed → Different calculations, Not allowed → Use factorial-based formulas

Multiple Events: Use multiplication principle when both must occur

Memory Tip: Permutation = Position matters, Combination = Choose group
Strategy Tip: For "at least" problems, consider using complement rule
Visualization Tip: Draw tree diagrams for sequential decisions
Verification Tip: Your answer should be reasonable in context
Problem-Solving Strategy
1
Identify Type
2
Determine Order
3
Choose Formula
4
Calculate
5
Verify

Questions & Answers

Question: How do I know whether to use permutations or combinations?

Answer: Ask yourself: "Does the order of selection matter?"

  • Use Permutations: When order matters (arranging, ranking, positioning)
  • Use Combinations: When order doesn't matter (selecting, choosing, grouping)

Examples:

  • Committee formation: Combination (order doesn't matter)
  • Race finishing positions: Permutation (1st ≠ 2nd ≠ 3rd)
  • Choosing toppings for pizza: Combination (pepperoni + mushrooms = mushrooms + pepperoni)
  • Assigning different jobs to people: Permutation (job A ≠ job B)

Question: What's the difference between "with repetition" and "without repetition"?

Answer: This determines whether the same item can be selected multiple times:

  • With Repetition: Same item can be selected multiple times
  • Without Repetition: Each item can only be selected once

Examples:

  • Password with digits (0-9), length 3, repetition allowed: 10 × 10 × 10 = 1,000 possibilities
  • Arranging 3 letters from {A, B, C} without repetition: P(3,3) = 3! = 6 arrangements
  • Selecting 2 letters from {A, B, C} without repetition: C(3,2) = 3 combinations

Question: When should I use the complement rule in probability?

Answer: Use the complement rule when it's easier to count what you DON'T want:

Formula: P(A) = 1 - P(A'), where A' is the complement of A

Use when:

  • Calculating "at least one" (complement: none)
  • Calculating "not all" (complement: all)
  • The complement has fewer cases to count
  • Direct calculation is complex

Example: Probability of getting at least one head in 5 coin flips is 1 - P(no heads) = 1 - (1/2)⁵ = 1 - 1/32 = 31/32.