INDEX

S.No. Topic Page Remark

No.
1. CCE-1
A short introduction of
Permutation and Combination

2. CCE-2
Presentation of Permutation
and Combination
3. CCE-3
Final report on Permutation
and Combination
CCE-1
INTRODUCTION

The concept of permutation and combination was developed in the 17th century.
Permutation and combination are the tools used to arrange or rearrange a
collection or set of data in a specific manner. It makes it easier to calculate the
biggest of the biggest probabilities and many other things. There are formulas to
calculate the permutation and combination, and we will look at them.
But, before that, there are many more things to know about this topic. So, let‟s
move forward and look at some of the essential terms related to permutation and
combination.

Some Important Terms

 Permutation: The selection of data or objects from a certain group of sets or

forming subsets is known as permutation.

 Combination: The order of representation of data or objects in a certain

group is called combination.

 Sets: When a well-defined element or object is collected together, it is known

as a set.

 Factorial: It is denoted by an integral value followed by an exclamation

mark.

Basically, it is the product or multiplication of the given positive integer,

followed by the positive numbers less than it.

Permutation and its Uses

A permutation is a vital tool of mathematics used when the sequence or order of

an arrangement is needed. The use of permutation is in almost every field as
well as mathematics. In computer science, it is used for analysing sorting
algorithms. In quantum physics, it is used to describe the states of particles. In
biology, it is used in the description of RNA sequences.
Formula and Calculation of Permutation

The formula for permutation, which is used to calculate the permutation, is

given below:

Where
„n‟ is the item present in the set.
„r‟ is the number of items taken for the permutation.
„!‟ is the exclamation mark that denotes factorial.

It can be calculated simply by putting the values of these variables into the
formula. Generally, the expression of this formula is to find the number of
arrangements or number of ways in which „r‟ can be arranged from a set of „n‟
if the order matters. Look at the question below, which will describe the
formula very well.

Applications Of Permutations

Permutations, the different ways in which a set of items can be arranged, come
into play in various everyday situations, even if we don't always realize it. Here
are some practical examples:

 Seating Arrangements: If you're hosting a dinner party or a meeting and

need to figure out how to seat people to ensure everyone gets along or is able to
collaborate effectively, permutations help you explore all possible seating
arrangements.

 Scheduling: When setting up a schedule, whether for work shifts, class

timetables, or family activities, permutations allow you to explore different
ways to allocate time slots and tasks.

 Passwords and Security: The security of passwords and PINs relies on

permutations. The number of possible combinations increases with length and
complexity, making it harder for unauthorized users to guess or crack them.

 Travel Planning: If you‟re planning a trip with multiple destinations,

permutations help you figure out the best order to visit places to maximize your
time or minimize travel distance.
 Game Strategies: In games and sports, especially strategy games or card
games, permutations help players understand possible moves or combinations,
influencing their strategy.

 Food and Recipes: When preparing meals, permutations can help in mixing
and matching ingredients or meal courses to create new dishes or to cater to
different dietary preferences.

 Event Planning: Organizing an event often involves arranging activities,

seating, or resources in various ways to optimize the experience for guests.

 Product Customization: When choosing from different options for a product

(e.g., colors, sizes, features), permutations help in understanding the variety of
possible combinations.
 Making car plate numbers
 Order in which contestants finish a race
Combination

The combination is a mathematical technique or tool that determines all the

possible ways to group a certain data that arranges a collection of data in all
possible groups. In combination, the items can be selected in any order; in this,
the order of arrangement does not matter, unlike in permutation.

Formula and Calculation of Combination

The formula for combination is:

Where,
n = Total items in the set
r = Items taken for the permutation
“!” denotes factorial

It can be calculated simply by putting the values of these variables into the
formula. Generally, this expression of this formula is to find the number of
possible arrangements or number of ways in which „r‟ can be arranged from a
set of „n‟ if the order doesn‟t matter. Let‟s understand it by an example.

Application Of Combination

Here are some common examples:

1. Choosing Teams: When forming teams for a project or a sports game,

combinations help you select a subset of people from a larger group. For
example, choosing 5 players out of 15 for a soccer match.

2. Planning Menus: In meal planning, combinations can be used to choose a set

of dishes from a list of options, such as selecting a variety of appetizers, main
courses, and desserts for a dinner party.

3. Picking Lottery Numbers: When playing the lottery, you choose a set of
numbers from a larger pool. The combinations of numbers you select determine
your chances of winning.

4. Designing Outfits: Combining different clothing items and accessories to

create various outfits can be approached as a combinations problem, where the
order of items doesn‟t matter.
5. Organizing Groups: When planning a group activity or a study session, you
might need to select a subset of participants from a larger group, such as
choosing a study group of 4 out of 10 students.

6. Selecting Ingredients: In cooking, if you have a variety of ingredients and

want to choose a subset to use in a recipe, combinations help you figure out all
possible ingredient combinations.

7. Gifting: When selecting a combination of gifts from a range of options, you

consider the various possible sets of items that you could give to someone.

8. Travel Itineraries: Choosing a combination of destinations or activities to

include in your travel itinerary can help in planning a well-rounded trip.

9. Financial Planning: In budgeting or investing, combinations of different

financial strategies or portfolio elements can be evaluated to achieve specific
goals.
10. Event Planning: When organizing events, you may need to combine
various elements like decorations, themes, and activities to create a cohesive
experience.

Conclusion
As we have discussed above, permutation and combination are the two most
essential tools of mathematics that are used to arrange or rearrange a certain
set or collection of data in a specific or patterned manner and to find the total
number of possible ways or arrangements of arranging a specific group or
collection of data, respectively. There are formulas for both, which are
discussed already. They are instrumental in day-to-day life, as it makes the
calculations very easy that seem impossible. Not only in mathematics, but they
are also used in almost every other sector.
 CCE – 2
PRRESENTATION
CCE-3
FINAL DRAFT

Permutation and Combination

INTRODUCTION
Permutation and combination are essential concepts in combinatorics, a
branch of mathematics that focuses on counting and arranging objects. They
are used to determine how many ways a set of items can be selected or
arranged, but they differ in how they treat the order of selection. Permutation
refers to the arrangement of objects where the order matters. For example, if
we have three distinct letters (A, B, and C), the different permutations of these
letters would include ABC, ACB, BAC, BCA, CAB, and CBA, all of which are
distinct because their order differs. The number of permutations of ‘n’ objects
taken ‘r’ at a time is calculated using the formula \(P(n, r) = \frac{n!}{(n-r)!}\),
where \(n!\) represents the factorial of n, the product of all positive integers
up to n. Combination, on the other hand, refers to the selection of objects
where the order does not matter. For example, selecting two letters from A, B,
and C results in the combinations AB, AC, and BC, regardless of the order in
which they are selected. The formula for combinations is \(C(n, r) = \frac{n!}{r!
(n-r)!}\), where \(r!\) accounts for the internal arrangements of the selected
items. In summary, permutations deal with ordered arrangements, while
combinations focus on unordered selections. These concepts are crucial in
fields such as probability, statistics, and problem-solving where counting the
possible outcomes is essential.

PERMUTATION
A permutation is an arrangement of objects in a definite order. The members
or elements of sets are arranged here in a sequence or linear order. For
example, the permutation of set A={1,6} is 2, such as {1,6}, {6,1}. As you can
see, there are no other ways to arrange the elements of set A.
When we look at the schedules of trains, buses and the flights we really
wonder how they are scheduled according to the public’s convenience. Of
course, the permutation is very much helpful to prepare the schedules on
departure and arrival of these. Also, when we come across licence plates of
vehicles which consists of few alphabets and digits. We can easily prepare
these codes using permutations.

Definition of Permutation
Basically Permutation is an arrangement of objects in a particular way or order.
While dealing with permutation one should concern about the selection as well
as arrangement. In Short, ordering is very much essential in permutations. In
other words, the permutation is considered as an ordered combination.

Representation of Permutation
We can represent permutation in many ways, such as:

 P(n,k)
n
 pk
 P
n k
n
 Pk
 Pn , k

Formula
The formula for permutation of n objects for r selection of objects is given by:
n!
P(n,r) = ( n−r ) !
For example, the number of ways 3rd and 4th position can be awarded to 10
members is given by:
10! (10.9 .8 !)
P(10, 2) = 8! = =10 x 9=90
8!

Types of Permutation
Permutation can be classified in three different categories:

 Permutation of n different objects (when repetition is not allowed)

  Repetition, where repetition is allowed
 Permutation when the objects are not distinct (Permutation of multi
sets)
Let us understand all the cases of permutation in details.

Permutation of n different objects

If n is a positive integer and r is a whole number, such that r < n, then P(n, r)
represents the number of all possible arrangements or permutations of n
distinct objects taken r at a time. In the case of permutation without
repetition, the number of available choices will be reduced each time. It can
also be represented as: nPr.

P(n, r) = n(n-1)(n-2)(n-3)……..upto r factors

P(n, r) = n(n-1)(n-2)(n-3)……..(n – r +1)

⇒P(n,r)=n!(n−r)!
Here, “nPr” represents the “n” objects to be selected from “r” objects without
repetition, in which the order matters.

Permutation when repetition is allowed

We can easily calculate the permutation with repetition. The permutation with
repetition of objects can be written using the exponent form.

When the number of object is “n,” and we have “r” to be the selection of
object, then;

Choosing an object can be in n different ways (each time).

Thus, the permutation of objects when repetition is allowed will be equal to,

n × n × n × ……(r times) = nr

This is the permutation formula to compute the number of permutations

feasible for the choice of “r” items from the “n” objects when repetition is
allowed.

Permutation of multi-sets
Permutation of n different objects when P1 objects among ‘n’ objects are
similar, P2 objects of the second kind are similar, P3 objects of the third kind are
 similar ……… and so on, Pk objects of the kth kind are similar and the remaining
of all are of a different kind,

Thus it forms a multiset, where the permutation is given as:

n!p1!p2!p3…..pn!

APPLICATIONS OF PERMUTATION
 Digital lock
A “combination lock” should really be called a “Permutation lock”. Permutation
lock has three inputs. If the order of input changes, it won’t unlock. Though the
number are same, but order plays its role.

 Car Race
For example, there are 8 cars in a race and the goal was to predict the correct
finishing order of all 8 cars. This is a permutation problem because order
matters. How many different ways can the cars finish in the race? The answer
is 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1= 40320. The probability of picking the correct
order would be very small indeed.

 Car Number Plate

Another excellent example is the number plate people have on their cars. This
is a unique for each person because no two cars are allowed to have the same
number plate.

 Choosing Clothes
You have 3 shirts and 2 paints . Using these shirts and paints you want to
create maximum number of pairs of shirt and a paint. How many way you can
pair the shirts and paints. If there are 15 shirts and 10 shirts you can make 150
pairs of shirt and paint.

 Waiting Room
There are three candidates for an interview. There are three post to be filled
Manager Supervisor Specialist In this case, order of picking an employee
plays important role. If the order change their roles will also change. Manager
Supervisor Specialist Supervisor Specialist Manager Specialist Manager
Supervisor
 Telephone Dilemma
Nearly everyone has a phone number, so this is a very good real world
example. Ace, a hopeless romantic, is having a teenage life crisis. He received a
girl’s number, but dropped the piece of paper into a chimney and it was
incinerated to beautiful ashes by accident. All he remembers is that it uses the
number 0-9 and consisted of 7 numbers. Help Ace figure out if asking the girl
for her number is worth it by figuring out how many possible combinations of
numbers are possible.

 Seating Dilemma
Seating Dilemma one of the most key components in event. The combinations
are endless and can be extremely frustrating – or so it seems. Wouldn’t it be a
lot simpler if you knew there are only 6 ways to seat a crowed rather than
600,000,000, if who sat where wasn’t a trivial matter? If a person uses a
permutation they don’t have to play this pointless, agitating guessing game
and can plan accordingly.

 Seating Arrangement
Seating arrangement is important to a teacher because this can be a way to
manage behaviour in class. For example, He may choose to not let two noisy
student sit together or hew can put three students sit side by side so they can
help each other. Seating arrangements of executive in board meetings may be
important especially if ranks the person are holding in a company is
considered.

 Trophy Line up
Everybody loves showing off their achievements and what better way to
display your magnificence than through your seemingly endless amount of
trophies? A display way is quite effective, but there are so many ways to
display the trophies, and you would prefer to group trophies of the same
achievements together. To figure out how many ways you can display the
same ones together within the number of trophy slots allotted, you can use
permutation.

 Making password
Making password is essential in making sure our information online is safe and
protected. It is important to always change passwords regularly to prevent
hacking and fraud. The number of password can be made is determined by
permutation.
 Making Words
English letters are 26 only. Out of these 26 letters. We formed lacs and lacs of
word by using these 26 letters which was done by arranging these 26 letters in
various permutation and combination.

 PAINTING
You want to paint your room. Your room has 4 walls and you have 3 paint
colours. Each wall can be painted 3 different colours but you have 4 sides. You
can paint it in 4 3 2 1=24 different ways.

 Book ‘Arrangement
An example of permutations would be the arrangement of books on a shelf. An
easy one is to say there are five different book… how many ways can you
arrange them on shelf? Then you have five choices for the first book four
choices for the second book three choices for the third book... 5 4 3 2 1=120
ways to set books on a shelf.

JOBS WHERE PERMUTATION CAN BE USED

Where a person can use permutation

 IANA (Internet Assigned Number Authority)

The IANA (Internet Assigned Number Authority) are responsible for assigning
the IP addresses for all the technology in the world that interacts with the
internet. They use permutation to pick an address that is functional, open and
meets the requirements for a specific type of device.

 Combo Lock Designer

These people design the locks that are used for gates and lockers. They use
permutations to assign combos that haven’t been used previously, are the only
combination that opens a lock, and cannot be cracked.
COMBINATION

In mathematics, a combination is a way of selecting items from a collection

where the order of selection does not matter. Suppose we have a set of three
numbers P, Q and R. Then in how many ways we can select two numbers from
each set, is defined by combination.

In smaller cases, it is possible to count the number of combinations, but for the
cases which have a large number of group of elements or sets, the possibility
of a set of combination is also higher. Therefore, a formula has been
determined to find the possible selection of the number of items, which we
will discuss in this article. We will also discuss the relation
between permutation and combination with the help of theorems and their
proofs.

Definition of Combination in Math

The combination is defined as “An arrangement of objects where the order in
which the objects are selected does not matter.” The combination means
“Selection of things”, where the order of things has no importance.

For example, if we want to buy a milkshake and we are allowed to combine

any 3 flavours from Apple, Banana, Cherry, and Durian, then the combination
of Apple, Banana, and Cherry is the same as the combination Banana, Apple,
Cherry. So if we are supposed to make a combination out of these possible
flavours, then firstly, let us shorten the name of the fruits by selecting the first
letter of their names. We only have 4 possible combinations for the question
above ABC, ABD, ACD, and BCD. Also, do notice that these are the only possible
combination. This can be easily understood by the combination Formula.

COMBINATION FORMULA

The Combination of 4 objects taken 3 at a time are the same as the number of
subgroups of 3 objects taken from 4 objects. Take another example, given
three fruits; say an apple, an orange, and a pear, three combinations of two
can be drawn from this set: an apple and a pear; an apple and an orange; or a
pear and an orange.

More formally, a k-combination of a set is a subset of k distinct elements of S.

If the set has n elements, the number of k-combinations is equal to the
binomial coefficient.
n
Ck = [(n)(n-1) (n-2) …. (n-k+1)]/[(k-1) (k-2) …….(1)]

which can be written as;

n
Ck = n!/k!(n-k)!, when n>k
n
Ck = 0 , when n<k

Where n = distinct object to choose from

C = Combination

K = spaces to fill (Where k can be replaced by r also)

The combination can also be represented as: –nCr, nCr, C(n,r), Crn

RELATION BETWEEN PERMUTATION AND

COMNINATON
he combination is a type of permutation where the order of the selection is not
considered. Hence, the count of permutation is always more than the number
of the combination. This is the basic difference between permutation and
combination. Now let us find out how these two are related.

Theorem: nPr = nCr.r!

Corresponding to each combination of nCr, we have r! permutations because r

objects in every combination can be rearranged in r! ways.

Proof:
n
Pr = nCr.r!

= [n!/r!(n-r)!].r!

= n!/(n-r)!
Hence the theorem states true.

Theorem: nCr + nCr-1 = n+1Cr

Proof:

Difference Between Permutation and Combination

The major difference between the permutation and combination are given
below:
Permutation Combination

Permutation means the selection of objects, The combination means the selection of objects, in which
where the order of selection matters the order of selection does not matter.

In other words, it is the arrangement of r In other words, it is the selection of r objects taken out of
objects taken out of n objects. n objects irrespective of the object arrangement.

The formula for permutation is The formula for combination is

n
Cr = n!/[r!(n-r)!]
Pr = n! /(n-r)!
n
APPLICATIONS OF COMBINATION

 Lottery Draws
In lottery games, combinations are used to calculate the number of
possible winning sets of numbers. Since the order in which the numbers
are drawn does not matter, combinations help determine the odds of
selecting the correct group of numbers from a larger set, such as 6 out of
49.

 Team Selection
In sports or work-related contexts, combinations are used to select a
group of people from a larger pool. For example, choosing 5 players
from 12 to form a basketball team, where the specific order of selection
doesn’t matter but each team configuration is unique.

 Committee Formation
Combinations are applied in selecting members for a committee from a
large group. For example, if you need to form a 3-member committee
from 10 candidates, the order of selection is irrelevant. The number of
possible combinations helps determine the different ways the
committee could be formed.

 Card Games
In card games like poker, combinations help determine the number of
possible hands. For instance, in a standard 52-card deck, choosing 5
cards for a hand is a combination problem because the order of cards
does not matter, only the specific cards selected.

 Research Groups
Researchers may use combinations when selecting participants or
research subjects from a pool of volunteers. The combination formula
helps calculate how many unique subsets of people can be formed from
a group for experiments or studies, without considering the order of
selection.
 Event Seating Arrangements
Combinations are useful when arranging guests at an event, where the
seating order doesn’t matter but the selection of guests does. For
example, determining how many different groups of 6 people can be
chosen from a pool of 20 for a special dinner.

 Genetic Studies
In genetics, combinations are used to calculate genetic variations when
selecting alleles or genes from a population. For example, determining
how many different ways certain gene variants can be combined to
create potential offspring genotypes, given specific parental traits.

 Marketing Campaigns
Marketers use combinations to select a group of products, services, or
promotional strategies for a campaign. For example, choosing a set of 3
promotional items from 10 available options involves calculating the
number of ways the items can be combined to form a compelling
bundle.

 Product Bundling
Businesses use combinations when bundling products together for
promotions or discounts. For instance, selecting 2 products from 6 to
create a promotional package involves combination math, as the order
of products in the bundle doesn’t matter, only the specific items chosen.

 Sampling
In statistical sampling, combinations are used to select a sample from a
larger population. For example, if a survey needs 5 respondents from a
pool of 50, combinations are used to determine how many different
groups of 5 could be selected to represent the population.

 Password Combinations
In cybersecurity, combinations are used to calculate possible password
combinations when selecting characters from a limited set. For example,
choosing a 4-digit PIN from 10 possible digits involves using
combinations to calculate how many unique PINs can be formed,
ignoring the order of digits.

 Seating Arrangements
 Combinations can be applied in seating arrangements when the order of
seating doesn’t matter but the selection of seats does. For example, if 8
people need to sit in a section with 12 available seats, combinations can
be used to determine how many different groups of 8 people can be
seated.

 Game Strategy
In games like chess or board games, combinations are used to determine
potential strategies or moves. For instance, calculating the number of
possible ways to choose 3 different moves from 10 available options
involves combinations, where the order of the moves doesn’t affect the
strategy.

 Gift Packaging
Retailers use combinations to create gift bundles by selecting a subset of
items from a larger set. For instance, when forming a gift set with 3
items out of 5 available options, combinations are used to calculate how
many different sets of items can be combined for the bundle.

 Voting Systems
Combinations help calculate the possible outcomes in voting scenarios
where the order of votes doesn’t matter. For instance, in an election
with multiple candidates, combinations can be used to figure out how
many different ways voters can select a subset of candidates for their
vote, ensuring fair representation.