If have two distinct roots lying in the interval (0,1) and , then find least 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.
Conditions on problem translate with the following inequalities
GM ( a , c ) < 2 b < AM ( c , a )
with c < a
Set S = { 2 n ∣ ∣ ∣ n ∈ N } ⊂ Q .
Anytime there is an element of S between GM and AM we have a parabola fitting the criteria.
Since f ( x ) = x is obviously monotone increasing, and by the simple fact that for positive reals x , y , z , t we have x ≤ y , z ≤ t ⇒ x z ≤ y t , our problem to minimize a b c is then split in two easier problem.
FIRST: Find a and c so that their product a c is the minimum value such that
S a , c : = S ∩ ( GM ( a , c ) , AM ( c , a ) ) = ∅
SECOND: Once such minimum a c is found simply set b = 2 ⋅ min S a , c .
To solve the first problem we can start thinking that way. We have to minimize a c so we keep a c as low as possible in a way that a + c is as large as possible. This happens when c and a have max distance.
So examine initially the case when c = 1 , and the least a we find so that S a , 1 = ∅ is a = 5 . In this case we have
GM ( 1 , 5 ) = 5 ≈ 2 . 2 3 6 AM ( 1 , 5 ) = 3 S 5 , 1 = { 2 5 }
and a c = 5 .
In the cases where c > 1 , since it must always be c < a , the lowest choice possible is c = 2 , a = 3 that gives a product a c = 6 that is greater than 5 we obtained previously. This proves that we found the minimum value for a c .
By the second problem, since the minimum of S 5 , 1 is 2 . 5 , we take b = 5 and the product a b c = 5 ⋅ 5 ⋅ 1 = 2 5 .
And the answer is 4 .