Skip to content
NCERT Exemplar · Q22

Q.Without repetition of the numbers, four digit numbers are formed with the numbers 0,2,3,50, 2, 3, 5. The probability of such a number divisible by 5 is
(A) 15\frac{1}{5}
(B) 45\frac{4}{5}
(C) 130\frac{1}{30}
(D) 59\frac{5}{9}

Gujarat GsebMCQ· 1mImportance★★★★★est
77% · 72/93 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

We count all four-digit numbers formed without repetition from {0,2,3,5}, then count those divisible by 5 (last digit 0 or 5). The probability is 59\frac{5}{9}, which corresponds to option (D).

Concept and Intuition

Classical probability is simply:

P(event)=number of favourable outcomestotal number of equally likely outcomesP(\text{event}) = \frac{\text{number of favourable outcomes}}{\text{total number of equally likely outcomes}}

Here, the "outcomes" are all distinct four-digit numbers we can form using the digits 0, 2, 3, 5 exactly once each. The key constraint: a four-digit number cannot start with 0 — that would make it a three-digit number. So the total count isn't just 4!4!; we must exclude numbers beginning with 0.

For divisibility by 5, a number must end in 0 or 5. That's the core condition. We'll count favourable cases carefully, watching out for the "first digit can't be 0" rule in each scenario.


Step-by-step solution

1. Count total four-digit numbers (without repetition)

We have four distinct digits: 0, 2, 3, 5.

Total permutations of all four digits = 4!=244! = 24.

But numbers starting with 0 are invalid (they'd be three-digit numbers).

How many start with 0? Fix 0 in the first place; the remaining three digits (2,3,5) can be arranged in 3!=63! = 6 ways.

So total valid four-digit numbers:

24−6=1824 - 6 = 18

Tip

A faster way: choose the first digit from {2,3,5} (3 choices), then arrange the remaining 3 digits in any order in the last three places (3!=63! = 6). So 3×6=183 \times 6 = 18. Same result.

2. Count favourable numbers (divisible by 5)

A number is divisible by 5 iff its last digit is 0 or 5. We handle these two cases separately.

Case 1: Last digit = 0

If the last digit is fixed as 0, the first three digits must be a permutation of {2,3,5}.

No restriction on the first digit here — 2, 3, and 5 are all non-zero, so every arrangement is valid.

Number of ways: 3!=63! = 6.

Case 2: Last digit = 5 …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.