How many three-digit numbers are congruent to 5 modulo 9?
Answer & explanation
Correct answer: option 1
The correct answer is Option (1) → 100
A number is congruent to 5 modulo 9 when it can be written as \(9k + 5\) for an integer \(k\). It must lie between 100 and 999.
\(100 \le 9k + 5 \le 999\)
\(95 \le 9k \le 994\)
\(k = 11, 12, \ldots, 110\)
The smallest such number is \(9 \times 11 + 5 = 104\) and the largest is \(9 \times 110 + 5 = 995\).
\(\text{Number of values of } k = 110 - 11 + 1 = 100\)
So there are 100 such numbers.