Quantitative Aptitude · UPSC Civil Services Examination 2025 · GS Paper II · Last updated:
If n is a natural number, then what is the number of distinct remainders of (1ⁿ + 2ⁿ) when divided by 4?
- A. 0
- B. 1
- C. 2 (Correct answer)
- D. 3
Correct Answer
Option C — 2
Detailed Solution & Explanation
Evaluate $(1^n + 2^n) \bmod 4$ for natural numbers $n \ge 1$:
- $n = 1$: $1^1 + 2^1 = 3 \equiv 3 \pmod 4$.
- $n \ge 2$: Since $4 \mid 2^n$ for every $n \ge 2$, we have $1^n + 2^n \equiv 1 + 0 = 1 \pmod 4$.
Thus, the only remainders are $3$ and $1$ — 2 distinct remainders. For Quantitative Aptitude (Number System) problems, writing down the standard relation first and substituting the given numerical values step-by-step prevents sign and unit-conversion errors that commonly lead to distractors like (A) 0, (B) 1, (D) 3.
Topics covered: Number System