Analyzing the Universe of Possibilities
To begin, we define the sample space for selecting two distinct numbers a and b from the set {1,2,3,…,100}. Since the selection is made without replacement, the first number a has 100 possible choices, and the second number b has 99 possible choices.
The total number of ordered pairs (a,b) is given by:
This value represents the denominator of our probability calculation.
The Constraint
A Geometric Reality
We are tasked with finding the number of pairs that satisfy the condition a−b≥10, or equivalently, a≥b+10. We can determine the number of favorable outcomes by systematically testing values of b:
If b=1, then a≥11. The possible values for a are {11,12,…,100}, which gives 100−11+1=90 choices.
If b=2, then a≥12. The possible values for a are {12,13,…,100}, which gives 100−12+1=89 choices.
This pattern continues until b=90, where a≥100. In this final case, a must be 100, providing exactly 1 choice.
The Elegance of Summation
The total number of favorable outcomes is the sum of the arithmetic progression:
Using the formula for the sum of the first k natural numbers, S=2k(k+1), where k=90, we calculate:
The Final Synthesis
The probability P is the ratio of favorable outcomes to the total number of outcomes:
To simplify this fraction, we divide both the numerator and the denominator by their greatest common divisor, which is 45:
Since 91=7×13 and 220=22×5×11, the fraction is in its simplest form where m=91 and n=220.
The final result, m+n, is: