query: Greatest common divisor addition of numbers
positive_passages.docid: 94770
positive_passages.text: Greatest common divisor of two positive integers
negative_passages.docid: 50249
negative_passages.text: Pairs of numbers with a given LCM
negative_passages.docid: 56423
negative_passages.text: gcd of power plus one
negative_passages.docid: 86051
negative_passages.text: Find the sum of reciprocals of divisors given the sum of divisors
negative_passages.docid: 157508
negative_passages.text: prove $lcm(a,gcd(b,c))=gcd(lcm(a,b),lcm(a,c))$
negative_passages.docid: 127388
negative_passages.text: Least common multiple for 3 or more numbers
negative_passages.docid: 14783
negative_passages.text: A Number Theory problem (GCD)
negative_passages.docid: 28749
negative_passages.text: Proving that any common multiple of two numbers is a multiple of their least common multiple
negative_passages.docid: 107095
negative_passages.text: Prove $\gcd(a,b) \gcd(a,c) \gcd(b,c) \,\text{lcm} (a,b,c)^2=$ $\text{lcm}(a,b)\,\text{lcm}(a,c) \,\text{lcm}(b,c) \gcd(a,b,c)^2$
negative_passages.docid: 190
negative_passages.text: Why $\gcd(qb+r,b)=\gcd(b,r)$?
negative_passages.docid: 57281
negative_passages.text: Is Bezout's lemma enough to confirm the GCD of a number.
negative_passages.docid: 117098
negative_passages.text: Properties of the greatest common divisor: $\gcd(a, b) = \gcd(a, b-a)$ and $\gcd(a, b) = \gcd(a, b \text{ mod } a)$
negative_passages.docid: 122096
negative_passages.text: Find $GCD(n^2+1,n+1)$
negative_passages.docid: 76507
negative_passages.text: $\gcd(b^x - 1, b^y - 1, b^ z- 1,\dots) = b^{\gcd(x, y, z,\dots)} -1$
negative_passages.docid: 10966
negative_passages.text: gcd and lcm from prime factorization proof
negative_passages.docid: 75733
negative_passages.text: Divisibility of prime numbers
negative_passages.docid: 38295
negative_passages.text: If $\gcd (a,b) = 1$, what can be said about $\gcd (a+b,a-b)$?