Let $n$ and $k$ be two positive integers such that $n>k$. Prove that the equation $x^n+y^n=z^k$ has a solution in positive integers if and only if the equation $x^n+y^n=z^{n-k}$ has a solution in positive integers.

Let $ABCD$ be a rectangle with sides $AB = 4$ and $BC = 3$. The perpendicular on the diagonal $BD$ drawn from $ A$ intersects $BD$ at the point $H$. We denote by $M$ the midpoint of $BH$ and $N$ the midpoint of $CD$. Calculate the length of segment $MN$.

The NEMO (National Electronic Math Olympiad) is similar to the NIMO Summer Contest, in that there are fifteen problems, each worth a set number of points. However, the NEMO is weighted using Fibonacci numbers; that is, the $n^{\text{th}}$ problem is worth $F_n$ points, where $F_1 = F_2 = 1$ and $F_n = F_{n-1} + F_{n-2}$ for $n \ge 3$. The two problem writers are fair people, so they make sure that each of them is responsible for problems worth an equal number of total points. Compute the number of ways problem writing assignments can be distributed between the two writers. [i]Proposed by Lewis Chen[/i]

Let $ 0<a_k<1$ for $ k=1,2,... .$ Give a necessary and sufficient condition for the existence, for every $ 0<x<1$, of a permutation $ \pi_x$ of the positive integers such that \[ x= \sum_{k=1}^{\infty} \frac{a_{\pi_x}(k)}{2^k}.\] [i]P. Erdos[/i]

Determine if there exist $101$ positive integers (not necessarily distinct) such that their product is equal to the sum of all their pairwise LCM.

Consider the sequence of real numbers $(a_n)_{n\ge1}$ such that $$\lim_{n\to\infty}\frac1{n^r}\sum_{k=1}^n\frac{a_k}k=l\in\mathbb R,r\in\mathbb N^*$$ Show that: $$\lim_{n\to\infty}\left(\dfrac{\displaystyle\sum_{p=n+1}^{2n}\sum_{k=1}^p\sum_{i=1}^k\frac{a_i}{p\cdot i}}{n^{r+1}}\right)=l\left(\frac{2^{r+1}}{r(r+1)}-\frac{2^r}{(r+1)^2}\right)$$ [i]Proposed by Florin Stănescu and Şerban Cioculescu[/i]

Let $N$ be an integer, $N>2$. Arnold and Bernold play the following game: there are initially $N$ tokens on a pile. Arnold plays first and removes $k$ tokens from the pile, $1\le k < N$. Then Bernold removes $m$ tokens from the pile, $1\le m\le 2k$ and so on, that is, each player, on its turn, removes a number of tokens from the pile that is between $1$ and twice the number of tokens his opponent took last. The player that removes the last token wins. For each value of $N$, find which player has a winning strategy and describe it.

Find an ordered pair $(a,b)$ of real numbers for which $x^2+ax+b$ has a non-real root whose cube is $343$.

Find all natural integers $m, n$ such that $m, 2+m, 2^n+m, 2+2^n+m$ are all prime numbers

Find all real solutions $(x,y,z)$ of the system $$\begin{cases}\dfrac{4x^2}{1+4x^2}= y\\ \\\dfrac{4y^2}{1+4y^2}= z\\ \\ \dfrac{4z^2}{1+4z^2}= x \end{cases}$$

Let $P$ be a $10$-degree monic polynomial with roots $r_1, r_2, . . . , r_{10} \ne $ and let $Q$ be a $45$-degree monic polynomial with roots $\frac{1}{r_i}+\frac{1}{r_j}-\frac{1}{r_ir_j}$ where $i < j$ and $i, j \in \{1, ... , 10\}$. If $P(0) = Q(1) = 2$, then $\log_2 (|P(1)|)$ can be written as $a/b$ for relatively prime integers $a, b$. Find $a + b$.

A moth starts at vertex $A$ of a certain cube and is trying to get to vertex $B$, which is opposite $A$, in five or fewer “steps,” where a step consists in traveling along an edge from one vertex to another. The moth will stop as soon as it reaches $B$. How many ways can the moth achieve its objective?

A quadrilateral $ABCD$ is inscribed in a circle. On each of the sides $AB,BC,CD,DA$ one erects a rectangle towards the interior of the quadrilateral, the other side of the rectangle being equal to $CD,DA,AB,BC,$ respectively. Prove that the centers of these four rectangles are vertices of a rectangle.

Consider a cone of revolution with an inscribed sphere tangent to the base of the cone. A cylinder is circumscribed about this sphere so that one of its bases lies in the base of the cone. let $V_1$ be the volume of the cone and $V_2$ be the volume of the cylinder. a) Prove that $V_1 \neq V_2$; b) Find the smallest number $k$ for which $V_1=kV_2$; for this case, construct the angle subtended by a diamter of the base of the cone at the vertex of the cone.

Let $p$ be an[color=#FF0000] odd [/color]prime number. Determine all pairs of polynomials $f$ and $g$ from $\mathbb{Z}[X]$ such that \[f(g(X))=\sum_{k=0}^{p-1} X^k = \Phi_p(X).\]

In triangle $ABC$ with $AB=23$, $AC=27$, and $BC=20$, let $D$ be the foot of the $A$ altitude. Let $\mathcal{P}$ be the parabola with focus $A$ passing through $B$ and $C$, and denote by $T$ the intersection point of $AD$ with the directrix of $\mathcal P$. Determine the value of $DT^2-DA^2$. (Recall that a parabola $\mathcal P$ is the set of points which are equidistant from a point, called the $\textit{focus}$ of $\mathcal P$, and a line, called the $\textit{directrix}$ of $\mathcal P$.)

For how many integers $n$, there are four distinct real numbers satisfying the equation $ |x^2-4x-7|=n$? $ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 5 $

A rectangle can be divided by parallel lines to its sides into 200 congruent squares, and also in 288 congruent squares. Prove that the rectangle can also be divided into 392 congruent squares.

One afternoon a bakery finds that it has $300$ cups of flour and $300$ cups of sugar on hand. Annie and Sam decide to use this to make and sell some batches of cookies and some cakes. Each batch of cookies will require $1$ cup of flour and $3$ cups of sugar. Each cake will require $2$ cups of flour and $1$ cup of sugar. Annie thinks that each batch of cookies should sell for $2$ dollars and each cake for $1$ dollar, but Sam thinks that each batch of cookies should sell for $1$ dollar and each cake should sell for $3$ dollars. Find the difference between the maximum dollars of income they can receive if they use Sam's selling plan and the maximum dollars of income they can receive if they use Annie's selling plan.

Let $x,y,z\geq0$ be real numbers such that $x+y+z=1$ Define $f(x,y,z)$ in this way : \[f(x,y,z)=\frac{x(2y-z)}{1+x+3y}+\frac{y(2z-x)}{1+y+3z}+\frac{z(2x-y)}{1+z+3x}\] Find the minimum value and maximum value of $f(x,y,z)$ .

Three circles of radius $1$ are mutually tangent, as shown. What is the area of the triangle whose vertices are the points of tangency?

Let $BE$ and $CF$ be the altitudes of acute triangle $ABC$. Let $H$ be the orthocenter of $ABC$ and $M$ be the midpoint of side $BC$. The points of intersection of the midperpendicular line to $BC$ with segments $BE$ and $CF$ are denoted by $K$ and $L$ respectively. The point $Q$ is the orthocenter of triangle $KLH$. Prove that $Q$ belongs to the median $AM$. (Bohdan Zheliabovskyi)

$1992$ vectors are given in the plane. Two players pick unpicked vectors alternately. The winner is the one whose vectors sum to a vector with larger magnitude (or they draw if the magnitudes are the same). Can the first player always avoid losing?

A finite sequence of integers $a_0,,a_1,\dots,a_n$ is called [i]quadratic[/i] if for each $i\in\{1,2,\dots n\}$ we have the equality $|a_i-a_{i-1}|=i^2$. $\text{(i)}$ Prove that for any two integers $b$ and $c$, there exist a positive integer $n$ and a quadratic sequence with $a_0=b$ and $a_n = c$. $\text{(ii)}$ Find the smallest positive integer $n$ for which there exists a quadratic sequence with $a_0=0$ and $a_n=2021$.

An integer consists of 7 different digits, and is a multiple of each of its digits. What digits are in this nubmer?