Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2024 USAMO Problems/Problem 3

Revision as of 21:32, 20 March 2024 by Anyu-tsuruko (talk | contribs) (Created page with "Let <math>m</math> be a positive integer. A triangulation of a polygon is <math>m</math>-balanced if its triangles can be colored with <math>m</math> colors in such a way that...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Let $m$ be a positive integer. A triangulation of a polygon is $m$-balanced if its triangles can be colored with $m$ colors in such a way that the sum of the areas of all triangles of the same color is the same for each of the $m$ colors. Find all positive integers $n$ for which there exists an $m$-balanced triangulation of a regular $n$-gon. Note: A triangulation of a convex polygon $\mathcal{P}$ with $n \geq 3$ sides is any partitioning of $\mathcal{P}$ into $n-2$ triangles by $n-3$ diagonals of $\mathcal{P}$ that do not intersect in the polygon's interior.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2024_USAMO_Problems/Problem_3&oldid=217222"