A polygon is decomposed into triangles by drawing some non-intersecting interior diagonals in such a way that for every pair of triangles of the triangulation sharing a common side, the sum of the angles opposite to this common side is greater than $180^o$. a) Prove that this polygon is convex. b) Prove that the circumcircle of every triangle used in the decomposition contains the entire polygon. [i]Proposed by Morteza Saghafian - Iran[/i]

Can one divide a square into finitely many triangles such that no two triangles share a side? (The triangles have pairwise disjoint interiors and their union is the square.)

Let $\mathcal{P}$ be a convex polygon and $\textbf{T}$ be a triangle with vertices among the vertices of $\mathcal{P}$. By removing $\textbf{T}$ from $\mathcal{P}$, we end up with $0, 1, 2,$ or $3$ smaller polygons (possibly with shared vertices) which we call the effect of $\textbf{T}$. A triangulation of $P$ is a way of dissecting it into some triangles using some non-intersecting diagonals. We call a triangulation of $\mathcal{P}$ $\underline{\text{beautiful}}$, if for each of its triangles, the effect of this triangle contains exactly one polygon with an odd number of vertices. Prove that a triangulation of $\mathcal{P}$ is beautiful if and only if we can remove some of its diagonals and end up with all regions as quadrilaterals.

$n$ positive numbers are given. Is it always possible to find a convex polygon with $n+3$ edges and a triangulation of it so that the length of the diameters used in the triangulation are the given $n$ numbers? [i]Proposed by Morteza Saghafian[/i]

A convex $n$-gon $A_0A_1\dots A_{n-1}$ has been partitioned into $n-2$ triangles by certain diagonals not intersecting inside the $n$-gon. Prove that these triangles can be labeled $\triangle_1,\triangle_2,\dots,\triangle_{n-2}$ in such a way that $A_i$ is a vertex of $\triangle_i$, for $i=1,2,\dots,n-2$. Find the number of all such labellings.

A splitting of a planar polygon is a finite set of triangles whose interiors are pairwise disjoint, and whose union is the polygon in question. Given an integer $n \ge 3$, determine the largest integer $m$ such that no planar $n$-gon splits into less than $m$ triangles.

A [i]triangulation[/i] of a convex polygon $\Pi$ is a partitioning of $\Pi$ into triangles by diagonals having no common points other than the vertices of the polygon. We say that a triangulation is a [i]Thaiangulation[/i] if all triangles in it have the same area. Prove that any two different Thaiangulations of a convex polygon $\Pi$ differ by exactly two triangles. (In other words, prove that it is possible to replace one pair of triangles in the first Thaiangulation with a different pair of triangles so as to obtain the second Thaiangulation.) [i]Proposed by Bulgaria[/i]

$n$ positive numbers are given. Is it always possible to find a convex polygon with $n+3$ edges and a triangulation of it so that the length of the diameters used in the triangulation are the given $n$ numbers? [i]Proposed by Morteza Saghafian[/i]

Prove that every convex polygon has at most one triangulation consisting entirely of acute triangles.

Consider a set $S$ of $200$ points on the plane such that $100$ points are the vertices of a convex polygon $A$ and the other $100$ points are in the interior of the polygon. Moreover, no three of the given points are collinear. A triangulation is a way to partition the interior of the polygon $A$ into triangles by drawing the edges between some two points of S such that any two edges do not intersect in the interior, and each point in $S$ is the vertex of at least one triangle. 1. Prove that the number of edges does not depend on the triangulation. 2. Show that for any triangulation, one can color each triangle by one of three given colors such that any two adjacent triangles have different colors.

The square $ABCD$ has to be decomposed into $n$ triangles (which are not overlapping) and which have all angles acute. Find the smallest integer $n$ for which there exist a solution of that problem and for such $n$ construct at least one decomposition. Answer whether it is possible to ask moreover that (at least) one of these triangles has the perimeter less than an arbitrarily given positive number.

The square $ABCD$ has to be decomposed into $n$ triangles (which are not overlapping) and which have all angles acute. Find the smallest integer $n$ for which there exist a solution of that problem and for such $n$ construct at least one decomposition. Answer whether it is possible to ask moreover that (at least) one of these triangles has the perimeter less than an arbitrarily given positive number.