In any △ A B C and n ≥ 0 , the following is true: sin n 2 A 1 + sin n 2 B 1 + sin n 2 C 1 ≥ x y n
What is x + y , where x and y are positive coprime integers?
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.
Me : going to suicide
This chinese man : c'mon, i can do it all the time
In any triangle △ A B C and n ≥ 0 , the following inequality is true: sin n 2 A 1 + sin n 2 B 1 + sin n 2 C 1 ≥ 3 × 2 n
⟹ x + y = 5 .
Proof:
Let △ A B C be any acute angled triangle , then:
f ( x ) = csc n 2 x for all x ∈ ( 0 , 2 π )
⟹ f ′ ( x ) = 2 − n csc n 2 x cot 2 x
⟹ f " ( x ) = 4 n 2 csc n 2 x cot 2 2 x + 4 n csc n + 2 2 x > 0
By applying Jensen's Inequality:
c y c ∑ 3 csc n 2 A ≥ csc n ( 6 π ) = 2 n
⟹ c y c ∑ csc n 2 A ≥ 3 × 2 n
If △ A B C was an obtuse triangle then:
b + c a = sin B + sin C sin A = sin ( 2 B − C ) sin A ≥ sin 2 A
⟹ csc 2 A ≥ a b + c
c y c ∑ csc n 2 A ≥ ∑ ( a b + c ) n ≥ 3 3 ∏ ( a b + c ) n ≥ 3 × 2 n
Since you told "in any triangle... ", we can consider a particular triangle, namely, an equilateral triangle. For such a triangle, it's easy to see that x = 3 , y = 2 .
Log in to reply
I meant since it is a general inequality, it has to be applicable to any triangle.
@Alak Bhattacharya , please can you add your solution again to the geometry (Stacking squares in a triangle) problem. I have deleted the old one because there was error in the answer. Thank you.
Problem Loading...
Note Loading...
Set Loading...
By AM-GM inequality , we have:
sin n 2 A 1 + sin n 2 B 1 + sin n 2 C 1 ≥ 3 sin n 2 A sin n 2 B sin n 2 C 3 ≥ 3 ⋅ 2 n Equality occurs when A = B = C = 3 π
Therefore x + y = 3 + 2 = 5 .