Find all solutions of the equation $(a^a)^5 = b^b$ in positive integers.

Find all functions $f : R_+ \to R_+$ such that $$x^2(f(x)+f(y)) = (x+y)f(f(x)y)$$ for all positive real $x, y$.

$K(x, y), f(x)$ and $g(x)$ are positive and continuous for $x, y \subseteq [0, 1]$. $\int_{0}^{1} f(y) K(x, y) dy = g(x)$ and $\int_{0}^{1} g(y) K(x, y) dy = f(x)$ for all $x \subseteq [0, 1]$. Show that $f = g$ on $[0, 1]$.

Let $a_0=29$, $b_0=1$ and $$a_{n+1} = a_n+a_{n-1}\cdot b_n^{2019}, \qquad b_{n+1}=b_nb_{n-1}$$ for $n\geq 1$. Determine the smallest positive integer $k$ for which $29$ divides $\gcd(a_k, b_k-1)$ whenever $a_1,b_1$ are positive integers and $29$ does not divide $b_1$.

Let $\gamma$ be a circle and $l$ a line in its plane. Let $K$ be a point on $l$, located outside of $\gamma$. Let $KA$ and $KB$ be the tangents from $K$ to $\gamma$, where $A$ and $B$ are distinct points on $\gamma$. Let $P$ and $Q$ be two points on $\gamma$. Lines $PA$ and $PB$ intersect line $l$ in two points $R$ and respectively $S$. Lines $QR$ and $QS$ intersect the second time circle $\gamma$ in points $C$ and $D$. Prove that the tangents from $C$ and $D$ to $\gamma$ are concurrent on line $l$.

Find all functions $f: \mathbb{Q}\to \mathbb{R}$ such that for all $x,y\in \mathbb{Q}$: \[f(xy)=f(x)f(y)-f(x+y)+1.\]

A rectangle $ABCD$ is given. On the side $AB$, $n$ different points are chosen strictly between $A$ and $B$. Similarly, $m$ different points are chosen on the side $AD$. Lines are drawn from the points parallel to the sides. How many rectangles are formed in this way? (One possibility is shown in the figure.) [img]https://cdn.artofproblemsolving.com/attachments/0/1/dcf48e4ce318fdcb8c7088a34fac226e26e246.png[/img]

For a positive integer $n$ we denote $D_2(n)$ to the number of divisors of $n$ which are perfect squares and $D_3(n)$ to the number of divisors of $n$ which are perfect cubes. Prove that there exists such that $D_2(n)=999D_3(n).$ Note. The perfect squares are $1^2,2^2,3^2,4^2,…$ , the perfect cubes are $1^3,2^3,3^3,4^3,…$ .

Prove that in any triangle the length of the shortest bisector does not exceed three times the radius of the incircle.

Let $A_1A_2 \dots A_n$ be a polygon (not necessarily regular) with $n$ sides. Suppose there is a translation that maps each point $A_i$ to a point $B_i$ in the same plane. For convenience, define $A_0 = A_n$ and $B_0 = B_n$. Prove that \[ \sum_{i=1}^{n} (A_{i-1} B_{i})^2 = \sum_{i=1}^{n} (B_{i-1} A_{i})^2 \, . \]

What is the greatest number of regions into which four planes can divide three-dimensional space?

If $ x$ and $ y$ are positive integers for which $ 2^x3^y \equal{} 1296$, what is the value of $ x\plus{}y$? $ \textbf{(A)}\ 8\qquad \textbf{(B)}\ 9\qquad \textbf{(C)}\ 10\qquad \textbf{(D)}\ 11\qquad \textbf{(E)}\ 12$

Line segment $\overline{AE}$ of length $17$ bisects $\overline{DB}$ at a point $C$. If $\overline{AB} = 5$, $\overline{BC} = 6$ and $\angle BAC = 78^o$ degrees, calculate $\angle CDE$.

Consider a circumscribed pentagon ${ABCDE}$ . Its incenter lies on the diagonal ${AC}$ . Prove that $$ {AB} + {BC} > {CD} + {DE} + {EA}. $$ Egor Bakaev

For every positive integer $n$, determine the biggest positive integer $k$ so that $2^k |\ 3^n+1$

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

Let $ABCD$ be a convex quadrilateral with the line $CD$ being tangent to the circle on diameter $AB$. Prove that the line $AB$ is tangent to the circle on diameter $CD$ if and only if the lines $BC$ and $AD$ are parallel.

suppose that $A$ is the set of all Closed intervals $[a,b] \subset \mathbb{R}$. Find all functions $f:\mathbb{R} \rightarrow A$ such that $\bullet$ $x \in f(y) \Leftrightarrow y \in f(x)$ $\bullet$ $|x-y|>2 \Leftrightarrow f(x) \cap f(y)=\varnothing$ $\bullet$ For all real numbers $0\leq r\leq 1$, $f(r)=[r^2-1,r^2+1]$ Proposed by Matin Yousefi

Do there exist integers $a$ and $b$ such that : (a) the equation $x^2 + ax + b = 0$ has no real roots, and the equation $\lfloor x^2 \rfloor + ax + b = 0$ has at least one real root? [i](2 points)[/i] (b) the equation $x^2 + 2ax + b$ = 0 has no real roots, and the equation $\lfloor x^2 \rfloor + 2ax + b = 0$ has at least one real root? [i]3 points[/i] (By $\lfloor k \rfloor$ we denote the integer part of $k$, that is, the greatest integer not exceeding $k$.) [i]Alexandr Khrabrov[/i]

Let $f:[1,\infty)\to(0,\infty)$ be a continuous function. Assume that for every $a>0$, the equation $f(x)=ax$ has at least one solution in the interval $[1,\infty)$. (a) Prove that for every $a>0$, the equation $f(x)=ax$ has infinitely many solutions. (b) Give an example of a strictly increasing continuous function $f$ with these properties.

A [i]smooth number[/i] is a positive integer of the form $2^m 3^n$, where $m$ and $n$ are nonnegative integers. Let $S$ be the set of all triples $(a, b, c)$ where $a$, $b$, and $c$ are smooth numbers such that $\gcd(a, b)$, $\gcd(b, c)$, and $\gcd(c, a)$ are all distinct. Evaluate the infinite sum $\sum_{(a,b,c) \in S} \frac{1}{abc}$. Recall that $\gcd(x, y)$ is the greatest common divisor of $x$ and $y$.

On a blackboard, several polynomials of degree $37$ are written, each of them has the leading coefficient equal to $1$. Initially all coefficients of each polynomial are non-negative. By one move it is allowed to erase any pair of polynomials $f, g$ and replace it by another pair of polynomials $f_1, g_1$ of degree $37$ with the leading coefficients equal to $1$ such that either $f_1+g_1 = f+g$ or $f_1g_1 = fg$. Prove that it is impossible that after some move each polynomial on the blackboard has $37$ distinct positive roots. [i](8 points)[/i] [i]Alexandr Kuznetsov[/i]

A school needs to elect its president. The school has $121$ students, each of whom belongs to one of two tribes: Geometers or Algebraists. Two candidates are running for president: one Geometer and one Algebraist. The Geometers vote only for Geometers and the Algebraists only for Algebraists. There are more Algebraists than Geometers, but the Geometers are resourceful. They convince the school that the following two-step procedure is fairer: [list=a] [*]The school is divided into $11$ groups, with $11$ students in each group. Each group elects a representative for step 2. [*]The $11$ elected representatives elect a president. [/list] Not only do the Geometers manage to have this two-step procedure approved, they also volunteer to assign the students to groups for step 1. What is the minimum number of Geometers in the school that guarantees they can elect a Geometer as president? (In any stage of voting, the majority wins.)

Prove the inequality $$ 1^k+2^k+...+n^k \le \frac{n^{2k}-(n-1)^k}{n^k-(n-1)^k}$$ (L Emelianov)

Driving along a highway, Megan noticed that her odometer showed $15951$ (miles). This number is a palindrome—it reads the same forward and backward. Then $2$ hours later, the odometer displayed the next higher palindrome. What was her average speed, in miles per hour, during this $2$-hour period? $\textbf{(A) }50 \qquad \textbf{(B) }55 \qquad \textbf{(C) }60\qquad \textbf{(D) }65\qquad\textbf{(E) }70$