Let and be positive integers such that
Find the minimum possible value of .
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.
First of all, I am reversing the guven equation , which forms
4 3 1 9 7 > a b > 1 7 7 7
It can also be written as
4 3 1 7 2 + 2 5 > a b > 1 7 6 8 + 9
4 + 4 3 2 5 > a b > 4 + 1 7 9
Now, we know that 4 3 1 9 7 > 4 and 1 7 7 7 < 5
So, we can say that the following equation is true.
4 > a b > 5
Now, we can say that 4 + 4 3 2 5 > 4 + a x > 4 + 1 7 9
Subtracting 4 on all sides, we get
4 3 2 5 > a x > 1 7 9
Now, reciprocating the equation,
2 5 4 3 > x a > 9 1 7
Now, multiplying x on all sides,
2 5 4 3 x > a > 9 1 7 x
Lets find the bounds of a for x = 1 , 2 , 3 , ⋯ because we need the smallest value of b .
We obtain the bounds as
( 1 2 5 1 8 , 1 9 8 ) , ( 3 2 5 1 1 , 1 9 7 ) , ( 5 9 4 , 4 3 2 )
But, none of these pairs contain an integer between them,
So, lets proceed with x = 4 , the bounds obtained are
6 2 5 1 2 for 2 5 4 3 x , and 7 9 5 for 9 1 7 x
So, in this situation, take the smallest value for a i.e. 7 .
Then b would be ( 4 a + x ) = [ ( 4 × 7 ) + 4 ] = [ 2 8 + 4 ] = 3 2