Scribd
Upload
34 views19 pages

Techniques of Counting: Ms.M.Balamurali

The document discusses various counting techniques including permutations, combinations, binomial theorem, Pascal's triangle, and the pigeonhole principle. It provides definitions and examples of each technique. Permutations refer to arrangements of objects where order matters. Combinations are arrangements where order does not matter. The binomial theorem and Pascal's triangle relate to expanding binomial expressions. The pigeonhole principle states that if more objects are placed into categories than categories exist, at least one category will contain more than one object.

Uploaded by

fahad
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
34 views19 pages

Techniques of Counting: Ms.M.Balamurali

The document discusses various counting techniques including permutations, combinations, binomial theorem, Pascal's triangle, and the pigeonhole principle. It provides definitions and examples of each technique. Permutations refer to arrangements of objects where order matters. Combinations are arrangements where order does not matter. The binomial theorem and Pascal's triangle relate to expanding binomial expressions. The pigeonhole principle states that if more objects are placed into categories than categories exist, at least one category will contain more than one object.

Uploaded by

fahad
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/ 19

Techniques of Counting

Ms.M.Balamurali
Contents
Permutations
Introduction
Permutations with specific arrangements
Permutations with repetition
Practice with Permutation
Combination
Introduction
Practice with combination
Binomial theorem and Binomial Coefficients
Pascals triangle
Pigeonhole Principle
Learning Outcomes
After completing this module students will be able to
Calculate the number of elements in certain
mathematically defined sets where ordinary methods
of counting are tedious
Calculate number of possible outcomes of elementary
combinatorial processes such as permutations and
combinations
Permutation
A permutation is an arrangement of objects in different orders.

The order of the arrangement is important!! For example, the


number of different ways 3 students can enter school can be shown
as 3!, or 321, or 6. There are six different arrangements, or
permutations, of the three students in which all three of them enter
school.
The notation for a permutation: n Pr
n is the total number of objects
r is the number of objects chosen (want)

(Note if n = r then n Pr = n!)


Permutation
To find the permutations of {A, B, C, D, E}, there are:
Five possible choices for the first item

Four possible choices for the second item

Three remaining possible choices for the third item

Two remaining possible choices for the fourth item, and

Only one possible choice for the final item

For any positive integer N, we define N! (N factorial) as the


product of all the positive integers up to and including N
Example: 5! = 1 * 2 * 3 * 4 * 5 = 120

Given any N distinct items, there are N! possible permutations of


those items
Permutation
By the rule of product,

The number of permutations of n things


taken r at a Time

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

Note:
P(n, r ) =
n!
(n r )!
Permutations
with Specific Arrangements
EXAMPLE:

Use the letters in the word " square " and tell how many 6-letter
arrangements, with no repetitions, are possible if the :
a) first letter is a vowel.
b) vowels and consonants alternate, beginning with a consonant.
Solution:
Part a:
When working with arrangements, I put lines down to represent
chairs.
Before starting a problem I decide how many chairs I need to fill and
then work from there
I need six "chairs" ( 6-letter arrangements)
_____ _____ _____ _____ _____ _____

The first of the six chairs must be a vowel (u ,a , e). There are three
ways to fill the first chair.
__3___ _____ _____ _____ _____ _____
After the vowel has been placed in the first chair, there are 5
letters left to be arranged in the remaining five chairs.

__3__ __5__ __4__ __3__ __2__ __1__ or

3 5P5 = 3 120 = 360


Solution:
Part b:
I need six "chairs" ( 6-letter arrangements)
_____ _____ _____ _____ _____ _____

Beginning with a consonant, every other chair must be filled with


a consonant. (s ,q , r )

__3__ _____ __2___ _____ ___1__ _____

The remaining chairs have the three vowels to be arranged in


them:

__3__ __3___ __2___ __2___ ___1__ ___1__

= 36
Permutations
with Repetition
In general, repetitions are taken care of by dividing the
permutation by the number of objects that are identical!

Example1:
1. How many different 5-letter words can be
formed from the word APPLE ?
P5 5 4 3 2 1 120
5
= = = 60 words
2! 2 1 2
You divide by 2! Because the letter P repeats
twice
Permutations
with Repetition
Example:
2. How many different six-digit numerals can be written
using all of the following six digits:
4,4,5,5,5,7
P6 6 5 4 3 2 1 720
6
= = = 60
2!3! 2 1 3 2 1 12

Two 4s repeat and three 5s repeat


Permutations
with Repetition
The number of different permutations of n objects,
where there are n1 indistinguishable objects of type 1,
n2 indistinguishable objects of type 2, , and nk
indistinguishable objects of type k, is

n!
n1!n2 !..nk !
Combinations
A combination is a set of objects in which order is not important.

The number of combinations of n things


taken r at a time
n P(n, r )
C (n, r ) = =
n!
=
r r! (n r )!r!
or
Combinations
Example1: Evaluate 7C2 = 76 = 42 = 21
21 2
Example2: There are 12 boys and 14 girls in
Mrs.Schultzkie's math class. Find the number of ways Mrs.
Schultzkie can select a team of 3 students from the class to
work on a group project. The team consists of 1 girl
and 2 boys.
boy 12C2 girl 14C1

12 11 14
21 1
66 14
= 924
Binomial Theorem
Let x and y be variables, and let n be a positive integer. Then
n
(x + y )n = C (n, j )x n j y j
j =0
n n n n 1 n n 2 2 n 1 n 1 n n
= x + x y + x y + ... + x y + y
0 1 2 n 1 n
Pascals Triangle
C(0, 0)

C(1, 0) C(1, 1)

C(2, 0) C(2,1) C(2, 2)

C(3, 0) C(3, 1) C(3, 2) C(3,3)

C(4, 0) C(4, 1) C(4, 2) C(4,3) C(4, 4)

C(5, 0) C(5, 1) C(5, 2) C(5,3) C(5, 4) C(5, 5)


Pascals Triangle
1

1 1

1 2 1

1 3 3 1

1 4 6 4 1

1 5 10 10 5 1
The Pigeonhole Principle
Pigeonhole principle

If n pigeon holes are occupied by n+1 or more pigeons, then at


least one pigeon hole is occupied more than one pigeon.

Example:

Suppose a department contains 13 professors. Then two of the


professors (pigeons) were born in the same month (pigeon
holes).
The Pigeonhole Principle
Generalized pigeonhole principle

If n pigeonholes are occupied by kn+1 or more pigeons,


where k is a positive integer, the at least one pigeon hole
is occupied by k+1 or more pigeons.
Example:
Find the minimum number of students in a class to be sure
that three of them are born in the same month.
Here the n=12 months are the pigeonholes and k+1=3, or
k=2.Hence among any kn+1=25students (pigeons), three
of them are born in the same month.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy