CDS 2025 · PYQ · Number Theory / Fermat's Little Theorem · medium
What is the remainder when 2^101 is divided by 101?
- A.1
- B.2✓ Correct
- C.5
- D.7
By Fermat's Little Theorem, since 101 is prime and gcd(2,101)=1, 2^100 ≡ 1 (mod 101). Therefore 2^101 = 2 × 2^100 ≡ 2 × 1 = 2 (mod 101).
💡
Practice unlimited CDS PYQs + AI-tracked progress on each topic.
Sign up free →More Number Theory / Fermat's Little Theorem questions
Want more CDS practice?
Free daily 10-Q quiz · adaptive mocks · 4,000+ verified PYQs · AI doubt solver in Hindi + English