EdiShorts

UPSC Prelims 2025 CSAT Q46 · Numeracy

Year2025
PaperCSAT
QuestionQ46
SubjectNumeracy

If n is a natural number, then what is the number of distinct remainders of (1^n + 2^n) when divided by 4?

  1. a0
  2. b1
  3. c2
  4. d3
Show answer & explanationHide answer
Correct answer(c) 2

For n = 1, (1^1 + 2^1) = 3 gives remainder 3 when divided by 4, whereas for all n >= 2, 2^n is divisible by 4, leaving remainder 1, yielding exactly 2 distinct remainders (1 and 3).

Statement-by-statement analysis

✗ Option (a)
  • Evaluating the expression for n = 1 gives 1^1 + 2^1 = 3, which leaves a remainder of 3 when divided by 4.
  • Since at least one valid remainder exists for any natural number n, the total number of distinct remainders cannot be 0.
✗ Option (b)
  • For n = 1, (1 + 2) = 3, which gives a remainder of 3 when divided by 4.
  • For n = 2, (1 + 4) = 5, which gives a remainder of 1 when divided by 4.
  • Since 3 and 1 are two distinct values, the count of distinct remainders must be more than 1.
✓ Option (c)
  • For n = 1, 1^1 + 2^1 = 3, and 3 divided by 4 gives remainder 3.
  • For any n >= 2, 2^n is a multiple of 4, so 2^n mod 4 = 0, which makes (1^n + 2^n) mod 4 = (1 + 0) mod 4 = 1.
  • Thus, the only possible remainders are 1 and 3, making the total number of distinct remainders equal to 2.
✗ Option (d)
  • For all n >= 2, the remainder is constantly 1 because 2^n is divisible by 4.
  • The only other remainder produced is 3 (when n = 1).
  • No natural number n yields remainders 0 or 2, so obtaining 3 distinct remainders is impossible.

Concept to know

  • Modular arithmetic principles allow evaluating remainders of exponential terms without computing large powers.
  • The term 1^n always evaluates to 1 for any natural number n.
  • The term 2^n equals 2 when n = 1, but for all n >= 2, 2^n = 4 × 2^(n-2), which means 2^n is divisible by 4 and leaves a remainder of 0.
  • By modular addition, (1^n + 2^n) mod 4 equals (1 + 2) mod 4 = 3 for n = 1, and (1 + 0) mod 4 = 1 for all n >= 2.
  • Testing initial boundary cases (n = 1, 2, 3) is a standard technique to identify constant or repeating patterns in divisibility problems.

Related facts for revision

  • Cyclicity of remainders for powers of numbers when divided by divisors like 3, 4, 5, or 10.
  • Divisibility rules for expressions of the form (a^n + b^n) when n is odd or even.
  • Binomial theorem applications for finding remainders of expressions like (x + 1)^n mod x.
  • Fermat Little Theorem and Wilson Theorem for prime moduli.
How UPSC tests this

Understanding modular arithmetic, testing edge cases like n = 1, and identifying distinct remainder sets.

Trap: Assuming 2^n is divisible by 4 for all natural numbers n without checking n = 1, which leads to incorrectly choosing 1 distinct remainder.

More Numeracy PYQs

All Numeracy questions →

Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.