CAT Quant · Chapter Test
Remainders — 25-Question Test
A fresh, mixed-difficulty set drawn from the whole chapter — questions you haven't been asked before. Auto-graded with full solutions; your result is saved to your dashboard.
Building your 25-question test…
Formula Reference Sheet
This chapter
Modular reduction core
| Notation | a ≡ r (mod n) means n divides (a − r) |
|---|---|
| Sum / difference | (a ± b) mod n = (a mod n ± b mod n) mod n |
| Product | (a × b) mod n = ((a mod n)(b mod n)) mod n |
| Power | a^k mod n = (a mod n)^k mod n |
| Negative remainder | if a ≡ −1 (mod n) then a^k ≡ (−1)^k (mod n) |
Named theorems
| Fermat’s little theorem | a^(p−1) ≡ 1 (mod p), p prime, gcd(a,p)=1 |
|---|---|
| Euler’s theorem | a^φ(n) ≡ 1 (mod n), gcd(a,n)=1 |
| Euler’s totient | φ(n) = n·∏(1 − 1/p) over distinct primes p | n |
| Wilson’s theorem | (p − 1)! ≡ −1 (mod p), p prime |
| Corollary of Wilson | (p − 2)! ≡ 1 (mod p), p prime |
CAT reference
🖩 Graphing Calculator