Find all functions $f : R \to R$ that satisfy $f(x + y^2 - f(y)) = f(x)$ for all $x,y \in R$. (Vo Quoc Ba Can)

What is the smallest perfect square larger than $1$ with a perfect square number of positive integer factors? [i]Ray Li[/i]

A $9\times 7$ rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with $90^\circ$) and square tiles composed by four unit squares. Let $n\ge 0$ be the number of the $2 \times 2 $ tiles which can be used in such a tiling. Find all the values of $n$.

At the end of a soccer tournament in which any pair of teams played between them exactly once, and in which there were not draws, it was observed that for any three teams $A, B$ and C, if $A$ defeated $B$ and $B$ defeated $C$, then $A$ defeated $C$. Any team calculated the difference (positive) between the number of games that it won and the number of games it lost. The sum of all these differences was $5000$. How many teams played in the tournament? Find all possible answers.

Let $ABC$ be an isosceles obtuse-angled triangle, and $D$ be a point on its base $AB$ such that $AD$ equals to the circumradius of triangle $BCD$. Find the value of $\angle ACD$.

A round robin tournament is held with $2016$ participants. Each player plays each other player once and no games result in ties. We say a pair of players $A$ and $B$ is a [i]dominant pair[/i] if all other players either defeat $A$ and $B$ or are defeated by both $A$ and $B$. Find the maximum number dominant pairs. [i]Proposed by Nathan Ramesh

In the acute-angled triangle $ ABC $, the sides $ AB $ and $BC$ have different lengths, and the extension of the median $ BM $ intersects the circumscribed circle at the point $ N $. On this circle we note such a point $ D $ that $ \angle BDH = 90 {} ^ \circ $, where $ H $ is the point of intersection of the altitudes of the triangle $ ABC $. The point $K$ is chosen so that $ ANCK $ is a parallelogram. Prove that the lines $ AC $, $ KH $ and $ BD $ intersect at one point. (Igor Nagel)

Let $R[x]$ be the whole set of real coefficient polynomials, and define the mapping $T: R[x] \to R[x]$ as follows: For $$f (x) = a_nx^{n} + a_{n-1}x^{n- 1} +...+ a_1x + a_0,$$ let $$T(f(x))=a_{n}x^{n+1} + a_{n-1}x^{n} + (a_n+a_{n-2})x^{n-1 } + (a_{n-1}+a_{n-3})x^{n-2}+...+(a_2+a_0)x+a_1.$$ Assume $P_0(x)= 1$, $P_n(x) = T(P_{n-1}(x))$ ( $n=1,2,...$), find the constant term of $P_n(x)$.

Let $ABC$ be a triangle with $AB < AC,$ $I$ its incenter, and $M$ the midpoint of the side $BC$. If $IA=IM,$ determine the smallest possible value of the angle $AIM$.

Toothpicks of equal length are used to build a rectangular grid as shown. If the grid is 20 toothpicks high and 10 toothpicks wide, then the number of toothpicks used is [asy] real xscl = 1.2; int[] x = {0,1,2,4,5},y={0,1,3,4,5}; for(int a:x){ for(int b:y) { dot((a*xscl,b)); } } for(int a:x) { pair prev = (a,y[0]); for(int i = 1;i<y.length;++i) { pair p = (a,y[i]); pen pen = linewidth(.7); if(y[i]-prev.y!=1){ pen+=dotted; } draw((xscl*prev.x,prev.y)--(xscl*p.x,p.y),pen); prev = p; } }for(int a:y) { pair prev = (x[0],a); for(int i = 1;i<x.length;++i) { pair p = (x[i],a); pen pen = linewidth(.7); if(x[i]-prev.x!=1){ pen+=dotted; } draw((xscl*prev.x,prev.y)--(p.x*xscl,p.y),pen); prev = p; } } path lblx = (0,-.7)--(5*xscl,-.7); draw(lblx); label("$10$",lblx); path lbly = (5*xscl+.7,0)--(5*xscl+.7,5); draw(lbly); label("$20$",lbly);[/asy] $\text{(A)} \ 30 \qquad \text{(B)} \ 200 \qquad \text{(C)} \ 410 \qquad \text{(D)} \ 420 \qquad \text{(E)} \ 430$

Consider a cube and let$ M, N$ be two of its vertices. Assign the number $1$ to these vertices and $0$ to the other six vertices. We are allowed to select a vertex and to increase with a unit the numbers assigned to the $3$ adjiacent vertices - call this a [i]movement[/i]. Prove that there is a sequence of [i]movements [/i] after which all the numbers assigned to the vertices of the cube became equal if and only if $MN$ is not a diagonal of a face of the cube. Marius Ghergu, Dinu Serbanescu

Let $n\geq 4$ and $y_1,\dots, y_n$ real with $$\sum_{k=1}^n y_k=\sum_{k=1}^n k y_k=\sum_{k=1}^n k^2y_k=0$$ and $$y_{k+3}-3y_{k+2}+3y_{k+1}-y_k=0$$ for $1\leq k\leq n-3$. Prove that $$\sum_{k=1}^n k^3y_k=0$$

Let $f(x)$ be a nonconstant monic polynomial of degree $n$ with rational coefficents that is irreducible, meaning it cannot be factored into two nonconstant rational polynomials. Find and prove a formula for the number of monic complex polynomials that divide $f$.

Triangle $ABC$ satisfying $AB<AC$ has circumcircle $\Omega$. $E, F$ lies on $AC, AB$, respectively, such that $BCEF$ is cyclic. $T$ lies on $EF$ such that $\odot(TEF)$ is tangent to $BC$ at $T$. $A'$ is the antipode of $A$ on $\Omega$. $TA', TA$ intersects $\Omega$ again at $X, Y$, respectively, and $EF$ intersects $\odot(TXY)$ again at $W$. Prove that $\measuredangle WBA=\measuredangle ACW$ [i]Proposed by BlessingOfHeaven[/i]

Let \(f:\{0, 1\}^n \to \{0, 1\} \subseteq \mathbb{R}\) be a function. Call such a function a Boolean function. Let \(\wedge\) denote the component-wise multiplication in \(\{0,1\}^n\). For example, for \(n = 4\), \[(0,0,1,1) \wedge (0,1,0,1) = (0,0,0,1).\] Let \(S = \left\{i_1,i_2,\ldots ,i_k\right\} \subseteq \left\{1,2,\ldots ,n\right\}\). \(f\) is called the oligarchy function over \(S\) if \[f (x) = x_{i_1},x_{i_2},\ldots,x_{i_k}\ \text{ (with the usual multiplication),}\] where \(x_i\) denotes the \(i\)-th component of \(x\). By convention, \(f\) is called the oligarchy function over \(\emptyset\) if \(f\) is constantly 1. (i) Suppose \(f\) is not constantly zero. Show that \(f\) is an oligarchy function [u]if and only if[/u] \(f\) satisfies \[f(x\wedge y)=f(x)f(y),\ \forall x,y\in\left\{0,1\right\}^n.\] Let \(Y\) be a uniformly distributed random variable over \(\left\{0, 1\right\}^n\). Let \(T\) be an operator that maps Boolean functions to functions \(\left\{0, 1\right\}^n\to\mathbb{R}\), such that \[(Tf)(x)=E_Y(f(x\wedge Y)),\ \forall x\in\left\{0,1\right\}^n\] where \(E_Y()\) denotes the expectation over \(Y\). \(f\) is called an eigenfunction of \(T\) if \(\exists\lambda\in\mathbb{R}\backslash\left\{0\right\}\) such that \[(Tf)(x)=\lambda f(x),\ \forall x\in\left\{0,1\right\}^n\] (ii) Prove that \(f\) is an eigenfunction of \(T\) [u]if and only if[/u] \(f\) is an oligarchy function.

A two digit prime number is such that the sum of its digits is $13.$ Determine the integer.

Let $(a_n)_{n \in \mathbb{N}}$ be a sequence of integers. Define $a_n^{(0)} = a_n$ for all $n \in \mathbb{N}$. For all $M \geq 0$, we define $(a_n^{(M + 1)})_{n \in \mathbb{N}}:\, a_n^{(M + 1)} = a_{n + 1}^{(M)} - a_n^{(M)}, \forall n \in \mathbb{N}$. We say that $(a_n)_{n \in \mathbb{N}}$ is $\textrm{(M + 1)-self-referencing}$ if there exists $k_1$ and $k_2$ fixed positive integers such that $a_{n + k_1} = a_{n + k_2}^{(M + 1)}, \forall n \in \mathbb{N}$. (a) Does there exist a sequence of integers such that the smallest $M$ such that it is $\textrm{M-self-referencing}$ is $M = 2022$? (a) Does there exist a stricly positive sequence of integers such that the smallest $M$ such that it is $\textrm{M-self-referencing}$ is $M = 2022$?