The probability that a randomly selected 2-digit number belongs to the set is a multiple of 3 is equal to
First, let us interpret the condition. We want those natural numbers for which the expression is a multiple of . Writing this in modular arithmetic language, “is a multiple of ” means “is congruent to modulo ”. So we require
Adding to both sides keeps the equivalence true, therefore
Now we study the powers of modulo . We begin with the smallest exponents and proceed step by step.
We notice a repeating pattern: Thus the remainder alternates between and every time we increase the exponent by . Consequently,
So the given condition is satisfied exactly when is an odd integer.
But the problem restricts us to two-digit numbers. The set of all two-digit natural numbers is , and its size is
Among these, we list the odd ones: This is an arithmetic progression with first term , common difference , and last term . Using the standard counting formula for such a progression,
Therefore, exactly out of the two-digit numbers meet the required criterion.
Probability is defined as Substituting the values we have just obtained,
Hence, the correct answer is Option C.
Tagged Classical probability and sample spaces. Machine-assigned, so read it as a strong shortlist rather than a verdict.