Scribd
Upload
12 views34 pages

Combinat or Ics

Uploaded by

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

Combinat or Ics

Uploaded by

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

COMBINATORICS

COMBINATORICS

• is the branch of Mathematics dealing with the study of finite


or countable discrete structures.
• It deals with the study of permutations and combinations,
enumerations of the sets of elements.
• It is frequently used in computer Science to derive the
formulas and it is used for the estimation of the analysis of
the algorithms.
HISTORY

First combinatorial problems have been studied by ancient Indian, Arabian


and Greek mathematicians. Interest in the subject increased during the 19th and 20th
century, together with the development of graph theory and problems like the four
colour theorem. Some of the leading mathematicians include Blaise Pascal (1623 –
1662), Jacob Bernoulli (1654 – 1705) and Leonhard Euler (1707 – 1783).
Table of contents
01 Basic Counting 02
Permutations and
Principles (Sum rule,
Combinations
Product rule)

03 04 Inclusion-Exclusion
Binomial Coefficients Principle
and Pascal’s Triangle
01
BASIC COUNTING
PRINCIPLES
(Sum rule, Product rule)
BASIC COUNTING
PRINCIPLES TWO BASIC COUNTING
PRINCIPLES
is a rule used to
count the total number of 1. SUM RULE
possible outcomes in a 2. PRODUCT RULE
situation.

The Rule of Sum and Rule of Product are


used to decompose difficult counting
problems into simple problems.
SUM RULE PRINCIPLE
The Sum Rule states that if
a task can be performed in either
two ways, where the two methods
cannot be performed simultaneously,
then completing the job can be done
by the sum of the ways to perform the
task.
SUM RULE EXAMPLE:
For instance, suppose a bakery has a selection of 20 different cupcakes, 10 different donuts,
and 15 different muffins. If you are to select a tasty treat, how many different choices
of sweets can you choose from?

Here’s how this works.

Because we have to choose from either a cupcake or donut or muffin (notice the “OR”),
we have 20 + 10 + 15 = 45 treats to choose from.
PRODUCT RULE PRINCIPLE
The Product Rule states
that if a task can be performed in
a sequence of tasks, one after the
other, then completing the job can
be done by the product of the
ways to perform the task
PRODUCT RULE EXAMPLE:
suppose a bakery has a selection of 20 different cupcakes, 10 different donuts, and 15 different muffins
— how many different orders are there?

What makes this question different from the first problem is that we are not asking how many total
choices there are. We are asking how many different ways we can select a treat.
It’s possible that you only want one treat, but you can quite easily want more than one.
So how many different orders can you create, if you’re allowed to choose as few or as many as you
like?
This is the job for the product rule!
Because we can choose treats from a selection of cupcakes and donuts and muffins (notice the
“AND”), we 20 x 10 x 15 = 3,000 ordering options.
SUM AND PRODUCT RULE EXAMPLE:
QUESTION:
A boy lives at X and wants to go to School at Z. From his home X he has to first reach Y
and then Y to Z. He may go X to Y by either 3 bus routes or 2 train routes. From there,
he can either choose 4 bus routes or 5 train routes to reach Z. How many ways are there
to go from X to Z?

SOLUTION:
From X to Y, he can go in 3+2=5 ways (Rule of Sum).
Thereafter, he can go Y to Z in 4+5=9 ways (Rule of Sum).
Hence from X to Z he can go in 5×9=45 ways (Rule of Product).
02
PERMUTATIONS AND
COMBINATIONS
PERMUTATIONS

Permutation is an arrangement of objects in a particular way


or order. It is considered as an ordered combination.

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.
Representation of Permutation
FORMULA

Where:

n = total items in the set;


r = items taken for the permutation;
"!" denotes taking the factorial
EXAMPLE

The number of ways 3rd and 4th position can be awarded


to 10 members is given.

P(10, 2) = 10!/(10-2)! = 10!/8! = (10.9.8!)/8! = 10 x 9 =


90
EXAMPLE

Example: How many 3 letter words with or


without meaning can be formed out of the
letters of the word SWING when
repetition of letters is not allowed?

Solution: Here n = 5, as the word SWING has


5 letters. Since we have to frame 3 letter
words with or without meaning and
without repetition, therefore total
permutations possible are:
COMBINATIONS

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
COMBINATION FORMULA
Example

Example 1: A group of 3 lawn tennis players S, T, U. A team consisting of 2 players is to be formed. In


how many ways can we do so?
Solution- In a combination problem, we know that the order of arrangement or selection does not matter.
Thus ST= TS, TU = UT, and SU=US.
Thus we have 3 ways of team selection.
By combination formula we have-
3
C2 = 3!/2! (3-2)!
= (3.2.1)/(2.1.1) =3
Example

Example 2: Find the number of subsets of the set {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} having 3 elements.
Solution: The set given here have 10 elements. We need to form subsets of 3 elements in any order. If we
select {1,2,3} as first subset then it is same as {3,2,1}. Hence, we will use the formula of combination
here.
Therefore, the number of subsets having 3 elements = 10C3
= 10!/(10-3)!3!
= 10.9.87!/7!.3!
= 10.9.8/3.2
= 120 ways.
03
BINOMIAL
COEFFICIENTS AND
PASCAL’S TRIANGLE
BINOMIAL COEFFICIENTS

The positive integers that are present as coefficients in the


binomial expansion are termed binomial coefficients.
It was introduced in the year 1826.
The Indian mathematician Bhaskaracharya was the person
who gave the description of the coefficients in the binomial
expansion.
FORMULA
PASCAL’S TRIANGLE

Pascal’s Triangle is a kind of number


pattern. Pascal’s Triangle is the triangular arrangement of
numbers that gives the coefficients in the expansion of any
binomial expression. The numbers are so arranged that they
reflect as a triangle.
Pascal’s Triangle History

Blaise Pascal was born at Clermont-Ferrand, in


the Auvergne region of France on June 19, 1623.

In 1653 he wrote the Treatise on the Arithmetical Triangle


which today is known as Pascal’s Triangle.
Pascal’s Triangle Formula

Pascal Triangle Formula is the formula that is used to find the


number that is to be filled in the mth column and the nth row.
As we know that the terms in Pascal’s triangle are the
summation of the terms in the above row.
n
Cm = n-1Cm-1 + n-1Cm
Where,
• nCm represents the (m+1)th element in the nth row., and
• n is a non-negative integer [0 ≤ m ≤ n]
EXAMPLE

A coin is tossed three times, find the probability of getting exactly 2 tails.

Solution:
Using the Pascal triangle formula, the total number of outcomes will be 2 3 = 8 (1 + 3 + 3 + 1 =
8)
Where 3 of them give exactly two tails.
So the probability of getting exactly two tails is 3/8, or 37.5%

Answer: The probability of getting exactly two tails is 37.5%


04
INCLUSION-
EXCLUSION PRINCIPLE
INCLUSION-EXCLUSION PRINCIPLE

Principle of Inclusion and Exclusion is an approach


which derives the method of finding the number of elements
in the union of two finite sets.

This is used to solve combinations and probability problems


when it is necessary to find a counting method, which makes
sure that an object is not counted twice.
Consider two finite sets, Here, n(A) denotes the
A and B. cardinality of set A, n(B) denotes
We can denote the Principle of the cardinality of set B and
n(A⋂B) denotes the cardinality
Inclusion and Exclusion formula
of (A⋂B). We have included A
as follows:
and B and excluded their
common elements.
n(A⋃B) = n(A) + n(B) – n(A⋂B)
If we have 3 sets A, B, and C, then according to
the Principle of Inclusion and Exclusion,
n(A⋃B⋃C) = n(A) + n(B) + n(C) –
n(A⋂B) – n(A⋂C) – n(B⋂C) +
n(A⋂B⋂C)

The Principle of Inclusion and Exclusion,


represented by a Venn diagram for 3 sets, is
given below.

You might also like