it is given a polyhedral constructed from two regular pyramids with bases heptagons (a polygon with $7$ vertices) with common base $A_1A_2A_3A_4A_5A_6A_7$ and vertices respectively the points $B$ and $C$. The edges $BA_i , CA_i$ $(i = 1,...,7$), diagonals of the common base are painted in blue or red. Prove that there exists three vertices of the polyhedral given which forms a triangle with all sizes in the same color.

Find all the positive integers $n , n\ge 3$ such that $n\mid (n-2)!$

Find the least positive integer such that the product of its digits is $8! = 8 \cdot 7 \cdot6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1$.

A right-triangular wooden block of mass $M$ is at rest on a table, as shown in figure. Two smaller wooden cubes, both with mass $m$, initially rest on the two sides of the larger block. As all contact surfaces are frictionless, the smaller cubes start sliding down the larger block while the block remains at rest. What is the normal force from the system to the table? $\textbf{(A) } 2mg\\ \textbf{(B) } 2mg + Mg\\ \textbf{(C) } mg + Mg\\ \textbf{(D) } Mg + mg( \sin \alpha + \sin \beta)\\ \textbf{(E) } Mg + mg( \cos \alpha + \cos \beta)$

A circle has center $ (-10,-4) $ and radius $13$. Another circle has center $(3,9) $ and radius $\sqrt{65}$. The line passing through the two points of intersection of the two circles has equation $x+y=c$. What is $c$? $\textbf{(A)} \text{ 3} \qquad \textbf{(B)} \text{ } 3 \sqrt{3} \qquad \textbf{(C)} \text{ } 4\sqrt{2} \qquad \textbf{(D)} \text{ 6} \qquad \textbf{(E)} \text{ }\frac{13}{2}$

Let $ \lambda $ be the Lebesgue measure in the plane, let $ u,v\in\mathbb{R}^2, $ let $ A\subset\mathbb{R}^2 $ such that $ \lambda (A)>0 $ and let be the function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ defined as $$ f(t)=\int_A \chi_{A+tu}\cdot\chi_{A+tv}\cdot d\lambda $$ [b]a)[/b] Show that $ f $ is continuous. [b]b)[/b] Prove that any Lebesgue measurable subset of the plane that has nonzero Lebesgue measure contains the vertices of an equilateral triangle.

A school has $n$ students and $k$ classes. Every two students in the same class are friends. For each two different classes, there are two people from these classes that are not friends. Prove that we can divide students into $n-k+1$ parts taht students in each part are not friends.

Find three different polynomials $P(x)$ with real coefficients such that $P\left(x^2 + 1\right) = P(x)^2 + 1$ for all real $x$.

Two perpendicular chords are drawn through a given interior point $P$ of a circle with radius $R.$ Determine, with proof, the maximum and the minimum of the sum of the lengths of these two chords if the distance from $P$ to the center of the circle is $kR.$

There are 15 people at a party; each person has 10 friends. To greet each other each person hugs all their friends. How many hugs are exchanged at this party?

Let $ABC$ be an acute-angled, nonisosceles triangle. Point $A_1, A_2$ are symmetric to the feet of the internal and the external bisectors of angle $A$ wrt the midpoint of $BC$. Segment $A_1A_2$ is a diameter of a circle $\alpha$. Circles $\beta$ and $\gamma$ are defined similarly. Prove that these three circles have two common points.

Determine all triples $(p, q, r)$ of prime numbers for which $p^q + p^r$ is a perfect square.

Starting with the triple $(1007\sqrt{2},2014\sqrt{2},1007\sqrt{14})$, define a sequence of triples $(x_{n},y_{n},z_{n})$ by $x_{n+1}=\sqrt{x_{n}(y_{n}+z_{n}-x_{n})}$ $y_{n+1}=\sqrt{y_{n}(z_{n}+x_{n}-y_{n})}$ $ z_{n+1}=\sqrt{z_{n}(x_{n}+y_{n}-z_{n})}$ for $n\geq 0$.Show that each of the sequences $\langle x_n\rangle _{n\geq 0},\langle y_n\rangle_{n\geq 0},\langle z_n\rangle_{n\geq 0}$ converges to a limit and find these limits.

In a convex quadrilateral $ABCD$, consider quadrilateral $KLMN$ formed by the centers of mass of triangles $ABC, BCD, DBA, CDA$. Prove that the straight lines connecting the midpoints of the opposite sides of quadrilateral $ABCD$ meet at the same point as the straight lines connecting the midpoints of the opposite sides of $KLMN$.

Two points on the distance 1 are given in a plane. It is allowed to draw a line through two marked points, as well as a circle centered in a marked point with radius equal to the distance between some two marked points. By marked points we mean the two initial points and intersection points of two lines, two circles, or a line and a circle constructed so far. Let $C(n)$ be the minimum number of circles needed to construct two points on the distance $n$ if only a compass is used, and let $LC(n)$ be the minimum total number of circles and lines needed to do so if a ruler and a compass are used, where $n$ is a natural number. Prove that the sequence $C(n)/LC(n)$ is not bounded. [i]A. Belov[/i]

The number $328$ is written on the board. Two players alternate writing positive divisors of $328$ on the board, subject to the following rules: $\bullet$ No divisor of a previously written number may be written. $\bullet$ The player who writes 328 loses. Who has a winning strategy, the first player or the second player?

Evaluate $50(\cos 39^{\circ}\cos21^{\circ}+\cos129^{\circ}\cos69^{\circ})$

Are there positive real numbers $x$, $y$ and $z$ such that $ x^4 + y^4 + z^4 = 13\text{,} $ $ x^3y^3z + y^3z^3x + z^3x^3y = 6\sqrt{3} \text{,} $ $ x^3yz + y^3zx + z^3xy = 5\sqrt{3} \text{?} $ [i]Proposed by Matko Ljulj.[/i]

None of the positive integers $k,m,n$ are divisible by $5$. Prove that at least one of the numbers $k^2-m^2,m^2-n^2,n^2-k^2$ is divisible by $5$.

Let $a_1, a_2, ..., a_n $ be a sequence such that the arithmetic mean of the $n$ terms is $n$. Consider $n = 2009$. Determine the sum of the $2009$ terms of the sequence.

Anna and Boris move simultaneously towards each other, from points A and B respectively. Their speeds are constant, but not necessarily equal. Had Anna started 30 minutes earlier, they would have met 2 kilometers nearer to B. Had Boris started 30 minutes earlier instead, they would have met some distance nearer to A. Can this distance be uniquely determined? [i](3 points)[/i]

For all positive integers $n$ define $a_n=2 \underbrace{33...3}_{n \, times}$, where digit $3$ occurs $n$ times. Show that the number $a_{2009}$ has infinitely many multiples in the set $\{a_n | n \in N*\}$.

Prove that there exist infinitely many integers $n$ such that $n$, $n+1$, $n+2$ are each the sum of the squares of two integers. [Example: $0=0^2+0^2$, $1=0^2+1^2$, $2=1^2+1^2$.]

A baker uses $6\tfrac{2}{3}$ cups of flour when she prepares $\tfrac{5}{3}$ recipes of rolls. She will use $9\tfrac{3}{4}$ cups of flour when she prepares $\tfrac{m}{n}$ recipes of rolls where m and n are relatively prime positive integers. Find $m + n.$

(a) Is there a natural number $n$ such that the number $2^n$ has last digit $6$ and the sum of the other digits is $2$? b) Are there natural numbers $a$ and $m\ge 3$ such that the number $a^m$ has last digit $6$ and the sum of the other digits is 3?