MathDB
Alpha set

Source:

August 29, 2010
geometry proposedgeometry

Problem Statement

For any angle α with 0<α<180∘0 < \alpha < 180^{\circ}, we call a closed convex planar set an α\alpha-set if it is bounded by two circular arcs (or an arc and a line segment) whose angle of intersection is α\alpha. Given a (closed) triangle TT , find the greatest α\alpha such that any two points in TT are contained in an α\alpha-set S⊂T.S \subset T .
Back to ProblemsView on AoPS