What is the remainder when is divided by ?
Show answer & solutionHide answer & solution
Option D
Approach
Reduce each base modulo first: and sit one on either side of , so both powers collapse without being computed.
Step-by-step solution
- 1and
Why: Both bases are within of the divisor, so replacing each by its residue is the cheapest possible simplification.
- 2
Why: is odd, so the negative sign survives the power — this is the step the whole question turns on.
- 3
Why: Every power of is .
- 4
Why: The two residues cancel, so the sum is an exact multiple of and the remainder is .
Shortcut
always divides when is odd. Here , a multiple of , so divides and the remainder is .
Common mistakes
Option A
Filler — no route reaches .
Option B
Read as out of even-exponent habit, giving .
Option C
Reduced only and set aside, reporting the that contributes.
Skills used