Find all positive integers $n\geq 3$ such that it is possible to triangulate a convex $n$-gon such that all vertices of the $n$-gon have even degree.

Three different pairs of shoes are placed in a row so that no left shoe is next to a right shoe from a different pair. In how many ways can these six shoes be lined up? $ \textbf{(A) }60\qquad \textbf{(B) }72\qquad \textbf{(C) }90\qquad \textbf{(D) }108\qquad \textbf{(E) }120\qquad $

In rectangle $ABCD, AB= 5$ and $BC = 3$. Points $F$ and $G$ are on line segment $CD$ so that $DF = 1$ and $GC = 2$. Lines $AF$ and $BG$ intersect at $E$. What is the area of $\vartriangle AEB$?

Prove the trigonometric inequality $\cos x < 1 - \frac{x^2}{2} + \frac{x^4}{16},$ when $x \in \left(0, \frac{\pi}{2} \right).$

There are 20 students in a high school class, and each student has exactly three close friends in the class. Five of the students have bought tickets to an upcoming concert. If any student sees that at least two of their close friends have bought tickets, then they will buy a ticket too. Is it possible that the entire class buys tickets to the concert? (Assume that friendship is mutual; if student $A$ is close friends with student $B$, then $B$ is close friends with $A$.)

Given a table $m\times n$, in each cell of which a number $+1$ or $-1$ is written. It is known that initially exactly one $-1$ is in the table, all the other numbers being $+1$. During a move, it is allowed to chose any cell containing $-1$, replace this $-1$ by $0$, and simultaneously multiply all the numbers in the neighbouring cells by $-1$ (we say that two cells are neighbouring if they have a common side). Find all $(m,n)$ for which using such moves one can obtain the table containing zeros only, regardless of the cell in which the initial $-1$ stands.

Find all integers that can be written as $\frac{(a+b)(b+c)(c+a)}{abc}$, where $a,b,c$ are pairwise coprime positive integers.

Find all injective functions $ f : \mathbb{N} \to \mathbb{N}$ which satisfy \[ f(f(n)) \le\frac{n \plus{} f(n)}{2}\] for each $ n \in \mathbb{N}$.

Determine all functions $f : R \to R$ such that for all $x, y \in R$ holds $$f(xf(x) + f(y)) = y + f(x)^2$$

Functions $f$ and $g$ are defined on the set of all integers in the interval $[-100; 100]$ and take integral values. Prove that for some integral $k$ the number of solutions of the equation $f(x)-g(y)=k$ is odd.\\ ( A. Golovanov)

Given a positive integer $m$. Let $$A_l = (4l+1)(4l+2)...(4(5^m+1)l)$$ for any positive integer $l$. Prove that there exist infinite number of positive integer $l$ which $$5^{5^ml}\mid A_l\text{ and } 5^{5^ml+1}\nmid A_l$$ and find the minimum value of $l$ satisfying the above condition.

Two different ellipses are given. One focus of the first ellipse coincides with one focus of the second ellipse. Prove that the ellipses have at most two points in common.

Let $p$ be an odd prime number. Let $S=a_1,a_2,\dots$ be the sequence defined as follows: $a_1=1,a_2=2,\dots,a_{p-1}=p-1$, and for $n\ge p$, $a_n$ is the smallest integer greater than $a_{n-1}$ such that in $a_1,a_2,\dots,a_n$ there are no arithmetic progressions of length $p$. We say that a positive integer is a [i]ghost[/i] if it doesn’t appear in $S$. What is the smallest ghost that is not a multiple of $p$? [i]Proposed by Guerrero[/i]

Find all nonnegative integer solutions $(x,y,z,w)$ of the equation\[2^x\cdot3^y-5^z\cdot7^w=1.\]

Given is a triangle $ABC$. Let $X$ be the reflection of $B$ in $AC$ and $Y$ is the reflection of $C$ in $AB$. The tangent to $(XAY)$ at $A$ meets $XY$ and $BC$ at $E, F$. Show that $AE=AF$.

Let $a$ and $b$ be fixed positive numbers. Find the smallest possible depending on $a$ and $b$ value of the sum $$\frac{x^2}{(ay + bz)(az + by)}+\frac{y^2}{(az + bx)(ax + bz)}+\frac{z^2}{(ax + by)(ay + bx)},$$ where $x, y, z$ are positive real numbers.

Find all integers $n \geq 2$ for which there exists a sequence of $2n$ pairwise distinct points $(P_1, \dots, P_n, Q_1, \dots, Q_n)$ in the plane satisfying the following four conditions: [list=i] [*]no three of the $2n$ points are collinear; [*] $P_iP_{i+1} \ge 1$ for all $i = 1, 2, \dots ,n$, where $P_{n+1}=P_1$; [*] $Q_iQ_{i+1} \ge 1$ for all $i = 1, 2, \dots, n$, where $Q_{n+1} = Q_1$; and [*] $P_iQ_j \le 1$ for all $i = 1, 2, \dots, n$ and $j = 1, 2, \dots, n$.[/list] [i]Ray Li[/i]

In a simple graph $G$, an operation is defined as taking two neighbor vertices $u,v$ which have a common neighbor, deleting the edge between $u,v$ and adding a new vertex $w$ whose neighbors are exactly the common neighbors of $u$ and $v$. Starting with the complete graph $G=K_n$ where $n\ge 3$ is a positive integer, find the maximum number of operations that can be applied. Proposed by[i] Deniz Can Karaçelebi[/i]

When askes: "What time is it?", father said to a son: "Quarter of time that passed and half of the remaining time gives the exact time". What time was it?

Let $n$ be a fixed natural number. The maze is a grid of dimensions $n \times n$, with a gate to the sky on one of the squares and some adjacent squares with partitions separated from each other so that it is still possible to move from one square to another. The program is in the UP, DOWN, RIGHT, LEFT final sequence, With each command, the Creature moves from its current square to the corresponding neighboring square, unless the partition or the outer boundary of the labyrinth prevents execution of the command (otherwise it does nothing), upon entering the gate, the Creature moves on to heaven. God creates a program, then Satan creates a labyrinth and places it on a square. Prove that God can make such a program that, independently of Satan's labyrinth and selected from the source square, the Creature always reaches heaven by following this program.

A tree has $10$ pounds of apples at dawn. Every afternoon, a bird comes and eats $x$ pounds of apples. Overnight, the amount of food on the tree increases by $10\%$. What is the maximum value of $x$ such that the bird can sustain itself indefinitely on the tree without the tree running out of food?

Let $\mathbb{R}^+$ be the set of positive real numbers. Find all functions $f \colon \mathbb{R}^+ \to \mathbb{R}^+$ such that, for all $x,y \in \mathbb{R}^+$, $$f(xy+f(x))=xf(y)+2.$$

In right $ \triangle ABC$ with hypotenuse $ \overline{AB}$, $ AC \equal{} 12$, $ BC \equal{} 35$, and $ \overline{CD}$ is the altitude to $ \overline{AB}$. Let $ \omega$ be the circle having $ \overline{CD}$ as a diameter. Let $ I$ be a point outside $ \triangle ABC$ such that $ \overline{AI}$ and $ \overline{BI}$ are both tangent to circle $ \omega$. The ratio of the perimeter of $ \triangle ABI$ to the length $ AB$ can be expressed in the form $ \displaystyle\frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m\plus{}n$.

Benny the Bear has $100$ rabbits in his rabbit farm. He observes that $53$ rabbits are spotted, and $73$ rabbits are blue-eyed. Compute the minimum number of rabbits that are both spotted and blue-eyed.

Let $x,y,z$ be positive integers such that $\frac{x+1}{y}+\frac{y+1}{z}+\frac{z+1}{x}$ is an integer. Let $d$ be the greatest common divisor of $x,y$ and $z$. Prove that $d\le \sqrt[3]{xy+yz+zx}$.