EdiShorts

UPSC Prelims 2025 CSAT Q67 · Numeracy

Year2025
PaperCSAT
QuestionQ67
SubjectNumeracy

What is the remainder when
9^3 + 9^4 + 9^5 + 9^6 + . . . + 9^100
is divided by 6?

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

Each term 9^n leaves a remainder of 3 when divided by 6, and the sum of 98 such terms yields 294, which is exactly divisible by 6.

Statement-by-statement analysis

✓ Option (a)
  • When 9^n is divided by 6, the remainder is always 3 for any positive integer exponent n.
  • The number of terms from 9^3 to 9^100 is equal to 100 - 3 + 1 = 98 terms.
  • The sum of the remainders is 98 × 3 = 294, and 294 divided by 6 leaves a remainder of 0.
✗ Option (b)
  • A remainder of 1 would require the sum of individual remainders mod 6 to equal 1.
  • Since 294 is perfectly divisible by 6 (294 = 6 × 49 + 0), the remainder cannot be 1.
✗ Option (c)
  • A remainder of 2 is mathematically impossible here because each term contributes a remainder of 3.
  • Adding multiples of 3 can only yield net remainders of 0 or 3 modulo 6.
✗ Option (d)
  • A candidate gets a remainder of 3 if they incorrectly count the number of terms as 97 instead of 98.
  • For 97 terms, 97 × 3 = 291, which gives 291 mod 6 = 3, but the actual count of terms is 98.

Concept to know

  • Remainder property of powers of 9 divided by 6 states that 9^n leaves a remainder of 3 for all positive integers n.
  • Additive property of remainders allows finding the total remainder by summing the individual remainders of each term.
  • The total number of terms in an inclusive exponent range from a to b is calculated as b - a + 1.
  • Pairing technique shows that every two consecutive terms contribute a combined remainder of 3 + 3 = 6, which reduces to 0 mod 6.
  • An even number of terms (98 terms) means all terms pair up completely, leaving an overall remainder of 0.

Related facts for revision

  • Powers of 4 divided by 6 always leave a remainder of 4 for any positive integer exponent.
  • Cyclicity of remainders helps solve large exponent division problems by identifying repeating remainder patterns.
  • Binomial theorem expansion can express 9^n as (6 + 3)^n to isolate terms containing 6 as a factor.
How UPSC tests this

Modular arithmetic, properties of remainders of powers, and accurate counting of terms in a finite sequence.

Trap: Miscounting the total terms as 100 - 3 = 97 instead of 100 - 3 + 1 = 98, which leads incorrectly to option d. Pair terms in groups of two to quickly see that 98 terms form 49 pairs of sum 6.

More Numeracy PYQs

All Numeracy questions →

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