Maths Olympiad Prep

Library / /60 of 101

Combinatorics Difficulty 6.3 National olympiad Prove it Estonia

On a plane, 5 points are chosen arbitrarily. Find the largest possible number of distinct right triangles with all vertices in the chosen points.

Solutions — 2

Solution 1

A square ABCDABCD and its centre EE determine 8 distinct right triangles: ABCABC, BCDBCD, CDACDA, DABDAB, AEBAEB, BECBEC, CEDCED, DEADEA.

Figure 1
Fig. 48

We show that more than 8 right triangles is impossible. Firstly, note that among any 5 points, one can choose 4 points that are vertices of a rectangle in at most one way. Indeed, suppose that this can be done in two different ways. Then these two quadruples of points have 3 points in common. But 3 vertices of a rectangle (even parallelogram) uniquely determine the last vertex.

Secondly, note that a quadrangle whose every three vertices form a right triangle is a rectangle. Indeed, these four triangles must have right angle at distinct vertices, otherwise three points would lie on a line. Now if AA, BB, CC are the vertices of a right triangle with right angle at BB then the remaining vertex DD must be located in such a way that some triangle could have right triangle at AA and some triangle could have right angle at CC. Hence DD must lie on a line passing through AA and perpendicular to either ABAB or ACAC, and also on a line passing through CC and perpendicular to either ACAC or BCBC (in Fig. 49, these lines are drawn using dashes of distinct colours).

Figure 2
Fig. 49

As lines perpendicular to ACAC do not meet, DD must lie on the line passing through AA perpendicular to ABAB or on the line passing through CC perpendicular to BCBC. If DD lies on both these lines, ABCDABCD is a rectangle. Hence consider the case with DD lying on exactly one of these lines. W.l.o.g., let DD lie on the line passing through AA perpendicular to ABAB and on the line passing through CC perpendicular to ACAC. But then BCDBCD is not a right triangle. Hence the only possibility for DD is such that ABCDABCD is a rectangle.

Let now 5 points be chosen on a plane. Let us count right triangles with vertices in the chosen points by quadrangles, among the vertices of which the vertices of the triangle are. As there are 5 possibilities to extract 4 points out of the given 5 points and, by the above, at most one of the obtained quadruples enable 4 right triangles and the others consequently enable at most 3 right triangles, we can have at most 4+43=164 + 4 \cdot 3 = 16 right triangles. But each of these right triangles is counted twice as the fourth vertex can be either of the two remaining points. Hence there are at most 8 distinct right triangles.

Solution 2

As in Solution 1, we show that it is possible to find 8 right triangles.

Now we prove that more than 8 right triangles is impossible. Suppose the opposite, i.e., there can be 9 right triangles. As there are C53=10C_5^3 = 10 triples of chosen points in total, at most one triple does not determine a right triangle. Let AA and BB be chosen points at maximal distance from each other (if there are several pairs of points with this property, take any of them). By choice, ABAB can only be the hypotenuse of a right triangle. Hence at least two of the remaining three chosen points must lie on the circle with diameter ABAB; let these points be CC and DD. At least one of ACDACD and BCDBCD must be a right triangle. As all vertices of this triangle lie on the circle with diameter ABAB, two vertices of this triangle must be the endpoints of another diameter of this circle. These points can only be CC and DD. Therefore also CDCD is a line segment of maximal length and can only be the hypotenuse of a right triangle.

If the last chosen point EE also lies on the circle with diameter ABAB then ACEACE and BCEBCE are not right triangles because no pair of vertices can be the endpoints of a diameter of this circle. But if EE does not lie on this circle then AEBAEB and CEDCED are not right angles, implying that ABEABE and CDECDE cannot be right triangles. The contradiction shows that there cannot be 9 right triangles.

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 and solution reproduced as published; topic and difficulty added by this site.