Analyzing the Universe
In any probability problem, we must first define our 'Universe'—the sample space. If each of our three letters has the freedom to choose any of the five addresses, how many total scenarios exist?
Since each letter is independent, the first letter has 5 choices, the second has 5, and the third has 5. Mathematically, we represent this as:
This is the total number of ways the universe could unfold if we let chaos reign. This is our denominator, the bedrock of our probability.
The Strategy of Selection
Now, we impose our constraint: we want exactly two addresses to be used. We cannot just jump into the distribution; we must first curate our environment.
We need to choose which two addresses out of the five will be the 'lucky' ones. This is a classic selection problem. We use the combination formula, nCr, because the order in which we select the two addresses is irrelevant.
Choosing address A and B is the same as choosing B and A. Thus, we calculate:
We have 10 distinct pairs of addresses that could potentially host our letters.
The Distribution Dance
With our two chosen addresses—let's call them X and Y—we now distribute the three letters. Each letter has 2 choices: it can go to X or it can go to Y.
The total number of ways to distribute the letters into these two specific boxes is:
But wait! We must be careful. Does this count include cases where we fail our mission? Yes.
If all three letters go to X, then Y is empty. If all three go to Y, then X is empty. In both cases, we have used only one address, not two.
To satisfy the condition of 'exactly two,' we must subtract these two 'all-in-one' scenarios. Therefore, the number of valid ways to distribute the letters into our two chosen addresses is:
The Grand Synthesis
We are almost there. We have 10 ways to pick our pair of addresses, and for each pair, we have 6 ways to distribute the letters such that both are used.
By the Fundamental Counting Principle, we multiply these together to find our total favorable outcomes:
Finally, we calculate the probability P(E) by dividing our favorable outcomes by the total sample space:
By simplifying this fraction, dividing both numerator and denominator by 5, we arrive at our elegant final answer:
Reflecting on the Elegance
Look at what we have achieved. We broke a complex constraint into a selection phase and a distribution phase. We respected the distinct nature of the letters and the addresses.
We accounted for the 'trap' of using only one address by subtracting the invalid cases. This is the essence of JEE-level thinking: breaking the intimidating into the manageable. Keep this logical structure in your toolkit, and no combinatorial problem will ever stand in your way again.