The sides of a triangle have lengths 1 1 , 1 5 , k where k is an integer. For how many value(s) of k is the triangle obtuse?
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.
We know that c 2 = a 2 + b 2 − 2 a b × cos θ ,but cos θ would be negative for obtuse angles θ hence, c 2 > a 2 + b 2 for obtuse angled triangles.
I forgot the second case ;(
This seems like a nice and simple solution, although I'm having difficulty understanding how you figured out both the upper and lower bounds in both cases because your method seems to give only a single bound in each case (lower bound in first case and upper bound in second case). You also didn't analyze the case of angle A being obtuse, if I understand your solution correctly. Anyway, I didn't know that we can extend the Pythagorean Theorem for obtuse triangles like that.
I did it in quite a complicated way using the law of cosines and then solving a few quadratic inequalities and comparing bounds. Also used the fact that a linear polynomial is little-o of a quadratic polynomial.
Here's my approach (if anyone cares):
Denote the triangle as Δ ABC where the sides A B , B C , C A are (w.l.o.g) k , 1 1 , 1 5 respectively. By the Law of Cosines, we have,
cos ( A ) = 3 0 k 1 0 4 + k 2 , cos ( B ) = 2 2 k k 2 − 1 0 4 , cos ( C ) = 3 3 0 3 4 6 − k 2
We use the fact that the cosine of any obtuse angle ∈ ( − 1 , 0 ) and check the three cases respectively.
If A is obtuse, you get 0 < ( k + 2 6 ) ( k + 4 ) < 3 0 k . Even at k = 0 (which cannot be a valid k ). the MHS is greater than RHS and using the "little-o" fact, we can easily conclude that there are no positive real solutions for k when A is obtuse. (this covers positive integral solutions too).
If B is obtuse, you get 0 < ( k + 2 6 ) ( k − 4 ) < 2 2 k . Considering the LHS-MHS part, you get the solution set for k as ( − ∞ , − 2 6 ) ∪ ( 4 , ∞ ) . Now, taking into account the RHS (upper bound) and noting that the upper bound doesn't hold for k = 1 1 (but holds for k = 1 0 ), we can again use the "little-o" argument to get the solution set of k as ( 4 , 1 1 ) .
If C is obtuse, you get 0 < 6 7 6 − k 2 < 3 3 0 . The LHS-MHS part gives us k < 2 6 and the MHS-RHS part gives us k > 1 8 . Combining the two, we have k ∈ ( 1 8 , 2 6 ) .
Now, we simply collect the solution sets from the possible cases which is the following set (interval union): ( 4 , 1 1 ) ∪ ( 1 8 , 2 6 ) . We can easily count the number of positive integral solutions for k to be 1 3 , and we're done.
Log in to reply
Woah! You can post it as a separate solution which will contribute to different approaches to solve this problem.
Log in to reply
Would it work if I post it as a comment here?
Log in to reply
@Prasun Biswas – Yeah , its okay to post a comment. But I recommend you to post it as a separate solution. (Your choice).
Log in to reply
@Nihar Mahajan – Nah, I'll post it as a comment then. This solution already has 5 upvotes and is simpler than my approach, so it's best to comment. :D
Log in to reply
@Prasun Biswas – No problem. If you post a solution/comment , I am sure to upvote it :D (if its correct)
Log in to reply
@Nihar Mahajan – Done! Check my first comment. I edited it to include my approach. :)
I have edited the solution according to your convinience
Log in to reply
Thanks for the clarification. I realize now that it was quite obvious. I need to revise elementary classical geometry again. :\ Nonetheless, thanks for the simple solution. Upvoted! :)
Obtuse angle mean 90 <@<180 Considering c^2=a^2+b^2-2ab cos@ For @=180 eq will bcom c^2=(a+b)^2 C=a+b so we got the upper limit
C o r r e c t !
Best question best solution
There are 2 possible ranges for k :
1 1 2 + 1 5 2 < k < 1 1 2 + 1 5 2 − 2 ( 1 1 ) ( 1 5 ) c o s ( 1 8 0 )
Or
4 < k < 1 0 4
4 came from 1 5 2 = 1 1 2 + k 2 − 2 ( 1 1 k ) c o s ( 1 8 0 )
And
1 0 4 = 1 5 2 − 1 1 2
Can you check your working?
By using pythogorus property and properties of triangle (sum of two sides is greater than third side)We will solve this as k has 13 solutions
Problem Loading...
Note Loading...
Set Loading...
A really nice question, Nihar Mahajan
The Pythagoras Theorem states that
a 2 + b 2 = c 2 for a r i g h t − a n g l e d triangle
Just twist it a little bit and you get
a 2 + b 2 < c 2 for an o b t u s e − a n g l e d triange
Now, here we have two cases :
CASE 1
1 1 2 + 1 5 2 < c 2
So we would need all c starting from 1 9 ( 1 9 2 = 3 6 1 > 1 1 2 + 1 5 2 ) to 2 5 ( 1 1 + 1 5 = 2 6 which must be greater than the third side, c ) , i.e, 7 numbers.
CASE 2
1 1 2 + b 2 < 1 5 2
Now we would need all b starting from 5 ( 1 1 + 5 = 1 6 which must be greater than the third side, 1 5 ) to 1 0 ( 1 1 2 + 1 0 2 > 1 5 2 ) , i.e, 6 numbers.
Hence, the number of solutions for k is 1 3 .
Upvote it if you liked it.