Sum of inradii does not exceed M
Source: Kvant Magazine No. 1 2021 M2635
March 9, 2023
geometryinequalitiesinradiusKvant
Problem Statement
In the triangle , the lengths of the sides and are and respectively. Several segments are drawn from the vertex , which cut the triangle into several triangles. Find the smallest number for which, with each such cut, the sum of the radii of the circles inscribed in triangles does not exceed .Porposed by O. Titov