MD-002›Counting with Permutations and Combinations

Math Deficiency – IITopic 10 of 32

Counting with Permutations and Combinations

9 minread

1,542words

Intermediatelevel

Counting with Permutations and Combinations is a key concept in combinatorics, which is the branch of mathematics that deals with counting, arrangement, and combination of objects. These concepts are used to solve problems related to probability, statistics, and other fields where arrangement and selection matter.

1. Permutations

A permutation is an arrangement of objects in a specific order. The number of ways to arrange $n$ objects is called a permutation. The order in which objects are arranged matters in permutations.

Formula for Permutations:

The number of ways to arrange $r$ objects from a total of $n$ objects is given by the permutation formula:

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

Where:

$n$ is the total number of objects.
$r$ is the number of objects being arranged.
$n!$ (n factorial) represents the product of all positive integers up to $n$ : $n! = n \times (n-1) \times (n-2) \times \ldots \times 1$ .

Example 1: Basic Permutation

How many ways can you arrange 3 people from a group of 5 people?

We use the permutation formula:

P(5, 3) = \frac{5!}{(5 - 3)!} = \frac{5!}{2!} = \frac{5 \times 4 \times 3 \times 2 \times 1}{2 \times 1} = 60

So, there are 60 ways to arrange 3 people from a group of 5.

Example 2: Permutations with Repetition

If repetition is allowed, we can choose any of the $n$ objects for each of the $r$ positions. For example, if you are selecting 2 digits for a 2-digit code and digits can repeat, the total number of possibilities would be $n^r$ .

For instance, if there are 10 digits (0 to 9), the number of 2-digit codes is:

P = 10^2 = 100

Thus, there are 100 different possible 2-digit codes.

2. Combinations

A combination refers to a selection of objects without regard to the order in which they are selected. In combinations, the order of selection does not matter.

Formula for Combinations:

The number of ways to choose $r$ objects from a set of $n$ objects, without regard to the order, is given by the combination formula:

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

Where:

$n$ is the total number of objects.
$r$ is the number of objects being chosen.
$n!$ (n factorial) is the product of all integers from 1 to $n$ .
$r!$ and $(n - r)!$ are the factorials of $r$ and $n - r$ , respectively.

Example 1: Basic Combination

How many ways can you choose 3 people from a group of 5 people?

We use the combination formula:

C(5, 3) = \frac{5!}{3!(5 - 3)!} = \frac{5!}{3!2!} = \frac{5 \times 4 \times 3!}{3! \times 2 \times 1} = \frac{5 \times 4}{2 \times 1} = 10

So, there are 10 ways to choose 3 people from a group of 5.

Example 2: Combinations with Repetition

When repetition is allowed in combinations, the formula changes slightly. If you want to choose $r$ items from $n$ types of items (with replacement), the number of ways is:

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

This formula is useful when you are selecting things like multiple balls from a set of colored balls where repeats are allowed.

3. Differences Between Permutations and Combinations

Order matters in permutations, but it does not matter in combinations.
Permutations are used when you are arranging or ordering objects (e.g., arranging people in a line, ordering books on a shelf).
Combinations are used when you are selecting a subset of objects without regard to the order (e.g., choosing a team from a group of people, selecting toppings for a pizza).

4. Factorials

Factorials play a crucial role in both permutations and combinations. Here's a quick refresher:

$n! = n \times (n-1) \times (n-2) \times \ldots \times 1$
$0! = 1$ by definition.

5. Generalized Example Problems

Problem 1: Permutation Example with Different Order

In how many ways can 4 people be arranged in 6 available seats?

Since order matters (it's a permutation problem):

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

So, there are 360 different ways to arrange 4 people in 6 seats.

Problem 2: Combination Example without Order

How many ways can you choose 2 cards from a deck of 52 cards?

Since order doesn't matter (it's a combination problem):

C(52, 2) = \frac{52!}{2!(52 - 2)!} = \frac{52 \times 51}{2 \times 1} = 1326

So, there are 1,326 different ways to choose 2 cards from a deck of 52 cards.

6. Applications of Permutations and Combinations

Permutations: Useful in problems where the arrangement of objects matters, such as determining the number of possible seat assignments, the number of possible passwords, or the number of ways to order a list of items.
Combinations: Used in problems where the selection of objects matters, but the order doesn't, such as choosing a committee from a group of people or selecting a group of lottery numbers.

Summary:

Permutations: Arrangements of objects where order matters. Formula: $P(n, r) = \frac{n!}{(n - r)!}$
Combinations: Selections of objects where order does not matter. Formula: $C(n, r) = \frac{n!}{r!(n - r)!}$
Factorials: Represent the product of all positive integers up to a given number, and are essential in both permutations and combinations.
Combinations with Repetition: When selecting objects where repeats are allowed, use $C(n + r - 1, r)$ .

Previous topic 9

Geometric Series (Sum infinite and finite geometric series and categorize geometric series)

Next topic 11

Basic Probability

Past Papers

Open this section to load past papers

Click on Show Past Papers to see past papers.

MD-002›Counting with Permutations and Combinations

Math Deficiency – IITopic 10 of 32

Counting with Permutations and Combinations

9 minread

1,542words

Intermediatelevel

1. Permutations

A permutation is an arrangement of objects in a specific order. The number of ways to arrange $n$ objects is called a permutation. The order in which objects are arranged matters in permutations.

Formula for Permutations:

The number of ways to arrange $r$ objects from a total of $n$ objects is given by the permutation formula:

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

Where:

$n$ is the total number of objects.
$r$ is the number of objects being arranged.
$n!$ (n factorial) represents the product of all positive integers up to $n$ : $n! = n \times (n-1) \times (n-2) \times \ldots \times 1$ .

Example 1: Basic Permutation

How many ways can you arrange 3 people from a group of 5 people?

We use the permutation formula:

P(5, 3) = \frac{5!}{(5 - 3)!} = \frac{5!}{2!} = \frac{5 \times 4 \times 3 \times 2 \times 1}{2 \times 1} = 60

So, there are 60 ways to arrange 3 people from a group of 5.

Example 2: Permutations with Repetition

For instance, if there are 10 digits (0 to 9), the number of 2-digit codes is:

P = 10^2 = 100

Thus, there are 100 different possible 2-digit codes.

2. Combinations

A combination refers to a selection of objects without regard to the order in which they are selected. In combinations, the order of selection does not matter.

Formula for Combinations:

The number of ways to choose $r$ objects from a set of $n$ objects, without regard to the order, is given by the combination formula:

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

Where:

$n$ is the total number of objects.
$r$ is the number of objects being chosen.
$n!$ (n factorial) is the product of all integers from 1 to $n$ .
$r!$ and $(n - r)!$ are the factorials of $r$ and $n - r$ , respectively.

Example 1: Basic Combination

How many ways can you choose 3 people from a group of 5 people?

We use the combination formula:

C(5, 3) = \frac{5!}{3!(5 - 3)!} = \frac{5!}{3!2!} = \frac{5 \times 4 \times 3!}{3! \times 2 \times 1} = \frac{5 \times 4}{2 \times 1} = 10

So, there are 10 ways to choose 3 people from a group of 5.

Example 2: Combinations with Repetition

When repetition is allowed in combinations, the formula changes slightly. If you want to choose $r$ items from $n$ types of items (with replacement), the number of ways is:

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

This formula is useful when you are selecting things like multiple balls from a set of colored balls where repeats are allowed.

3. Differences Between Permutations and Combinations

Order matters in permutations, but it does not matter in combinations.
Permutations are used when you are arranging or ordering objects (e.g., arranging people in a line, ordering books on a shelf).
Combinations are used when you are selecting a subset of objects without regard to the order (e.g., choosing a team from a group of people, selecting toppings for a pizza).

4. Factorials

Factorials play a crucial role in both permutations and combinations. Here's a quick refresher:

$n! = n \times (n-1) \times (n-2) \times \ldots \times 1$
$0! = 1$ by definition.

5. Generalized Example Problems

Problem 1: Permutation Example with Different Order

In how many ways can 4 people be arranged in 6 available seats?

Since order matters (it's a permutation problem):

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

So, there are 360 different ways to arrange 4 people in 6 seats.

Problem 2: Combination Example without Order

How many ways can you choose 2 cards from a deck of 52 cards?

Since order doesn't matter (it's a combination problem):

C(52, 2) = \frac{52!}{2!(52 - 2)!} = \frac{52 \times 51}{2 \times 1} = 1326

So, there are 1,326 different ways to choose 2 cards from a deck of 52 cards.

6. Applications of Permutations and Combinations

Permutations: Useful in problems where the arrangement of objects matters, such as determining the number of possible seat assignments, the number of possible passwords, or the number of ways to order a list of items.
Combinations: Used in problems where the selection of objects matters, but the order doesn't, such as choosing a committee from a group of people or selecting a group of lottery numbers.

Summary:

Permutations: Arrangements of objects where order matters. Formula: $P(n, r) = \frac{n!}{(n - r)!}$
Combinations: Selections of objects where order does not matter. Formula: $C(n, r) = \frac{n!}{r!(n - r)!}$
Factorials: Represent the product of all positive integers up to a given number, and are essential in both permutations and combinations.
Combinations with Repetition: When selecting objects where repeats are allowed, use $C(n + r - 1, r)$ .

Previous topic 9

Geometric Series (Sum infinite and finite geometric series and categorize geometric series)

Next topic 11

Basic Probability

Past Papers

Open this section to load past papers

Click on Show Past Papers to see past papers.