Show that for every real function f in 1-period $L^2(0, 1)$ there exist three functions $g_1, g_2, g_3$ with the same properties and constants $c_0, c_1, c_2, c_3$ satisfying $$f(x)=c_0+\sum_{i=1}^3(g_i(x+c_i)-g_i(x))$$

Let $\mathbb{R}[x]$ be the set of all polynomials with real coefficients. Find all functions $f: \mathbb{R}[x] \rightarrow \mathbb{R}[x]$ satisfying the following conditions: [list] [*] $f$ maps the zero polynomial to itself, [*] for any non-zero polynomial $P \in \mathbb{R}[x]$, $\text{deg} \, f(P) \le 1+ \text{deg} \, P$, and [*] for any two polynomials $P, Q \in \mathbb{R}[x]$, the polynomials $P-f(Q)$ and $Q-f(P)$ have the same set of real roots. [/list] [i]Proposed by Anant Mudgal, Sutanay Bhattacharya, Pulkit Sinha[/i]

(a) Let $a,x,y$ be positive integers. Prove: if $x\ne y$, the also \[ax+\gcd(a,x)+\text{lcm}(a,x)\ne ay+\gcd(a,y)+\text{lcm}(a,y).\] (b) Show that there are no two positive integers $a$ and $b$ such that \[ab+\gcd(a,b)+\text{lcm}(a,b)=2014.\]

A rectangular board of 8 columns has squared numbered beginning in the upper left corner and moving left to right so row one is numbered 1 through 8, row two is 9 through 16, and so on. A student shades square 1, then skips one square and shades square 3, skips two squares and shades square 6, skips 3 squares and shades square 10, and continues in this way until there is at least one shaded square in each column. What is the number of the shaded square that first achieves this result? [asy] unitsize(20); for(int a = 0; a < 10; ++a) { draw((0,a)--(8,a)); } for (int b = 0; b < 9; ++b) { draw((b,0)--(b,9)); } draw((0,0)--(0,-.5)); draw((1,0)--(1,-1.5)); draw((.5,-1)--(1.5,-1)); draw((2,0)--(2,-.5)); draw((4,0)--(4,-.5)); draw((5,0)--(5,-1.5)); draw((4.5,-1)--(5.5,-1)); draw((6,0)--(6,-.5)); draw((8,0)--(8,-.5)); fill((0,8)--(1,8)--(1,9)--(0,9)--cycle,black); fill((2,8)--(3,8)--(3,9)--(2,9)--cycle,black); fill((5,8)--(6,8)--(6,9)--(5,9)--cycle,black); fill((1,7)--(2,7)--(2,8)--(1,8)--cycle,black); fill((6,7)--(7,7)--(7,8)--(6,8)--cycle,black); label("$2$",(1.5,8.2),N); label("$4$",(3.5,8.2),N); label("$5$",(4.5,8.2),N); label("$7$",(6.5,8.2),N); label("$8$",(7.5,8.2),N); label("$9$",(0.5,7.2),N); label("$11$",(2.5,7.2),N); label("$12$",(3.5,7.2),N); label("$13$",(4.5,7.2),N); label("$14$",(5.5,7.2),N); label("$16$",(7.5,7.2),N); [/asy] $\text{(A)}\ 36 \qquad \text{(B)}\ 64 \qquad \text{(C)}\ 78 \qquad \text{(D)}\ 91 \qquad \text{(E)}\ 120$

A function $f : \mathbb{Z}_+ \to \mathbb{Z}_+$, where $\mathbb{Z}_+$ is the set of positive integers, is non-decreasing and satisfies $f(mn) = f(m)f(n)$ for all relatively prime positive integers $m$ and $n$. Prove that $f(8)f(13) \ge (f(10))^2$.

Let $\pi$ be the set of points in a plane and $f : \pi \to \pi$ be a mapping such that the image of any triangle (as its polygonal line) is a square. Show that $f(\pi)$ is a square.

Let $f:(0,\infty)\to(0,\infty)$ be a function satisfying $f\bigl(xf(y)\bigr)+f\bigl(yf(x)\bigr)=2xy$ for all $x,y>0$. Show that $f(x) = x$ for all positive $x$.

Let $f:[0,1]\rightarrow\mathbb{R}$ be a continuous function. Define $\tilde{f}:[0,1]\rightarrow\mathbb{R}$ as $$\tilde{f}(x)=\begin{dcases} \frac{1}{x}\cdot\int_0^x f(t)dt &\text{ for } x>0;\\ f(0) &\text{ for }x=0.\end{dcases}$$ Show that: [list=a] [*] $\tilde{f}$ is continuous in $0$ and differentiable on $(0,1]$. [*] the following equality takes place: $$\int_0^1 f^2(x)dx = \left(\int_0^1 f(x)dx\right)^2 + \int_0^1 \left(f(x)-\tilde{f}(x)\right)^2dx.$$

Express $\int_0^2 f(x)dx$ for any quadratic functions $f(x)$ in terms of $f(0),\ f(1)$ and $f(2).$

Let $n \geq 2, n \in \mathbb{N}$, $a,b,c,d \in \mathbb{N}$, $\frac{a}{b} + \frac{c}{d} < 1$ and $a + c \leq n,$ find the maximum value of $\frac{a}{b} + \frac{c}{d}$ for fixed $n.$

Let $k>1$ be an integer. A function $f:\mathbb{N^*}\to\mathbb{N^*}$ is called $k$-[i]tastrophic[/i] when for every integer $n>0$, we have $f_k(n)=n^k$ where $f_k$ is the $k$-th iteration of $f$: \[f_k(n)=\underbrace{f\circ f\circ\cdots \circ f}_{k\text{ times}}(n)\] For which $k$ does there exist a $k$-tastrophic function?

Find all pairs of twice differentiable functions $f,g \colon \mathbb{R} \to \mathbb{R}$, with their second derivative being continuous, such that the following holds for all $x,y \in \mathbb{R}$: \[(f(x)-g(y))(f'(x)-g'(y))(f''(x)-g''(y))=0\]

Evaluate the infinite sum \[\sum_{n \equal{} 0}^\infty \binom{2n}{n}\frac {1}{5^n}.\]

If $k$ and $n$ are positive integers , and $k \leq n$ , let $M(n,k)$ denote the least common multiple of the numbers $n , n-1 , \ldots , n-k+1$.Let $f(n)$ be the largest positive integer $ k \leq n$ such that $M(n,1)<M(n,2)<\ldots <M(n,k)$ . Prove that : [b](a)[/b] $f(n)<3\sqrt{n}$ for all positive integers $n$ . [b](b)[/b] If $N$ is a positive integer , then $f(n) > N$ for all but finitely many positive integers $n$.

At a chess tournament the winner gets 1 point and the defeated one 0 points. A tie makes both obtaining $\frac{1}{2}$ points. 14 players, none of them equally aged, participated in a competition where everybody played against all the other players. After the competition a ranking was carried out. Of the two players with the same number of points the younger received the better ranking. After the competition Jan realizes that the best three players together got as many points as the last 9 players obtained points together. And Joerg noted that the number of ties was maximal. Determine the number of ties.