Prove that if a>1 then (an−1,am−1)=a(m,n)−1
where (a,b)=gcd(a,b)
I've seen one proof using the Euclidean algorithm, but I didn't fully understand it because it wasn't very well written.
I was thinking something along the lines of have d=a(m,n)−1 and then showing
d|am−1 and d|an−1 and then if c|am−1 and c|an−1, then c≤d.
I don't really know how to show this though...
I can't seem to be able to get d∗K=am−1.
Any help would be beautiful!
No comments:
Post a Comment