FUNDAMENTAL PRINCIPLES OF COUNTING WORKSHEET WITH ANSWERS

(1) (i) A person went to a restaurant for dinner. In the menu card, the person saw 10 Indian and 7 Chinese food items. In how many ways the person can select either an Indian or a Chinese food?     Solution

(ii) There are 3 types of toy car and 2 types of toy train available in a shop. Find the number of ways a baby can buy a toy car and a toy train?   Solution

(iii) How many two-digit numbers can be formed using 1,2,3,4,5 without repetition of digits?     Solution

(iv) Three persons enter in to a conference hall in which there are 10 seats. In how many ways they can take their seats?    Solution

(v) In how many ways 5 persons can be seated in a row?  Solution  

(2)  (i) A mobile phone has a passcode of 6 distinct digits. What is the maximum number of attempts one makes to retrieve the passcode?   Solution

(ii) Given four flags of different colours, how many different signals can be generated if each signal requires the use of three flags, one below the other?    Solution

(3)  Four children are running a race.   

(i) In how many ways can the first two places be filled?  Solution 

(ii) In how many different ways could they finish the race?   Solution 

(4)  Count the number of three-digit numbers which can be formed from the digits 2,4,6,8 if (i) repetitions of digits is allowed. (ii) repetitions of digits is not allowed    Solution

(5)  How many three-digit numbers are there with 3 in the unit place? (i) with repetition (ii) without repetition.  

Solution

(6)  How many numbers are there between 100 and 500 with the digits 0, 1, 2, 3, 4, 5 ? if (i) repetition of digits allowed (ii) the repetition of digits is not allowed.  Solution

(7)  How many three-digit odd numbers can be formed by using the digits 0, 1, 2, 3, 4, 5 ? if (i) the repetition of digits is not allowed (ii) the repetition of digits is allowed.

Solution

(8)  Count the numbers between 999 and 10000 subject to the condition that there are (i) no restriction. (ii) no digit is repeated. (iii) at least one of the digits is repeated.

Solution

(9)  How many three-digit numbers, which are divisible by 5, can be formed using the digits 0, 1, 2, 3, 4, 5 if (i) repetition of digits are not allowed? (ii) repetition of digits are allowed?   Solution

(10) To travel from a place A to place B, there are two different bus routes B1,B2, two different train routes T1, T2 and one air route A1. From place B to place C there is one bus route say B'1, two different train routes say T'1, T'2 and one air route A'1. Find the number of routes of commuting from place A to place C via place B without using similar mode of transportation.      Solution 

(11) How many numbers are there between 1 and 1000 (both inclusive) which are divisible neither by 2 nor by 5?  Solution

(12) How many strings can be formed using the letters of the word LOTUS if the word (i) either starts with L or ends with S? (ii) neither starts with L nor ends with S?  Solution

(13) (i) Count the total number of ways of answering 6 objective type questions, each question having 4 choices. 

Solution

(ii) In how many ways 10 pigeons can be placed in 3 different pigeon holes ?      Solution

(iii) Find the number of ways of distributing 12 distinct prizes to 10 students?       Solution

(14)  Find the value of 

  (i) 6!      (ii) 4! + 5!         (iii) 3! − 2!       (iv) 3! × 4!

  (v) 12! /(9! × 3!)     (vi)  (n + 3)!/(n + 1)!    Solution

(15)  Evaluate

n!/r!(n − r)! when

(i) n = 6, r = 2 (ii) n = 10, r = 3 (iii) For any n with r = 2.

  Solution

(16)  Find the value of n if

(i) (n + 1)! = 20(n − 1)!      (ii) (1/8!) + (1/9!)  =  n/10!

   Solution

Kindly mail your feedback to v4formath@gmail.com

We always appreciate your feedback.