6C Video

Arrangement of Letters

The arrangement of letters is a fundamental concept in combinatorics and involves finding different ways to organize a set of letters.

Example with Letters a, b, and c

  • Arrangements for letter a:

    • a, b, c

    • a, c, b

  • Arrangements for letter b:

    • b, a, c

    • b, c, a

  • Arrangements for letter c:

    • c, a, b

    • c, b, a

Total Arrangements

  • The total number of unique arrangements (permutations) for the three letters is 6 ways.

Factorial Concept

To find the total arrangements of multiple items, consider:

  1. Choices for the 1st letter: 3 options (any of a, b, or c).

  2. Choices for the 2nd letter: 2 remaining options (after selecting the first).

  3. Choices for the 3rd letter: Only 1 option left.

Calculating Total Arrangements

  • The formula to calculate these arrangements is:

    • 3 × 2 × 1 = 6

  • This concept is also referred to as 3 factorial (3!).

Definition of Factorial

  • Notation: n! (n factorial)

  • Definition: n! = n × (n-1) × (n-2) × ... × 1

  • Example: 6! = 720

  • Important Note: 0! = 1, by mathematical convention.

Permutations

  • Permutations: This term refers to the different arrangements of a set where the order matters.

  • Example: Consider 10 contestants competing for 1st, 2nd, and 3rd places. The total ways to arrange them is calculated using permutations.

Calculating Permutations

  • Formula: P(n, r) = n! / (n - r)!

  • Example: For 10 items taken 3 at a time:

    • P(10, 3) = 10! / (10-3)! = 10! / 7! = 10 × 9 × 8 = 720.

Permutations of Arranging Students

  • To find the arrangements of 4 students, you use:

    • 4! = 4 × 3 × 2 × 1 = 24 ways.

Arrangements with Duplicate Letters

When dealing with duplicate characters in arrangements, adjustments must be made to avoid overcounting:

  • Example: The name "Aaron" has two A's. To find the correct calculation:

    • Adjusted Calculation: Total arrangements = 5! / 2! = 120 / 2 = 60 ways.

  • General Approach: If there are n letters, with some repeating, the formula becomes:

    • Total Arrangements = n! / (repeating letters' factorials).

Round Table Arrangements

In circular arrangements, where the order is also significant, the position of one person is fixed to account for the circular nature:

  • Example: For 6 people around a round table:

    • This is calculated as (6 - 1)! which is 5! = 120 arrangements.

Combinations

  • Combinations: Refers to the selection of items where the order does not matter.

  • Definition: The number of ways to choose r items from n items is calculated as:

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

  • Applied Example: Choosing 3 members from a total of 6 members:

    • C(6, 3) calculations yield the number of ways to choose groupings without regard to order.

Example Problems

Problem 1: Photo Arrangement Probability

  • Total Arrangements: 4! = 24 ways.

  • Favorable Conditions: If Lisa must be on the far left, and David on the far right, leading to the arrangement of Mary and Bob:

    • Arrangements = 2 ways.

  • Probability Formula: Probability = favorable conditions / total arrangements = 2 / 24 = 1 / 12.

Problem 2: Crayon Arrangements with Conditions

  • Total Arrangements: 8! = 40,320 ways.

  • Favorable Arrangements: If the red crayon must be on the far left, we arrange the remaining 7 crayons:

    • Favorable arrangements = 7! = 5,040.

  • Probability Calculation: Probability = 5,040 / 40,320 = 1 / 8.

Problem 3: Class Selection Probability

From a class of 10 students, the probability of selecting 5 girls:

  • Favorable Outcomes: Number of ways to choose 5 girls from 8 = C(8, 5).

  • Total Outcomes: Number of ways to choose any 5 from 10 = C(10, 5).

  • Resulting Probability: This calculates as favorable outcomes / total outcomes which gives the final likelihood of this selection.