Find all pairs $(a,b)$ of positive integers that satisfy the equation \[a^{b^{2}}= b^{a}.\]

Alex places a rook on any square of an empty $8\times8$ chessboard. Then he places additional rooks one rook at a time, each attacking an odd number of rooks which are already on the board. A rook attacks to the left, to the right, above and below, and only the first rook in each direction. What is the maximum number of rooks Alex can place on the chessboard?

Let $ABCD$ be a cyclic quadrilateral with perpendicular diagonals and circumcenter $O$. Let $g$ be the line obtained by reflection of the diagonal $AC$ along the angle bisector of $\angle BAD$. Prove that the point $O$ lies on the line $g$. [i]Proposed by Theresia Eisenkölbl[/i]

There are ten apples and $p$ pears in a basket. Anna eats two apples, and she finds that there are now more pears than apples. She then eats four pears. After eating the pears, she notices that there are more apples than pears. What is the sum of all possible values of $p$? $\textbf{(A) } 19\qquad\textbf{(B) } 28\qquad\textbf{(C) } 30\qquad\textbf{(D) } 42\qquad\textbf{(E) } 45$

Find the largest positive $p$ ($p>1$) such, that $\forall a,b,c\in[\frac1p,p]$ the following inequality takes place \[9(ab+bc+ca)(a^2+b^2+c^2)\geq(a+b+c)^4\]

Compute the smallest positive integer $n$ that is a multiple of $29$ with the property that for every positive integer that is relatively prime to $n$, $k^{n}\equiv 1\pmod{n}.$

Let $ABC$ be a triangle and $M$ be the middle point of $BC$. Let $\Omega$ be the circumference such as $A,B,C \in \Omega$. Let $P$ be the intersection of $\Omega$ and $AM$. $AF$ is a hight of the triangle, with $F\in BC$, and $H$ the orthocenter.Additionally the intersections of $MH$ and $PF$ with $\Omega$ are $K$ and $T$ respectibly. Demonstrate that the circumscribed circumference of the traingle $KTF$ is tangent with $BC$.

Consider the following increasing sequence $1,3,5,7,9,…$ of all positive integers consisting only of odd digits. Find the $2017$ -th term of the above sequence.

Let $n\ge 1$ be an integer. In town $X$ there are $n$ girls and $n$ boys, and each girl knows each boy. In town $Y$ there are $n$ girls, $g_1,g_2,\ldots ,g_n$, and $2n-1$ boys, $b_1,b_2,\ldots ,b_{2n-1}$. For $i=1,2,\ldots ,n$, girl $g_i$ knows boys $b_1,b_2,\ldots ,b_{2i-1}$ and no other boys. Let $r$ be an integer with $1\le r\le n$. In each of the towns a party will be held where $r$ girls from that town and $r$ boys from the same town are supposed to dance with each other in $r$ dancing pairs. However, every girl only wants to dance with a boy she knows. Denote by $X(r)$ the number of ways in which we can choose $r$ dancing pairs from town $X$, and by $Y(r)$ the number of ways in which we can choose $r$ dancing pairs from town $Y$. Prove that $X(r)=Y(r)$ for $r=1,2,\ldots ,n$.

Let $p$ and $n$ be positive integers, with $p\geq2$, and let $a$ be a real number such that $1\leq a<a+n\leq p$. Prove that the set \[ \mathcal {S}=\left\{\left\lfloor \log_{2}x\right\rfloor +\left\lfloor \log_{3}x\right\rfloor +\cdots+\left\lfloor \log_{p}x\right\rfloor\mid x\in\mathbb{R},a\leq x\leq a+n\right\} \] has exactly $n+1$ elements.

Prove that if $ a_1 < a_2 < \ldots < a_n $ and $ b_1 < b_2 < \ldots < b_n $, where $ n \geq 2 $, then $$\qquad (a_1 + a_2 + \ldots + a_n)(b_1 + b_2 + \ldots + b_n) < n(a_1b_1 + a_2b_2 + \ldots + a_nb_n).$$

There are $76$ cards with different numbers written on them. These cards are laid out on the table in a circle, number down. Try to find some three cards in a row such that the number written on the middle of these three cards is greater than on each of the two neighboring ones. You can turn over no more than $10$ cards in succession. How should one proceed to be sure to find three cardboard boxes for which the specified condition is met?

What is the smallest positive integer that when raised to the $6^{th}$ power, it can be represented by a sum of the $6^{th}$ powers of distinct smaller positive integers?

Let $K,L,M$ be points on sides $AB,BC,CA$, respectively, of a triangle $ABC$ such that $AK/AB = BL/BC = CM/CA = 1/3$. Show that if the circumcircles of the triangles $AKM, BLK, CML$ are equal, then so are the incircles of these triangles.

Let $a$ and $b$ be positive integers with $a>1$ and $b>2$. Prove that $a^b+1\ge b(a+1)$ and determine when there is inequality.

Let $ABCD$ be a convex quadrilateral with $\angle ABC>90$, $CDA>90$ and $\angle DAB=\angle BCD$. Denote by $E$ and $F$ the reflections of $A$ in lines $BC$ and $CD$, respectively. Suppose that the segments $AE$ and $AF$ meet the line $BD$ at $K$ and $L$, respectively. Prove that the circumcircles of triangles $BEK$ and $DFL$ are tangent to each other. $\emph{Slovakia}$

We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.

Anne-Marie has a deck of $16$ cards, each with a distinct positive factor of $2002$ written on it. She shuffles the deck and begins to draw cards from the deck without replacement. She stops when there exists a nonempty subset of the cards in her hand whose numbers multiply to a perfect square. What is the expected number of cards in her hand when she stops? [i]Proposed by Michael Ren.[/i]

Let $f(x)=x^2+bx+c$, where $b,c \in \mathbb{R}$ and $b>0$ Do there exist disjoint sets $A$ and $B$, whose union is $[0,1]$ and $f(A)=B$, where $f(X)=\{f(x), x \in X\}$ [i]D. Zmiaikou[/i]

Let $n \geq 2$ be a positive integer. For a positive integer $a$, let $Q_a(x)=x^n+ax$. Let $p$ be a prime and let $S_a=\{b | 0 \leq b \leq p-1, \exists c \in \mathbb {Z}, Q_a(c) \equiv b \pmod p \}$. Show that $\frac{1}{p-1}\sum_{a=1}^{p-1}|S_a|$ is an integer.

Keiko tosses one penny and Ephraim tosses two pennies. The probability that Ephraim gets the same number of heads that Keiko gets is $\text{(A)}\ \dfrac{1}{4} \qquad \text{(B)}\ \dfrac{3}{8} \qquad \text{(C)}\ \dfrac{1}{2} \qquad \text{(D)}\ \dfrac{2}{3} \qquad \text{(E)}\ \dfrac{3}{4}$

For any angle $0 < \theta < \pi/2$, show that \[0 < \sin \theta + \cos \theta + \tan \theta + \cot \theta - \sec \theta - \csc \theta < 1.\]

Eight poles stand along the road. A sparrow starts at the first pole and once in a minute flies to a neighboring pole. Let $a(n)$ be the number of ways to reach the last pole in $2n + 1$ flights (we assume $a(m) = 0$ for $m < 3$). Prove that for all $n \ge 4$ $$a(n) - 7a(n-1)+ 15a(n-2) - 10a(n-3) +a(n-4)=0.$$ [i](T. Amdeberhan, F. Petrov )[/i]

The incircle of triangle $ABC$ touches sides $BC$, $AC$, and $AB$ at points $A_1$, $B_1$, and $C_1$. The line through the midpoints of segments $AB_1$ and $AC_1$ intersects the tangent at $A$ to the circumcircle of triangle $ABC$ at point $A_2$. Points $B_2$ and $C_2$ are defined similarly. Prove that points $A_2$, $B_2$, and $C_2$ lie on a line.

Let \(n\) be a positive integer. For every positive integer $1 \leq k \leq n$ the sequence ${\displaystyle {\{ a_{i}+ki\}}_{i=1}^{n }}$ is defined, where $a_1,a_2, \dots ,a_n$ are integers. Among these \(n\) sequences, for at most how many of them does all the elements of the sequence give different remainders when divided by \(n\)?