olymmath

BALTIC-WAY 2009 Problem 14

    For which n≥2n\ge 2 is it possible to find nn pairwise non-similar triangles A1,A2,…,AnA_1, A_2,\ldots , A_n such that each of them can be divided into nn pairwise non-similar triangles, each of them similar to one of A1,A2,…,AnA_1,A_2 ,\ldots ,A_n ?

    Dataset text AI-MO AoPS. Quoted with source.

    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 baltic-way/2009/p14 · Tag 6EB1P89AT9 · Edit this page on GitHub · Keys: j next, k previous