Find all pairs of positive integers $ (x,y)$ such that \[ x^y \equal{} y^{x \minus{} y}. \] [i]Albania[/i]

Steph scored $15$ baskets out of $20$ attempts in the first half of a game, and $10$ baskets out of $10$ attempts in the second half. Candace took $12$ attempts in the first half and $18$ attempts in the second. In each half, Steph scored a higher percentage of baskets than Candace. Surprisingly they ended with the same overall percentage of baskets scored. How many more baskets did Candace score in the second half than in the first? [asy] size(7cm); draw((-8,27)--(72,27)); draw((16,0)--(16,35)); draw((40,0)--(40,35)); label("12", (28,3)); draw((25,6.5)--(25,12)--(31,12)--(31,6.5)--cycle); draw((25,5.5)--(31,5.5)); label("18", (56,3)); draw((53,6.5)--(53,12)--(59,12)--(59,6.5)--cycle); draw((53,5.5)--(59,5.5)); draw((53,5.5)--(59,5.5)); label("20", (28,18)); label("15", (28,24)); draw((25,21)--(31,21)); label("10", (56,18)); label("10", (56,24)); draw((53,21)--(59,21)); label("First Half", (28,31)); label("Second Half", (56,31)); label("Candace", (2.35,6)); label("Steph", (0,21)); [/asy] $\textbf{(A)} ~7\qquad\textbf{(B)} ~8\qquad\textbf{(C)} ~9\qquad\textbf{(D)} ~10\qquad\textbf{(E)} ~11$

On the circumference of a circle there are red and blue points. One may add a red point and change the colour of both its neighbours (to the other colour) or remove a red point and change the colour of both its previous neighbours. Initially there are two red points. Prove that there is no sequence of allowed operations which leads to the configuration consisting of two blue points. (K Kazarnovskiy, Moscow)

Prove that no perfect cube is of the form $y^2+108$ where $y \in \mathbb{Z}$.

A square $ ABCD$ with sides of length 1 is divided into two congruent trapezoids and a pentagon, which have equal areas, by joining the center of the square with points $ E,F,G$ where $ E$ is the midpoint of $ BC$, $ F,G$ are on $ AB$ and $ CD$, respectively, and they're positioned that $ AF < FB, DG < GC$ and $ F$ is the directly opposite of $ G$. If $ FB \equal{} x$, the length of the longer parallel side of each trapezoid, find the value of $ x$. [asy]unitsize(2.5cm); defaultpen(linewidth(.8pt)+fontsize(10pt)); dotfactor=4; pair[] dotted={(0,0),(0,1),(1,1),(1,0),(1/6,0),(1/6,1),(1/2,1/2),(1,1/2)}; draw(unitsquare); draw((1/6,0)--(1/2,1/2)--(1/6,1)); draw((1/2,1/2)--(1,1/2)); dot(dotted); label("$x$",midpoint((1/6,1)--(1,1)),N);[/asy]$ \displaystyle \textbf{(A)}\ \frac {3}{5} \qquad \textbf{(B)}\ \frac {2}{3} \qquad \textbf{(C)}\ \frac {3}{4} \qquad \textbf{(D)}\ \frac {5}{6} \qquad \textbf{(E)}\ \frac {7}{8}$

Let $ G$ be a simple graph with vertex set $ V\equal{}\{0,1,2,3,\cdots ,n\plus{}1\}$ .$ j$and$ j\plus{}1$ are connected by an edge for $ 0\le j\le n$. Let $ A$ be a subset of $ V$ and $ G(A)$ be the induced subgraph associated with $ A$. Let $ O(G(A))$ be number of components of $ G(A)$ having an odd number of vertices. Let $ T(p,r)\equal{}\{A\subset V \mid 0.n\plus{}1 \notin A,|A|\equal{}p,O(G(A))\equal{}2r\}$ for $ r\le p \le 2r$. Prove That $ |T(p,r)|\equal{}{n\minus{}r \choose{p\minus{}r}}{n\minus{}p\plus{}1 \choose{2r\minus{}p}}$.

Let $ f(x)\equal{}x^2\plus{}3$ and $ y\equal{}g(x)$ be the equation of the line with the slope $ a$, which pass through the point $ (0,\ f(0))$ . Find the maximum and minimum values of $ I(a)\equal{}3\int_{\minus{}1}^1 |f(x)\minus{}g(x)|\ dx$.

Let $ABC$ be a triangle with circumcenter $O$ and orthocenter $H$ such that $OH$ is parallel to $BC$. Let $AH$ intersects again with the circumcircle of $ABC$ at $X$, and let $XB, XC$ intersect with $OH$ at $Y, Z$, respectively. If the projections of $Y,Z$ to $AB,AC$ are $P,Q$, respectively, show that $PQ$ bisects $BC$. [i]Proposed by usjl[/i]

Suppose that $a_1,a_2,...,a_n$ are integers such that $a_1 +2^ia_2 +3^ia_3 +...+n^ia_n = 0$ for $i = 1,2,...,k -1$, where $k \ge 2$ is a given integer. Prove that $a_1+2^ka_2+3^ka_3+...+n^ka_n$ is divisible by $k!$.

At a festival, Jing Jing plays a game where she must knock down ten targets with as few balls as possible. Every time Jing Jing knocks down a target, she can reuse the ball she just threw and does not have to pick up a new ball. Suppose that Jing Jing knocks down each target with a probability of $\tfrac{3}{4}$. Compute the expected number of balls that Jing Jing needs to knock down all ten targets.

Find the number of $n$ that follow the following: $ \bigstar $ The number of integers $ (x,y,z) $ following this equation is not a multiple of 4. $ 2n=x^2+2y^2+2x^2+2xy+2yz $

Positive integers $x_1,...,x_m$ (not necessarily distinct) are written on a blackboard. It is known that each of the numbers $F_1,...,F_{2018}$ can be represented as a sum of one or more of the numbers on the blackboard. What is the smallest possible value of $m$? (Here $F_1,...,F_{2018}$ are the first $2018$ Fibonacci numbers: $F_1=F_2=1, F_{k+1}=F_k+F_{k-1}$ for $k>1$.)

A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula \[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0; \]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large. [i]Proposed by Harmel Nestra, Estionia[/i]

Construct a quadrilateral given its side lengths and the length of the segment joining the midpoints of its diagonals. (IZ Titovich)

Let $a,b,c,x,y,z$ be real numbers such that $x+y+z=0$, $a+b+c\geq 0$, $ab+bc+ca \ge 0$. Prove that $$ ax^2+by^2+cz^2\ge 0 $$

Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that $$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$ for all positive integers $n$. Show that $a_{2022}\leq 1$.

Solve the system of equations: $ (1\plus{}4^{2x\minus{}y}).5^{1\minus{}2x\plus{}y}\equal{}1\plus{}2^{2x\minus{}y\plus{}1}$ $ y^3\plus{}4x\plus{}ln(y^2\plus{}2x)\plus{}1\equal{}0$

Given a real number $c$ and an integer $m, m \ge 2$. Real numbers $x_1, x_2,... , x_m$ satisfy the conditions $x_1 + x_2 +...+ x_m = 0$ and $\frac{x^2_1 + x^2_2 + ...+ x^2_m}{m}= c$. Find max $(x_1, x_2,..., x_m)$ if it is known to be as small as possible.

Let $\mathbb{R}^{+}$ be the set of all positive real numbers. Find all the functions $f: \mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$ such that for all $x, y \in \mathbb{R}^{+}$, \[ f(x)f(y) = f(y)f(xf(y)) + \frac{1}{xy}. \]

Suppose $x$, $y$, $z$ are positive numbers such that $x+y+z=1$. Prove that \[ \frac{(1+xy+yz+zx)(1+3x^3 + 3y^3 + 3z^3)}{9(x+y)(y+z)(z+x)} \ge \left( \frac{x \sqrt{1+x} }{\sqrt[4]{3+9x^2}} + \frac{y \sqrt{1+y} }{\sqrt[4]{3+9y^2}} + \frac{z \sqrt{1+z}}{\sqrt[4]{3+9z^2}} \right)^2. \]

Three numbers $a,b,c$, none zero, form an arithmetic progression. Increasing $a$ by $1$ or increasing $c$ by $2$ results in a geometric progression. Then $b$ equals: $\textbf{(A)}\ 16 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ 8$

Find all Polynomial $P(x)$ and $Q(x)$ with Integer Coefficients satisfied the equation: \[Q(a+b) = \frac{P(a) - P(b)}{a - b}\] $\forall a, b \in \mathbb{Z}^+$ and $a>b$

Jorge's teacher asks him to plot all the ordered pairs $ (w, l)$ of positive integers for which $ w$ is the width and $ l$ is the length of a rectangle with area 12. What should his graph look like? $ \textbf{(A)}$[asy]size(75); draw((0,-1)--(0,13)); draw((-1,0)--(13,0)); dot((1,12)); dot((2,6)); dot((3,4)); dot((4,3)); dot((6,2)); dot((12,1)); label("$l$", (0,6), W); label("$w$", (6,0), S);[/asy] $ \textbf{(B)}$[asy]size(75); draw((0,-1)--(0,13)); draw((-1,0)--(13,0)); dot((1,1)); dot((3,3)); dot((5,5)); dot((7,7)); dot((9,9)); dot((11,11)); label("$l$", (0,6), W); label("$w$", (6,0), S);[/asy] $ \textbf{(C)}$[asy]size(75); draw((0,-1)--(0,13)); draw((-1,0)--(13,0)); dot((1,11)); dot((3,9)); dot((5,7)); dot((7,5)); dot((9,3)); dot((11,1)); label("$l$", (0,6), W); label("$w$", (6,0), S);[/asy] $ \textbf{(D)}$[asy]size(75); draw((0,-1)--(0,13)); draw((-1,0)--(13,0)); dot((1,6)); dot((3,6)); dot((5,6)); dot((7,6)); dot((9,6)); dot((11,6)); label("$l$", (0,6), W); label("$w$", (6,0), S);[/asy] $ \textbf{(E)}$[asy]size(75); draw((0,-1)--(0,13)); draw((-1,0)--(13,0)); dot((6,1)); dot((6,3)); dot((6,5)); dot((6,7)); dot((6,9)); dot((6,11)); label("$l$", (0,6), W); label("$w$", (6,0), S);[/asy]

Let $ABC$ be a triangle with circumcircle $\omega$, circumcenter $O{}$, and orthocenter $H{}$. Let $K{}$ be the midpoint of $AH{}$. The perpendicular to $OK{}$ at $K{}$ intersects $AB{}$ and $AC{}$ at $P{}$ and $Q{}$, respectively. The lines $BK$ and $CK$ intersect $\omega$ again at $X{}$ and $Y{}$, respectively. Prove that the second intersection of the circumcircles of triangles $KPY$ and $KQX$ lies on $\omega$. [i]Stefan Lozanovski[/i]

On Christmas Eve, 1983, Dean Jixon, the famous seer who had made startling predictions of the events of the preceding year that the volcanic and seismic activities of $1980$ and $1981$ were connected with mathematics. The diminishing of this geological activity depended upon the existence of an elementary proof of the irreducibility of the polynomial \[P(x)=x^{1981}+x^{1980}+12x^{2}+24x+1983.\] Is there such a proof?