A function $f:\mathbb{Z}\implies\mathbb{Z}$ satisfies $f(x+4)-f(x)=8x+20$ $f(x^2-1)=(f(x)-x)^2+x^2-2$ Find $f(0)$ and $f(1)$.

Does there exist a positive integer $n>10^{100}$, such that $n^2$ and $(n+1)^2$ satisfy the following property: every digit occurs equal number of times in the decimal representations of each number?

$a_{0}=2,a_{1}=1$ and for $n\geq 1$ we know that : $a_{n+1}=a_{n}+a_{n-1}$ $m$ is an even number and $p$ is prime number such that $p$ divides $a_{m}-2$. Prove that $p$ divides $a_{m+1}-1$.

Let $a$ and $b$ be two-digit positive integers. Find the greatest possible value of $a+b$, given that the greatest common factor of $a$ and $b$ is $6$. [i]Proposed by Jacob Xu[/i] [hide=Solution][i]Solution[/i]. $\boxed{186}$ We can write our two numbers as $6x$ and $6y$. Notice that $x$ and $y$ must be relatively prime. Since $6x$ and $6y$ are two digit numbers, we just need to check values of $x$ and $y$ from $2$ through $16$ such that $x$ and $y$ are relatively prime. We maximize the sum when $x = 15$ and $y = 16$, since consecutive numbers are always relatively prime. So the sum is $6 \cdot (15+16) = \boxed{186}$.[/hide]

$32$ teams, ranked $1$ through $32$, enter a basketball tournament that works as follows: the teams are randomly paired and in each pair, the team that loses is out of the competition. The remaining $16$ teams are randomly paired, and so on, until there is a winner. A higher ranked team always wins against a lower-ranked team. If the probability that the team ranked $3$ (the third-best team) is one of the last four teams remaining can be written in simplest form as $\dfrac{m}{n}$, compute $m+n$.

Let $f(x)=x^2-2$ and let $f^{(n)}(x)$ denote the $n$-th iteration of $f$. Let $H=\{x:f^{(100)}(x)\leq -1\}$. Find the length of $H$ (the sum of the lengths of the intervals of $H$).

Find all solutions of the equation $(a^a)^5 = b^b$ in positive integers.

Let $ABC$ be an acute triangle. Let $\omega$ be a circle whose centre $L$ lies on the side $BC$. Suppose that $\omega$ is tangent to $AB$ at $B'$ and $AC$ at $C'$. Suppose also that the circumcentre $O$ of triangle $ABC$ lies on the shorter arc $B'C'$ of $\omega$. Prove that the circumcircle of $ABC$ and $\omega$ meet at two points. [i]Proposed by Härmel Nestra, Estonia[/i]

The sequence of integers $ a_1 $, $ a_2 $, $ \dots $ is defined as follows: $ a_1 = 1 $ and $ n> 1 $, $ a_ {n + 1} $ is the smallest integer greater than $ a_n $ and such, that $ a_i + a_j \neq 3a_k $ for any $ i, j $ and $ k $ from $ \{1, 2, \dots, n + 1 \} $ are not necessarily different. Define $ a_ {2004} $.

A triangle has vertices $ (0,0)$, $ (1,1)$, and $ (6m,0)$, and the line $ y \equal{} mx$ divides the triangle into two triangles of equal area. What is the sum of all possible values of $ m$? $ \textbf{(A)}\minus{} \!\frac {1}{3} \qquad \textbf{(B)} \minus{} \!\frac {1}{6} \qquad \textbf{(C)}\ \frac {1}{6} \qquad \textbf{(D)}\ \frac {1}{3} \qquad \textbf{(E)}\ \frac {1}{2}$

We attach to the vertices of a regular hexagon the numbers $1$, $0$, $0$, $0$, $0$, $0$. Now, we are allowed to transform the numbers by the following rules: (a) We can add an arbitrary integer to the numbers at two opposite vertices. (b) We can add an arbitrary integer to the numbers at three vertices forming an equilateral triangle. (c) We can subtract an integer $t$ from one of the six numbers and simultaneously add $t$ to the two neighbouring numbers. Can we, just by acting several times according to these rules, get a cyclic permutation of the initial numbers? (I. e., we started with $1$, $0$, $0$, $0$, $0$, $0$; can we now get $0$, $1$, $0$, $0$, $0$, $0$, or $0$, $0$, $1$, $0$, $0$, $0$, or $0$, $0$, $0$, $1$, $0$, $0$, or $0$, $0$, $0$, $0$, $1$, $0$, or $0$, $0$, $0$, $0$, $0$, $1$ ?)

Find all possible values of $k $ such that there exist a $k\times k$ table colored in $k$ colors such that there do not exist two cells in a column or a row with the same color or four cells made of intersecting two columns and two rows painted in exactly three colors.

Let $x_1$, $x_2$, $\cdots$, $x_n$ be positive real numbers, and let \[ S = x_1 + x_2 + \cdots + x_n. \] Prove that \[ (1 + x_1)(1 + x_2) \cdots (1 + x_n) \leq 1 + S + \frac{S^2}{2!} + \frac{S^3}{3!} + \cdots + \frac{S^n}{n!} \]

Given a positive integer whose base-$10$ representation is $\overline{d_k\ldots d_0}$ for some integer $k \geq 0$, where $d_k \neq 0$, a move consists of selecting some integers $0 \leq i \leq j \leq k$, such that the digits $d_j,\ldots,d_i$ are not all $0$, erasing them from $n$, and replacing them with a divisor of $\overline{d_j\ldots d_i}$ (this divisor need not have the same number of digits as $\overline{d_j\ldots d_i}$). Prove that for all sufficiently large even integers $n$, we may apply some sequence of moves to $n$ to transform it into $2024$. [i]Allen Wang[/i]

Determine all positive integers$ n$ such that $f_n(x,y,z) = x^{2n} + y^{2n} + z^{2n} - xy - yz - zx$ divides $g_n(x,y, z) = (x - y)^{5n} + (y -z)^{5n} + (z - x)^{5n}$, as polynomials in $x, y, z$ with integer coefficients.

The perimeter of $\triangle ABC$ is $2$ and it's sides are $BC=a, CA=b,AB=c$. Prove that $$abc+\frac{1}{27}\ge ab+bc+ca-1\ge abc. $$