Blog
Friday, 27 May 2016
arithmetic - Prove that GCD$(n^a - 1,n^b -1)= n^{GCD(a,b)} -1$
I used Euclid's theorem $a=bq +r$.
$n^a -1 = ((n^b)^q )n^r -1$
I don't know how to move forward.
No comments:
Post a Comment
‹
›
Home
View web version
No comments:
Post a Comment