a letter lock consists of 3 rings each marked with 6 different letters . the number of distinct unsuccessful attempts to open the lock is at the most - .
since each ring consists of six different letters , the total number of attempts possible with the three rings is = 6 * 6 * 6 = 216 . of these attempts , one of them is a successful attempt . maximum number of unsuccessful attempts = 216 - 1 = 215 . answer : c
subtract(multiply(multiply(6, 6), 6), const_1)