Library / /39 of 151

, 2017

Combinatorics Difficulty 6.0 National Olympiad Find the answer Hungary

For which $n$ can we partition a regular $n$ -gon into finitely many triangles such that no two triangles share a side?

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.