Find all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ which satisfy \[ f(m + f(n)) = f(m) + n \] for all $m,n \in \mathbb{Z}$.

Can the set of lattice points $\{(x, y) \mid x, y \in \mathbb{Z}, 1 \le x, y \le 252, x \neq y\}$ be colored using 10 distinct colors such that for all $a \neq b$, $b \neq c$, the colors of $(a, b)$ and $(b, c)$ are distinct?

Let \[P(m)=\frac{m}{2} + \frac{m^2}{4}+ \frac{m^4}{8} + \frac{m^8}{8}.\] How many of the values of $P(2022)$, $P(2023)$, $P(2024)$, and $P(2025)$ are integers? $ \textbf{(A) }0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4 \qquad $

Let $a$ and $n$ be positive integers such that the greatest common divisor of $a$ and $n!$ is $1$. Prove that $n!$ divides $a^{n!}-1$.

Let $a$, $b$, and $n$ be positive integers with $\gcd (a, b)=1$. Without using Dirichlet's theorem, show that there are infinitely many $k \in \mathbb{N}$ such that $\gcd(ak+b, n)=1$.

Prove that the sequence $(a_n)$, where $$a_n=\sum_{k=1}^n\left\{\frac{\left\lfloor2^{k-\frac12}\right\rfloor}2\right\}2^{1-k},$$converges, and determine its limit as $n\to\infty$.

In neverland, there are $n$ cities and $n$ airlines. Each airline serves an odd number of cities in a circular way, that is, if it serves cities $c_1,c_2,\dots,c_{2k+1}$, then they fly planes connecting $c_1c_2,c_2c_3,\dots,c_1c_{2k+1}$. Show that we can select an odd number of cities $d_1,d_2,\dots,d_{2m+1}$ such that we can fly $d_1\rightarrow d_2\rightarrow\dots\rightarrow d_{2m+1}\rightarrow d_1$ while using each airline at most once.

Given a tetrahedron $A_1A_2A_3A_4$, define an $A_1$-exsphere such a sphere that is tangent to all planes given by faces of the tetrahedron and the vertex $A_1$ and the sphere are separated by the plane $A_2A_3A_4.$ Denote $\varrho_1,\ldots,\varrho_4$ of all four exspheres. Furthermore, denote $v_i, i=1,\ldots,4$ the distance of the vertex $A_i$ from the opposite face. Show that \[2\left(\frac{1}{v_1}+\frac{1}{v_2}+\frac{1}{v_3}+\frac{1}{v_4}\right)=\frac{1}{\varrho_1}+\frac{1}{\varrho_2}+\frac{1}{\varrho_3}+\frac{1}{\varrho_4}.\]

The $16$ squares on a piece of paper are numbered as shown in the diagram. While lying on a table, the paper is folded in half four times in the following sequence: [list=1] [*]fold the top half over the bottom half [*]fold the bottom half over the top half [*]fold the right half over the left half [*]fold the left half over the right half.[/list] Which numbered square is on top after step $4$? [asy] unitsize(18); for(int a=0; a<5; ++a) { draw((a,0)--(a,4)); } for(int b=0; b<5; ++b) { draw((0,b)--(4,b)); } label("$1$",(0.5,3.1),N); label("$2$",(1.5,3.1),N); label("$3$",(2.5,3.1),N); label("$4$",(3.5,3.1),N); label("$5$",(0.5,2.1),N); label("$6$",(1.5,2.1),N); label("$7$",(2.5,2.1),N); label("$8$",(3.5,2.1),N); label("$9$",(0.5,1.1),N); label("$10$",(1.5,1.1),N); label("$11$",(2.5,1.1),N); label("$12$",(3.5,1.1),N); label("$13$",(0.5,0.1),N); label("$14$",(1.5,0.1),N); label("$15$",(2.5,0.1),N); label("$16$",(3.5,0.1),N); [/asy] $\text{(A)}\ 1 \qquad \text{(B)}\ 9 \qquad \text{(C)}\ 10 \qquad \text{(D)}\ 14 \qquad \text{(E)}\ 16$

There are $m$ villages on the left bank of the Lena, $n$ villages on the right bank and one village on an island. It is known that $(m+1,n+1)>1$. Every two villages separated by water are connected by ferry with positive integral number. The inhabitants of each village say that all the ferries operating in their village have different numbers and these numbers form a segment of the series of the integers. Prove that at least some of them are wrong. [i](K. Kokhas)[/i]

Let $A_1A_2 \dots A_n$ a cyclic $n$-agon with center $O$ and $P$, $Q$ being two isogonal conjugates of it (i.e, $\angle PA_{i+1}A_i = \angle QA_{i+1}A_{i+2}$ for all $i$). Let $P_i$ be the circumcenter of $\triangle PA_iA_{i+1}$ and $Q_i$ the circumcenter of $\triangle QA_iA_{i+1}$ for all $i$. Prove that: $a) ~P_1P_2 \dots P_n$ and $Q_1Q_2 \dots Q_n$ are cyclic, with centers $O_P$ and $O_Q$, respectively. $b)~O, O_P$ and $O_Q$ are collinears. $c)~O_PO_Q \mid \mid PQ.$ Remark: indices are taken modulo $n$.

Let $M$ be a subset of $\{1,2,3... 2011\}$ satisfying the following condition: For any three elements in $M$, there exist two of them $a$ and $b$ such that $a|b$ or $b|a$. Determine the maximum value of $|M|$ where $|M|$ denotes the number of elements in $M$

Evaluate the sum $\frac{3!+4!}{2(1!+2!)}+\frac{4!+5!}{3(2!+3!)}+\cdots+\frac{12!+13!}{11(10!+11!)}$

Let $V$ be the set of all continuous functions $f\colon [0,1]\to \mathbb{R}$, differentiable on $(0,1)$, with the property that $f(0)=0$ and $f(1)=1$. Determine all $\alpha \in \mathbb{R}$ such that for every $f\in V$, there exists some $\xi \in (0,1)$ such that \[f(\xi)+\alpha = f'(\xi)\]

A Yule log is shaped like a right cylinder with height $10$ and diameter $5$. Freya cuts it parallel to its bases into $9$ right cylindrical slices. After Freya cut it, the combined surface area of the slices of the Yule log increased by $a\pi$. Compute $a$.

Let $ABCDEF$ be a regular hexagon of side length $3$. Let $X, Y,$ and $Z$ be points on segments $AB, CD,$ and $EF$ such that $AX=CY=EZ=1$. The area of triangle $XYZ$ can be expressed in the form $\dfrac{a\sqrt b}{c}$ where $a,b,c$ are positive integers such that $b$ is not divisible by the square of any prime and $\gcd(a,c)=1$. Find $100a+10b+c$. [i] Proposed by James Lin [/i]