CENGAGE / G TEWANI MATHS SOLUTIONS CHAPTER PERMUTATIONS AND COMBINATIONS || ALGEBRA Download Doubtnut Today
Ques No.
Question CENGAGE_MATHS_ALGEBRA_PERMUTATIONS COMBINATIONS_Fundamental Principal Of Counnting 1
AND
Find the number 4 letter words, with or without meaning, which can be formed out of the letters of the word MAKE, where the repetition of the letters is not allowed. Watch Free Video Solution on Doubtnut
CENGAGE_MATHS_ALGEBRA_PERMUTATIONS COMBINATIONS_Fundamental Principal Of Counnting 2
AND
How may two-digit even numbers can be formed form the digits 1,2, 3, 4, 5 if the digits can be repeated? Watch Free Video Solution on Doubtnut
CENGAGE_MATHS_ALGEBRA_PERMUTATIONS COMBINATIONS_Fundamental Principal Of Counnting 3
AND
Find the number of different signals that can be generated by arranging at least 2 flags in order (one below the other) on a vertical staff, if five different flags are available. Watch Free Video Solution on Doubtnut
CENGAGE_MATHS_ALGEBRA_PERMUTATIONS COMBINATIONS_Fundamental Principal Of Counnting
4
AND
Poor Dolly’s T.V. has only 4 channels, all of them quite boring. Hence it is not surprising that she desires to switch (change) channel after every one minute. Then find the number of ways in which she can change the channels so the she is back to her original channel for the first time after 4 min. Watch Free Video Solution on Doubtnut
CENGAGE_MATHS_ALGEBRA_PERMUTATIONS COMBINATIONS_Fundamental Principal Of Counnting 5
AND
There are n locks and n matching keys. If all the locks and keys are to be perfectly matched, find the maximum number of trails required to open a lock. Watch Free Video Solution on Doubtnut