olymmath

HMMT 2012 S2

  • Team 2
  • Answer

You are given two line segments of length 2n2^{n} for each integer 0≤n≤100 \leq n \leq 10. How many distinct nondegenerate triangles can you form with three of the segments? Two triangles are considered distinct if they are not congruent.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

55

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/2012/s2 · Tag P0BTN5PZMY · Edit this page on GitHub · Keys: j next, k previous