Skip to content
EXERCISE 3.1 · Q6

Q.A letter lock contains 3 rings and each ring containing 5 different letters. Determine the maximum number of false trials that can be made before the lock is opened?

Maharashtra MsbshseTextbookSubjectiveImportance★★★★★est
3% · 6/197 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Each of the 3 rings can independently show any of its 5 letters, so by the Multiplication Principle the total number of distinct letter-combinations of the lock is 5×5×5=1255\times5\times5=125. Exactly one of these 125 combinations is the correct one that opens the lock; every other com …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.