An easy number theory problem

Number Theory Level pending

Positive integers a a , b b , c c , and d d are such that gcd ( a , b ) = 1 \gcd (a,b)=1 and a < b a<b , and gcd ( c , d ) = 1 \gcd(c,d)=1 and c < d c<d . Then a b + c d = 1 \dfrac{a}{b}+\dfrac{c}{d}=1 is true only if b = d b=d .

False True

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Kelvin Hong
Jul 1, 2017

Consider a fraction a b \dfrac{a}{b} ,

1 a b = b a b 1-\dfrac{a}{b}=\dfrac{b-a}{b}

gcd ( b , b a ) = gcd ( b , b b a ) = gcd ( b , a ) = gcd ( b , a ) = 1 \gcd(b,b-a)=\gcd(b,b-b-a)=\gcd(b,-a)=\gcd(b,a)=1

So the fraction b a b \dfrac{b-a}{b} cannot divided down simpler and since gcd ( c , d ) = 1 \gcd(c,d)=1 , there must be b = d b=d .

Someone please tell me if there is a theory talk about this statement, thanks.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...