0% found this document useful (0 votes)
1 views

DS-Binomials

The document covers the concepts of permutations and combinations, explaining their definitions, differences, and applications in various problems. It includes examples of calculating permutations and combinations, as well as the binomial theorem and Pascal's triangle. Additionally, it discusses generalized permutations and combinations that account for repetitions in counting problems.

Uploaded by

lollipopmama7271
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1 views

DS-Binomials

The document covers the concepts of permutations and combinations, explaining their definitions, differences, and applications in various problems. It includes examples of calculating permutations and combinations, as well as the binomial theorem and Pascal's triangle. Additionally, it discusses generalized permutations and combinations that account for repetitions in counting problems.

Uploaded by

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

Permutations &

Combinations
First Year Computer Engineering
Discrete Structures
Permutations & Combinations
Permutations : set of distinct objects / ordered arrangement of
objects.
S= {1,2,3} then (3,2,1) is a 3-permutation of S
(2,3) is a 2-permutation of S.

Combinations: r-combinations of elements is a set of unordered


selection of r elements form the set.
R-combination is a subset of r elements in the Set S.
C(4,2) = 2 combination of 4 elements {a,b,c,d}
Questions

Ans 1] Types of 3 letter


Q1. How many 3 letter
words : LOG, OGA, ART,
with or without meaning
ARH
can be formed from
so the number of
'LOGARITHMS' if repetition
permutation is
is not allowed. nP = 10P
r 3
Ans 2]
Q2. In a cricket championship 21 matches played
there are 21 matches if each Each team played with other
team plays one match with team
every other team. What is Hence number of teams in n.
the total number of teams.
• nC2 = 21
Q3. A question paper consists of 10
questions divided into part A and part B.
Each part has 5 questions . A candidate
has to answer 6 questions in all atleast
2 should be from part A and 2 should be
from part B. How many ways can a
student select the questions if he can
answer all equally well.
• Possibilities:
A B Total
2 4 6
3 3 6
4 2 6

• Number of ways to choose 2 from part A and 4 from part


B=
• Number of ways to choose 3 from part A and 3 from part
B=
• Number of ways to choose 4 from part A and 2 from part
B=
• So the total number of ways = 50 + 100 + 50 = 200.
A4] ABC must occur as
Q4.How many
a block , so find the
permutations of the
number of
letters ABCDEFGH
permutations of 6
contain the string ABC.
objects. 6!=720
Q5. Find the number of
permutations of the word
'CLIMATE' such that the
vowels should always
occur in odd places.
Ans 5]
Q6. Suppose a saleswomen has to A6] Number of possible paths
visit 8 different cities. She must between the cities is the
begin her trip in a specified city, but permutation of 7 elements,
she can visit other cities in any because the first city is determined
order that she wishes. How many the remaining 7 cities can be
possible orders can he saleswomen ordered arbitrarily. Hence 7! = 5040
use when visiting the cities. paths
Difference between permutation and
combinations

Permutations Combinations
• Arrangement • Selection
• Order is important • Order is not important
Binomial Coefficients
• The number of r-combinations for a set of n elements is also
called
Binomial Theorem
Binomial Theorem

(a+b) =
3 (a+b) (a+b) (a+b)
How many possible ways to pick an element per
(a+b) to obtain a term on the right-hand side.

a3 ab2 a2b b3
Binomial Theorem

(a+b)3 = a3 + 3ab2 + 3a2b + b3

a2b = choose 1 b from 3 sets of (a+b)

ab2 =choose 2 b from 3 sets of (a+b)


Binomial Theorem

Property 1: if x = 1 and y = x in the expression (x+y)n (Next Slide)

Property 2: if x = 1 and y = 1 in the expression (x+y)n i.e. (1+1)n =2n

Property 3: rth term in the Binomial Coefficient (Next Slide)

Property 4: n is odd there are 2 middle terms (n+1th) & (n+1th + 1)


2 2
If n is even then 1 middle term (n+2nd) (Next Slide)
2
Binomial Theorem Property 1:
Binomial Theorem Property 3: rth term in the Binomial Coefficient
Binomial Theorem Property 4:
Problems

Q2. What is the


Q1. What is the coefficient of x y
12 13

expansion of (x+y)4 in the expression


(2x-3y)25
Problems

Q3] Expand Q4] Expand


(a+b)6 (1.04)4

Q5] Find the


middle term
in (3x – 4)6
Pascal's Identity and Triangle
• This is the basis for a geometric arrangement of binomial
coefficients in a triangle
• The nth row in the triangle consists of the binomial coefficients of
Pascal's Triangle

Pascal's identity together with


initial conditions (n 0) = (n n) = 1
for all integers n can be used to
recursively define binomial
coefficients.

Pascals Identity is the basis of


geometric arrangement of the
binomial coefficients in a triangle .
Fun Facts of the Pascal's triangle
Pascal's Triangle
Generalized Permutations and Combinations
• In many counting problems elements will be repeated.
• Eg. Numbers in a license plate
• So we consider permutations and combination where items are
used more than once.
• i.e counting involves indistinguishable objects (contrast to all
problems that was distinguishable)
• Eg.
Letters on the work SUCCESS
Permutations with repetitions
• Example 1: How many strings of length r can be formed from the
English alphabet?
Solution:
By product rule, as there are 26 letters & each letter can be
repeated – there are 26r strings of length r.
Combinations with repetitions
Example 1:How may ways can 100 be written as a sum of 4-non
negative integers.

n=100 r=4

n+r-1C = 100+4-1C4
r

You might also like