The Architecture of Probability
Welcome, future engineer. Today, we are not just solving a probability problem; we are building a mental model of how to navigate constraints in combinatorics.
When you look at a 3-digit number, do not just see a value. See a structure consisting of three slots: the Hundreds, the Tens, and the Units. This is your playground.
Phase 1
The Sample Space
Before we hunt for our favorable outcomes, we must define the universe. We are looking at 3-digit numbers, which range from 100 to 999.
The first slot, the Hundreds place, is the gatekeeper. It cannot be 0, or else we fall into the realm of 2-digit numbers. Thus, it has 9 choices ({1,2,…,9}).
The Tens and Units places are free spirits; they can be any digit from 0 to 9, giving us 10 choices each. By the Fundamental Principle of Counting, our total sample space n(S) is:
This is our denominator.
Phase 2
The Logic of 'At Least'
'At least two odd digits' is a phrase that demands precision. It means we are satisfied if we have exactly two odd digits, or if we have all three.
We must partition this into mutually exclusive cases to ensure we count every valid number exactly once. We have two sets of digits: Odd {1,3,5,7,9} (count of 5) and Even {0,2,4,6,8} (count of 5).
Phase 3
The Cases
Let us begin with the simplest scenario: all three digits are odd. This is the OOO pattern.
For each slot, we have 5 choices. Thus, the number of ways is:
Now, we move to the 'exactly two odd' scenarios. We have three patterns: OOE, OEO, and EOO.
For OOE (Odd-Odd-Even), the first two slots are odd (5×5) and the last is even (5). That gives us 125 ways. For OEO (Odd-Even-Odd), the logic is identical: 5×5×5=125 ways.
Phase 4
The Trap
Now, we arrive at the EOO (Even-Odd-Odd) pattern. This is where the JEE examiner tests your vigilance.
If we place the even digit at the front, we must remember the gatekeeper rule: the first digit cannot be 0. Therefore, our even choices for the first slot are restricted to {2,4,6,8}, giving us only 4 choices.
The remaining two slots are odd, giving us 5×5 choices. Thus, the number of ways is:
If you had used 5 here, you would have included numbers like 013, which are not 3-digit numbers!
The Final Synthesis
We have navigated the traps. Now, we sum our favorable outcomes n(E):
The probability P(E) is:
By dividing both the numerator and the denominator by 25, we arrive at the elegant result:
You have successfully mastered the constraints and conquered the counting. Keep this vigilance in your toolkit for every exam you face.