Question

Calculating the least common multiple of $n$ numbers, knowing the LCM of $(n-1)$ of them

score 202 · Answer 1 · 2015-11-20 12:22:31

202

Views

Calculating the least common multiple of $n$ numbers, knowing the LCM of $(n-1)$ of them

Published on 20 Nov 2015 - 12:22

score 137 · Answer 2 · 2015-11-21 12:28:44

137

Views

GCD and LCM trouble

Published on 21 Nov 2015 - 12:28

score 141 · Answer 3 · 2015-11-24 20:46:41

141

Views

$w = ax = by$ over the nonzero integers $\implies w = \pm\text{lcm}(a,b)\gcd(x,y)$.

Published on 24 Nov 2015 - 20:46

score 628 · Answer 4 · 2015-11-26 02:08:56

628

Views

Proving ${\rm gcd}(a,b)=1$, $a\mid c$ and $b\mid c$ implies $ab\mid c$ WITHOUT Euclid's or Bezout's lemma.

Published on 26 Nov 2015 - 2:08

score 293 · Answer 5 · 2015-12-15 07:56:08

293

Views

How to prove by induction the formula to find LCM of two numbers for multiple numbers?

Published on 15 Dec 2015 - 7:56

score 493 · Answer 6 · 2015-12-15 14:17:17

493

Views

Prove that $lcm(a , b) = \prod_{i=1} (P_i)^{\max(\alpha_i,\beta_i)}$

Published on 15 Dec 2015 - 14:17

score 667 · Answer 7 · 2015-12-29 16:42:08

667

Views

Find $\operatorname{lcm}(2n-1,2n+1)$

Published on 29 Dec 2015 - 16:42

score 217 · Answer 8 · 2016-01-16 14:56:38

217

Views

Solve for $A,B$: $\mathrm{LCM}(A,B)=168$, $\mathrm{HCF(A,B)}=12$

Published on 16 Jan 2016 - 14:56

score 206 · Answer 9 · 2016-02-03 14:23:13

206

Views

Is this true :$\zeta(s-1)=\sum_{n=1}^{\infty}\frac{\gcd(n,n)}{{\operatorname{lcm}(n,n)}^{s}}$?

Published on 03 Feb 2016 - 14:23

score 4.8k · Answer 10 · 2016-02-21 10:42:19

4.8k

Views

How to find lcm of $\frac{\pi}{5}$ and $\frac{\pi}{2}$ ? With paper pencil approach

Published on 21 Feb 2016 - 10:42

score 1.6k · Answer 11 · 2016-02-24 17:03:17

1.6k

Views

How do I solve the system of congruences $x \equiv 1 \pmod{3}$, $x \equiv 2 \pmod{4}$, $x \equiv 4 \pmod{5}$, $x \equiv 2 \pmod{7}$?

Published on 24 Feb 2016 - 17:03

score 1.1k · Answer 12 · 2016-02-25 22:35:26

1.1k

Views

Number of factors in the smallest number possible.

Published on 25 Feb 2016 - 22:35

score 1.5k · Answer 13 · 2016-03-21 19:24:25

1.5k

Views

Euler function and least common multiple

Published on 21 Mar 2016 - 19:24

score 12.3k · Answer 14 · 2016-03-28 19:44:57

12.3k

Views

The lowest number that is a multiple of both 60 and the integer n is 180. Find the smallest possible value of n.

Published on 28 Mar 2016 - 19:44

score 148 · Answer 15 · 2016-03-31 00:20:58

148

Views

A questionable proof that $Z(S_n)$ is trivial for $n\ge 3$.

Published on 31 Mar 2016 - 0:20

List Question

Calculating the least common multiple of $n$ numbers, knowing the LCM of $(n-1)$ of them

GCD and LCM trouble

$w = ax = by$ over the nonzero integers $\implies w = \pm\text{lcm}(a,b)\gcd(x,y)$.

Proving ${\rm gcd}(a,b)=1$, $a\mid c$ and $b\mid c$ implies $ab\mid c$ WITHOUT Euclid's or Bezout's lemma.

How to prove by induction the formula to find LCM of two numbers for multiple numbers?

Prove that $lcm(a , b) = \prod_{i=1} (P_i)^{\max(\alpha_i,\beta_i)}$

Find $\operatorname{lcm}(2n-1,2n+1)$

Solve for $A,B$: $\mathrm{LCM}(A,B)=168$, $\mathrm{HCF(A,B)}=12$

Is this true :$\zeta(s-1)=\sum_{n=1}^{\infty}\frac{\gcd(n,n)}{{\operatorname{lcm}(n,n)}^{s}}$?

How to find lcm of $\frac{\pi}{5}$ and $\frac{\pi}{2}$ ? With paper pencil approach

How do I solve the system of congruences $x \equiv 1 \pmod{3}$, $x \equiv 2 \pmod{4}$, $x \equiv 4 \pmod{5}$, $x \equiv 2 \pmod{7}$?

Number of factors in the smallest number possible.

Euler function and least common multiple

The lowest number that is a multiple of both 60 and the integer n is 180. Find the smallest possible value of n.

A questionable proof that $Z(S_n)$ is trivial for $n\ge 3$.

Trending Questions

Popular # Hahtags

Popular Questions