Maths Olympiad Prep

Library / /13 of 69

Geometry Difficulty 5.5 AIME, harder Prove it Mongolia

Find the number of obtuse triangles with integer sides and perimeter equals to 5050.

Solution

Let aa, bb, cc be sides of the triangle. Then a+b+c=50a + b + c = 50. Without losing generality we may assume that abca \ge b \ge c.

Now 50=a+b+c3a50 = a + b + c \le 3a and consequently we get a17a \ge 17. On the other hand 50=a+b+c>2a50 = a + b + c > 2a by triangle inequality and we came to conclusion a<25a < 25.

It is well known fact that a triangle with sides abca \ge b \ge c is obtuse iff a2>b2+c2a^2 > b^2 + c^2. Therefore for any pair (b,c)(b, c) satisfying the above condition bc2b - c \ge 2 implies the pair (b1,c+1)(b - 1, c + 1) also satisfies. Note that from 2bb+c=50a2b \ge b + c = 50 - a follows ab50a2a \ge b \ge \frac{50 - a}{2}.

Now for a=17,18,,24a = 17, 18, \ldots, 24 form pairs (b,c)(b, c) such that ab50a2a \ge b \ge \frac{50 - a}{2} and we shall count obtuse triangles with sides abca \ge b \ge c.

When a=24a = 24 there are (b,c)=(24,2),(23,3),,(13,13)(b, c) = (24, 2), (23, 3), \ldots, (13, 13) pairs. We get from here 11 pairs: (23,3),(22,4),,(13,13)(23, 3), (22, 4), \ldots, (13, 13).

When a=23a = 23 there are (b,c)=(23,4),(22,5),,(14,13)(b, c) = (23, 4), (22, 5), \ldots, (14, 13) pairs. We get from here 9 pairs: (22,5),(21,6),,(14,13)(22, 5), (21, 6), \ldots, (14, 13).

When a=22a = 22 there are (b,c)=(22,6),(21,7),,(14,14)(b, c) = (22, 6), (21, 7), \ldots, (14, 14) pairs. We get from here 7 pairs: (20,8),(19,9),,(14,14)(20, 8), (19, 9), \ldots, (14, 14).

When a=21a = 21 there are (b,c)=(21,8),(20,9),,(15,14)(b, c) = (21, 8), (20, 9), \ldots, (15, 14) pairs. We get from here 3 pairs: (17,12),(16,13),(15,14)(17, 12), (16, 13), (15, 14).

When a=20a = 20 there are (b,c)=(20,10),(19,11),,(15,15)(b, c) = (20, 10), (19, 11), \ldots, (15, 15) pairs. There are no pairs which satisfy the condition.

When a=19a = 19 there are (b,c)=(19,12),(18,13),,(16,15)(b, c) = (19, 12), (18, 13), \ldots, (16, 15) pairs. There are no pairs which satisfy the condition.

When a=18a = 18 there are (b,c)=(18,14),(17,15),(15,16)(b, c) = (18, 14), (17, 15), (15, 16) pairs. There are no pairs which satisfy the condition.

When a=17a = 17 there is only one pair: (b,c)=(17,16)(b, c) = (17, 16). But in this case we get an acute triangle.

Thus total number of triangles which satisfy the given condition is 3030.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.