When 10^100 is divided by 7, the remainder is
Question:
When 10^100 is divided by 7, the remainder is
When 10^100 is divided by 7, the remainder is
Options
Answer: 4
Explanation:
By Fermat's Little Theorem, since 7 is prime and gcd(10,7)=1, we have 10^6 ≡ 1 (mod 7). Now 100 = 16×6 + 4, so 10^100 = (10^6)^16 × 10^4 ≡ 1^16 × 10^4 ≡ 10^4 (mod 7). Computing: 10 ≡ 3 (mod 7), 10² ≡ 9 ≡ 2 (mod 7), 10^4 ≡ 2² ≡ 4 (mod 7). Remainder is 4.
Explanation:
By Fermat's Little Theorem, since 7 is prime and gcd(10,7)=1, we have 10^6 ≡ 1 (mod 7). Now 100 = 16×6 + 4, so 10^100 = (10^6)^16 × 10^4 ≡ 1^16 × 10^4 ≡ 10^4 (mod 7). Computing: 10 ≡ 3 (mod 7), 10² ≡ 9 ≡ 2 (mod 7), 10^4 ≡ 2² ≡ 4 (mod 7). Remainder is 4.
👉 Want AI explanation? Open in MCQ App
Recommended articles
- How To Cover Current Affairs For Upsc Prelims — Master UPSC Current Affairs with daily newspaper reading, Vision IAS monthly compilations, PT 365, and MCQ practice. Complete strategy guide for Prelims…
- Top 10 Daily Current Affairs Resources For Upsc Aspirants — Discover the best daily current affairs resources for UPSC 2026. Complete guide with The Hindu, PIB, Sansad TV, and 7 more proven sources. Expert…
- Free Cat Previous Year Questions Guide — Master CAT 2025 with free previous year questions. Practice 1000+ PYQs, mock tests, and detailed solutions. Complete guide to CAT preparation using past…