Find the number of positive rational numbers pairs such that
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.
Proposition : Sum of any fraction and its inverse can not be an integer.
Consider a fraction q p .Now assume that q p + p q = m where m ∈ Z
So p 2 + q 2 = m p q ⟹ p 2 − m p q + q 2 = 0 .As p is an integer so its discriminant should be an integer.
D = m 2 − 4 ⟹ m 2 − D 2 = 4 ⟹ ( m + D ) ( m − D ) = 4 .
From this the only solution is D = 0 , m = 2 , .Putting m = 2 yields p = q which implies no fraction exists.
Now coming to the main problem.As stated that solution can be rational numbers we can assume
x = b a and y = d c where a , b , c , d ∈ Z ; g c d ( a , b ) = g c d ( c , d ) = 1 ; b , d = 0
The expression becomes b a + d c + a b + c d = 2 0 1 9
Case(1): if x , y ∈ Z then inverses can not become an integer untill they are 1 / 2 .But they cannt be half because it is not a solution.
Case(2):if x = n ∈ Z ; y = q p ∈ Q and vice-versa..
n + 1 / n + p / q + q / p = 2 0 1 9 1 / n + p / q + q / p = 2 0 1 9 − n = I .This will not give any solutions.
Case(3) When both x , y ∈ Q then b a + d c + a b + c d = 2 0 1 9
The sum of fraction and its inverse will not make any integer.So now consider b a + d c = k ∈ Z and a b + c d = l ∈ Z .Multiply this:
( b a + d c ) ( a b + c d ) = k l
1 + b c a d + 1 + a d b c = k l b c a d + a d b c = k l − 2 .But we proved earlier that fraction and sum with its inverse will never yields an integer.(Here fraction is b c a d )
if here c ∣ a and b ∣ d then b c a d will be an integer but a d b c will again become an fraction.
So there is no rationals x , y exists.