Fix an integer $ b \geq 2$. Let $ f(1) \equal{} 1$, $ f(2) \equal{} 2$, and for each $ n \geq 3$, define $ f(n) \equal{} n f(d)$, where $ d$ is the number of base-$ b$ digits of $ n$. For which values of $ b$ does \[ \sum_{n\equal{}1}^\infty \frac{1}{f(n)} \] converge?

Let Q+ and Z denote the set of positive rationals and the set of inte- gers, respectively. Find all functions f : Q+ → Z satisfying the following conditions: (i) f(1999) = 1; (ii) f(ab) = f(a) + f(b) for all a, b ∈ Q+; (iii) f(a + b) ≥ min{f(a), f(b)} for all a, b ∈ Q+.

Suppose that n numbers $x_1, x_2, . . . , x_n$ are chosen randomly from the set $\{1, 2, 3, 4, 5\}$. Prove that the probability that $x_1^2+ x_2^2 +\cdots+ x_n^2 \equiv 0 \pmod 5$ is at least $\frac 15.$

Prove that for any integer $n$ one can find integers $a$ and $b$ such that \[n=\left[ a\sqrt{2}\right]+\left[ b\sqrt{3}\right] \]

For a sequence $u_1,u_2\dots,$ define $\Delta^1(u_n)=u_{n+1}-u_n$ and, for all integer $k>1$, $\Delta^k(u_n)=\Delta^1(\Delta^{k-1}(u_n))$. If $u_n=n^3+n$, then $\Delta^k(u_n)=0$ for all $n$ $\textbf{(A) }\text{if }k=1\qquad$ $\textbf{(B) }\text{if }k=2,\text{ but not if }k=1\qquad$ $\textbf{(C) }\text{if }k=3,\text{ but not if }k=2\qquad$ $\textbf{(D) }\text{if }k=4,\text{ but not if }k=3\qquad$ $\textbf{(E) }\text{for no value of }k$

Let $n \geq 1$ be an odd integer. Determine all functions $f$ from the set of integers to itself, such that for all integers $x$ and $y$ the difference $f(x)-f(y)$ divides $x^n-y^n.$ [i]Proposed by Mihai Baluna, Romania[/i]

Let $\mathbb{R}$ be the set of real numbers. Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function such that \[f(x+y)f(x-y)\geqslant f(x)^2-f(y)^2\] for every $x,y\in\mathbb{R}$. Assume that the inequality is strict for some $x_0,y_0\in\mathbb{R}$. Prove that either $f(x)\geqslant 0$ for every $x\in\mathbb{R}$ or $f(x)\leqslant 0$ for every $x\in\mathbb{R}$.

Prove that there exists a nonconstant function $ f:\mathbb{R}^2\longrightarrow\mathbb{R} $ verifying the following system of relations: $$ \left\{ \begin{matrix} f(x,x+y)=f(x,y) ,& \quad \forall x,y\in\mathbb{R} \\f(x,y+z)=f(x,y) +f(x,z) ,& \quad \forall x,y\in\mathbb{R} \end{matrix} \right. $$

Antonio and Bernardo play the following game. They are given two piles of chips, one with $m$ and the other with $n$ chips. Antonio starts, and thereafter they make in turn one of the following moves: (i) take a chip from one pile; (ii) take a chip from each of the piles; (ii) remove a chip from one of the piles and put it onto the other. Who cannot make any more moves, loses. Decide, as a function of $m$ and $n$ if one of the players has a winning strategy, and in the case of the affirmative answer describe that strategy.

Let $f$ be a function from the set of rational numbers to the set of real numbers. Suppose that for all rational numbers $r$ and $s$, the expression $f(r + s) - f(r) - f(s)$ is an integer. Prove that there is a positive integer $q$ and an integer $p$ such that \[ \Bigl\lvert f\Bigl(\frac{1}{q}\Bigr) - p \Bigr\rvert \le \frac{1}{2012} \, . \]

Let $n \geq 3$ be an integer and let $a,b\in\mathbb{R}$ such that $nb\geq a^2$. We consider the set \[ X = \left\{ (x_1,x_2,\ldots,x_n)\in\mathbb{R}^n \mid \sum_{k=1}^n x_k = a, \ \sum_{k=1}^n x_k^2 = b \right\} . \] Find the image of the function $M: X\to \mathbb{R}$ given by \[ M(x_1,x_2,\ldots,x_n) = \max_{1\leq k\leq n} x_k . \] [i]Dan Schwarz[/i]

Consider a regular $n$-gon $A_1A_2\ldots A_n$ with area $S$. Let us draw the lines $l_1,l_2,\ldots,l_n$ perpendicular to the plane of the $n$-gon at $A_1,A_2,\ldots,A_n$ respectively. Points $B_1,B_2,\ldots,B_n$ are selected on lines $l_1,l_2,\ldots,l_n$ respectively so that: (i) $B_1,B_2,\ldots,B_n$ are all on the same side of the plane of the $n$-gon; (ii) Points $B_1,B_2,\ldots,B_n$ lie on a single plane; (iii) $A_1B_1=h_1,A_2B_2=h_2,\ldots,A_nB_n=h_n$. Express the volume of polyhedron $A_1A_2\ldots A_nB_1B_2\ldots B_n$ as a function in $S,h_1,\ldots,h_n$.

Let $ F $ be the primitive of a continuous function $ f:\mathbb{R}\longrightarrow (0,\infty ), $ with $ F(0)=0. $ Determine for which values of $ \lambda \in (0,1) $ the function $ \left( F^{-1}\circ \lambda F \right)/\text{id.} $ has limit at $ 0, $ and calculate it.

Let $n, k, \ell$ be positive integers and $\sigma : \lbrace 1, 2, \ldots, n \rbrace \rightarrow \lbrace 1, 2, \ldots, n \rbrace$ an injection such that $\sigma(x)-x\in \lbrace k, -\ell \rbrace$ for all $x\in \lbrace 1, 2, \ldots, n \rbrace$. Prove that $k+\ell|n$.

$a,b,c,x,y,z$ are positive real numbers and $bz+cy=a$, $az+cx=b$, $ay+bx=c$. Find the least value of following function $f(x,y,z)=\frac{x^2}{1+x}+\frac{y^2}{1+y}+\frac{z^2}{1+z}$

The smallest value of $x^2+8x$ for real values of $x$ is: $\textbf{(A) }-16.25\qquad\textbf{(B) }-16\qquad\textbf{(C) }-15\qquad\textbf{(D) }-8\qquad \textbf{(E) }\text{None of these}$

Let $k, M$ be positive integers such that $k-1$ is not squarefree. Prove that there exist a positive real $\alpha$, such that $\lfloor \alpha\cdot k^n \rfloor$ and $M$ are coprime for any positive integer $n$.

Prove that there exist two functions $f,g \colon \mathbb{R} \to \mathbb{R}$, such that $f\circ g$ is strictly decreasing and $g\circ f$ is strictly increasing. [i](Poland) Andrzej Komisarski and Marcin Kuczma[/i]

Let $f : [0, 1] \to [0, 1]$ satisfy $f(0) = 0, f(1) = 1$ and \[f(x + y) - f(x) = f(x) - f(x - y)\] for all $x, y \geq 0$ with $x - y, x + y \in [0, 1].$ Prove that $f(x) = x$ for all $x \in [0, 1].$

Find all functions $f:\mathbb{N}\to\mathbb{N}$ such that \[f(f(n))=n+2015\] where $n\in \mathbb{N}.$

Find $ \lim_{a\rightarrow{\infty}} \frac{1}{a^2}\int_0^a \ln (1\plus{}e^x)dx$.

Let $f: \mathbb{R}^2 \to \mathbb{R}^2$ be a function having the following property: For any two points $A$ and $B$ in $\mathbb{R}^2$, the distance between $A$ and $B$ is the same as the distance between the points $f(A)$ and $f(B)$. Denote the unique straight line passing through $A$ and $B$ by $l(A,B)$ (a) Suppose that $C,D$ are two fixed points in $\mathbb{R}^2$. If $X$ is a point on the line $l(C,D)$, then show that $f(X)$ is a point on the line $l(f(C),f(D))$. (b) Consider two more point $E$ and $F$ in $\mathbb{R}^2$ and suppose that $l(E,F)$ intersects $l(C,D)$ at an angle $\alpha$. Show that $l(f(C),f(D))$ intersects $l(f(E),f(F))$ at an angle $\alpha$. What happens if the two lines $l(C,D)$ and $l(E,F)$ do not intersect? Justify your answer.

Let be given a parallelogram $ ABCD$ and two points $ A_1$, $ C_1$ on its sides $ AB$, $ BC$, respectively. Lines $ AC_1$ and $ CA_1$ meet at $ P$. Assume that the circumcircles of triangles $ AA_1P$ and $ CC_1P$ intersect at the second point $ Q$ inside triangle $ ACD$. Prove that $ \angle PDA \equal{} \angle QBA$.

Let $C$ be the class of all real valued continuously differentiable functions $f$ on the interval $[0,1]$ with $f(0)=0$ and $f(1)=1 .$ Determine the largest real number $u$ such that $$u \leq \int_{0}^{1} |f'(x) -f(x) | \, dx $$ for all $f$ in $C.$

Let $n,k$ be given positive integers with $n>k$. Prove that: \[ \frac{1}{n+1} \cdot \frac{n^n}{k^k (n-k)^{n-k}} < \frac{n!}{k! (n-k)!} < \frac{n^n}{k^k(n-k)^{n-k}} \]