A letter lock consists of three rings ea...

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

899

999

479

568

Text Solution

Verified by Experts

The correct Answer is:

Topper's Solved these Questions

PERMUTATIONS & COMBINATIONS
AAKASH SERIES|Exercise PRACTICE EXERCISE|163 Videos
PERMUTATIONS & COMBINATIONS
AAKASH SERIES|Exercise EXERCISE-I|60 Videos
PARTIAL FRACTIONS
AAKASH SERIES|Exercise PRACTICE EXERCISE|31 Videos
PROBABILITY
AAKASH SERIES|Exercise Practise Exercise|165 Videos

Similar Questions

Explore conceptually related problems

a Letter lock contains 5 rings each marked with four different letters . The number of all possible iunsuccesful attempts to open the lock is

A letter lock consists of three rings each marked with 5 different letters. Number of maximum attempts to open the lock is

A letter lock consists of 4 rings each marked with 10 different letters, the number of ways in which it is possible to make an unsuccessful attempts to open the lock is

A letter lock contains 4 rings, each ring containing 5 letters. All possible trails are made to open the lock and the lock opens in only one way. The probability for the lock to open is

A number lock contains 4 rings each ring containing 6 numbers . All the possible attempts of opening the lock are made but the lock opens in only one way. The probability for the lock to open is

A number lock has 3 rings and each ring has 9 digits 1, 2, 3,……, 9. Find the maximum number of unsuccessful attempts that can be made by a thief who tries to open the lock without knowing the key code.

Suppose that 'n' letters are written to 'n' different persons and their addresses are written on 'n' different envelops. Find the number of ways in which these letters can be put in the envelopes (one in each) such that atleast one letter does not go into the corresponding envelope.

AAKASH SERIES-PERMUTATIONS & COMBINATIONS-EXERCISE-II

5 digit number divisible by 9 are to be formed by using the digits 0, ...
Text Solution
|
Number of numbers greater than 24000 can be formed by using digits 1, ...
Text Solution
|
A letter lock consists of three rings each marked with 10 different le...
Text Solution
|
The number of four digits telephone numbers having atleast one ...
Text Solution
|
The number of quadratic expressions with the coefficients drawn ...
Text Solution
|
Number of diffferent matrices that can be formed with elements 0, 1, 2...
Text Solution
|
Four dice are rolled then the number of possible out comes in which at...
Text Solution
|
Find the number of numbers less than 2000 that can be formed using the...
Text Solution
|
The number of odd numbers lying between 40000 and 70000 that can be ma...
Text Solution
|
Total number of four digit odd numbers that can be formed using 0, 1, ...
Text Solution
|
The number of numbers greater than 1000 but not greater than ...
Text Solution
|
Number of 5 digited numbers using 0,1,2,3,4 divisible by 4 with repeti...
Text Solution
|
Find the number of 4- digit numbers that can be formed using the digit...
Text Solution
|
Number of 4 digited numbers using 0, 1, 2, 3, 4, 5 divisible by 6 with...
Text Solution
|
The number of 5 digited numbers that contain 7 exactly once is
Text Solution
|
Number of different 6 digit numbers whose sum of digits to be odd is (...
Text Solution
|
The number of 5 letter words formed using the letters of DELHI begin a...
Text Solution
|
Number of bijections from Set-A containing n elements onto itself is 7...
Text Solution
|
Number of Surjections from Set - A containing n elements to the Set -B...
Text Solution
|
The number of ways in which 10 letters can be posted in 5 letter boxe...
Text Solution
|