Friday, 27 May 2016

arithmetic - Prove that GCD(na−1,nb−1)=nGCD(a,b)−1

I used Euclid's theorem a=bq+r.
na−1=((nb)q)nr−1
I don't know how to move forward.

-

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...