query: If $\gcd(a,b)=1=\gcd(c,d)$, $b>0$, $d>0$ and $\frac {a}{b}+ \frac {c}{d}$ is an integer, show that $b=d$
positive_passages.docid: 20003
positive_passages.text: Prove for positive integers a,b,c and d (where b does not equal d), if gcd(a,b) = gcd(c,d) = 1, then a/b + c/d is not an integer
negative_passages.docid: 76680
negative_passages.text: Prove that if $\gcd(a,c)=1$ and $\gcd(b,c)=1$ then $\gcd(ab,c)=1$
negative_passages.docid: 77278
negative_passages.text: If $\,\gcd(a,b) = {\rm lcm}(a,b)\,$ then prove $a=b$
negative_passages.docid: 73391
negative_passages.text: Prove that if $\gcd(a,b)=1$, then $\gcd(a^2,b^2)=1$
negative_passages.docid: 82777
negative_passages.text: If $\gcd(a, b) = 1$ then prove that $\gcd(a+b, a^2-ab+b^2) = 1$ or $3$?
negative_passages.docid: 114667
negative_passages.text: $d\mid a,b \iff d\mid\gcd(a,b) \ $ [GCD Universal Property]
negative_passages.docid: 60842
negative_passages.text: if $a^2+b^2=c^2$ then $gcd(a,b)=gcd(a,c)=gcd(b,c)$.
negative_passages.docid: 4141
negative_passages.text: Prove: If $a\mid m$ and $b\mid m$ and $\gcd(a,b)=1$ then $ab\mid m$
negative_passages.docid: 67660
negative_passages.text: Prove $\,b\equiv c\pmod{\!m}\Rightarrow \gcd(b,m)=\gcd(c,m)$ i.e. $\gcd(c+km,m) = \gcd(c,m)$
negative_passages.docid: 422
negative_passages.text: If $\gcd(a,b)=1$, $\gcd(a,y)=1$ and $\gcd(b,x)=1$ then prove that $ax+by$ is prime to $ab$
negative_passages.docid: 86413
negative_passages.text: Show that $\frac{(m+n-1)!}{m!n!}$ is an integer where m and n are positive integers and gcd(m,n)=1
negative_passages.docid: 34330
negative_passages.text: How to prove $\gcd(a^2,b^2) = (\gcd(a,b))^2$?
negative_passages.docid: 24845
negative_passages.text: Let $a\mid c$ and $b\mid c$ such that $\gcd(a,b)=1$, Show that $ab\mid c$
negative_passages.docid: 66748
negative_passages.text: Show that if $a \equiv b \pmod n$, $\gcd(a,n)=\gcd(b,n)$
negative_passages.docid: 28021
negative_passages.text: Showing that these two definitions of $\gcd(a,b)$ are equivalent
negative_passages.docid: 128199
negative_passages.text: Proving gcd(a, a+2) is 1 or 2 for every integer a?
negative_passages.docid: 23590
negative_passages.text: Show that $\gcd\left(\frac{a^n-b^n}{a-b},a-b\right)=\gcd(n d^{n-1},a-b)$