2025 · Q47
What is the remainder when 2ᵖ-1 is divided by p, where p > 5 is a prime number?
Elementary MathematicsNumber System
- A1
- B2
- C3
- D4
Explanation
By Fermat's little theorem, N^(p−1) ≡ 1 (mod p) when p ∤ N, so the remainder of N^(p−1) on division by p is 1, option (a).