Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
15 views15 pages

Unit 3 Lecture 4

The document discusses permutations and combinations, essential concepts in counting and probability. It explains permutations as arrangements where order matters and combinations as selections where order does not matter, providing formulas and examples for both. Additionally, it introduces the binomial theorem and its application in finding coefficients of binomial expansions.

Uploaded by

ahersuraj23march
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)
15 views15 pages

Unit 3 Lecture 4

The document discusses permutations and combinations, essential concepts in counting and probability. It explains permutations as arrangements where order matters and combinations as selections where order does not matter, providing formulas and examples for both. Additionally, it introduces the binomial theorem and its application in finding coefficients of binomial expansions.

Uploaded by

ahersuraj23march
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/ 15

Sets and Combinations

Lecture 4
BY
ANANYA PANDEY
Permutation and combination both are important parts of counting. Counting the numbers
with pure logic is itself a big thing. Without counting we can’t solve probability problems.
This is the reason why we learn permutations and combinations just before probability.
Permutation
The permutation is a selection process in which the order matters. Permutation can simply be defined as the
number of ways of arranging few or all members within a particular order. This is all about the term
Permutation.

Example: The permutations of the letters in a small set {a, b, c} are:

abc acb

bac bca

cab cba

A formula for the number of permutations of k objects from a set or group of n. This is generally written nPk.

Formula:

n
Pk = n! /(n-k)!
There are Two Types of Permutation:

1. Permutations with Repetition

How many 5 digit numbers can be formed from 1,2,3,4 with repetition?

4x4x4x4x4 = 4^5

So, the general formula is simply: n^r where n is the number of elements to choose from (ie. set or sink of
elements) and we choose r of them, repetition is allowed, and order matters.

How many 3 letter words with or without meaning can be formed by NUTS when repetition is allowed?

4x4x4 = 4^3
2. Number of permutations of ‘n’ objects where p1 objects are of one kind, p2 objects are of second kind……...pk objects are of
kth kind:

n!/p1!xp2!....pk!

Example 1: Total number of permutations of word ALLAHABAD.

9!/4!x2! = 4560 ways

Example 2: In how many ways 4 red, 3 yellow and 2 green discs be arranged in a row if the disk of the same color are
indistinguishable.

9!/4!x3!x2!

3. Permutations Without Repetition

n
Pk = n! /(n-k)!
Find the number of arrangements of the letters of the word ‘INDEPENDENCE’. In how many of
these arrangements,
(1) Do the words starts with P
(2) Do all vowels always occur together
(3) Do all vowels never occur together
(4) Do the words begin with I and end with P
(5) Repeat (4) with I and P interchangeable
Total arrangements = 12!/4!x3!x2! = 1663200

(1) 11!/4!x3!x2! = 138600

(2) There are 5 vowels in the given word 4 times E and 1 time I, since they have to always
occur together so let’s consider them as one single object EEEEI. This single object
together with 7 remaining objects will account for 8 objects, in which there are 3 N’s and 2
D’s so total number of arrangements will be:

8!/3!x2!
Correspondingly, to each of these arrangements, the 5 vowels EEEE and I can be
rearranged in: 5!/4! Ways

Therefore, the required number of arrangements will be: 8!/3!x2! X 5!/4! = 16800

(3) total number of arrangements - number of arrangements where all vowels occur
together : 1663200-16800 = 1646400

(4) After fixing I and P we are left with 10 letters therefore: 10!/4!x3!x2! = 12600

(5) I and P can be further arranged in 2! Ways therefore, 12600x2! = 25200 ways
From a club of 24 members a president, vice president, secretary, treasurer and
historian are to be elected. In how many ways can office be filled?

24P5 = 24!/(24-5)!
Combination
What is Combination?

Combination is the way of selecting items from a bulk collection, such that (non-similar permutations) the
order of selection does not matter.

nCr = n!/r!(n-r)!
Example: To play a particular card game, each player is dealt five cards from a standard deck of
52 cards. How many different hands are possible?
52C5 = 52!/5!x(52-5)! = 2,598,960

A student must answer 3 out of 5 essay questions on a test. In how many different ways can the student
select the question?

5C3 = 5!/3!x(5-3)!
The traveling squad for a basketball team consists of two centers, five forwards, and four guards. In
how many ways can the coach select a starting team of one center, two forwards, and two guards?

2C1 x 5C2 x 4C2 = 2 x 10 x 6 = 120


Difference between Permutation and Combination with Examples

We’ll see some examples to understand the difference between them.

Permutations

● Arrangement of people, digits, numbers, alphabets, letters, and colours etc.


● Picking a team captain or keeper and a particular one from a group.
● Picking two favourite colours, in order, from a colour book.
● Picking first, second and third prize winners.

Combinations

● Selections of the menu, food, clothes, subjects, team etc.


● Picking three team members from a group.
● Picking two colours from a colour book.
● Picking three winners only.
The Binomial Theorem
The binomial theorem gives the coefficients of the expansion of powers of binomial
expressions. A binomial expression is simply the sum of two terms, such as x + y.
Middle term in the expansion of (a+b)^n

(1) If n is even then the middle term will be: [n/2 + 1]th term.

(2) If n is odd then the 2 middle terms will be:

[ (n+1)/2 ]th term and [ (n+1)/2 + 1]th term

You might also like