Find all values of $k$ by which it is possible to divide any triangular region in $k$ quadrilaterals of equal area.

* Given $\vartriangle ABC$, divide it into the minimal number of parts so that after being flipped over these parts can constitute the same $\vartriangle ABC$.

Show that a polynomial of odd degree $2m+1$ over $\mathbb{Z}$, \[f(x)=c_{2m+1}x^{2m+1}+\cdots+c_{1}x+c_{0},\] is irreducible if there exists a prime $p$ such that \[p \not\vert c_{2m+1}, p \vert c_{m+1}, c_{m+2}, \cdots, c_{2m}, p^{2}\vert c_{0}, c_{1}, \cdots, c_{m}, \; \text{and}\; p^{3}\not\vert c_{0}.\]

Annie drew a rectangle and partitioned it into $n$ rows and $k$ columns with horizontal and vertical lines. Annie knows the area of the resulting $n \cdot k$ little rectangles while Benny does not. Annie reveals the area of some of these small rectangles to Benny. Given $n$ and $k$ at least how many of the small rectangle’s areas did Annie have to reveal, if from the given information Benny can determine the areas of all the $n \cdot k$ little rectangles? For example in the case $n = 3$ and $k = 4$ revealing the areas of the $10$ small rectangles if enough information to find the areas of the remaining two little rectangles. [img]https://cdn.artofproblemsolving.com/attachments/b/1/c4b6e0ab6ba50068ced09d2a6fe51e24dd096a.png[/img]

$101$ blue and $101$ red points are selected on the plane, and no three lie on one straight line. The sum of the pairwise distances between the red points is $1$ (that is, the sum of the lengths of the segments with ends at red points), the sum of the pairwise distances between the blue ones is also $1$, and the sum of the lengths of the segments with the ends of different colors is $400$. Prove that you can draw a straight line separating everything red dots from all blue ones.

Find all possible numbers of lines in a plane which intersect in exactly $37$ points.

Let $M$ be the set of all points $(x,y)$ in the cartesian plane, with integer coordinates satisfying $1 \le x \le 12$ and $1 \le y \le 13$. (a) Prove that every $49$-element subset of $M$ contains four vertices of a rectangle with sides parallel to the coordinate axes. (b) Give an example of a $48$-element subset of $M$ without this property.

Two right isosceles triangles of legs equal to $1$ are glued together to form either an isosceles triangle - called [i]t-shape[/i] - of leg $\sqrt2$, or a parallelogram - called [i]p-shape[/i] - of sides $1$ and $\sqrt2$. Find all integers $m$ and $n, m, n \ge 2$, such that a rectangle $m \times n$ can be tilled with t-shapes and p-shapes.

Prove that the following statement holds for all odd integers $n \ge 3$: If a quadrilateral $ABCD$ can be partitioned by lines into $n$ cyclic quadrilaterals, then $ABCD$ is itself cyclic.

In a regular polygon with $134$ sides, $67$ diagonals are drawn so that exactly one diagonal emerges from each vertex. We call the [i]length[/i] of a diagonal the number of sides of the polygon included between the vertices of the diagonal and which is less than or equal to $67$. If we order the [i]lengths [/i] of the diagonals in ascending order, we obtain a succession of $67$ numbers $(d_1,d_2,...,d_{67})$. It will be possible to draw diagonals such that a) $(d_1,d_2,...,d_{67})=\underbrace{2 ... 2}_{6},\underbrace{3 ... 3}_{61}$ ? b) $(d_1,d_2,...,d_{67}) =\underbrace{3 ... 3}_{8},\underbrace{6 ... 6}_{55}.\underbrace{8 ... 8}_{4} $ ?

At a given plane with $2,000$ lines, all those with an odd number of different points of intersection with intersecting lines. a) Can there be an odd number of red lines if in the plane given there are no parallel lines? b) Can there be an odd number of red lines if none of any 3 given lines intersect at one point?

Given a regular $72$-gon. Lenya and Kostya play the game "Make an equilateral triangle." They take turns marking with a pencil on one still unmarked angle of the $72$-gon: Lenya uses red. Kostya uses blue. Lenya starts the game, and the one who marks first wins if its color is three vertices that are the vertices of some equilateral triangle, if all the vertices are marked and no such a triangle exists, the game ends in a draw. Prove that Kostya can play like this so as not to lose.

Different points $A_1, A_2,..., A_n$ in the plane ($n> 3$) are such that the triangle $A_iA_jA_k$ is obtuse for all the different $i,j,k \in\{1,2,...,n\}$. Prove that there is a point $A_{n + 1}$ in the plane, such that the triangle $A_iA_jA_{n + 1}$ is obtuse for all different $i,j \in\{1,2,...,n\}$

Anton has an isosceles right triangle, which he wants to cut into $9$ triangular parts in the way shown in the picture. What is the largest number of the resulting $9$ parts that can be equilateral triangles? A more formal description of partitioning. Let triangle $ABC$ be given. We choose two points on its sides so that they go in the order $AC_1C_2BA_1A_2CB_1B_2$, and no two coincide. In addition, the segments $C_1A_2$, $A_1B_2$ and $B_1C_2$ must intersect at one point. Then the partition is given by segments $C_1A_2$, $A_1B_2$, $B_1C_2$, $A_1C_2$, $B_1A_2$ and $C_1B_2$. [img]https://cdn.artofproblemsolving.com/attachments/0/5/5dd914b987983216342e23460954d46755d351.png[/img]

Does there exist a convex $N$-gon such that all its sides are equal and all vertices belong to the parabola $y = x^2$ for a) $N = 2011$ b) $N = 2012$ ?

On the plane are $n$ paper disks of radius $1$ whose boundaries all pass through a certain point, which lies inside the region covered by the disks. Find the perimeter of this region. (P Kozhevnikov)

Consider six points in the interior of a square of side length $3$. Prove that among the six points, there are two whose distance is less than $2$.

Consider $4n$ points in the plane, with no three points collinear. Using these points as vertices, we form $\binom{4n}{3}$ triangles. Show that there exists a point $X$ of the plane that belongs to the interior of at least $2n^3$ of these triangles.

In the plane, construct as many lines in general position as possible, with any two of them intersecting in a point with integer coordinates.

A point in the plane is called a node if both its coordinates are integers. Consider a triangle with vertices at nodes containing exactly two nodes inside. Prove that the straight line connecting these nodes either passes through a vertex or is parallel to a side of the triangle.

In a plane a set of $n\geq 3$ points is given. Each pair of points is connected by a segment. Let $d$ be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length $d$. Prove that the number of diameters of the given set is at most $n$.

Consider on the coordinate plane all rectangles whose (i) vertices have integer coordinates; (ii) edges are parallel to coordinate axes; (iii) area is $2^k$, where $k = 0,1,2....$ Is it possible to color all points with integer coordinates in two colors so that no such rectangle has all its vertices of the same color?

A convex polygon is divided into some triangles. Let $V$ and $E$ be respectively the set of vertices and the set of egdes of all triangles (each vertex in $V$ may be some vertex of the polygon or some point inside the polygon). The polygon is said to be [i]good [/i] if the following conditions hold: i. There are no $3$ vertices in $V$ which are collinear. ii. Each vertex in $V$ belongs to an even number of edges in $E$. Find all good polygon.

What greatest number of triples of points can be selected from $1955$ given points, so that each two triples have one common point?

Using cardboard equilateral triangles of side length $1$, an equilateral triangle of side length $2^{2004}$ is formed. An equilateral triangle of side $1$ whose center coincides with the center of the large triangle is removed. Determine if it is possible to completely cover the remaining surface, without overlaps or holes, using only pieces in the shape of an isosceles trapezoid, each of which is created by joining three equilateral triangles of side $1$.