olymmath

HMMT 2015 U6

  • Guts
  • Answer

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

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

8

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2015/u6 · Tag 8PBAPK083C · Edit this page on GitHub · Keys: j next, k previous