Friday, September 6, 2019

algebra precalculus - How to prove that $gcd(t^n-1,t^m-1)=t^{gcd(n,m)}-1 $








Let $t$ be an element in any domain where gcd's exist. Then if $m,n$ are positive integer,prove that: $\gcd(t^n-1,t^m-1)=t^{\gcd(n,m)}-1 $

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...