A number lock on a suitcase has $3$ wheels each labelled with $10$ digits from $0$ to $9$ . If opening of the lock is a particular sequence of three digits with no repeats, how many such sequences will be possible?

Open in App

Solution

3 digit no. to be formed with no repeats
$∙$ $1^{s t}$ Place can be filled by 10 ways
$∙$ $2^{n d}$ Place can be filled by 9 ways
$∙$ $3^{r d}$ Place can be filled by 8 ways
$∴$ Total Ways $= 10 \times 9 \times 8 = 720$

Suggest Corrections

Similar questions

Q. A number lock on a suitcase has

3

wheels each labeled with

10

digits from

0

9

. If the opening of the lock is a particular sequence of three digits with no repeats, how many such sequences will be possible?

A number lock on a suitcase has 3 wheels each labelled with ten digits 0 to 9. If opening of the lock is a particular sequence of three digits with no repeats, how many such sequences will be possible? Also find the number of unsuccessful attempts to open the lock.

Q. A number of lock on a suitcase has three wheels each labelled with ten digits

0

9

. The opening of the lock is a particular sequence of three digits with no repeats. If a person tries to open the lock, then the number of unsuccessful attempts made by him is

Q. The number lock of a suitcase has

4

wheels each labelled with ten digits i.e. from

0

9

. The lock opens with a sequence of four digits with no repeats. What is the probability of a person getting the right sequence to open the suitcase?

A combination lock on a suitcase has 3 wheels, each labelled with nine digits from 1 to 9. If an opening combination is a particular sequence of three digits with no repeats, what is the probability of a person guessing the right combination ?

Join BYJU'S Learning Program

A number lock on a suitcase has 3 wheels each labelled with 10 digits from 0 to 9. If opening of the lock is a particular sequence of three digits with no repeats, how many such sequences will be possible?

3 digit no. to be formed with no repeats ∙ 1st Place can be filled by 10 ways ∙ 2nd Place can be filled by 9 ways ∙ 3rd Place can be filled by 8 ways ∴ Total Ways =10×9×8=720

A number lock on a suitcase has $3$ wheels each labelled with $10$ digits from $0$ to $9$ . If opening of the lock is a particular sequence of three digits with no repeats, how many such sequences will be possible?

3 digit no. to be formed with no repeats
$∙$ $1^{s t}$ Place can be filled by 10 ways
$∙$ $2^{n d}$ Place can be filled by 9 ways
$∙$ $3^{r d}$ Place can be filled by 8 ways
$∴$ Total Ways $= 10 \times 9 \times 8 = 720$