Problem: Find the maximum possible value of the inradius of a triangle with vertices in the interior or on the boundary of a unit square.
Solution
Solution: It is easy to see that if a triangle contains another triangle, then its inradius is greater than the inradius of the second one. So we may consider triangles with vertices on the boundary of the square. Moreover, we may assume that at least one vertex of the triangle is a vertex of the square and the other two vertices belong to the sides of the square containing not the first vertex. So we shall consider △OAB such that O=(0,0), A=(a,1) and B=(1,b), 0≤a,b≤1.
Consider also △OCD, where C=(a+b,1) and D=(1,0). Denote by S and P the area and perimeter of △OAB, respectively. Set x=OA=1+a2, y=AB=(1−a)2+(1−b)2, z=OB=1+b2, u=OC=1+(a+b)2 and v=CD=1+(1−a−b)2. Note that OD=1, u≥z≥1, x≥1 and v≥1.
Comparing the perimeters of △OAB and △OCD gives (u+v+1)−(x+y+z)=u+xu2−x2+v+yv2−y2+1+z1−z2=u+x2ab+b2+v+y2ab−1+zb2≤1+z2ab+b2+v+y2ab−1+zb2=2ab(v+y1+1+z1)≤3ab≤(u+v+1)ab Hence (u+v+1)(1−ab)≤x+y+z⟺u+v+11≥x+y+z1−ab=P2S=r On the other hand, u+v+1=1+(a+b)2+1+(1−a−b)2+1≥x≥1minF(x) where F(x)=1+x2+1+(1−x)2+1. Since minx≥1F(x)=5+1, we get that r≤5+11=45−1.
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.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.