Scribd
Upload
6 views

Permutation

The document explains the concepts of permutations and combinations, highlighting that permutations involve arrangements where order matters, while combinations focus on selections where order does not matter. It outlines key properties and formulas for calculating the number of permutations and combinations, providing examples for clarity. The document emphasizes the significance of order in permutations and the irrelevance of order in combinations.

Uploaded by

jashgilos26
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

Permutation

The document explains the concepts of permutations and combinations, highlighting that permutations involve arrangements where order matters, while combinations focus on selections where order does not matter. It outlines key properties and formulas for calculating the number of permutations and combinations, providing examples for clarity. The document emphasizes the significance of order in permutations and the irrelevance of order in combinations.

Uploaded by

jashgilos26
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Permutation

Is a special type of FCP( FUNDAMENTAL COUNTI NG PRINCIPLE)


that refers to an arrangement of objects in a definitive order.
Changing the order of the objects being arranged creates a new
permutation
*Order matters, meaning the arrangement of items is important.
*It focuses on organizing or arranging things in specific ways.
*Permutations result in more possibilities because changing the
order creates a new outcome.
*Used in situations where the sequence of chosen items makes a
difference.
The key difference between permutations and combinations lies
in order.
Permutation refers to an arrangement of objects where the order
matters.
For example, if you have three letters (A, B, C), the arrangements
"ABC" and "CAB" are considered different permutations because
the order of the letters is different.

Combination
Is a special type of FCP (Fundamental Counting Principle) that determines the
number of possible groups/sets/selections in a collection of items where the
order of the selection does not matter. In combinations, you can select the
items in any order.

*Order doesn’t matter, so the arrangement of items is irrelevant.


*It focuses solely on selecting items from a group.
*Combinations result in fewer possibilities because the same
items in a different order count as one.
*Used in scenarios where the grouping or selection matters but
not the order.
The key difference between permutations and combinations lies
in order.
Combination refers to a selection of objects where the order does
not matter. Using the same letters (A, B, C), the selection of "AB"
and "BA" would be considered the same combination because the
order doesn't matter.
Here are some important properties of permutations:
1. Order Matters: In permutations, the arrangement or sequence of the objects
is crucial. Changing the order of the elements results in a different
permutation.
2. Number of Permutations: The number of permutations of n objects taken r at
a time (denoted as P(n, r)) is given by the formula:

P(n,r)= n!

(n−r)!

where n! (n factorial) represents the product of all positive integers up


to n. This formula calculates the total possible arrangements of r objects
selected from n objects.

3. Factorial Representation: The total number of permutations of n objects is n!


(n factorial), which accounts for all possible ways to arrange n distinct items.
For example, for 3 objects (A, B, C), the number of permutations is 3! = 3 × 2
× 1 = 6.
4. Distinct Objects: Permutations assume that all the objects are distinct. If
some of the objects are identical (e.g., two of them are the same), the
formula for permutations adjusts to account for the repetitions. For example,
the number of distinct permutations of the word "AAB" is less than 3!,
because there are repeated "A"s.
5. Circular Permutations: When arranging objects in a circle, one position is
typically fixed (to eliminate identical arrangements caused by rotating the
circle), so the number of circular permutations of n objects is given by (n-1)!.
6. Permutation with Repetition: If repetition of elements is allowed, the formula
for permutations changes. The number of permutations of r objects selected
from n elements (with repetition allowed) is:

P(n,r)=nr
7. Symmetry: The number of permutations of a set of distinct objects is the
same regardless of how we select the objects, i.e., selecting 2 objects from 4
is the same as selecting 2 from 4 and then arranging them in order.

These properties help describe how permutations work, and how to calculate and
understand the various possibilities in different situations

Here are the key properties of combinations:

1. Order Doesn't Matter: In combinations, the order in which you select the
objects is irrelevant. For example, choosing the items {A, B} is the same as
{B, A}—it’s still considered one combination.
2. Number of Combinations: The number of combinations of n objects taken r at

a time (denoted as C(n, r) or ( n ) ( r ) is given by the formula: C(n,r)=n! r!


((n-r)! This formula calculates the number of ways to select r objects from a
set of n objects without regard to order.

Combinations
1. How many committees of 5 members can be formed from 12 people?
2. From a group of 10 students, how many ways can a teacher select 2
students for a special task?
3. From a list of 25 tasks, how many ways can 4 tasks be assigned for a
project?
4. A deck has 52 cards. How many ways can 5 cards be chosen?
5. In a raffle with 20 tickets, how many ways can 6 winners be chosen?
6. A student council of 30 members needs to form a 5 person committee.
How many ways can this be done?
7. From a set of 16 tasks, how many ways can 7 tasks be selected?

Permutation
1. How many ways can 3 students (A, B, and C) be arranged in a row for a
photograph?
2. How many different ways can we arrange 2 books on a shelf from a
collection of 5 distinct books?
3. How many 3-digit numbers can be formed using the digits 2, 4, and 6 if
repetition of digits is allowed?
4. How many different ways can 4 people (A, B, C, D) be selected and
arranged in a line for a photo if we only select and arrange 3 out of the 4
people?
PERMUTATION AND COMBINATION
DEFINITIONS:
DEFINITIONS:
PROPERTIES:
PROPERTIES:
EXAMPLES:
EXAMPLES:

You might also like