ILL 1986 Problem 20
For any angle α with , we call a closed convex planar set an -set if it is bounded by two circular arcs (or an arc and a line segment) whose angle of intersection is . Given a (closed) triangle , find the greatest such that any two points in are contained in an -set
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.