Find the minimum value of the expression over all triples of positive intergers satisfying .
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.
Note that any triple ( a , b , c ) = ( 1 , 2 , c ) satisfy the given inequality. So, b a takes the value 2 1 .
Now we prove that there is no other solution for b ≥ 2 a .
Let t = ∣ a c − b ! ∣ .
If t > 0 , 1 = ∣ ∣ ∣ ∣ t a c − t b ! ∣ ∣ ∣ ∣ .
Since t ≤ b , t b ! is an integer, so t a c is also an integer.
Furthermore, 2 a ≤ b ⇒ a , 2 a i n { 1 , 2 , . . . , b } . At least one of a and 2 a is different from t , so it is not canceled out from the product in t b ! . So, a ∣ t b ! .
Therefore, since the difference between t b ! and t a c is 1, g cd ( a , t a c ) = 1 implying t = a c .
Thus, we are now left with two cases only: ∣ a c − b ! ∣ = 0 or ∣ a c − b ! ∣ = a c .
These cases reduce to b ! = a c and b ! = 2 a c respectively.
Either way, 2 a − 1 ∈ { 1 , 2 , . . . , b } , so ( 2 a − 1 ) ∣ b ! or ( 2 a − 1 ) ∣ 2 a c .
Now g cd ( 2 a − 1 , 2 a c ) = 1 , implying 2 a − 1 = 1 and a = 1 .
If a = 1 , b ! − b ≤ 1 ⇒ b l e 2 . So, ( a , b ) = ( 1 , 2 ) is the only solution at b ≤ 2 a .
So minimum value of b a is 2 1 .