Professional Documents
Culture Documents
@ **KED.our IRoBLEMS
kI the following examples the solution is given upto point of writing down the formula that will apply for
particular values after understanding the solution.
itself into arranging g letters amongst themselves (g! ways). Besides, we have to toot at the internal a:rangement of the
ways)
,l
I e.roon@i-'
things taken 4 at a
time'
,,,n;";'or
o".,,,u,u,ions or
. 6@bH;;::-1#;1*"
ina
Sofu6 The answer will be given by 6po. At, in each of i aif"r.ot boxes? r^'2ode@ How many 3-digit numbers can be formed (g/rtion The significance of at least 5 hats of each kind is^that while putting a hat in each box, we have the option " out of thd-aigits i,2, 3, q- ana {z
selection. ;:::Ht":i"J":TjJ';,*:"T:,$t'#:.,Hf:l? 5pr. j iossibilities of putting a hat in a box.) ' Thw in this question for every task of putting 'Yo]le:n @ h how- **, *uYs can the 7 letters M, N, a hat in n'O, P, Q R, s be arranged so that P-and Q occupy continuous box we frr. tt f$.iuility of either putting a red hat or plp+it " a blue hat. The'solution can then be looked at as: there are 5 tasks each of which can be done in 2 ways. Through the For *t9/^ together arranging the 7 letters keepi ng p and, e rule we have the total number of ways :25 (Aniwer). aFways we have to view r and () as-one leuei * Let this be denoted by PJ' , l@9o1" tl.l In how lnany ways can 4 Indians and 4 Then, we have to arrange the letters M, N, o, PQ, R Vepalese people be seated around a round table so that no and S in a linear Here, it is like arranging 6 two Indians are in adjacent positions? letters in 6 places (since 2 letters are counted as.one)-. T-his F$ruon ffwe fi.,t put 4 Indians around the round table, can be done in 6! ways. . .,, V "undo However, the solution is not complete at rhis pointi";' '-,;;;; this in 3! ways. il;r;;;L phced around the round tabte, of time since in the count of 6! the internal arrangement we have to place the four Neparese around the sdme round between P and Q is neglected' This can be done in 2f ways' iuut". Noo .ince the Indians are already praced we can do
Forming numbers requires an ordered Hence, the answer will be
kinds orhats, red andbrue ut least 5 of each kind, in how many ways can the hats
::lT@
"""'lk'}ffi 'ffrHTii.il,,u,J,ij
.
happen
be _o ,"n"., Answer:3! x 4! given by the formula: Total number of ways _ Number of Q_,<: ' olrollem tl,e How many numbers greater than a million , ttrey are always together) ^ways, \@"' ,r.n oi". or*"o, *ora' that can be formed cbdbe formed from the aigits t, 2,31,0,4,2,3? frilm the le(ers of the words BEGINS il ;il;J;-. , , (plution In order to forrn a number greater than a million - -----r --oWe should have a 7 digitnumber. Since we have with B and end with S? only seven
$luaonB&Sarefixedatthestartandtheendposi-$iJ#.xIiJ;ffi,ffiJl".ake0inthestartingposition
themselves. This cAn be done in 4!
3!)
ir th" r"n",,
nl
roai*,
Nepalerff"
will be the number words tilott."uo ["\rr4"d with,n" r"*^ "ffi;;;; BEGINS lnfrich have flana s at the
What
Tas{for thffiudent:
ways. of "*o"*"-;;;;
To ^^,-_^.,,_ _--solve
.l
h-ow many ways can the retters be u"u"g"i, so that all the are adjacent to each
other?
orthe ;,Tf;ffif"T:iffi:'?#"-",,T1f?;*"iTilTffi:
oxo
we have to
x s ,4;
t; i^r'i-:
i>< u,
t arrsforrns
This would have been the answer had all the digits been '' distinct. But-in this particular example-we have two 2,s and