The number of permutations of the letters of the word HINDUSTAN such that neither the pattern HIN nor DUS nor TAN appears is x . Find the digit sum of x .
Details and assumptions
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If somebody will go through this way then also he will report 30 as answer but this solution is absolutely wrong
Total no of permutations 9 ! Number of permutations having all three patterns 3 ! Number of permutations having any 2 patterns ³ c 2 × 5 ! Number of permutations having any one pattern ³ c 1 × 7 !
Therefore number of required permutations :
9 ! − ( ³ c 2 5 ! + ³ c 1 7 ! + 3 ! ) = 3 4 7 3 9 4
Correct answer should be 1 6 9 1 9 4
Log in to reply
I agree correct answer should be 169194.
Why is the answer 169194? Can u provide a solution pls?
Log in to reply
2 9 ! − ( 7 ! + 7 ! + 2 7 ! ) + ( 3 × 5 ! − 3 ! )
1 8 1 4 4 0 − 1 2 6 0 0 + 3 5 4 = 1 6 9 1 9 4
I think this will help you
Log in to reply
@Kïñshük Sïñgh – I too have done the same way.
@Kïñshük Sïñgh – I did the 9!/2 - [7! + 7! +7!/2] part.. how do u explain the remaining part?
Log in to reply
@Chinmay Raut – L e t s u n d e r s t a n d t h i s w i t h a n e x a m p l e , f i r s t c l u b H I N 1 . H I N _ _ _ _ _ _ D U S _ _ H I N _ ( o n e o f t h e a r r a n g e m e n t ) w a y s o f a r r a n g i n g = 7 ! 2 . n o w , c l u b D U S D U S _ _ _ _ _ _ D U S _ _ H I N _ ( o n e o f t h e a r r a n g e m e n t ) w a y s = 2 7 ! t h e r e f o r e t h e r e w i l l b e r e p e t a t i o n o f s o m e c a s e s l i k e t h e s e w h i c h w e h a v e c o u n t e d i n 1 . t h a t s w h y w e h a v e t o a d d 3 × 5 ! a n d o n e c a s e w h i c h w i l l b e c o u n t e d i n a l l t h e a r r a n g e m e n t s ( H I N D U S T A N ) , t h e r e f o r e w e h a v e t o s u b s t r a c t i t t h e r e f o r e o u r r e q u i r e d a n s w e r w i l l b e 2 9 ! − ( 7 ! + 7 ! + 2 7 ! ) + ( 3 × 5 ! − 3 ! ) = 1 6 9 1 9 4
Problem Loading...
Note Loading...
Set Loading...
Anybody getting the answer as 168942 will also report 30 as digit sum. There are 2 N's hence permutations of HINDUSTAN are 9!/2, and not 9!, as claimed by Sandeep.