For integers \(a, b, m, n\), prove that \[gcd({a}^{m} - {b}^{m}, {a}^{n} - {b}^{n}) = {a}^{gcd(m,n)} - {b}^{gcd(m,n)}.\]
Solution
Let d=gcd(m,n), thus d∣m and d∣n. We then let m=pd and n=pd.
Hence gcd(am−bm,an−bn)=gcd(apd−bpd,aqd−bqd).
Let A=ad and B=bd, it follows that
gcd(am−bm,an−bn)=gcd(Ap−Bp,Aq−Bq).
Since A−BAp−Bp=k=0∑p−1Ap−k−1Bk and
A−BAq−Bq=k=0∑q−1Aq−k−1Bk we get
gcd(Ap−Bp,Aq−Bq)=A−B.
Since A−B=ad−bd and d=gcd(m,n), we prove that
gcd(am−bm,an−bn)=agcd(m,n)−bgcd(m,n).
Check out my other notes at Proof, Disproof, and Derivation
#NumberTheory
#GreatestCommonDivisor(GCD/HCF/GCF)
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Could you please provide a proof for the sum you have claimed to be true? Thanks