There is a unique ordered triple of real numbers $(a, b, c)$ that makes the piecewise function \begin{align*} f(x) = \begin{cases} (x - a)^2 + b & \text{if } x \geq c \\ x^3 - x & \text{if } x < c \end{cases} \end{align*} twice continuously differentiable for all real $x.$ The value of $a + b + c$ can be expressed as a common fraction $p/q.$ Compute $p + q.$

Suppose that $a_{1},a_{2},\dots,a_{k}\in\mathbb C$ that for each $1\leq i\leq k$ we know that $|a_{k}|=1$. Suppose that \[\lim_{n\to\infty}\sum_{i=1}^{k}a_{i}^{n}=c.\] Prove that $c=k$ and $a_{i}=1$ for each $i$.

Let $A=\{a_1,a_2,\cdots,a_{2010}\}$ and $B=\{b_1,b_2,\cdots,b_{2010}\}$ be two sets of complex numbers. Suppose \[\sum_{1\leq i<j\leq 2010} (a_i+a_j)^k=\sum_{1\leq i<j\leq 2010}(b_i+b_j)^k\] holds for every $k=1,2,\cdots, 2010$. Prove that $A=B$.

Let $ f:[0,1]\longrightarrow\mathbb{R} $ be a continuous function such that $$ \int_0^1 f(x)g(x)dx =\int_0^1 f(x)dx\cdot\int_0^1 g(x)dx , $$ for all functions $ g:[0,1]\longrightarrow\mathbb{R} $ that are continuous and non-differentiable. Prove that $ f $ is constant.

Find all non-decreasing functions $f:\mathbb R^+\cup\{0\}\rightarrow\mathbb R^+\cup\{0\}$ such that for each $x,y\in \mathbb R^+\cup\{0\}$ \[f\left(\frac{x+f(x)}2+y\right)=2x-f(x)+f(f(y)).\]

Let $f: (0,+\infty)\rightarrow (0,+\infty)$ be a function satisfying the following condition: for arbitrary positive real numbers $x$ and $y$, we have $f(xy)\le f(x)f(y)$. Show that for arbitrary positive real number $x$ and natural number $n$, inequality $f(x^n)\le f(x)f(x^2)^{\dfrac{1}{2}}\dots f(x^n)^{\dfrac{1}{n}}$ holds.

Find all functions $f$ from the reals into the reals such that \[ f(ab) = f(a+b) \] for all irrational $a, b$.

Consider the function $f$ defined by \[f(n)=\frac{1}{n}\left (\left \lfloor\frac{n}{1}\right \rfloor+\left \lfloor\frac{n}{2}\right \rfloor+\cdots+\left \lfloor\frac{n}{n}\right \rfloor \right )\] for all positive integers $n$. (Here $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.) Prove that (a) $f(n+1)>f(n)$ for infinitely many $n$. (b) $f(n+1)<f(n)$ for infinitely many $n$.

There are $n$ people standing on a circular track. We want to perform a number of [i]moves[/i] so that we end up with a situation where the distance between every two neighbours is the same. The [i]move[/i] that is allowed consists in selecting two people and asking one of them to walk a distance $d$ on the circular track clockwise, and asking the other to walk the same distance on the track anticlockwise. The two people selected and the quantity $d$ can vary from move to move. Prove that it is possible to reach the desired situation (where the distance between every two neighbours is the same) after at most $n-1$ moves.

A collection of circles in the upper half-plane, all tangent to the $x$-axis, is constructed in layers as follows. Layer $L_0$ consists of two circles of radii $70^2$ and $73^2$ that are externally tangent. For $k\geq 1$, the circles in $\textstyle\bigcup_{j=0}^{k-1} L_j$ are ordered according to their points of tangency with the $x$-axis. For every pair of consecutive circles in this order, a new circle is constructed externally tangent to each of the two circles in the pair. Layer $L_k$ consists of the $2^{k-1}$ circles constructed in this way. Let $S=\textstyle\bigcup_{j=0}^6 L_j$, and for every circle $C$ denote by $r(C)$ its radius. What is \[\sum_{C\in S}\dfrac1{\sqrt{r(C)}}?\] [asy] import olympiad; size(350); defaultpen(linewidth(0.7)); // define a bunch of arrays and starting points pair[] coord = new pair[65]; int[] trav = {32,16,8,4,2,1}; coord[0] = (0,73^2); coord[64] = (2*73*70,70^2); // draw the big circles and the bottom line path arc1 = arc(coord[0],coord[0].y,260,360); path arc2 = arc(coord[64],coord[64].y,175,280); fill((coord[0].x-910,coord[0].y)--arc1--cycle,gray(0.78)); fill((coord[64].x+870,coord[64].y+425)--arc2--cycle,gray(0.78)); draw(arc1^^arc2); draw((-930,0)--(70^2+73^2+850,0)); // We now apply the findCenter function 63 times to get // the location of the centers of all 63 constructed circles. // The complicated array setup ensures that all the circles // will be taken in the right order for(int i = 0;i<=5;i=i+1) { int skip = trav[i]; for(int k=skip;k<=64 - skip; k = k + 2*skip) { pair cent1 = coord[k-skip], cent2 = coord[k+skip]; real r1 = cent1.y, r2 = cent2.y, rn=r1*r2/((sqrt(r1)+sqrt(r2))^2); real shiftx = cent1.x + sqrt(4*r1*rn); coord[k] = (shiftx,rn); } // Draw the remaining 63 circles } for(int i=1;i<=63;i=i+1) { filldraw(circle(coord[i],coord[i].y),gray(0.78)); }[/asy] $\textbf{(A) }\dfrac{286}{35}\qquad\textbf{(B) }\dfrac{583}{70}\qquad\textbf{(C) }\dfrac{715}{73}\qquad\textbf{(D) }\dfrac{143}{14}\qquad\textbf{(E) }\dfrac{1573}{146}$

Let $a$ and $b$ be positive integers such that $ab+1$ divides $a^{2}+b^{2}$. Show that \[\frac{a^{2}+b^{2}}{ab+1}\] is the square of an integer.

Compute the value of the expression \[ 2009^4 \minus{} 4 \times 2007^4 \plus{} 6 \times 2005^4 \minus{} 4 \times 2003^4 \plus{} 2001^4 \, .\]

Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that \[f\left( {yf(x + y) + f(x)} \right) = 4x + 2yf(x + y)\] for all $x,y\in\mathbb{R}$. [i]Netherlands (Birgit van Dalen)[/i]

Let be a number $ a\in \left[ 1,\infty \right) $ and a function $ f\in\mathcal{C}^2(-a,a) . $ Show that the sequence $$ \left( \sum_{k=1}^n f\left( \frac{k}{n^2} \right) \right)_{n\ge 1} $$ is convergent, and determine its limit.

[b]a)[/b] Show that two real numbers $ x,y>1 $ chosen so that $ x^y=y^x, $ are equal or there exists a positive real number $ m\neq 1 $ such that $ x=m^{\frac{1}{m-1}} $ and $ y=m^{\frac{m}{m-1}} . $ [b]b)[/b] Solve in $ \left( 1,\infty \right)^2 $ the equation: $ x^y+x^{x^{y-1}}=y^x+y^{y^{x-1}} . $

Prove that there exists a positive real number $C$ with the following property: for any integer $n\ge 2$ and any subset $X$ of the set $\{1,2,\ldots,n\}$ such that $|X|\ge 2$, there exist $x,y,z,w \in X$(not necessarily distinct) such that \[0<|xy-zw|<C\alpha ^{-4}\] where $\alpha =\frac{|X|}{n}$.

Let $ f: [0,1]^2\to\mathbb{R}$ be a continuous function on the closed unit square such that $ \frac{\partial f}{\partial x}$ and $ \frac{\partial f}{\partial y}$ exist and are continuous on the interior of $ (0,1)^2.$ Let $ a\equal{}\int_0^1f(0,y)\,dy,\ b\equal{}\int_0^1f(1,y)\,dy,\ c\equal{}\int_0^1f(x,0)\,dx$ and $ d\equal{}\int_0^1f(x,1)\,dx.$ Prove or disprove: There must be a point $ (x_0,y_0)$ in $ (0,1)^2$ such that $ \frac{\partial f}{\partial x}(x_0,y_0)\equal{}b\minus{}a$ and $ \frac{\partial f}{\partial y}(x_0,y_0)\equal{}d\minus{}c.$

Let $F = \max_{1 \leq x \leq 3} |x^3 - ax^2 - bx - c|$. When $a$, $b$, $c$ run over all the real numbers, find the smallest possible value of $F$.

The number of functions $g:\mathbb{R}^4\to\mathbb{R}$ such that, $\forall a,b,c,d,e,f\in\mathbb{R}$ : (i) $g(1,0,0,1)=1$ (ii) $g(ea,b,ec,d)=eg(a,b,c,d)$ (iii) $g(a+e, b, c+f, d)= g(a,b,c,d)+g(e,b,f,d)$ (iv) $g(a,b,c,d)+g(b,a,d,c)=0$ is : (A)$1$ (B)$0$ (C)$\text{infinitely many}$ (D)$\text{None of these}$ [Hide=Hint(given in question)] Think of matrices[/hide]

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function satisfying the following conditions: (1) $f(1)=1$; (2) $\forall n\in \mathbb{N}$, $3f(n) f(2n+1) =f(2n) ( 1+3f(n) )$; (3) $\forall n\in \mathbb{N}$, $f(2n) < 6 f(n)$. Find all solutions of equation $f(k) +f(l)=293$, where $k<l$. ($\mathbb{N}$ denotes the set of all natural numbers).

Every day, some pairs of families living in a city may choose to exchange their apartments. A family may only participate in one exchange in a day. Prove that any complex exchange of apartments between several families can be carried out in two days. [i]Proposed by N. Konstantinov and A. Shnirelman[/i]

For positive rational $x$, if $x$ is written in the form $p/q$ with $p, q$ positive relatively prime integers, define $f(x)=p+q$. For example, $f(1)=2$. a) Prove that if $f(x)=f(mx/n)$ for rational $x$ and positive integers $m, n$, then $f(x)$ divides $|m-n|$. b) Let $n$ be a positive integer. If all $x$ which satisfy $f(x)=f(2^nx)$ also satisfy $f(x)=2^n-1$, find all possible values of $n$. [i]Anderson Wang.[/i]

Find all the functions $f: \mathbb R \rightarrow \mathbb R$ satisfying : $(x+y)(f(x)-f(y))=(x-y)f(x+y)$ for all $x,y \in \mathbb R$

Determine all functions $f:\mathbb R\to\mathbb R$ such that \[f(xy-1)+f(x)f(y)=2xy-1,\]for any real numbers $x{}$ and $y{}.$

Find all reals $A,B,C$ such that there exists a real function $f$ satisfying $f(x+f(y))= Ax+By+C$ for all reals $x,y$.