2023 CSAT — Q7
What is the remainder when is divided by ?
Worked rationale
The remainder mod is just the last two digits, so reduce the running product mod at every step — never multiply the whole thing out.
The remainder is .
Shortcut (the real time-saver): a multiple of times a multiple of is a multiple of . Here supplies the factor , and supplies two factors of (i.e. ), so the product is divisible by . Remainder .
Answer: (a) 0.
Why the other options miss
- B an arithmetic slip: a single mis-multiplication in the running product, landing on a wrong two-digit tail.
- C wrong formula: confuses the last-digit pattern (a mod- idea) with the mod- question, reading off a units digit instead.
- D solved the wrong question: notices the factor from but misses that and together carry the matching , so stops at “divisible by ” with a wrong tail.
Specialist insight
Two equally fast routes: (i) reduce mod after every multiplication so no number ever exceeds four digits; or (ii) spot the factorisation — gives a , the two numbers ending in give a — proving divisibility by in one line. The trap is reaching for the units-digit cycle, which answers a different (mod ) question.
Mod is the last two digits: reduce after each step (or spot and ), giving remainder .