Out of 11 consecutive natural numbers if three numbers are selected at random (without repetition), then the probability that they are in A.P. with positive common difference is:
Let us denote the 11 consecutive natural numbers by . Because only the relative positions matter, any other block of 11 consecutive numbers would give exactly the same count, so this labelling is allowed.
The total number of unordered selections of three numbers from these 11 is given by the combination formula
where and . Substituting, we obtain
Now we must count how many of those 165 triplets form an increasing arithmetic progression (A.P.) with positive common difference. Suppose the first term of such a progression is and the common difference is , where . Then the three terms are
All three terms must lie in the set , so the largest term must satisfy
For a given positive integer , the smallest permissible value of is , and the largest is . Hence, for that particular , the number of admissible values of equals
This quantity is positive only as long as Therefore can take the integer values . We now list the counts for each and add them.
For : admissible , giving progressions.
For : admissible , giving progressions.
For : admissible , giving progressions.
For : admissible , giving progressions.
For : admissible , giving progression.
Adding these gives the total number of favourable triplets:
The required probability is therefore
Simplifying the fraction, we divide numerator and denominator by their highest common factor, which is :
Hence, the correct answer is Option C.
Tagged Probability using permutations and combinations. Machine-assigned, so read it as a strong shortlist rather than a verdict.