In the above diagram two triangles with areas s and t , where ( 0 < s < t ) , are inscribed in a circle.
Find the value of j > 0 such that min ( s t j s 2 + t 2 ) = j .
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.
Very nice use of AM-GM
AG-GM inequality at it's best, nice solution sir!
This problem has nothing to do with the geometry. The aim of the problem is to provide a diagram as a distraction.
Let 0 < s < t
s t j s 2 + t 2 = j t s + s t
Let u = t s ⟹ f ( u ) = j u − u − 1 ⟹ f ′ ( u ) = u 2 j u 2 − 1 = 0 ⟹ u = j 1 ⟹ f ( j 1 ) = 2 j = j ⟹ 4 j = j 2 ⟹ j ( j − 4 ) = 0
j > 0 ⟹ j = 4 and s = 2 t which is the only thing you know about the two triangles.
Note: f ′ ′ ( j 1 ) = 2 j 2 3 > 0 ⟹ relative min at u = j 1
Came here after seeing " Mind your decisions" you tube channel video.. :P
Let s = x t , where 0 < x < 1 , since 0 < s < t . Then we have:
f ( t ) d t d f ( t ) = s t j s 2 + t 2 = x t 2 j x 2 t 2 + t 2 = x j x 2 + 1 = x 2 2 j x 2 − j x 2 − 1 = x 2 j x 2 − 1
As d t d f ( t ) = 0 , when x = j 1 , and d x 2 d 2 f ( t ) > 0 for all x > 0 , ⟹ min ( f ( t ) ) = f ( j 1 ) = j 1 j × j 1 + 1 = 2 j = j , ⟹ j = 4 .
Problem Loading...
Note Loading...
Set Loading...
A.M.-G.M. inequality :
s t j s 2 + t 2 = t j s + s t ≥ 2 j . So j ≥ 2 j or j ( j − 4 ) ≥ 0 . Since j > 0 , therefore the minimum value of the given expression is 4 when j = 4 . This will be true for any positive j , s , t , and this problem is just one example justifying the title!