PLUS Code SHAH10 Quant by Ronak Shah

LAKSHYA’22 Batch

DPP – Modern Maths - Session 1

Counting Principle

(Solutions at the End)

1.

There are 6 trains running between Indore and Bhopal. In how many ways can a man go from Indore to
Bhopal and return by a different train?

2.

In the previous question, if the person can return by any one of the 6 trains, then find the number of ways
in which he can go from Indore to Bhopal and return from Bhopal to Indore.

3.

In a MOCK CAT there are 3 sections viz, QA, English and DI containing 4, 6 and 11 questions respectively. In
how many ways can a candidate select one question from each of the three sections?

4.

A tricolour flag is to be formed having three adjacent strips of three different colours chosen from six
different colours. How many different coloured flags can be formed with different design in which all the
three strips are always in horizontal positions?

5.

In how many ways can 5 prizes be given away to 7 boys when each boy is eligible for all the prizes?

6.

A test paper consists of 10 questions and each questions has 4 choices. If each question is necessarily
attempted, then find the number of ways of answering the test paper.

Telegram Group: t.me/Unacademy_Ronak Shah

PLUS Code SHAH10 Quant by Ronak Shah

7.

A set of 6 questions contains true/false type questions. Maximum how many students can take the test if
all the students answer differently from others and must attempt all the questions?

8.

How many numbers can be formed with digits 2, 4, 6, 8 without repetition?

9.

How many four digit numbers can be formed using 5 only once but 5 must be used in all such numbers?

10.

How many four digit numbers can be formed with the digits 0, 2, 3, 5, 8, 9 if

(i) Repetition of digits is allowed.

(ii) Repetition of digits is not allowed.

Solution:

1.

A man can go from Indore to Bhopal in 6 ways by any one of the 6-train available. Then he can return from
Bhopal to Indore in 5 ways by the remaining 5 trains, since he cannot return by the same train by which
he goes to Bhopal from Indore. Thus, the required number of ways = 6 x 5 = 30.

2.

He can go from Indore to Bhopal in 6 ways and he can return from Bhopal to Indore in 6 ways also. Hence
the number of ways in which he can go from Indore to Bhopal and return from Bhopal to Indore = 6 x 6 =
36 ways.

3.

The candidate can select one question from QA in 4 ways, one question from English in 6 ways and one
question from DI in 11 ways. Hence he can select one question from each of three sections in 4 x 6 x 11 =
264 ways.

4.

First strip cab be coloured in 6 ways and second strip can be coloured in 5 ways and third can be colured
in 4 ways. Hence all the three strips can be coloured in 6 x 5 x 4 = 120 ways.

Telegram Group: t.me/Unacademy_Ronak Shah

PLUS Code SHAH10 Quant by Ronak Shah

Hence, there can be 120 differently coloured flags.

5.

First prize can be given away to any one of 7 boys in 7 ways. Again, second prize can be given away to any
one of the 7 boys since each boy is eligible for all the prizes. Similarly, third, fourth and fifth prize can also
be given away in 7 ways.

Hence, the required number of ways = 7 x 7 x 7 x 7 x 7 = 75.

6.

Since each question can be answered in 4 ways. So, the total number of ways of answering 10 questions =
4 x 4 x 4 x 4 x 4 … 10 times = 410.

7.

A questions can be answered in two ways i.e., either true or false. Hence all the 6 questions can be
answered in 2 x 2 x 2 x 2 x 2 x 2 = 2 6 = 64 students.

8.

Case 1. There are 4 numbers of 1 digit.

Case 2.

4 3

=> 4 x 3 = 12

There are 12 numbers of 2 digits.

Case 3.

4 3 2

 4x3x2 = 24

There are 24 numbers of 3 digits.

Case 4.

4 3 2 1

 4x3x2x1 = 24

There are 24 numbers of 4 digits.

Hence, total required numbers = 4 + 12 + 24 + 24 = 64

Note: No any number of 5, 6, 7, …. Digits can be formed since we have only four digits and repetitions of
digits is not allowed.

9.

Case 1.

8 9 9 1

=> 8 x 9 x 9 x 1 = 648

Telegram Group: t.me/Unacademy_Ronak Shah

PLUS Code SHAH10 Quant by Ronak Shah

When 5 is fixced at unit place, then there are only 8 digits available for thousands place (i.e., except to 0
and 5). Agains hundreds and tens places can be filled by any one of digits from 0 to 9 excepts 5.

10.

(I) 5 6 6 6

5 6 6 6

=> 5 x 6 x 6 x 6 = 1080

Since at thousnd place zero can not be placed.

(ii)

5 5 4 3

 5 x 5 x 4 x 3 = 300

Since at thousnds palce zero cannot be placed so only 5 digit are availbale and there are only 5 remaining
digits available for hundreds palce and 4 digits for tens place and 3 digits for unit place.

Telegram Group: t.me/Unacademy_Ronak Shah