query: Greatest Common Divisor Integer
positive_passages.docid: 97947
positive_passages.text: How can we prove that a binomial coefficient $n\choose m$is divisible by the ratio of $n$ and $\gcd(n,m)$?
negative_passages.docid: 62959
negative_passages.text: How to find GCD, LCM on a set of numbers
negative_passages.docid: 27250
negative_passages.text: Greatest common divisor of two relatively primes
negative_passages.docid: 87013
negative_passages.text: If $\gcd(a,b)=1$, then there exists integers $x$ and $y$ such that $xa + yb = 1$
negative_passages.docid: 8160
negative_passages.text: What is $\gcd(0,a)$, where $a$ is a positive integer?
negative_passages.docid: 46555
negative_passages.text: How to calculate GCD of Gaussian integers?
negative_passages.docid: 101940
negative_passages.text: If we know the GCD and LCM of two integers, can we determine the possible values of these two integers?
negative_passages.docid: 1197
negative_passages.text: Finding $\gcd(2n-1,2n+1)$ . . . I think it's 1 but is my logic right?
negative_passages.docid: 57944
negative_passages.text: Euler's Formula application for distinct odd primes with gcd 1
negative_passages.docid: 22845
negative_passages.text: Prove that if d is a common divisor of a and b, then $d=\gcd(a,b)$ if and only if $\gcd(a/d,b/d)=1$
negative_passages.docid: 75733
negative_passages.text: Divisibility of prime numbers
negative_passages.docid: 122096
negative_passages.text: Find $GCD(n^2+1,n+1)$
negative_passages.docid: 69279
negative_passages.text: If $\gcd(a,b)=1$ then, $\gcd(a^2,b^2)=1$
negative_passages.docid: 48452
negative_passages.text: Proof that $\gcd$ divides $\operatorname{lcm}$
negative_passages.docid: 21840
negative_passages.text: Zero divisors and units for the ring $\mathbb{Z}/n\mathbb{Z}$ with integer $n$
negative_passages.docid: 40538
negative_passages.text: On determinants and common divisors
negative_passages.docid: 125737
negative_passages.text: GCD( LCM(a,b) , LCM(a,c) ) = LCM(b, GCD(b,c)) , why?