max no of obtuse triangles by 16 segments (III Soros Olympiad 1996-97 R1 11.6)
Source:
May 29, 2024
geometrycombinatoricscombinatorial geometry
Problem Statement
What is the largest number of obtuse triangles that can be composed of different segments (each triangle is composed of three segments), if the largest of these segments does not exceed twice the smallest?