query: $\gcd$ and $\text{lcm}$ of more than $2$ positive integers
positive_passages.docid: 74809
positive_passages.text: GCD to LCM of multiple numbers
negative_passages.docid: 25174
negative_passages.text: Solve for $A,B$: $\mathrm{LCM}(A,B)=168$, $\mathrm{HCF(A,B)}=12$
negative_passages.docid: 4648
negative_passages.text: Proving that $\mathbb{Z}_m\oplus \mathbb{Z}_n \cong \mathbb{Z}_d\oplus \mathbb{Z}_l $ as groups, where $l=\mathrm{lcm}(m,n)$ and $d=\gcd(m,n)$
negative_passages.docid: 121280
negative_passages.text: Proving that $a \mathbb{Z} \cap b\mathbb{Z} = \operatorname{lcm}(a,b)\mathbb Z$
negative_passages.docid: 43728
negative_passages.text: Proof via Group Theory : $\mathrm{lcm}(a,b) \cdot \gcd(a,b) = |ab|$
negative_passages.docid: 130513
negative_passages.text: LCM is associative: $\ \text{lcm}(\text{lcm}(a,b),c)=\text{lcm}(a,\text{lcm}(b,c))$
negative_passages.docid: 145354
negative_passages.text: What is $\gcd(0,0)$?
negative_passages.docid: 66031
negative_passages.text: Rational Numbers - LCM and HCF
negative_passages.docid: 13317
negative_passages.text: show that $a^{12} \equiv 1 \mod 32760$ for each $a \in \mathbb{Z}$ such that $\text{gcd}(a, 32760) = 1$
negative_passages.docid: 65503
negative_passages.text: 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)}$
negative_passages.docid: 19164
negative_passages.text: On the GCD of a Pair of Fermat Numbers
negative_passages.docid: 119734
negative_passages.text: Why does prime factorization for LCM work?
negative_passages.docid: 48670
negative_passages.text: GCD in Gaussian integers.
negative_passages.docid: 41295
negative_passages.text: Divisibility, LCM and GCD for fractions (rationals)
negative_passages.docid: 122096
negative_passages.text: Find $GCD(n^2+1,n+1)$
negative_passages.docid: 59566
negative_passages.text: Proving that $ka \equiv kb \pmod{m} \iff a \equiv b \pmod{m/\gcd(k,m)}$
negative_passages.docid: 157508
negative_passages.text: prove $lcm(a,gcd(b,c))=gcd(lcm(a,b),lcm(a,c))$