Chapter 5

Counting
• Basic:
Password Combination ???
 Basic Counting Principles
• Product Rule
• Sum Rule
 Product Rule
• When a procedure is made up of separate
tasks:

-> Single task broken into two sequence n1 & n2.

Total number if ways to solve it is n1n2
• Examples:
1. Two employees & Seven offices.
7x6 = 42 ways to distribute the responsibilities

2. Number plate containing the sequence of three letters

followed by three digits.
26 x 26 x 26 x 10 x 10 x 10 = ########
 Sum Rule
• Can be solved either in n1 ways or n2 ways
• n1 & n2 are totally different set

Example: Any committee formation

Tree Diagram
 Pigeonhole Principle
• If k is a positive integer & k+1 or more objects
are placed into k boxes, then there is at least
one box containing two or more of the
objects.

• Prove: by contrapositive
 Thank You
Wish you a very good Term end Exam