Show that $\forall{a,b,n}\in\mathbb{N},\ gcd(a^n,b^n)=gcd(a,b)^n$.

76 Views Asked by At

Need help proving the relation above, I'm assuming it can be done using gcd properties.

1

There are 1 best solutions below

0
On

Write $a=gx$ and $b=gy$ where $g=gcd(a,b)$. Then $x,y$ are relatively prime. So $a^n = g^nx^n$ and $b=g^ny^n$. Since $x^n$ and $y^n$ are relatively prime we have $$gcd(a^n,b^n) = g^n$$