Scribd
Upload
65 views5 pages

Em - S13 (Permutation Combination - Set 2)

This document provides solutions to 15 problems involving permutations and combinations. The problems cover a range of topics including number of arrangements, distributions of objects, and counting principles. For each problem, the solution is provided along with a short explanation of the steps taken to arrive at the answer.

Uploaded by

Abhishek Maurya
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
65 views5 pages

Em - S13 (Permutation Combination - Set 2)

This document provides solutions to 15 problems involving permutations and combinations. The problems cover a range of topics including number of arrangements, distributions of objects, and counting principles. For each problem, the solution is provided along with a short explanation of the steps taken to arrive at the answer.

Uploaded by

Abhishek Maurya
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/ 5

ENGINEERING MATHEMATICS

PERMUTATION & COMBINATION_SET-2

SOLUTIONS

1. How many numbers of five digits can be formed from the numbers 2, 0, 4, 3, 8 when
repetition of digits is not allowed?

(a) 96 (b) 144


(c) 120 (d) 14

Solution: Option (a)

Explanation:

Numbers are 2, 0, 4, 3, 8
Numbers can be formed = (Total) – (those beginning with 0)

= 5! – 4! = 96

2. 4 buses runs between Bhopal and Gwalior. If a man goes from Gwalior to Bhopal by a bus and
comes back to Gwalior by another bus, then the total possible ways are

(a) 12 (b) 4
(c) 16 (d) 8

Solution: Option (a)

Explanation:

Since the man can go in 4 ways and can back in 3 ways. Therefore total number of ways are 12
ways.

3. If 12Pr, then r is equal to

(a) 5 (b) 3
(c) 4 (d) 2

Solution: Option (b)

Explanation:

1
12
P3 = 1320 hence r = 3

4. In how many ways can 5 prizes be distributed among four students when every student can
take one or more prizes?

(a) 1024 (b) 120


(c) 625 (d) 600

Solution: Option (a)

Explanation:

Required number of ways are 45 = 1024


{Since each prize can be distributed in 4 ways}.

5. How many words comprising of any three letters of the word UNIVERSAL can be formed?

(a) 504 (b) 540


(c) 405 (d) 450

Solution: Option (a)

Explanation:
9
P3 = 504

6. Find the total number of 9 digit numbers which have all the digits different.

(a) 9 * 9! (b) 10!


(c) 9! (d) None of these

Solution: Option (a)

Explanation:
10
P9 – 9P8 = 9 * 9!

7. If nP4 : nP5 = 1 : 2, then n =

(a) 4 (b) 6

2
(c) 5 (d) 7

Solution: Option (b)

Explanation:
(n! / (n – 4)!) * ((n – 5)! / n!) = 1/2 ⇨ n – 4 = 2

8. In how many ways can 10 true-false questions are replied?

(a) 20 (b) 512


(c) 100 (d) 1024

Solution: Option (d)

Explanation:

Required number of ways are 210 = 1024, because every question may be answered in 2 ways.

9. The number of 5 digit telephone numbers having at least one of their digits repeated is

(a) 90,000 (b) 30,240


(c) 100,000 (d) 69,760

Solution: Option (d)

Explanation:

Using the digits 0, 1, 2, ……., 9 the number of five digit telephone numbers which can be
formed is (since repetition is allowed)

The number of five digit telephone, numbers which have none of the digits repeated
= 10P5 = 30240

The required number of telephone numbers


= 105 – 30240 = 69760

10. Numbers greater than 1000 but not greater than 4000 which can be formed with the digits 0,
1, 2, 3, 4 (repetition of digits is allowed), are

(a) 350 (b) 450


(c) 375 (d) 576

3
Solution: Option (c)

Explanation:

Numbers greater than 1000 and less than or equal to 4000 will be of 4 digits and will have either
1 (except 1000) or 2 or 3 in the first place with 0 in each of remaining places.

After fixing 1st place, the 2nd place can be filled by any of the 5 numbers. Similarly 3rd place can
be filled up in 5 ways and 4th place can be filled up in 5 ways. Thus there will be ways in which
1 will be in 1st place but this include 1000 also hence there will be 124 numbers having 1 in the
first place.

11. If the best and the worst paper never appear together, then six examination papers can be
arranged in how many ways?

(a) 120 (b) 240


(c) 480 (d) None of these

Solution: Option (c)

Explanation:

If the best and the worst appear always together, the number of ways: 5! * 2.
Therefore required number of ways: 6! – 5!*2 = 480

12. The sum of the digits in the unit place of all numbers formed with the help of 3, 4, 5, 6 taken
all at a time is

(a) 18 (b) 108


(c) 432 (d) 144

Solution: Option (b)

Explanation:

Required sum = 3!(3 + 4 + 5 + 6) = 108


[If we fix 3 of the unit place, other three digits can be arranged in ways similarly for 4, 5, 6.]

13. The number of ways in which 6 rings can be worn on the four fingers of one hand is

(a) 46 (b) 64

4
(c) 6C4 (d) None of these

Solution: Option (a)

14. There are 3 candidates for a post and one is to be selected by the votes of 7 men. The
number of ways in which votes can be given is

(a) 75 (b) 7C3


(c) 37 (d) None of these

Solution: Option (c)

Explanation:

1st man can vote in 3 ways. 2nd man can vote in 3 ways. Similarly all other men can vote in 3
ways individually, hence the total number of ways 37 ways.

15. In how many ways can mn letters in n letter-boxes?

(a) (mn)n (b) (n)mn


(c) (m)mn (d) None of these

Solution: Option (b)

Explanation:

Required number of ways are nmn since each letter may be posted in n ways.

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