0% found this document useful (0 votes)
71 views4 pages

Ways to Form Five-Digit Numbers

This document contains 23 math word problems involving concepts like permutations, combinations, and counting principles. The problems cover a range of mathematical topics and involve calculating totals, sums, and numbers of arrangements under given constraints.

Uploaded by

Aseem Aggarwal
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
0% found this document useful (0 votes)
71 views4 pages

Ways to Form Five-Digit Numbers

This document contains 23 math word problems involving concepts like permutations, combinations, and counting principles. The problems cover a range of mathematical topics and involve calculating totals, sums, and numbers of arrangements under given constraints.

Uploaded by

Aseem Aggarwal
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

6. If the L.C.M.

of '  ' and '  ' is p 2 q4 r 3 , where

p , q , r are prime numbers and  ,   I  , then the


1. The letters of the word 'GHAJINI' are permuted and
all the permutations are arranged in a alphabetical number of ordered pairs ( ,  ) are :
order as in an English dictionary , then total number (a) 225 (b) 420 (c) 315 (d) 192
of words that appear after the word 'GHAJINI' is
given by : 7. Total number of non-negative integral solutions of
(a) 2093 (b) 2009 18  x1  x2  x3  20 , is given by :
(c) 2092 (d) 2091
(a) 1245 (b) 685
2. If John is allowed to select at most (n + 1) chocolates (c) 1150 (d) 441
from a collection of (2n + 2) distinct chocolates , then
total number of ways by which John can select at least 8. If Mr. and Mrs. Rustamji arrange a dinner party of 10
two chocolates are given by : guests and they are having fixed seats opposite one
another on the circular dinning table , then total number
(a) (4)n  4. 2n1Cn  2n  1
of arrangements on the table , if Mr. and Mrs. Batliwala
(b) 2(4)n  4. 2n1Cn  2n  3 among the guests don't wish to sit together , are given
by :
(c) 2(4)n  2n1Cn  2n  3
(a) 148 (8!) (b) 888 (8!)
n 2 n 1
(d) 2(4)  Cn  2n  3 (c) 74 (8!) (d) 164 (8!)

3. The coefficient of x1502 in the expansion of 9. If 10 identical balls are to be placed in identical boxes ,
then the total number of ways by which this placement
(1  x  x ) 2 2007

.(1  x)2008 is is possible , if no box remains empty , is given by :
(a) 2007
C501  2006C500 (a) 210 (b) 11 (c) 9 (d) 5

(b) 2006
C500  2006C501 10. Total number of ways by which the word
'HAPPYNEWYEAR' can by arranged so that all vowels
2007 appear together and all consonants appear together ,
(c) C498  2006C499
is given by :
(d) 2007
C501  2007 C1506 (a) 12(7!) (b) 6(8!)
(c) 8 (7!) (d) 3 (8!)
4. X and Y are any 2 five digits numbers , total number
of ways of forming X and Y with repetition , so that
11. The number of seven digit integers , with sum of the
these numbers can be added without using the carrying
digits equal to 10 and formed by using the digits 1 , 2
operation at any stage , is equal to :
and 3 only , is :
(a) 45(55)4 (b) 36(55)4
(a) 55 (b) 66 (c) 77 (d) 88
(c) (55)5 (d) 51(55)4
 
12. Let r be a variable vector and a  i  j  k such that
5. A team of four students is to be selected from a total
  
of 12 students , total number of ways in which team scalar values r . i , r . j and r . k are positive
     
can be selected if two particular students refuse to be
together and other two particular students wish to be  
integers. If r . a is not greater than 10 , then total
together only , is equal to :

(a) 226 (b) 182 numbers of possible r are given by :
(c) 220 (d) 300 (a) 80 (b) 120 (c) 240 (d) 100

[ 31 ]
Permutation and Combination

13. Let three lines L1 , L2 , L3 be given by 2x + 3y = 2 , 20. Total number of ways of selecting two numbers from
4 x  6 y  5 and 6 x  9 y  10 respectively. If line Lr the set of {1 , 2 , 3 , 4 , .... , 3n} so that their sum is
divisible by 3 is equal to :
contains 2r different points on it , where r  {1 , 2 , 3} ,
3n 2  n
then maximum number of triangles which can be formed (a) 3n2 – n (b)
with vertices at the given points on the lines , are given 2
by : 2n 2  n
(c) (d) 2n 2  n
(a) 320 (b) 304 2
(c) 364 (d) 360

14. Let function ' f ' be defined from set A to set B , where
A  B  {1 , 2 , 3 , 4}. If f ( x)  x , where x  A , 21. Total number of four letters words that can be formed
then total number of functions which are surjective is from the letters of the word 'DPSRKPURAM' , is given
given by : by
(a) 12 (b) 10 (a) 10C4.(4!)
(c) 9 (d) 8 (b) 2190

15. Total number of five digit numbers that can be   


(c) Coefficient of x4 in 4!. 1  x  x 2 1  x 
6

formed , having the property that every succeeding
digit is greater than the preceding digit , is equal to : 2
(d) Coefficient of x4 in 3!. 1  x  1  ( x  1)2 
 
6

(a) 9P5 (b) 9C4  

(c) 10C5 (d) 10P5 22. Consider seven digit number x1 x2 x3 x4 .... x7 , where
x1 , x2 , .... x7  0 , having the property that x4 is the
16. An n-digit number is a positive number with exactly greatest digit and digits towards the left and right of x4
n digits. Nine hundred distinct n-digit numbers are to are in decreasing order , then total number of such
be formed using only the three digits 2 , 5 and 7. The numbers in which all digits are distinct is given by :
smallest value of n for which this is possible , is :
(a) 9C7 .6C3 (b) 9C2 . 6C4
(a) 6 (b) 7
(c) 3. 9C7 . 5C1 (d) 2. 9C2 . 5C2
(c) 8 (d) 9
23. Consider xyz = 24 , where x , y , z  I , then
17. Consider n boxes which are numbered by n
consecutive natural numbers starting with the number
(a) Total number of positive integral solutions for
m. If the box with labelled number k , k  m , contains x , y , z are 81
k distinct books , then total number of ways by which (b) Total number of integral solutions for x , y, z
m books can be selected from any one of the boxes , are 90
are :
n m
(c) Total number of positive integral solutions for
(a) n Cm 1 (b) Cm x , y , z are 30

(c) n Cm 1 (d) n m
Cn 1 (d) Total number of integral solutions for x , y , z
are 120
18. Total number of triplets (x , y , z) which can be
formed , selecting x , y , z from the set 24. If n Cr 1  (m2  8). n 1Cr ; then possible value of 'm'
{1 , 2 , 3 , 4 , .... 100} such that x  y  z , is equal to : can be :
(a) 4 (b) 2
(a) 100C3 (b) 101C3
(c) 3 (d) –5
(c) 102C3 (d) 100C2
25. Let 10 different books are to be distributed among four
19. Total number of ways in which a group of 10 boys and students A , B , C and D. If A and B get 2 books each C
2 girls can be arranged in a row such that exactly and D get 3 books each , then total number of ways of
3 boys sit in between 2 girls , is equal to : distribution are equal to :
(a) 1440(8!) (b) 720(8!) (a) 10C4 (b) 25200

(c) 10(9!) (d) 180(8!) 10!


(c) 12600 (d)
(2!)2 (3!) 2

[ 32 ]
28. Statement 1 : Total number of polynomials of the form
x3 + ax2 + bx + c which are divisible by x2 + 1 , where
Following questions are assertion and reasoning type
a , b , c  {1 , 2 , 3 , ....10} must be 10
questions. Each of these questions contains two
statements , Statement 1 (Assertion) and Statement 2
because
(Reason). Each of these questions has four alternative
answers , only one of them is the correct answer. Select Statement 2 : value of 'b' can be selected in 10
the correct answer from the given options : ways from the set of first 10 natural number and
(a) Both Statement 1 and Statement 2 are true and a = c = 1.
Statement 2 is the correct explanation of Statement 1.
(b) Both Statement 1 and Statement 2 are true 29. Statement 1 : If a , b  N and x  7 a.5b , where x
but Statement 2 is not the correct explanation of and 7x is having 12 and 15 positive divisors
Statement 1. respectively , then the number of positive divisors of
(c) Statement 1 is true but Statement 2 is false. 5x is 16
(d) Statement 1 is false but Statement 2 is true. because

( mn)! Statement 2 : Sum of all the positive divisors of


26. Statement 1 : If n , m  I  , then N  is
m
( n !) .( m !) ( ) a .(  ) b , where a , b N , is equal to
always an integral value (1   a 1 )(1   b 1 )
, provided  and  are the prime
because 1      
Statement 2 : 'N' represents the total numbers of numbers.
ways of equal distribution of (mn) distinct objects
among 'm' persons. 30. Statement 1 : Let A1 , A2 ... , A30 be thirty sets each
27. Statement 1 : From a group of 5 teachers and with five elements and B1 , B2 , ... , Bn be n sets each
5 students , if a team of 5 persons is to be formed 30 n
having at least two teachers then total number of ways with three elements such that  A  B
i 1
i
i 1
i  S . If
be which team can be formed is given by  C . C 
5 8

.
2 3 each element of S belongs to exactly ten of the Ai’s
{i.e. , selection of 2 teachers from 5 and 3 more persons and exactly nine of the Bj’s , then the value of n is 45
from remaining 8}
because
because
Statement II : The team may have 5 teachers ,  n  n
Statement 2 : n   Ai    n ( Ai ) , where n( A)
or 4 teachers and 1 student , or 3 teachers and 2  i 1  i 1
students , or 2 teachers and 3 students. represent the number of elements of set A.

[ 33 ]
Permutation and Combination

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


Ex
6. (c) 7. (d) 8. (c) 9. (d) 10. (d)

11. (c) 12. (b) 13. (b) 14. (c) 15. (b)

16. (b) 17. (d) 18. (b) 19. (a) 20. (b)

21. (b , d) 22. (a , d) 23. (c , d) 24. (a , c , d) 25. (b , d)

26. (c) 27. (d) 28. (c) 29. (b) 30. (b)

[ 36 ]

You might also like