CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon


Question

A letter lock consist of three rings each marked with $$10$$ different letters. No of ways to make an unsuccessful attempts to open the lock is:


A
899
loader
B
999
loader
C
479
loader
D
568
loader

Solution

The correct option is B $$999$$

$$first\>ring\>has\>10\>options$$

$$second\>ring\>has\>10\>options$$

$$third\>ring\>has\>10\>options$$

$$\therefore\>permutation\>=\>10\times\>10\>\times\>10=1000$$

$$no.\>of\>ways\>of\>unsuccessful\>attempt\>=\>(1000-1)=999$$


Mathematics

Suggest Corrections
thumbs-up
 
0


similar_icon
Similar questions
View More


similar_icon
People also searched for
View More



footer-image