The least positive integer \(x\) such that \(x \equiv 1 \pmod{3}\), \(x \equiv 2 \pmod{4}\) and \(x \equiv 3 \pmod{5}\) is
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → 58
Let us combine two conditions at a time. The numbers with \(x \equiv 3 \pmod{5}\) are
\(3, 8, 13, 18, \ldots\)
The first of these that leaves remainder 2 on division by 4 is 18, since \(18 = 4 \times 4 + 2\). Adding multiples of \(\mathrm{LCM}(4, 5) = 20\) keeps both remainders:
\(x = 18, 38, 58, 78, \ldots\)
Now test the remainder on division by 3:
\(18 = 3 \times 6 + 0\)
\(38 = 3 \times 12 + 2\)
\(58 = 3 \times 19 + 1\)
So the least such integer is 58.
Why the other options are incorrect
Option (1) 38 — Incorrect. It leaves remainder 2, not 1, on division by 3.
Option (2) 48 — Incorrect. It leaves remainder 0, not 2, on division by 4.
Option (4) 78 — Incorrect. It leaves remainder 0, not 1, on division by 3.