Inellipses of Convex Polygons, Brianchon’s Theorem, and Bradley’s Theorem

Three problems are discussed: the classification theorem for families of ellipses inscribed in convex polygons, Brianchon’s theorem, and Bradley’s theorem. Each is presented with an elementary synthetic proof.