GCD of two numbers divided by their greatest common divisor is 1
6410
Prove that $(ma, mb) = |m|(a, b)\ $ [GCD & LCM Distributive Law]
116175
Show that $\gcd(3k+2,5k+3)=1$
19164
On the GCD of a Pair of Fermat Numbers
122096
Find $GCD(n^2+1,n+1)$
10966
gcd and lcm from prime factorization proof
80148
Prove $\gcd(a+b,a^2+b^2)$ is $1$ or $2$ if $\gcd(a,b) = 1$
69279
If $\gcd(a,b)=1$ then, $\gcd(a^2,b^2)=1$
38404
Prove $\gcd(a+b, a-b) = 1$ or $2\,$ if $\,\gcd(a,b) = 1$
41295
Divisibility, LCM and GCD for fractions (rationals)
28021
Showing that these two definitions of $\gcd(a,b)$ are equivalent
73391
Prove that if $\gcd(a,b)=1$, then $\gcd(a^2,b^2)=1$
66785
Find $\gcd(p^n-1,p^m+1)$.
33996
Proving that $\gcd(2^m - 1, 2^n - 1) = 2^{\gcd(m,n )} - 1$
10348
Prove that if the $\gcd(a,b)=1$, then $\gcd(a+b,ab)=1$
7316
How to prove that $z\gcd(a,b)=\gcd(za,zb)$
96376
Why do we notate the greatest common divisor of $a$ and $b$ as $(a,b)$?
113641
Suppose the gcd (a,b) = 1 and c divides a + b. Prove that gcd (a,c) = 1 = gcd (b,c)