Let be a triangle with incenter and circumcenter . Let the circumradius be . What is the least upper bound of all possible values of ?
Solution
always lies inside the convex hull of , which in turn always lies in the circumcircle of , so . On the other hand, if we first draw the circle of radius about and then pick , and very close together on it, we can force the convex hull of to lie outside the circle of radius about for any . Thus the answer is .
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.