Рет қаралды 3,860
We prove that n^{gcd(a,b)} - 1 = gcd( n^a - 1, n^b - 1) for all positive integers n, a, and b. Some trivial cases, for example where n = 1, are omitted from the proof.
I found this problem in Gelca and Andreescu's book, Putnam and Beyond.
Bézout's identity:
en.wikipedia.org/wiki/B%C3%A9...
proofwiki.org/wiki/B%C3%A9zou...
00:00 Intro
00:18 Idea for the proof
01:01 A sufficient condition
03:37 Proof of sufficient condition
06:48 Bézout's identity
08:24 RHS divides LHS
12:32 Dealing with n^{qb}