Determine all pairs of functions $f,g:\mathbb{R}\rightarrow\mathbb{R}$ such that for any $x,y\in \mathbb{R}$, \[f(x)f(y)=g(x)g(y)+g(x)+g(y).\]

The incircle $I$ of $\triangle ABC$ is tangent to sides $AB,BC,CA$ at $D,E,F$ respectively. Line $EF$ intersects lines $AI,BI,DI$ at $M,N,K$ respectively. Prove that $DM\cdot KE=DN\cdot KF$.

Determine for which integers $n \geqslant 4$ the cells of a $1 \times (2n+1)$ table can be filled with the numbers $1, 2, 3, \dots, 2n + 1$ such that the following conditions are satisfied: [list=i] [*]Each of the numbers $1, 2, 3, \dots, 2n + 1$ appears exactly once. [*]In any $1 \times 3$ rectangle, one of the numbers is the arithmetic mean of the other two. [*]The number $1$ is located in the middle cell of the table. [/list]

Let the four real solutions to the equation $x^2 + \frac{144}{x^2} = 25$ be $r_1, r_2, r_3$, and $r_4$. Find $|r_1| +|r_2| +|r_3| +|r_4|$.

Are there any triples $(a,b,c)$ of positive integers such that $(a-2)(b-2)(c-2)+12$ is a prime number that properly divides the positive number $a^2+b^2+c^2+abc-2017$?

Let $A$ be a complex $n \times n$ Matrix for $n >1$. Let $A^{H}$ be the conjugate transpose of $A$. Prove that $A\cdot A^{H} =I_{n}$ if and only if $A=S\cdot (S^{H})^{-1}$ for some complex Matrix $S$.

In a board, the positive integer $N$ is written. In each round, Olive can realize any one of the following operations: I - Switch the current number by a positive multiple of the current number. II - Switch the current number by a number with the same digits of the current number, but the digits are written in another order(leading zeros are allowed). For instance, if the current number is $2022$, Olive can write any of the following numbers $222,2202,2220$. Determine all the positive integers $N$, such that, Olive can write the number $1$ after a finite quantity of rounds.

Let $Q$ be a quadratic polynomial. If the sum of the roots of $Q^{100}(x)$ (where $Q^i(x)$ is defined by $Q^1(x)=Q(x)$, $Q^i(x)=Q(Q^{i-1}(x))$ for integers $i\geq 2$) is $8$ and the sum of the roots of $Q$ is $S$, compute $|\log_2(S)|$.

Triangle $\vartriangle ABC$ is inscribed in circle $O$ and has sides $AB = 47$, $BC = 69$, and $CA = 34$. Let $E$ be the point on $O$ such that $\overline{AE}$ and $\overline{BC}$ intersect inside $O$, $8$ units away from $B$. Let $P$ and $Q$ be the points on $\overleftrightarrow{BE}$ and $\overleftrightarrow{CE}$, respectively, such that $\angle EPA$ and $\angle EQA$ are right angles. Suppose lines $\overleftrightarrow{AP}$ and $\overleftrightarrow{AQ}$ respectively intersect $O$ again at $X$ and $Y$ . Compute the distance $XY$.

Let $\vartriangle ABC$ be equilateral. Two points $D$ and $E$ are on side $BC$ (with order $B, D, E, C$), and satisfy $\angle DAE = 30^o$ . If $BD = 2$ and $CE = 3$, what is $BC$? [img]https://cdn.artofproblemsolving.com/attachments/c/8/27b756f84e086fe31b5ea695f51fb6c78b63d0.png[/img]

Let $p$ be a prime number. At a school of $p^{2020}$ students it is required that each club consist of exactly $p$ students. Is it possible for each pair of students to have exactly one club in common?

Francisco wrote a sequence of numbers starting with $25$. From the fourth term of the sequence onwards, each term of the sequence is the average of the previous three. Given that the first six terms of the sequence are natural numbers and that the sixth number written was $8$, what is the fifth term of the sequence?

Find all functions $f: \mathbb{N}_{0}\rightarrow \mathbb{N}_{0}$ such that for all $n\in \mathbb{N}_{0}$: \[f(f(n))+f(n)=2n+6.\]

Let $m,n$ be integers greater than 1,$m \geq n$,$a_1,a_2,\dots,a_n$ are $n$ distinct numbers not exceed $m$,which are relatively primitive.Show that for any real $x$,there exists $i$ for which $||a_ix|| \geq \frac{2}{m(m+1)} ||x||$,where $||x||$ denotes the distance between $x$ and the nearest integer to $x$ .

Nair and Yuli play the following game: $1.$ There is a coin to be moved along a horizontal array with $203$ cells. $2.$ At the beginning, the coin is at the first cell, counting from left to right. $3.$ Nair plays first. $4.$ Each of the players, in their turns, can move the coin $1$, $2$, or $3$ cells to the right. $5.$ The winner is the one who reaches the last cell first. What strategy does Nair need to use in order to always win the game?

Let $ R$ be a rectangle that is the union of a finite number of rectangles $ R_i,$ $ 1 \leq i \leq n,$ satisfying the following conditions: [b](i)[/b] The sides of every rectangle $ R_i$ are parallel to the sides of $ R.$ [b](ii)[/b] The interiors of any two different rectangles $ R_i$ are disjoint. [b](iii)[/b] Each rectangle $ R_i$ has at least one side of integral length. Prove that $ R$ has at least one side of integral length. [i]Variant:[/i] Same problem but with rectangular parallelepipeds having at least one integral side.

Let $a_1=2021$ and for $n \ge 1$ let $a_{n+1}=\sqrt{4+a_n}$. Then $a_5$ can be written as $$\sqrt{\frac{m+\sqrt{n}}{2}}+\sqrt{\frac{m-\sqrt{n}}{2}},$$ where $m$ and $n$ are positive integers. Find $10m+n$.

Let $r(x)$ be a polynomial of odd degree with real coefficients. Prove that there exist only finitely many (or none at all) pairs of polynomials $p(x) $ and $q(x)$ with real coefficients satisfying the equation $(p(x))^3 + q(x^2) = r(x)$.

A particle is in the origin of the Cartesian plane. In each step the particle can go $1$ unit in any of the directions, left, right, up or down. Find the number of ways to go from $(0, 0)$ to $(0, 2)$ in $6$ steps. (Note: Two paths where identical set of points is traversed are considered different if the order of traversal of each point is different in both paths.)

Anett is drawing $X$-es on a $5 \times 5$ grid. For each newly drawn $X$ she gets points in the following way: She checks how many $X$-es there are in the same row (including the new one) that can be reached from the newly drawn $X$ with horizontal steps, moving only on fields that were previously marked with $X$-es. For the vertical $X$-es, she gets points the same way. a) What is the maximum number of points that she can get with drawing $25$ $X$-es? b) What is the minimum number of points that she can get with drawing $25$ $X$-es? For example, if Anett put the $X$ on the field that is marked with the circle, she would get $3$ points for the horizontal fields and $1$ point for the vertical ones. Thus, she would get $4$ points in total. [img]https://cdn.artofproblemsolving.com/attachments/5/c/662c2e4c3dea8d78e2f6397489b277daee0ad0.png[/img]

Determine all positive real $M$ such that for any positive reals $a,b,c$, at least one of $a + \dfrac{M}{ab}, b + \dfrac{M}{bc}, c + \dfrac{M}{ca}$ is greater than or equal to $1+M$.

Let $ABC$ be a triangle with $\angle{C} = 90^{\circ}$, and let $H$ be the foot of the altitude from $C$. A point $D$ is chosen inside the triangle $CBH$ so that $CH$ bisects $AD$. Let $P$ be the intersection point of the lines $BD$ and $CH$. Let $\omega$ be the semicircle with diameter $BD$ that meets the segment $CB$ at an interior point. A line through $P$ is tangent to $\omega$ at $Q$. Prove that the lines $CQ$ and $AD$ meet on $\omega$.

Find all prime numbers $p$ for which there exist positive integers $x$, $y$, and $z$ such that the number $x^p + y^p + z^p - x - y - z$ is a product of exactly three distinct prime numbers.

Let $F$ be the field of $p^2$ elements, where $p$ is an odd prime. Suppose $S$ is a set of $(p^2-1)/2$ distinct nonzero elements of $F$ with the property that for each $a\neq 0$ in $F$, exactly one of $a$ and $-a$ is in $S$. Let $N$ be the number of elements in the intersection $S \cap \{2a: a \in S\}$. Prove that $N$ is even.

On each day, more than half of the inhabitants of Évora eats [i]sericaia[/i] as dessert. Show that there is a group of 10 inhabitants of Évora such that, on each of the last 2010 days, at least one of the inhabitants ate [i]sericaia[/i] as dessert.