Scribd
Upload
7 views3 pages

Permutations

This document provides an introduction to permutations, including the definition, notation, formula, and examples. Permutations refer to arrangements of objects in a specific order and the number of ways to arrange a set of objects. The document also discusses factorial notation, permutations with repetition, and applications of permutations in various fields.

Uploaded by

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

Permutations

This document provides an introduction to permutations, including the definition, notation, formula, and examples. Permutations refer to arrangements of objects in a specific order and the number of ways to arrange a set of objects. The document also discusses factorial notation, permutations with repetition, and applications of permutations in various fields.

Uploaded by

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

Permutations are arrangements of objects in a specific order.

In mathematics,
permutations refer to the number of ways we can arrange a set of objects. Here's an
introduction to permutations:

Definition: A permutation of a set of objects is an arrangement of those objects in


a specific order. The order in which the objects are arranged matters.

Permutation Notation: Permutations are often denoted by the symbol


𝑃
(
𝑛
,
𝑟
)
P(n,r), where
𝑛
n is the total number of objects available for arrangement, and
𝑟
r is the number of objects selected and arranged. The number of permutations of
𝑛
n objects taken
𝑟
r at a time is denoted as
𝑃
(
𝑛
,
𝑟
)
P(n,r).

Formula for Permutations: The formula to calculate the number of permutations of


𝑛
n objects taken
𝑟
r at a time is given by:
𝑃
(
𝑛
,
𝑟
)
=
𝑛
!
(
𝑛
−
𝑟
)
!
P(n,r)=
(n−r)!
n!

where
𝑛
!
n! represents the factorial of
𝑛
n, which is the product of all positive integers up to
𝑛
n.

Factorial Notation: The factorial of a non-negative integer


𝑛
n, denoted by
𝑛
!
n!, is the product of all positive integers less than or equal to
𝑛
n. For example:
5
!
=
5
×
4
×
3
×
2
×
1
=
120
5!=5×4×3×2×1=120

Example: Suppose we have a set of 5 different objects, and we want to arrange 3 of


them in a specific order. The number of permutations of selecting and arranging 3
objects from a set of 5 objects is:
𝑃
(
5
,
3
)
=
5
!
(
5
−
3
)
!
=
5
!
2
!
=
5
×
4
×
3
×
2
×
1
2
×
1
=
60
P(5,3)=
(5−3)!
5!

=
2!
5!

=
2×1
5×4×3×2×1

=60

Permutations with Repetition: In some cases, we may have objects that are repeated.
For example, in arranging the letters of the word "MISSISSIPPI," the letter "I"
appears four times. In such cases, the formula for permutations is modified to
account for repeated objects.

Applications: Permutations have numerous applications in mathematics, statistics,


computer science, and various other fields. They are used in combinatorics to count
arrangements, in probability theory to calculate probabilities of events, in
cryptography to generate secure keys, and in algorithms to solve problems involving
arrangements and orderings.

Understanding permutations is essential for solving problems involving


arrangements, selections, and orderings of objects. They provide a systematic way
to count the number of possible outcomes in various scenarios, making them a
fundamental concept in combinatorial mathematics.

You might also like