Home
Class 12
MATHS
Lock of a safe consists of five discs ea...

Lock of a safe consists of five discs each of which features the digits 0, 1, 2, ….., 9. The safe can be opened by dialing a special combination of the digits. If the work day lasts 13 hours and to dial one combination of digits takes 5 seconds, then number of days sufficient enough to open the safe, are

A

9

B

10

C

11

D

12

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem, we need to determine how many days it would take to try all possible combinations for the lock of the safe. Let's break it down step by step. ### Step 1: Calculate the total number of combinations The lock consists of 5 discs, and each disc can feature any digit from 0 to 9. Therefore, each disc has 10 possible digits. The total number of combinations can be calculated as: \[ \text{Total combinations} = 10^5 \] Calculating this gives: \[ 10^5 = 100000 \] ### Step 2: Calculate the total time to try all combinations It takes 5 seconds to dial one combination. Therefore, the total time required to try all combinations is: \[ \text{Total time (in seconds)} = \text{Total combinations} \times \text{Time per combination} \] Substituting the values we have: \[ \text{Total time} = 100000 \times 5 = 500000 \text{ seconds} \] ### Step 3: Convert total time from seconds to hours To convert seconds into hours, we divide by the number of seconds in an hour (3600 seconds): \[ \text{Total time (in hours)} = \frac{500000}{3600} \] Calculating this gives: \[ \text{Total time (in hours)} \approx 138.89 \text{ hours} \] ### Step 4: Calculate the number of workdays required Given that a workday lasts 13 hours, we can find the number of workdays required by dividing the total hours by the number of hours in a workday: \[ \text{Number of days} = \frac{\text{Total time (in hours)}}{\text{Hours per workday}} = \frac{138.89}{13} \] Calculating this gives: \[ \text{Number of days} \approx 10.69 \] ### Step 5: Round up to the nearest whole number Since we cannot have a fraction of a day, we round up to the nearest whole number: \[ \text{Number of days required} = 11 \] Thus, the number of days sufficient enough to open the safe is **11 days**.
Promotional Banner

Similar Questions

Explore conceptually related problems

The lock of a safe has a dial with holes, sasy ten, in which the numbers 0,1,2,……..9 are inscribed in each hole. The lock can be opened only when a specific code numbersay of six digits is dialled. Suppose the code number is 249916, it means that the can be opened when we first dial 2, then 4 nd so on. Find the maximum number of trials which do not result in opening the lock.

Number of 7 digit telephone numbers that can be formed from the digits 0 , 1 , 2 , ,………………..9 , if each telephone number begins with digit 5 is

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 ?

The number of 6 digits numbers that can be formed using the digits 0, 1, 2, 5, 7 and 9 which are divisible by 11 and no digit is repeated is

The number of five-digit numbers which are divisible by 3 that can be formed by using the digits 1,2,3,4,5,6,7,8 and 9 , when repetition of digits is allowed, is

How many 5-digits telephone numbers can be formed with the digits 0,1,2,….,8,9 if each numbers starts with 35 and no digit appears more than once?

Two pipes of different diameters may be used to fill a swimming pool. The price with the larger diameter working alone can fill the swimming pool 1.25 times faster than the other pipe when it works alone. One hour after the larger pipe is opened, the smaller pipe is opened, and the swimming pool is filled 5 hours later. Which equation could be used to find the number of hours, x, it would take for the larger pipe to fill the pool working alone?

An old man while dialing a 7-digit telephone number remembers that the first four digits consist of one 1's, one 2's and two 3's. he also remembers that the fifth digit is either a 4 or 5 while has no memory of the sixt digit, he remembers that the seventh digit is 9 minus the sixth digit, maximum number of distinct trials he has to try to make sure that he dials the correct telephone number, is A. 360 B. 240 C. 216 D. none of these