New posts in Least Common Multiple

Can we invert these analogous "Dirichlet" series for GCD / LCM convolution?

Numerical example for $\gcd(a,b)=\prod p_i^{\min(a_i,b_i)}$

Prove that if LCMs are equal, then the numbers are equal too.

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

The series of reciprocals of the least common multiples of integers $X_1<X_2<\dots$ converges

prove that $\operatorname{lcm}(n,m) = nm/\gcd(n,m)$

Find the least number which when divided by 2, 3, 4, 5, 6 leaves a remainder of 1 but it is divided by 7 completely.

Concise proof that every common divisor divides GCD without Bezout's identity?

For integers $a$ and $b$, $ab=\text{lcm}(a,b)\cdot\text{hcf}(a,b)$

If $a \mid m$ and $(a + 1) \mid m$, prove $a(a + 1) | m$.