Computational Geometry AwesomeMath Summer Program 2025
Computational Geometry
Last update: July 2, 2025
1 Geometric Inequalities
1.1 Lecture Problems
We will only need 2 algebraic inequalities. The first one is the arithmetic mean-geometric mean (AM-GM)
inequality. It states if x1 , x2 any real numbers, then x21 + x22 ≥ 2x1 x2 and equality holds if and only if
h
x1 = x2 . This follows from (x21 − x22 ) ≥ 0. Most generally, it states: If x1 , . . . , xn ≥ 0 then
x1 + · · · + xn
≥ (x1 . . . xn )1/n ,
n
at
with equality holding if and only of x1 = · · · = xn .
The next is Cauchy-Schwartz. It states if x1 , . . . , xn ≥ 0, y1 . . . , yn ≥ 0, then
(x21 + · · · + x2n )(y12 + · · · + yn2 ) ≥ (x1 y1 + · · · + xn yn )2 .
eM
We typically take n = 2 or n = 2 in either case. Geometric inequalities often reduce to algebraic ones after
an application of the duality principle.
(Duality Principle) Prove if a, b, c are the sides of a triangle ABC, then we can write a = y + z, b = z + x,
and c = x + y, for some positive reals x, y, z. As we will see tomorrow, duality principle is key step in
converting geometric inequalities into algebraic inequalities.
om
es
Aw
1
Computational Geometry AwesomeMath Summer Program 2025
1.2 Problems
Problem 1: Let x, y, z, w be angles such that 180◦ > x + y = z + w > 0, and
sin x sin z
= .
sin y sin w
Prove x = z and y = w
Problem 2: Prove that in any triangle ABC the following holds
3 A B C 1
1. cos A + cos B + cos C ≤ ; 2. sin sin sin ≤ .
2 2 2 2 8
Problem 3: (IMO 1983) Prove that for any triangle ABC with sides a, b and c the following inequality holds
h
a2 b(a − b) + b2 c(b − c) + c2 a(c − a) ≥ 0.
at
Problem 4: (Hadwiger-Finsler Inequality) If a, b, and c are sides of a triangle ABC, prove that
√
a2 + b2 + c2 ≥ 4 3[ABC] + (b − c)2 + (c − a)2 + (a − b)2 .
Remark: This is a generalization of an IMO 1961 problem:
√
a2 + b2 + c2 ≥ 4 3[ABC].
√
1. 4R + r ≥ s 3; 2. s ≤
Problem 6: Prove that
2
√
3R 3
eM
Problem 5: Prove in any triangle ABC, we have
1
(s − a)2
+
1
(s − b)2
+
1
(s − c)2 r
1
≥ 2.
om
Problem 7: Positive reals x, y, z satisfy xyz(x + y + z) = 1. Find the smallest value of (x + y)(x + z).
Problem 8: Prove that mc < 12 (a + b).
Problem 9: Let ABCD be a convex quadrilateral such that ∠BAD = 30◦ . Prove that
BC + CD + DB ≥ AC.
es
Problem 10: Let ABC be an acute triangle. Prove that ha > s − a + r, where ha is the length of A-altitude in
triangle ABC.
Problem 11: Prove that any convex polygon with perimeter 2a can be covered by a disc with diameter a.
Aw
Problem 12: Let ABC be triangle with medians ma , mb , mc and circumradius R. Prove that
b2 + c 2 c2 + a2 a2 + b2
+ + ≤ 12R.
ma mb mc
Problem 13: Areas of triangles ABC, A1 B1 C1 , A2 B2 C2 are √
equal to S, S1 , S2 , respectively, and AB = A1 B1 +A2 B2 ,
AC = A1 C1 + A2 C2 , BC = B1 C1 + B2 C2 . Prove that S ≤ 4 S1 S2 .
Problem 14: The lengths of two heights of a triangle are equal to 12 and 20. Prove that the third height is shorter
than 30.
Problem 15: Let ABC be a triangle and M be an interior point of side AC. Assume ∠BM C ≥ 90◦ . Prove that
BM + M C < BA + BC.
Problem 16: (IMO Shortlist 1999) Let ABC be a triangle and M be an interior point. Prove that
min{M A, M B, M C} + M A + M B + M C < AB + AC + BC.
2
Computational Geometry AwesomeMath Summer Program 2025
Problem 17: (Adapted from IMO 1993)
• For three points A, B, C in the plane, we define M (ABC) to be the length of the longest side of triangle ABC
(possibly degenerate). Given a point P either inside or on a side of triangle ABC, prove that M (ABP ) ≤
M (ABC).
• For three points A, B, C in the plane, we define m(ABC) to be the smallest length of the three heights of the
triangle ABC, where in the case A, B, C are collinear, we set m(ABC) = 0. Given a point P on segment AB
of any triangle ABC, prove that m(P AC) ≤ m(ABC).
• Let A, B, C be given points in the plane. Prove that for any point X in the plane,
m(ABC) ≤ m(ABX) + m(AXC) + m(XBC).
h
at
eM
om
es
Aw