List questions from gcd-and-lcm

Published on 26 Mar 2026 - 1:11

74

Views

Combinatorics with Bashy

Published on 22 Nov 2019 - 0:15

483

Views

$\operatorname{lcm}(a^2, ab, b^2) =\operatorname{lcm}(a^2, b^2)$

Published on 25 Nov 2019 - 1:27

2.2k

Views

Understanding why gcd(a,m) = gcd(b,m) = 1 implies gcd(ab, m) = 1

Published on 27 Nov 2019 - 2:14

93

Views

$p$ prime number, $p = a\cdot b$, then $a=1$ or $b=1$

Published on 28 Nov 2019 - 12:06

74

Views

Find pairs $(a,b,c,d)$

Published on 29 Nov 2019 - 23:01

162

Views

Prove that $(m,n)(n,k)(k,n)[m,n,k]^2=[m,n][n,k][k,n](m,n,k)^2$

Published on 01 Dec 2019 - 7:05

147

Views

if a prime p|LCM[a,b] then p|a or p|b

Published on 04 Dec 2019 - 7:34

75

Views

Proof of gcd of a list of numbers

Published on 04 Dec 2019 - 13:46

269

Views

Is there a relationship between a polynomial and the $\gcd$ of its coefficients?

Published on 26 Mar 2026 - 4:34

180

Views

Least common multiple of $1,2,\ldots,2n+1$

Published on 07 Dec 2019 - 5:07

79

Views

Prove that the system $x\equiv a \pmod m$, $x\equiv b \pmod n$ has a solution iff $\gcd(m,n) \mid (a-b)$

Published on 09 Dec 2019 - 0:13

92

Views

$\gcd(8,16)$ with Euclidean algorithm

Published on 26 Mar 2026 - 7:55

82

Views

Find ℕ a, b, c such that gcd(a,b)=21, gcd(b,c)=21, gcd(a,c)=819

Published on 09 Dec 2019 - 22:16

49

Views

If $\gcd(i-j, n) = 1$, does it follow that at least one of $\gcd(i,n)$ and $\gcd(j,n)$ is 1?

Published on 11 Dec 2019 - 2:29

List Question

Let $R$ be an integral domain and $r, s$ $\in$ $R$

Combinatorics with Bashy

$\operatorname{lcm}(a^2, ab, b^2) =\operatorname{lcm}(a^2, b^2)$

Understanding why gcd(a,m) = gcd(b,m) = 1 implies gcd(ab, m) = 1

$p$ prime number, $p = a\cdot b$, then $a=1$ or $b=1$

Find pairs $(a,b,c,d)$

Prove that $(m,n)(n,k)(k,n)[m,n,k]^2=[m,n][n,k][k,n](m,n,k)^2$

if a prime p|LCM[a,b] then p|a or p|b

Proof of gcd of a list of numbers

Is there a relationship between a polynomial and the $\gcd$ of its coefficients?

Least common multiple of $1,2,\ldots,2n+1$

Prove that the system $x\equiv a \pmod m$, $x\equiv b \pmod n$ has a solution iff $\gcd(m,n) \mid (a-b)$

$\gcd(8,16)$ with Euclidean algorithm

Find ℕ a, b, c such that gcd(a,b)=21, gcd(b,c)=21, gcd(a,c)=819

If $\gcd(i-j, n) = 1$, does it follow that at least one of $\gcd(i,n)$ and $\gcd(j,n)$ is 1?

Trending Questions

Popular # Hahtags

Popular Questions