Find the triple of positive integers $(x,y,z)$ with $z$ least possible for which there are positive integers $a, b, c, d$ with the following properties: (i) $x^y = a^b = c^d$ and $x > a > c$ (ii) $z = ab = cd$ (iii) $x + y = a + b$.

Some polygon can be divided into two equal parts by three different ways. Is it certainly valid that this polygon has an axis or a center of symmetry?

The equation $ x^3\minus{}ax^2\plus{}bx\minus{}c\equal{}0$ has three (not necessarily different) positive real roots. Find the minimal possible value of $ \frac{1\plus{}a\plus{}b\plus{}c}{3\plus{}2a\plus{}b}\minus{}\frac{c}{b}$.

Let $I\subseteq \mathbb{R}$ be an open interval and $f:I\to\mathbb{R}$ a strictly monotonous function. Prove that for all $c\in I$ there exist $a,b\in I$ such that $c\in (a,b)$ and \[\int_a^bf(x) \ dx=f(c)\cdot (b-a).\]

A polynomial $p(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$ with integer coefficients is said to be divisible by an integer $m$ if $p(x)$ is divisible by m for all integers $x$. Prove that if $p(x)$ is divisible by $m$, then $k!a_0$ is also divisible by $m$. Also prove that if $a_0, k,m$ are non-negative integers for which $k!a_0$ is divisible by $m$, there exists a polynomial $p(x) = a_0x^k+\cdots+ a_k$ divisible by $m.$

Find all natural two digit numbers such that when you substract by seven times the sum of its digit from the number you get a prime number.

Determine all pairs $(x, y)$ of positive integers satisfying $x + y + 1 | 2xy$ and $ x + y - 1 | x^2 + y^2 - 1$.

On a table, we have ten thousand matches, two of which are inside a bowl. Anna and Bernd play the following game: They alternate taking turns and Anna begins. A turn consists of counting the matches in the bowl, choosing a proper divisor $d$ of this number and adding $d$ matches to the bowl. The game ends when more than $2024$ matches are in the bowl. The person who played the last turn wins. Prove that Anna can win independently of how Bernd plays. [i](Richard Henner)[/i]

Let $ A\equal{}(a_{ij})_{1\leq i,j\leq n}$ be a real $ n\times n$ matrix, such that $ a_{ij} \plus{} a_{ji} \equal{} 0$, for all $ i,j$. Prove that for all non-negative real numbers $ x,y$ we have \[ \det(A\plus{}xI_n)\cdot \det(A\plus{}yI_n) \geq \det (A\plus{}\sqrt{xy}I_n)^2.\]

Let $a$ and $b$ be two positive real numbers such that $a^{2007} = a + 1$ and $b^{4014} = b + 3a$. Determine whether $a > b$ or $b > a$.

Each of the following four large congruent squares is subdivided into combinations of congruent triangles or rectangles and is partially [b]bolded[/b]. What percent of the total area is partially bolded? [asy] import graph; size(7.01cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-0.42,xmax=14.59,ymin=-10.08,ymax=5.26; pair A=(0,0), B=(4,0), C=(0,4), D=(4,4), F=(2,0), G=(3,0), H=(1,4), I=(2,4), J=(3,4), K=(0,-2), L=(4,-2), M=(0,-6), O=(0,-4), P=(4,-4), Q=(2,-2), R=(2,-6), T=(6,4), U=(10,0), V=(10,4), Z=(10,2), A_1=(8,4), B_1=(8,0), C_1=(6,-2), D_1=(10,-2), E_1=(6,-6), F_1=(10,-6), G_1=(6,-4), H_1=(10,-4), I_1=(8,-2), J_1=(8,-6), K_1=(8,-4); draw(C--H--(1,0)--A--cycle,linewidth(1.6)); draw(M--O--Q--R--cycle,linewidth(1.6)); draw(A_1--V--Z--cycle,linewidth(1.6)); draw(G_1--K_1--J_1--E_1--cycle,linewidth(1.6)); draw(C--D); draw(D--B); draw(B--A); draw(A--C); draw(H--(1,0)); draw(I--F); draw(J--G); draw(C--H,linewidth(1.6)); draw(H--(1,0),linewidth(1.6)); draw((1,0)--A,linewidth(1.6)); draw(A--C,linewidth(1.6)); draw(K--L); draw((4,-6)--L); draw((4,-6)--M); draw(M--K); draw(O--P); draw(Q--R); draw(O--Q); draw(M--O,linewidth(1.6)); draw(O--Q,linewidth(1.6)); draw(Q--R,linewidth(1.6)); draw(R--M,linewidth(1.6)); draw(T--V); draw(V--U); draw(U--(6,0)); draw((6,0)--T); draw((6,2)--Z); draw(A_1--B_1); draw(A_1--Z); draw(A_1--V,linewidth(1.6)); draw(V--Z,linewidth(1.6)); draw(Z--A_1,linewidth(1.6)); draw(C_1--D_1); draw(D_1--F_1); draw(F_1--E_1); draw(E_1--C_1); draw(G_1--H_1); draw(I_1--J_1); draw(G_1--K_1,linewidth(1.6)); draw(K_1--J_1,linewidth(1.6)); draw(J_1--E_1,linewidth(1.6)); draw(E_1--G_1,linewidth(1.6)); dot(A,linewidth(1pt)+ds); dot(B,linewidth(1pt)+ds); dot(C,linewidth(1pt)+ds); dot(D,linewidth(1pt)+ds); dot((1,0),linewidth(1pt)+ds); dot(F,linewidth(1pt)+ds); dot(G,linewidth(1pt)+ds); dot(H,linewidth(1pt)+ds); dot(I,linewidth(1pt)+ds); dot(J,linewidth(1pt)+ds); dot(K,linewidth(1pt)+ds); dot(L,linewidth(1pt)+ds); dot(M,linewidth(1pt)+ds); dot((4,-6),linewidth(1pt)+ds); dot(O,linewidth(1pt)+ds); dot(P,linewidth(1pt)+ds); dot(Q,linewidth(1pt)+ds); dot(R,linewidth(1pt)+ds); dot((6,0),linewidth(1pt)+ds); dot(T,linewidth(1pt)+ds); dot(U,linewidth(1pt)+ds); dot(V,linewidth(1pt)+ds); dot((6,2),linewidth(1pt)+ds); dot(Z,linewidth(1pt)+ds); dot(A_1,linewidth(1pt)+ds); dot(B_1,linewidth(1pt)+ds); dot(C_1,linewidth(1pt)+ds); dot(D_1,linewidth(1pt)+ds); dot(E_1,linewidth(1pt)+ds); dot(F_1,linewidth(1pt)+ds); dot(G_1,linewidth(1pt)+ds); dot(H_1,linewidth(1pt)+ds); dot(I_1,linewidth(1pt)+ds); dot(J_1,linewidth(1pt)+ds); dot(K_1,linewidth(1pt)+ds); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); [/asy] $ \textbf{(A)}12\frac 12\qquad\textbf{(B)}20\qquad\textbf{(C)}25\qquad\textbf{(D)}33 \frac 13\qquad\textbf{(E)}37\frac 12 $

Six teams participate in a hockey tournament. Each team plays exactly once against each other team. A team is awarded $3$ points for each game they win, $1$ point for each draw, and $0$ points for each game they lose. After the tournament, a ranking is made. There are no ties in the list. Moreover, it turns out that each team (except the very last team) has exactly $2$ points more than the team ranking one place lower. Prove that the team that finished fourth won exactly two games.

In the rectangle in the figure, we are going to write $12$ numbers from $1$ to $9$, so that the sum of the four numbers written in each line is the same and the sum of the three is also equal numbers in each column. Six numbers have already been written. Determine the sum of the numbers of each row and every column. [img]https://cdn.artofproblemsolving.com/attachments/7/f/3db9ded1e703c5392f258e1608a1800760d78c.png[/img]

Determine all functions $f:\mathbb{Z} \rightarrow \mathbb{Z}$ which satisfy the following equations: a) $f(f(n))=4n+3$ $\forall$ $n \in \mathbb{Z}$; b) $f(f(n)-n)=2n+3$ $\forall$ $n \in \mathbb{Z}$.

Let $S$ be a set of real numbers such that: i) $1$ is from $S$; ii) for any $a, b$ from $S$ (not necessarily different), we have that $a-b$ is also from $S$; iii) for any $a$ from $S$ ($a$ is different from $0$), we have that $1/a$ is from $S$. Show that for every $a, b$ from $S$, we have that $ab$ is from $S$.

Let $ n$ be a natural number such that $ n \equal{} a^2 \plus{} b^2 \plus{}c^2$ for some natural numbers $ a,b,c$. Prove that \[ 9n \equal{} (p_1a\plus{}q_1b\plus{}r_1c)^2 \plus{} (p_2a\plus{}q_2b\plus{}r_2c)^2 \plus{} (p_3a\plus{}q_3b\plus{}r_3c)^2\] where $ p_j$'s , $ q_j$'s , $ r_j$'s are all [b]nonzero[/b] integers. Further, if $ 3$ does [b]not[/b] divide at least one of $ a,b,c,$ prove that $ 9n$ can be expressed in the form $ x^2\plus{}y^2\plus{}z^2$, where $ x,y,z$ are natural numbers [b]none[/b] of which is divisible by $ 3$.

Let $p,q\in \mathbb{R}[x]$ such that $p(z)q(\overline{z})$ is always a real number for every complex number $z$. Prove that $p(x)=kq(x)$ for some constant $k \in \mathbb{R}$ or $q(x)=0$. [i]Proposed by Mohammad Ahmadi[/i]

For a triangle $ ABC,$ let $ k$ be its circumcircle with radius $ r.$ The bisectors of the inner angles $ A, B,$ and $ C$ of the triangle intersect respectively the circle $ k$ again at points $ A', B',$ and $ C'.$ Prove the inequality \[ 16Q^3 \geq 27 r^4 P,\] where $ Q$ and $ P$ are the areas of the triangles $ A'B'C'$ and $ABC$ respectively.

Let $I$ be the incentre of a triangle $ABC$. Let $F$ and $G$ be the projections of $A$ onto the lines $BI$ and $CI$, respectively. Rays $AF$ and $AG$ intersect the circumcircles of the triangles $CFI$ and $BGI$ for the second time at points $K$ and $L$, respectively. Prove that the line $AI$ bisects the segment $KL$.

For which natural numbers $n\ge 2$ can the numbers from $1$ to $16$ be lined up in a square scheme so that the four row sums and the four column sums are all mutually different and divisible by $n$?

Let $ABC$ be an equilateral triangle, and let $D$ and $F$ be points on sides $BC$ and $AB$, respectively, with $FA=5$ and $CD=2$. Point $E$ lies on side $CA$ such that $\angle DEF = 60^\circ$. The area of triangle $DEF$ is $14\sqrt{3}$. The two possible values of the length of side $AB$ are $p \pm q\sqrt{r}$, where $p$ and $q$ are rational, and $r$ is an integer not divisible by the square of a prime. Find $r$.

Let $x, y, z \ge 0$ be real numbers. Prove that: \[\frac{x^{3}+y^{3}+z^{3}}{3}\ge xyz+\frac{3}{4}|(x-y)(y-z)(z-x)| .\] [hide="Additional task"]Find the maximal real constant $\alpha$ that can replace $\frac{3}{4}$ such that the inequality is still true for any non-negative $x,y,z$.[/hide]

Find all pairs of integers $(m, n)$ such that \[ \left| (m^2 + 2000m+ 999999)- (3n^3 + 9n^2 + 27n) \right|= 1.\]

With $21$ tiles, some white and some black, a $3 \times 7$ rectangle is formed. Show that there are always four tokens of the same color located at the vertices of a rectangle.

Determine all positive integers $m$ satisfying the condition that there exists a unique positive integer $n$ such that there exists a rectangle which can be decomposed into $n$ congruent squares and can also be decomposed into $m+n$ congruent squares.