Determine greatest common divisor, possibly involving the euc. algorithm
51858
Showing $\gcd(2^m-1,2^n+1)=1$
104056
Finding element in binary representation of $GF(2^6)$
65503
Identity involving LCM and GCD: $\frac{[a,b,c]^2}{[a,b][b,c][c,a]}=\frac{(a,b,c)^2}{(a,b)(b,c)(c,a)}$
40538
On determinants and common divisors
48670
GCD in Gaussian integers.
102757
Prove that either $m$ divides $n$ or $n$ divides $m$ given that $\operatorname{lcm}(m,n) + \operatorname{gcd}(m,n) = m + n$?
95890
GCD algorithms for a large integers
58480
Computing sums of divisors in $O(\sqrt n)$ time?
104176
$15x\equiv 20 \pmod{88}$ Euclid's algorithm
4425
Why are integer GCDs positive? [unit normalization of GCDs]
116175
Show that $\gcd(3k+2,5k+3)=1$
76126
How to find the GCD of two polynomials
125737
GCD( LCM(a,b) , LCM(a,c) ) = LCM(b, GCD(b,c)) , why?
62959
How to find GCD, LCM on a set of numbers
14783
A Number Theory problem (GCD)
135086
GCD of two numbers divided by their greatest common divisor is 1
50396
How can I show that $ab \sim \gcd (a,b) {\operatorname{lcm} (a,b)}$ for any $a,b \in R \setminus \{0\}$?