Exercise 624Number theory › Divisibility and gcdM1Added 4 Nov 2026
13 divides 2⁷⁰ + 3⁷⁰
#Fermat's little theorem#modular exponentiation
Statement
Prove that divides .
Hint
By Fermat's little theorem . Reduce the exponents. Also .
Show solutionHide solution
Solution
Powers of . , so . Since , .
Powers of . , and , so .
Sum. .
Remark. Another approach: is divisible by because , hence .
Lesson. Reduce the base and the exponent: use Fermat's theorem (or the actual order) to shrink exponents modulo (or modulo the order).