Proof of Exponential Auxiliary Lemma
📂Number TheoryProof of Exponential Auxiliary Lemma
Theorem
n∈N, x,y∈Z, prime numbers p=2 satisfy
gcd(n,p)=1p∣(x−y)p∤xp∤y
then
vp(xn−yn)=vp(x−y)+vp(n)
Proof
Strategy: It naturally follows from the properties of p-ary expansion. However, proving those properties is quite lengthy. The key is to present those properties first, which can be proved with elementary number theory knowledge, so don’t be intimidated and give it a try.
Lemma (Properties of p-ary):
- [3]: n∈N, x,y∈Z, prime numbers p satisfy
gcd(n,p)=1p∣(x∓y)p∤xp∤y
then
vp(xn±yn)=vp(x±y)
- [4]: x,y∈Z, prime numbers p=2 satisfy
p∣(x−y)p∤xp∤y
then
vp(xp−yp)=vp(x−y)+1
n:=pαbgcd(p,b)=1
By choosing a natural number n,b,α that satisfies the above two conditions, we get vp(n)=α. Then, by using the lemma [3],
vp(xn−yn)===vp([xpα]b−[ypα]b)vp(xpα−ypα)vp([xpα−1]p−[ypα−1]p)
Solving recursively using lemma [4] gives
vp([xpα−1]p−[ypα−1]p)=====vp([xpα−1]−[ypα−1])+1vp([xpα−2]p−[ypα−2]p)+1vp([xpα−2]−[ypα−2])+2⋮vp(x−y)+αvp(x−y)+vp(n)
In conclusion, we obtain the following.
vp(xn−yn)=vp(x−y)+vp(n)
■