Competition problem — Geometry — Maths Olympiad Prep

Library / /132 of 860

Geometry Difficulty 4.9 AIME Find the answer

Let $D$ be a regular ten-sided polygon with edges of length 1. A triangle $T$ is defined by choosing three vertices of $D$ and connecting them with edges. How many different (non-congruent) triangles $T$ can be formed?

Your answer

A number or a short expression. Spacing and $ signs are ignored.

Solution

The problem is equivalent to finding the number of ways to partition 10 into a sum of three (unordered) positive integers. These can be computed by hand to be $(1,1,8),(1,2,7),(1,3,6),(1,4,5),(2,2,6),(2,3,5),(2,4,4),(3,3,4)$

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.