Let $n$ be a positive integer and let $\alpha_n $ be the number of $1$'s within binary representation of $n$. Show that for all positive integers $r$, \[2^{2n-\alpha_n}\phantom{-1} \bigg|^{\phantom{0}}_{\phantom{-1}} \sum_{k=-n}^{n} \binom{2n}{n+k} k^{2r}.\]

A fox stands in the centre of the field which has the form of an equilateral triangle, and a rabbit stands at one of its vertices. The fox can move through the whole field, while the rabbit can move only along the border of the field. The maximal speeds of the fox and rabbit are equal to $u$ and $v$, respectively. Prove that: (a) If $2u>v$, the fox can catch the rabbit, no matter how the rabbit moves. (b) If $2u\le v$, the rabbit can always run away from the fox.

Let $\mathbb Z$ be the set of all integers. Find all functions $f:\mathbb Z\to\mathbb Z$ satisfying the following conditions: 1. $f(f(x))=xf(x)-x^2+2$ for all $x\in\mathbb Z$; 2. $f$ takes all integer values. [i](I. Voronovich)[/i]

A natural number $k > 1$ is called [i]good[/i] if there exist natural numbers $$a_1 < a_2 < \cdots < a_k$$ such that $$\dfrac{1}{\sqrt{a_1}} + \dfrac{1}{\sqrt{a_2}} + \cdots + \dfrac{1}{\sqrt{a_k}} = 1$$. Let $f(n)$ be the sum of the first $n$ [i][good[/i] numbers, $n \geq$ 1. Find the sum of all values of $n$ for which $f(n+5)/f(n)$ is an integer.

For any two rational numbers $ p$ and $ q$ in the interval $ (0,1)$ and function $ f$, there is always $ \displaystyle f \left( \frac{p\plus{}q}{2} \right) \leq \frac{f(p) \plus{} f(q)}{2}$. Then prove that for any rational numbers $ \lambda, x_1, x_2 \in (0,1)$, there is always: \[ f( \lambda x_1 \plus{} (1\minus{}\lambda) x_2 ) \leq \lambda f(x_i) \plus{} (1\minus{}\lambda) f(x_2)\]

The sequence $f_1, f_2, \cdots, f_n, \cdots $ of functions is defined for $x > 0$ recursively by \[f_1(x)=x , \quad f_{n+1}(x) = f_n(x) \left(f_n(x) + \frac 1n \right)\] Prove that there exists one and only one positive number $a$ such that $0 < f_n(a) < f_{n+1}(a) < 1$ for all integers $n \geq 1.$

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying relation : $$f(xf(y)-f(x))=2f(x)+xy$$ $\forall x,y \in \mathbb{R}$

Find all functions $f: \mathbb{Q}\to \mathbb{Q}$ such that for all $x,y \in \mathbb{Q}$: \[f(x+y)+f(x-y)=2(f(x)+f(y)).\]

Let $ABC$ be a triangle and $M,N,P$ be the midpoints of sides $BC, CA, AB$. The lines $AM, BN, CP$ meet the circumcircle of $ABC$ in the points $A_{1}, B_{1}, C_{1}$. Show that the area of triangle $ABC$ is at most the sum of areas of triangles $BCA_{1}, CAB_{1}, ABC_{1}$.

Let $f\left(x\right)=x^2-14x+52$ and $g\left(x\right)=ax+b$, where $a$ and $b$ are positive. Find $a$, given that $f\left(g\left(-5\right)\right)=3$ and $f\left(g\left(0\right)\right)=103$. $\text{(A) }2\qquad\text{(B) }5\qquad\text{(C) }7\qquad\text{(D) }10\qquad\text{(E) }17$

Let $f:[0,\infty)\to\mathbb R$ be a differentiable function with $|f(x)|\le M$ and $f(x)f'(x)\ge\cos x$ for $x\in[0,\infty)$, where $M>0$. Prove that $f(x)$ does not have a limit as $x\to\infty$.

Let $\phi(n,m), m \neq 1$, be the number of positive integers less than or equal to $n$ that are coprime with $m.$ Clearly, $\phi(m,m) = \phi(m)$, where $\phi(m)$ is Euler’s phi function. Find all integers $m$ that satisfy the following inequality: \[\frac{\phi(n,m)}{n} \geq \frac{\phi(m)}{m}\] for every positive integer $n.$

Let $ f : \mathbb{R}\to \mathbb{R}$ be a continuous function. Suppose that for any $ c > 0$, the graph of $ f$ can be moved to the graph of $ cf$ using only a translation or a rotation. Does this imply that $ f(x) = ax+b$ for some real numbers $ a$ and $ b$?

Let $n$ be a given integer greater than two, and let $S = \{1, 2,...,n\}$. Suppose the function $f : S^k \to S$ has the property that $f(a) \ne f(b)$ for every pair $a$ and $b$ of elements in $S^k$ with $a$ and $b$ differ in all components. Prove that $f$ is a function of one of its elements.

The following light grid is given: \begin{tabular}{cccc} o & o & o & o \\ o & o & o & o \\ o & o & o & o \\ o & o & o & o \end{tabular} where `o` represents a switched-off light and `•` represents a switched-on light. Each time a light is pressed, it toggles its state (on/off) as well as the state of its four adjacent neighbors (left, right, above, below). The bottom edge lights are considered to be immediately above the top edge lights, and the same applies to the lateral edges.The right figure illustrates the effect of pressing a light in a corner. Pressing a certain combination of lights results in all lights turning on. Prove that all lights must have been pressed at least once.

For positive integers $ m$ and $ n$, let $ f\left(m,n\right)$ denote the number of $ n$-tuples $ \left(x_1,x_2,\dots,x_n\right)$ of integers such that $ \left|x_1\right| \plus{} \left|x_2\right| \plus{} \cdots \plus{} \left|x_n\right|\le m$. Show that $ f\left(m,n\right) \equal{} f\left(n,m\right)$.

Show that there is no integer-valued function on the integers such that $f(m+f(n))=f(m)-n$ for all $m,n$.

Let $ f$ and $ g$ be two integer-valued functions defined on the set of all integers such that [i](a)[/i] $ f(m \plus{} f(f(n))) \equal{} \minus{}f(f(m\plus{} 1) \minus{} n$ for all integers $ m$ and $ n;$ [i](b)[/i] $ g$ is a polynomial function with integer coefficients and g(n) = $ g(f(n))$ $ \forall n \in \mathbb{Z}.$

Let $ABCD$ be a quadrilateral with $AD = 20$ and $BC = 13$. The area of $\triangle ABC$ is $338$ and the area of $\triangle DBC$ is $212$. Compute the smallest possible perimeter of $ABCD$. [i]Proposed by Evan Chen[/i]

Find all functions $f:\mathbb{N} \to \mathbb{N}$ such that for any two positive integers $a$ and $b$ we have $$ f^a(b) + f^b(a) \mid 2(f(ab) +b^2 -1)$$ Where $f^n(m)$ is defined in the standard iterative manner.

Let $ \mathcal{A}_n$ denote the set of all mappings $ f: \{1,2,\ldots ,n \} \rightarrow \{1,2,\ldots, n \}$ such that $ f^{-1}(i) :=\{ k \colon f(k)=i\ \} \neq \varnothing$ implies $ f^{-1}(j) \neq \varnothing, j \in \{1,2,\ldots, i \} .$ Prove \[ |\mathcal{A}_n| = \sum_{k=0}^{\infty} \frac{k^n}{2^{k+1}}.\] [i]L. Lovasz[/i]

Let $k,n$ and $r$ be positive integers. (a) Let $Q(x)=x^k+a_1x^{k+1}+\cdots+a_nx^{k+n}$ be a polynomial with real coefficients. Show that the function $\frac{Q(x)}{x^k}$ is strictly positive for all real $x$ satisfying $$0<|x|<\frac1{1+\sum\limits_{i=1}^n |a_i|}$$ (b) Let $P(x)=b_0+b_1x+\cdots+b_rx^r$ be a non zero polynomial with real coefficients. Let $m$ be the smallest number such that $b_m \neq 0$. Prove that the graph of $y=P(x)$ cuts the $x$-axis at the origin (i.e., $P$ changes signs at $x=0$) if and only if $m$ is an odd integer.

Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ such that for all real numbers $ x,y$: $ x f(x)\minus{}yf(y)\equal{}(x\minus{}y)f(x\plus{}y)$.

A $(2n + 1) \times (2n + 1)$ grid, with $n> 0$, is colored in such a way that each of the cell is white or black. A cell is called [i]special[/i] if there are at least $n$ other cells of the same color in its row, and at least another $n$ cells of the same color in its column. (a) Prove that there are at least $2n + 1$ special boxes. (b) Provide an example where there are at most $4n$ special cells. (c) Determine, as a function of $n$, the minimum possible number of special cells.

The function $f(x,y)$, defined on the set of all non-negative integers, satisfies (i) $f(0,y)=y+1$ (ii) $f(x+1,0)=f(x,1)$ (iii) $f(x+1,y+1)=f(x,f(x+1,y))$ Find f(3,2005), f(4,2005)