Question

Least common multiple in Euclidean algorithm

score 1.4k · Answer 1 · 2026-03-29 05:43:06

1.4k

Views

Least common multiple in Euclidean algorithm

Published on 29 Mar 2026 - 5:43

score 51 · Answer 2 · 2020-08-09 11:54:28

51

Views

GCD( LCM(a,b) , LCM(a,c) ) = LCM(b, GCD(b,c)) , why?

Published on 09 Aug 2020 - 11:54

score 171 · Answer 3 · 2020-08-09 12:49:09

171

Views

GCD( LCM(a,b) , LCM(a,c) ) = LCM(a, GCD(b,c)) , How?

Published on 09 Aug 2020 - 12:49

score 372 · Answer 4 · 2020-08-11 12:20:56

372

Views

GCD with two big large numbers

Published on 11 Aug 2020 - 12:20

score 277 · Answer 5 · 2026-03-31 20:27:49

277

Views

Let $S$ be the set of all integers $k$, $1\leq k\leq n$, such that $\gcd(k,n)=1$. What is the arithmetic mean of the integers in $S$?

Published on 31 Mar 2026 - 20:27

score 33 · Answer 6 · 2020-08-15 17:14:01

33

Views

Question regarding decimal LCM

Published on 15 Aug 2020 - 17:14

score 118 · Answer 7 · 2020-08-16 19:57:56

118

Views

Generalization of a problem related to gcd

Published on 16 Aug 2020 - 19:57

score 57 · Answer 8 · 2020-08-19 02:02:45

57

Views

Does there exist a GCD domain $R$ in which the relationship $aR \cap b R \subseteq \mathrm{lcm}(a,b) R$ is untrue?

Published on 19 Aug 2020 - 2:02

score 42 · Answer 9 · 2020-08-21 12:42:49

42

Views

Numbers that can be written as a sum of n of their divisors

Published on 21 Aug 2020 - 12:42

score 120 · Answer 10 · 2020-08-22 07:28:34

120

Views

Find the coefficients of gcd(a,b,c) as a linear combination?

Published on 22 Aug 2020 - 7:28

score 63 · Answer 11 · 2020-08-23 04:28:28

63

Views

Prove that if $b\mid c$ then $\gcd(a,b)=\gcd(a+c,b)$.

Published on 23 Aug 2020 - 4:28

score 74 · Answer 12 · 2020-08-26 16:36:40

74

Views

If $\gcd(x;y)=1$, why is $\gcd[(ax+by);(cx+dy)]=1$?

Published on 26 Aug 2020 - 16:36

score 248 · Answer 13 · 2020-08-26 21:24:21

248

Views

given information about primes dividing gcd and lcm, find # of prime factors dividing one of the numbers

Published on 26 Aug 2020 - 21:24

score 49 · Answer 14 · 2020-08-28 07:11:49

49

Views

Is it possible, for any $n$, to find the greatest common factor of all highly composite numbers $\geq n$?

Published on 28 Aug 2020 - 7:11

score 54 · Answer 15 · 2020-08-29 11:36:21

54

Views

Connectedness of $\{(x,y,z)\ : \ x,y,z \in \mathbb Z, \gcd(x,y,z) = 1\}$ under the relation $\vec u \cdot \vec v = 1$

Published on 29 Aug 2020 - 11:36

List Question

Least common multiple in Euclidean algorithm

GCD( LCM(a,b) , LCM(a,c) ) = LCM(b, GCD(b,c)) , why?

GCD( LCM(a,b) , LCM(a,c) ) = LCM(a, GCD(b,c)) , How?

GCD with two big large numbers

Let $S$ be the set of all integers $k$, $1\leq k\leq n$, such that $\gcd(k,n)=1$. What is the arithmetic mean of the integers in $S$?

Question regarding decimal LCM

Generalization of a problem related to gcd

Does there exist a GCD domain $R$ in which the relationship $aR \cap b R \subseteq \mathrm{lcm}(a,b) R$ is untrue?

Numbers that can be written as a sum of n of their divisors

Find the coefficients of gcd(a,b,c) as a linear combination?

Prove that if $b\mid c$ then $\gcd(a,b)=\gcd(a+c,b)$.

If $\gcd(x;y)=1$, why is $\gcd[(ax+by);(cx+dy)]=1$?

given information about primes dividing gcd and lcm, find # of prime factors dividing one of the numbers

Is it possible, for any $n$, to find the greatest common factor of all highly composite numbers $\geq n$?

Connectedness of $\{(x,y,z)\ : \ x,y,z \in \mathbb Z, \gcd(x,y,z) = 1\}$ under the relation $\vec u \cdot \vec v = 1$

Trending Questions

Popular # Hahtags

Popular Questions