Given d = gcd(c,n), why there exists relatively prime integers r and s, such that c = rd and n = sd
22845
Prove that if d is a common divisor of a and b, then $d=\gcd(a,b)$ if and only if $\gcd(a/d,b/d)=1$
85006
If $a$ and $b$ are relatively prime, prove that $a + 2b$ and $2a+b$ are also relatively prime or have a gcd of $3$.
38295
If $\gcd (a,b) = 1$, what can be said about $\gcd (a+b,a-b)$?
14783
A Number Theory problem (GCD)
4486
If $ar + bs =1$, then $\gcd(a,s) = \gcd(r,b) = \gcd(r,s) = 1$
107914
Expanding GCDs Reasoning: $\gcd(a,c) \cdot \gcd(b,c) = \gcd(ab,bc,ac,cc)$
59006
Proof of $\gcd(n!+1, (n+1)!+1)=1$?
113641
Suppose the gcd (a,b) = 1 and c divides a + b. Prove that gcd (a,c) = 1 = gcd (b,c)
35945
Proof that if $\gcd(a,b) = 1$ and $a\mid n$ and $b\mid n$, $ab \mid n$
156966
Prove that if $b = dk$ where $gcd(m, a) = d$, there are $d$ solutions to $ax \equiv b \mod m$
77547
Find integers $a,b,c,d$ such that
147527
Let $a$ and $b$ be non-zero integers, and $c$ be an integer. Let $d = \gcd(a, b)$. Prove that if $a|c$ and $b|c$ then $ab|cd$.
125737
GCD( LCM(a,b) , LCM(a,c) ) = LCM(b, GCD(b,c)) , why?
55441
Check: For the integers $a,b,c$ show that $\gcd(a,bc)=\gcd(a,\gcd(a,b)\cdot c)$
112486
Bounds on a sum of gcd's
43155
Cyclotomic Polynomials and GCD
2208
$\gcd(a,b,c)=\gcd(\gcd(a,b),c)\,$ [GCD Associative Law]