The relation of LCM and GCD in Euclidean rings
50396
How can I show that $ab \sim \gcd (a,b) {\operatorname{lcm} (a,b)}$ for any $a,b \in R \setminus \{0\}$?
66031
Rational Numbers - LCM and HCF
38547
Why does the Euclidean algorithm for finding GCD work?
139833
Prove that $\gcd(M, N)\times \mbox{lcm}(M, N) = M \times N$.
130513
LCM is associative: $\ \text{lcm}(\text{lcm}(a,b),c)=\text{lcm}(a,\text{lcm}(b,c))$
50249
Pairs of numbers with a given LCM
8160
What is $\gcd(0,a)$, where $a$ is a positive integer?
31263
Quotient rings of Gaussian integers
95533
I need some help with a GCD and LCM's Problem
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$
45213
Easiest and most complex proof of $\gcd (a,b) \times \operatorname{lcm} (a,b) =ab.$
74809
GCD to LCM of multiple numbers
137369
Inductive proof of gcd Bezout identity (from Apostol: Math, Analysis 2ed)
150909
GCD is MIN of Exponents of Prime Factors, LCM is MAX of Exponents of Prime Factors.
121156
Prove that: $\gcd[a,b,c]=\frac{abc.\operatorname{lcm}(a,b,c)}{\operatorname{lcm}(a,b)\operatorname{lcm}(a,c)\operatorname{lcm}(b,c)}$
77064
Proving $\gcd((a+b)^m,(a-b)^m)\le2^m$ for coprime $a,b$ and $m \in \Bbb N$
142693
$\gcd(a,b) = \gcd(a + b, \mathrm{lcm}[a,b])$