Problem 633

Erdős Problem #633: declared status 'solved'. Formalized: yes. Classify those triangles which can only be cut into a square number of congruent triangles. Current best: It is easy to see (see for example [So09]) that any triangle can be cut into $n^2$ congruent triangles (for any $n\geq 1$). Prize: $25. Tags: geometry.