A letter lock consists of 3 rings each containing the alphabets A,B,C,D,E,G,H,I find the numner of false trials that can be made.How may false trials can be made in the attempt of opening the lock?(solve using permutation)
Answers
Answered by
0
The three rings were considered as 3 boxes and we solve this problem by fixing an alphabet in a ring , and consider the trials made in fixing the other rings.
Attachments:

Cedric164:
Thanks a lot man
Answered by
0
I hope the letters are from A to I(you forgot F)
Total combinations= 9×9×9 = 729
correct combination = 1
false combination= 729 - 1 =728
So a maximum of 728 false trials can be made.
Total combinations= 9×9×9 = 729
correct combination = 1
false combination= 729 - 1 =728
So a maximum of 728 false trials can be made.
Similar questions