# CBSE Class 11 – Mathematics: Numbers: Permutation Exercise 1 (For CBSE, ICSE, IAS, NET, NRA 2022)

Get top class preparation for CBSE/Class-9 right from your home: get questions, notes, tests, video lectures and more- for all subjects of CBSE/Class-9.

**Question 1**:

How many 3-digit numbers can be formed from the digits and assuming that

(i) Repetition of the digits is allowed.

(ii) Repetition of the digits is not allowed.

**Question 2**:

How many digit even numbers can be formed from the digits if the digits can be repeated?

**Question 3**:

How many letter code can be formed using the first letters of the English alphabet, if no letter can be repeated?

**Question 4**:

How many digit telephone numbers can be constructed using the digits to if each number starts with and no digit appears more than once?

**Question 5**:

A coin is tossed times and the outcomes are recorded. How many outcomes are there?

**Question 6**:

Given flags of different Colours, how many different signals can be generated if each signal requires the use of flags, one below the other?

We can solve all these question based on principle of mathematical counting

**Solution 1**:

(i) In first case, repetition of digits is allowed.

Therefore, the units place can be filled in by any of the given five digits.

Similarly, tens and hundreds of digits can be filled in by any of the given five digits.

Thus, by the multiplication principle, the number of ways in which three-digit numbers can be formed from the given digits is

(ii)

In this case, repetition of digits is not allowed. Here, if units place is filled in first, then it can be filled by any of the given five digits.

Therefore, the number of ways of filling the units place of the three-digit number is 5.

Then, the tens place can be filled with any of the remaining four digits and the hundreds place can be filled with any of the remaining three digits.

Thus, by the multiplication principle, the number of ways in which three-digit numbers can be formed without repeating the given digits is

We will learn in later part of chapter on how to solve these problem with the help of permutation formula

**Solution 2**

As the number must be even, the units place can be filled by 2 or 4 or 6 only i.e.. , the units place can be filled in 3 ways.

The tens place can be filled by any of the digits in different ways and the hundreds place can be filled by any of the digits in different ways, as the digits can be repeated.

Therefore, by multiplication principle, the required number of three digit even numbers are

**Solution 3**

The first place can be filled in different ways by any of the first letters of the English alphabet following which, the second place can be filled in by any of the remaining letters in different ways. The third place can be filled in by any of the remaining letters in different ways and the fourth place can be filled in by any of the remaining letters in different ways.

Therefore, by multiplication principle, the required numbers of ways in which 4 vacant places can be filled is

Hence, four-letter codes can be formed using the first letters of the English alphabet if no letter is repeated.

We will learn in later part of chapter on how to solve these problem with the help of permutation formula

**Solution 4**:

It is given that the digit telephone numbers always start with 67.

Therefore, there will be as many phone numbers as there are ways of filling 3 vacant

Places

The three vacant places above will be filled by the digits , keeping in mind that the digits cannot be repeated.

The units place can be filled by any of the digits from , except digits and 7.

Therefore, the units place can be filled in different ways following which, the tens place can be filled in by any of the remaining 7 digits in 7 different ways, and the hundreds place can be filled in by any of the remaining 6 digits in 6 different ways.

Therefore, by multiplication principle, the required number of ways in which 5-digit telephone numbers can be constructed is

We will learn in later part of chapter on how to solve these problem with the help of permutation formula

**Solution 5**:

When a coin is tossed once, the number of outcomes is (Head and tail) i.e.. , in each throw, the number of ways of showing a different face is .

Thus, by multiplication principle, the required number of outcomes is

**Solution 6**:

Each signal requires the use of flags.

There will be as many flags as there are ways of filling in vacant places in succession by the given flags of different Colours.

The upper vacant place can be filled in different ways by any one of the flags following which, the lower vacant place can be filled in 4 different ways by any one of the remaining different flags.

Thus, by multiplication principle, the number of different signals that can be generated is .