SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 14 Q10

The number lock of a suitcase has \(4\) wheels, each labelled with ten digits \(i.e.,\) from \(0\) to \(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\(?\)

CBSE Class 11 Maths · Probability

Solution

👶 Simple Explanation

Simple Explanation

Imagine a lock with 4 spinning wheels, each showing a digit from 0 to 9. No digit repeats across the wheels. There are thousands of different sequences someone could try. Only one secret sequence opens the lock. The chance of guessing it correctly on the first try is 1 out of all possible sequences. Since digits cannot repeat, the total number of sequences is 5040. So the chance is very, very small — like picking one specific grain of sand from a big handful.

Answer: The probability of getting the right sequence is \( \dfrac{1}{5040} \).

📖 Probability of Opening the Number Lock

Detailed Explanation

The lock has 4 wheels, and each wheel can show any digit from 0 to 9, giving 10 choices per wheel. But the correct sequence uses four digits with no repeats, so once a digit is used it cannot be used again on another wheel. To find the probability of guessing correctly, we use the classical (equally likely) definition of probability, where every possible allowed sequence is equally likely to be the correct one. The number of favourable outcomes is 1 (only one correct sequence opens the lock), and the total number of outcomes is the number of ways to arrange 4 distinct digits chosen from 10, which is a permutation.

Formula Used

\[ P(E) = \frac{\text{Number of favourable outcomes}}{\text{Total number of outcomes}} \] and \[ {}^{n}P_{r} = \frac{n!}{(n-r)!} \]

Solution

  1. Step 1: Identify what counts as a valid sequence. Each wheel shows one digit, and the correct sequence has 4 digits with no repetition. So we must choose and arrange 4 distinct digits out of the 10 digits available (0 to 9).
  2. Step 2: Count the total number of possible sequences using permutations, since order matters and repetition is not allowed. The number of arrangements is \( {}^{10}P_{4} \).
  3. Step 3: Evaluate the permutation. \[ {}^{10}P_{4} = \frac{10!}{(10-4)!} = \frac{10!}{6!} = 10 \times 9 \times 8 \times 7 \] This gives \[ {}^{10}P_{4} = 5040 \] So there are 5040 equally likely sequences the person could try.
  4. Step 4: Count the favourable outcomes. Only one particular sequence actually opens the suitcase, so the number of favourable outcomes is 1.
  5. Step 5: Apply the probability formula. \[ P(\text{correct sequence}) = \frac{\text{favourable}}{\text{total}} = \frac{1}{5040} \]

Final Answer

The probability of getting the right sequence is \( \dfrac{1}{5040} \).

Common Mistake

A common mistake is using \( 10^4 = 10000 \) as the total, treating each wheel independently with repetition allowed. Since the sequence must have no repeated digits, the correct total is the permutation \( {}^{10}P_{4} = 5040 \), not \( 10^4 \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand the structure of the lock. The lock has 4 wheels, each displaying one digit, and the correct sequence uses 4 digits with no repetition — Reason: Since repetition is not allowed, once a digit appears on one wheel it cannot appear on another, so this is a permutation problem (order matters and digits are distinct).
  2. Step 2: Identify the total sample space. We must count how many different 4-digit sequences (no repetition) can be formed from the digits 0 through 9. The total number of digits available is 10, and we choose and arrange 4 of them, giving \( {}^{10}P_{4} \) — Reason: Permutation is used here because the order of digits matters; swapping two digits produces a completely different sequence.
  3. Step 3: Apply the permutation formula with \( n = 10 \) and \( r = 4 \): \[{}^{10}P_{4} = \frac{10!}{(10-4)!} = \frac{10!}{6!}\] — Reason: Dividing \( 10! \) by \( 6! \) cancels out all terms below 7, leaving only the top four factors.
  4. Step 4: Evaluate the expression by expanding the top four factors: \[{}^{10}P_{4} = 10 \times 9 \times 8 \times 7 = 5040\] — Reason: This gives the total number of equally likely sequences a person could try, i.e. the size of the sample space is 5040.
  5. Step 5: Count the favourable outcomes. Only one specific sequence opens the lock, so the number of favourable outcomes is 1 — Reason: By definition of the lock, exactly one correct arrangement exists out of all 5040 possible arrangements.
  6. Step 6: Substitute into the probability formula: \[P(E) = \frac{1}{5040}\] — Reason: Dividing the single favourable outcome by the total 5040 outcomes gives the probability of guessing the correct sequence at random.

Final Answer

The probability of getting the right sequence is \( \dfrac{1}{5040} \).

Common Mistake

One common mistake: Students often treat this as a combinations problem and use \( {}^{10}C_{4} \) instead of \( {}^{10}P_{4} \), forgetting that the order of digits in a lock sequence matters — entering 1-2-3-4 is different from entering 4-3-2-1.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Total sequences of 4 distinct digits from 0–9: \[{}^{10}P_{4} = \frac{10!}{(10-4)!} = \frac{10!}{6!} = 10 \times 9 \times 8 \times 7 = 5040\]
  2. Step 2: Favourable outcomes = 1 (only one sequence opens the lock).
  3. Step 3: \[P(E) = \frac{1}{5040}\]

Answer: The probability of getting the right sequence is \( \dfrac{1}{5040} \).

➕ More Examples

More Examples

Example 1

Question: A bicycle lock has 3 rotating wheels, each labelled with the digits 1 to 8 (i.e., 8 digits). The lock opens with a specific sequence of 3 different digits (no digit repeats). What is the probability that a person randomly selects the correct sequence to open the lock?

Solution: Step 1: Identify the total number of digits available and how many are chosen. There are \( n = 8 \) digits (1 through 8), and \( r = 3 \) digits are chosen in order with no repetition. Step 2: Find the total number of possible sequences using permutations. \[ {}^{8}P_{3} = \frac{8!}{(8 - 3)!} = \frac{8!}{5!} \] Expanding: \[ {}^{8}P_{3} = 8 \times 7 \times 6 = 336 \] So there are 336 equally likely possible sequences. Step 3: Since only one sequence opens the lock, the number of favourable outcomes is 1. Step 4: Apply the probability formula. \[ P(\text{correct sequence}) = \frac{\text{Number of favourable outcomes}}{\text{Total number of outcomes}} = \frac{1}{336} \]

Answer: \( \dfrac{1}{336} \)

Example 2

Question: A digital safe has a 5-digit PIN formed by choosing 5 different digits from 0 to 9 (no repetition allowed), and the order of digits matters. A thief tries one randomly chosen sequence. What is the probability that the thief enters the correct PIN?

Solution: Step 1: Identify the total number of available digits and the length of the PIN. Digits available: 0 to 9, so \( n = 10 \). PIN length: \( r = 5 \), with no repetition. Step 2: Calculate the total number of possible 5-digit PINs. \[ {}^{10}P_{5} = \frac{10!}{(10 - 5)!} = \frac{10!}{5!} \] Expanding: \[ {}^{10}P_{5} = 10 \times 9 \times 8 \times 7 \times 6 = 30240 \] So the sample space has 30240 equally likely outcomes. Step 3: Only one specific sequence opens the safe, so favourable outcomes = 1. Step 4: Apply the probability formula. \[ P(\text{correct PIN}) = \frac{1}{30240} \]

Answer: \( \dfrac{1}{30240} \)

🎯 Try a Similar Question

Try a Similar Question

Question: A bicycle lock has 3 wheels, each labelled with the digits 1 to 8 (i.e., eight digits in all). The lock opens with a sequence of 3 distinct digits (no digit repeats). A person randomly tries one sequence. What is the probability that the person gets the correct sequence to open the lock?

Solution

  1. Step 1: Identify the total number of possible sequences: Each wheel is labelled with 8 digits (1 through 8), and no digit may repeat. We need to form a sequence of 3 distinct digits chosen from these 8, where order matters. The total number of such sequences is given by the permutation formula: \[ {}^{8}P_{3} = \frac{8!}{(8 - 3)!} = \frac{8!}{5!} \]
  2. Step 2: Evaluate the permutation: Expanding the factorial: \[ {}^{8}P_{3} = \frac{8 \times 7 \times 6 \times 5!}{5!} = 8 \times 7 \times 6 = 336 \] So there are 336 possible sequences in total.
  3. Step 3: Identify the number of favorable outcomes: There is exactly 1 correct sequence that opens the lock. Hence, the number of favorable outcomes is 1.
  4. Step 4: Calculate the probability: Using the definition of probability: \[ P(\text{correct sequence}) = \frac{\text{Number of favorable outcomes}}{\text{Total number of outcomes}} = \frac{1}{336} \]

Answer: The probability of getting the correct sequence to open the lock is \( \dfrac{1}{336} \).

Everything you get with Solver7

More questions in Probability

Chapter 14 Examples Q1(i) Chapter 14 Examples Q1(ii) Chapter 14 Examples Q1(iii) Chapter 14 Examples Q1(iv) Chapter 14 Examples Q2 Chapter 14 Examples Q3 Chapter 14 Examples Q4 Chapter 14 Examples Q5(i) Chapter 14 Examples Q5(ii) Chapter 14 Examples Q5(iii) Chapter 14 Examples Q5(iv) Chapter 14 Examples Q5(v) Chapter 14 Examples Q6(i) Chapter 14 Examples Q6(ii) Chapter 14 Examples Q6(iii) Chapter 14 Examples Q6(iv) Chapter 14 Examples Q6(v) Chapter 14 Examples Q7(a) Chapter 14 Examples Q7(b) Chapter 14 Examples Q7(c) Chapter 14 Examples Q8(a) Chapter 14 Examples Q8(b) Chapter 14 Examples Q8(c) Chapter 14 Miscellaneous Examples Q9(i) Chapter 14 Miscellaneous Examples Q9(ii) Chapter 14 Miscellaneous Examples Q9(iii) Chapter 14 Miscellaneous Examples Q9(iv) Chapter 14 Miscellaneous Examples Q9(v) Chapter 14 Miscellaneous Examples Q10(i) Chapter 14 Miscellaneous Examples Q10(ii) Chapter 14 Miscellaneous Examples Q10(iii) Chapter 14 Miscellaneous Examples Q11 Chapter 14 Miscellaneous Examples Q12(a) Chapter 14 Miscellaneous Examples Q12(b) Exercise 14.1 Q1 Exercise 14.1 Q2 Exercise 14.1 Q3 Exercise 14.1 Q4(i) Exercise 14.1 Q4(ii) Exercise 14.1 Q4(iii) Exercise 14.1 Q5(i) Exercise 14.1 Q5(ii) Exercise 14.1 Q5(iii) Exercise 14.1 Q5(iv) Exercise 14.1 Q5(v) Exercise 14.1 Q6(i) Exercise 14.1 Q6(ii) Exercise 14.1 Q6(iii) Exercise 14.1 Q6(iv) Exercise 14.1 Q6(v) Exercise 14.1 Q6(vi) Exercise 14.1 Q6(vii) Exercise 14.1 Q6(viii) Exercise 14.1 Q7(i) Exercise 14.1 Q7(ii) Exercise 14.1 Q7(iii) Exercise 14.1 Q7(iv) Exercise 14.1 Q7(v) Exercise 14.1 Q7(vi) Exercise 14.2 Q1