cartesian triangles
Source: French MO 2000 Problem
April 9, 2021
geometryTriangle
Problem Statement
In this problem we consider so-called cartesian triangles, that is, triangles with integer sides and . Unless noted otherwise, is assumed to be cartesian.(a) If are the projections of the orthocenter to , respectively, specify which of the segments , , , , , , , , , , , , , , have rational length.
(b) If is the incenter, the excenter across , and the intersection points of the two bisectors at with the line , specify those of the segments , , , , , , , having rational length.
(c) Assume that and are prime. Prove that exactly one of the numbers and is a multiple of .
(d) Assume that , where and are coprime, and denote by the of and . Compute in terms of .
(e) Prove that if is not a multiple of , then .
(f) Deduce a necessary and sufficient condition for a triangle to be cartesian with coprime integer sides, and by geometrical observations derive an analogous characterization of triangles with coprime sides , , and .