Remainder Theorem Practice Quiz: Factorials, Powers and Cyclicity
This is a review test on the Remainder Theorem from the Number System, covering remainders of large powers, factorials and combined divisors. It brings together theorem-based shortcuts with past CAT and IPMAT style problems. Aptitude360 provides a worked solution for every question so you can check each method.
Topics covered in this Remainder Theorem review
- Remainders of large powers using cyclicity and Fermat's theorem
- Factorial remainders on division by a prime using Wilson's theorem
- Finding possible remainders when a number is divided by a related divisor
- Numbers satisfying two remainder conditions at once
- Divisibility of sums and differences of equal powers
- Finding a divisor that leaves the same remainder for two numbers
- Digit-sum based remainders on division by nine and eleven
- Power towers and dividend, quotient and remainder relations
Key remainder formulas and rules to revise
- Division identity: \( N = d \times q + r,\ 0 \le r < d \)
- Fermat's little theorem (p prime, a not a multiple of p): \( a^{p-1} \equiv 1 \pmod{p} \)
- Euler's theorem (a and n coprime): \( a^{\phi(n)} \equiv 1 \pmod{n} \)
- Wilson's theorem (p prime): \( (p-1)! \equiv -1 \pmod{p} \)
- Corollary of Wilson (p prime): \( (p-2)! \equiv 1 \pmod{p} \)
- For odd n: \( (a+b) \mid (a^{n}+b^{n}) \)
Revision tips for remainder problems
- Reduce the base modulo the divisor before handling the power.
- Write a base that is one less than the divisor as minus one, so its powers simply alternate in sign.
- When two numbers leave the same remainder, the divisor must divide their difference.
- When a divisor has distinct prime factors, split it into pairwise coprime prime-power factors and combine the remainders.
Who this review suits
Aspirants for CAT, IPMAT and other aptitude exams who have studied the Remainder Theorem and want to consolidate it before moving to mixed Number System practice.