Newbetuts
.
New posts in gcd-and-lcm
How can I find the possible values that $\gcd(a+b,a^2+b^2)$ can take, if $\gcd(a,b)=1$
elementary-number-theory
divisibility
gcd-and-lcm
Show that $\gcd(a^2, b^2) = \gcd(a,b)^2$
elementary-number-theory
divisibility
gcd-and-lcm
$n_1,...,n_k$ pair coprime $\!\iff\! {\rm lcm}(n_1,...,n_k)=n_1...n_k$ [lcm = product for coprimes] [closed]
elementary-number-theory
proof-explanation
gcd-and-lcm
Understanding the Existence and Uniqueness of the GCD
elementary-number-theory
discrete-mathematics
proof-explanation
gcd-and-lcm
Show $(2^m-1,2^n+1)=1$ if $m$ is odd [duplicate]
elementary-number-theory
gcd-and-lcm
Prove $\gcd(a,b) \gcd(a,c) \gcd(b,c) \,\text{lcm} (a,b,c)^2=$ $\text{lcm}(a,b)\,\text{lcm}(a,c) \,\text{lcm}(b,c) \gcd(a,b,c)^2$ [closed]
elementary-number-theory
diophantine-equations
gcd-and-lcm
Why $\mathbb{C}(f(t),g(t))=\mathbb{C}(t)$ implies that $\gcd(f(t)-a,g(t)-b)=t-c$, for some $a,b,c \in \mathbb{C}$?
polynomials
commutative-algebra
field-theory
gcd-and-lcm
Prove that if $\gcd(a,b)=1$, then $\gcd(a^2,b^2)=1$
elementary-number-theory
divisibility
gcd-and-lcm
Showing $\gcd(2^m-1,2^n+1)=1$
elementary-number-theory
divisibility
gcd-and-lcm
If $n \in Z^+$, how many possible values are there for $gcd(n,n+3000)$?
elementary-number-theory
gcd-and-lcm
How can one talk about gcd in the context of complex numbers where order doesn't exist?
elementary-number-theory
ring-theory
complex-numbers
algebraic-number-theory
gcd-and-lcm
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)}$
elementary-number-theory
gcd-and-lcm
Smallest positive element of $ \{ax + by: x,y \in \mathbb{Z}\}$ is $\gcd(a,b)$ [duplicate]
elementary-number-theory
gcd-and-lcm
What is $\gcd(0,a)$, where $a$ is a positive integer?
abstract-algebra
group-theory
elementary-number-theory
gcd-and-lcm
Basis for $\mathbb{Z}^2$
abstract-algebra
gcd-and-lcm
Is this $\gcd(0, 0) = 0$ a wrong belief in mathematics or it is true by convention?
elementary-number-theory
proof-verification
gcd-and-lcm
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$ [duplicate]
elementary-number-theory
gcd-and-lcm
Show that if $a \equiv b \pmod n$, $\gcd(a,n)=\gcd(b,n)$ [duplicate]
elementary-number-theory
congruences
gcd-and-lcm
$\gcd(a,b) = \gcd(a + b, \mathrm{lcm}[a,b])$
elementary-number-theory
gcd-and-lcm
Investigating the recurrence relation $x_{n+1}=\frac{x_{n}+x_{n-1}}{(x_{n},\,x_{n-1})}+1$
sequences-and-series
number-theory
elementary-number-theory
recurrence-relations
gcd-and-lcm
Prev
Next