Let X be a bounded, nonempty set of points in the Cartesian plane. Let f(X) be the set of all points that are at a distance of at most 1 from some point in X. Let fn(X)=f(f(⋯(f(X))⋯)) (n times). Show that fn(X) becomes “more circular” as n gets larger.
In other words, if rn=sup{radii of circles contained in fn(X)} and Rn=inf{radii of circles containing fn(X)}, then show that Rn/rn gets arbitrarily close to 1 as n becomes arbitrarily large.I'm not sure that I'm posting this in a right forum. If it's in a wrong forum, please mods move it. functiongeometrycoordinate geometryIterationIMO ShortlistIMO Longlist