TST Tajikistan 2018 Day 1 Problem 2
Source:
July 10, 2018
TajikistanIMO TST 2018
Problem Statement
Problem 2. Prove that for every n≥3, there exists a convex polygon with n sides, such that one can divide it into n-2 triangles that are all similar, but pairwise non-congruent.[color=#00f]Moved to HSO. ~ oVlad