The number of integers \(n\) with \(1 \le n \le 200\) such that \(n \equiv 2 \pmod{3}\) and \(n \equiv 1 \pmod{4}\) is
Answer & explanation
Correct answer: option 1
The correct answer is Option (1) → 17
The numbers with \(n \equiv 1 \pmod{4}\) are \(1, 5, 9, 13, \ldots\). The first of them that also leaves remainder 2 on division by 3 is 5.
\(5 = 3 \times 1 + 2\) and \(5 = 4 \times 1 + 1\)
Since \(3 \times 4 = 12\), both conditions repeat every 12 numbers, so the numbers are exactly those with \(n \equiv 5 \pmod{12}\).
\(n = 5, 17, 29, \ldots\)
\(12k + 5 \le 200 \Rightarrow 12k \le 195 \Rightarrow k \le 16\)
\(k = 0, 1, 2, \ldots, 16\)
The largest such number is \(12 \times 16 + 5 = 197\).
So there are 17 such integers.
Why the other options are incorrect
Option (2) 16 — Incorrect. This leaves out \(k = 0\), that is, the number 5 itself.
Option (3) 18 — Incorrect. The next number, \(12 \times 17 + 5 = 209\), is greater than 200.
Option (4) 50 — Incorrect. 50 numbers from 1 to 200 satisfy \(n \equiv 1 \pmod{4}\) alone; the condition \(n \equiv 2 \pmod{3}\) must also hold.