Remainder Theorem Level 2 Practice Quiz: Large Powers and Polynomials
Remainder Theorem Level 2 builds the skill of finding remainders of very large numbers quickly, using cyclicity, Fermat's and Euler's theorems and the polynomial remainder theorem. It covers power towers, last digits of products and divisibility of sums of powers. Aptitude360 includes worked solutions for most problems at this level.
What this Remainder Theorem set covers
- Remainders of large powers divided by small primes
- Power towers, where the exponent itself is a power
- Last two and last three digits of products
- Divisibility of sums of odd powers
- Numbers that leave different given remainders with several divisors
- Polynomial remainder theorem and the factor theorem, including finding an unknown coefficient
Key remainder rules and formulas
- Fermat (p prime, p not dividing a): \( a^{p-1}\equiv1 \pmod{p} \)
- Euler (a, n coprime): \( a^{\phi(n)}\equiv1 \pmod{n} \)
- Product rule: \( ab \bmod n=(a \bmod n)(b \bmod n) \bmod n \)
- Odd n: \( (a+b) \mid (a^{n}+b^{n}) \)
- Remainder theorem: \( P(x)\div(x-a) \) leaves \( P(a) \)
- Factor theorem: \( (x-a) \mid P(x) \iff P(a)=0 \)
Revision tips for remainder questions
- Reduce the base modulo the divisor before working on the exponent
- For power towers, reduce the exponent modulo Euler's totient of the divisor only when the base and divisor are coprime; otherwise split the divisor into coprime factors and combine the results
- For last two digits, work modulo hundred and drop factors of ten carefully
- In polynomial questions, substitute the root of the divisor instead of doing long division
Who this level suits
Quant aspirants who know basic remainders and want harder Number System practice on large powers and polynomials.