- A1
- B3
- C9
- D100
Step-by-Step Solution
Fermat's little theorem says that for a prime and any whole number a, the number leaves the same remainder as a itself on division by . With and , the remainder is simply 3. Put another way, ≡ 1 (mod 101), so ≡ 3. The trap is 1: that is the remainder left by , one power lower down.
Answer: B) 3