EXAMPLES OF REAL-LIFE SITUATIONS INVOLVING PERMUTATIONS
1. At a certain company, passwords must be from 3-5 symbols long and composed of the
26 letters of the alphabet, the ten digits 0-9, and the 14 symbols !,@,#,$,%,ˆ,&,*,(,),-,+,{,
and }.
A. How many passwords are possible if repetition of symbols is allowed?
B. How many passwords contain no repeated symbols?
Solutions:
a) (50^3) + (50^4) + (50^5) = 318,875,000
b) (50 * 49 * 48) + (50 * 49 * 48 * 47) + (50 * 49 * 48 * 47 * 46) =
259,896,000
Usage: In cybersecurity and encryption, we often rely on permutations and
combinations to create strong passwords and secure systems. When you set a
password, you select characters from a set of possibilities, such as letters,
numbers, and symbols. The more options you have for each character position,
the more potential combinations there are for your password. This makes it
harder for hackers to guess or crack your password through brute force attacks,
where they try every possible combination until they find the correct one. So, by
increasing the number of possible combinations, we increase the security of our
passwords and systems.
2. A student has to take four university entry exams. For passing each exam, he gets either
2, 3, or 4 points. He needs to reach at least 13 points to get to the university. How many
ways can he do the exams to be successful?
Solution:
He needs to have 13-16 points to get into a university.
13 points: (3,3,3,4) P*3,1(4) = 4
(4,4,3,2) P*2,1,1(4) = 12
14 points: (4,4,4,2) P*3,1(4) = 4
(4,4,3,3) P*2,2(4) = 6
15 points: (4,4,4,3) P*3,1(4) = 4
16 points: (4,4,4,4) P*4(4) = 1
N = 4 + 12 + 4 + 6 + 4 + 1 = 31
There are 31 possible ways of reaching at least 13 points.
Usage: Using permutations as a way for you to get the desired result in the examination
is a great way for permutations to work. Once you know the points on each question in
the exam. Therefore, giving you a slightly higher chance of getting the desired result you
need to pass the exam.
3. There are 4 czech and 3 slovak books on the bookshelf. Czech books should be placed
on the left side of the bookshelf and slovak books on the right side of the bookshelf. How
many ways are there to arrange the books?
Solution:
● Czech Books: 4 or (4!)
● Slovak Books: 3 or (3!)
N = (4!) (3!)
N = 24 * 6
N = 144 ways to arrange on Czech and Slovak Books
Usage: Book arrangements can also work in permutations due to their order needing to
be arranged in a specific manner. But this can also work in real life. For example, if you
want to be arranged in a way that looks pleasing or tidy, using permutations helps you to
find many ways to create an order that is nice to see.
PERMUTATION PROBLEM
It is in international summits that major world decisions happen. Suppose that you were the
overall in charge of the seating in an international convention wherein 12 country-
representatives were invited. They are the prime ministers/presidents of the countries of
Canada, China, France, Germany, India, Japan, Libya, Malaysia, Philippines, South Korea,
USA, and United Kingdom.
1. If the seating arrangement is to be circular, how many seating arrangements are
possible?
2. Create your own seat plan for these 12 leaders based on your knowledge of their
backgrounds. Discuss why you arranged them that way.
Solutions:
1. (12-1)! = 11! = 39,916,800 ways of seating arrangement in a circular table
2. USA, China, UK, Germany, South Korea, France, Japan, India, Canada,
Malaysia, Philippines, Libya
Reason: The seating arrangement of these 12 countries are based on the global
power they have in 2024 by these factors (Economic Strength, Military
Capabilities, Technological Innovation, Geopolitical Influence, Diplomatic
Network, Human Capital, and Cultural & Ideological Influence).
