Let $f(n)$ be the number of ways to write $n$ as a sum of powers of $2$, where we keep track of the order of the summation. For example, $f(4)=6$ because $4$ can be written as $4$, $2+2$, $2+1+1$, $1+2+1$, $1+1+2$, and $1+1+1+1$. Find the smallest $n$ greater than $2013$ for which $f(n)$ is odd.

We say that two sequences $x,y \colon \mathbb{N} \to \mathbb{N}$ are [i]completely different[/i] if $x_n \neq y_n$ holds for all $n\in \mathbb{N}$. Let $F$ be a function assigning a natural number to every sequence of natural numbers such that $F(x)\neq F(y)$ for any pair of completely different sequences $x$, $y$, and for constant sequences we have $F \left((k,k,\dots)\right)=k$. Prove that there exists $n\in \mathbb{N}$ such that $F(x)=x_{n}$ for all sequences $x$.

Prove that \[\sum_{cyc}(x+y)\sqrt{(z+x)(z+y)} \geq 4(xy+yz+zx),\] for all positive real numbers $x,y$ and $z$.

Consider the parametric function $ f_k:\mathbb{R}\longrightarrow\mathbb{R}, f(x)=x+k\lfloor x \rfloor . $ [b]a)[/b] For which integer values of $ k $ the above function is injective? [b]b)[/b] For which integer values of $ k $ the above function is surjective? [b]c)[/b] Given two natural numbers $ n,m, $ create two bijective functions: $$ \phi : f_m (\mathbb{R} )\cap [0,\infty )\longrightarrow f_n(\mathbb{R})\cap [0,\infty ) $$ $$ \psi : \left(\mathbb{R}\setminus f_m (\mathbb{R})\right)\cap [0,\infty )\longrightarrow\left(\mathbb{R}\setminus f_n (\mathbb{R})\right)\cap [0,\infty ) $$ [i]Cristinel Mortici[/i]

Find all one-to-one mappings $f:\mathbb{N}\to\mathbb{N}$ such that for all positive integers $n$ the following relation holds: \[ f(f(n)) \leq \frac {n+f(n)} 2 . \]

Given two positive integers $n$ and $m$ and a function $f : \mathbb{Z} \times \mathbb{Z} \to \left\{0,1\right\}$ with the property that \begin{align*} f\left(i, j\right) = f\left(i+n, j\right) = f\left(i, j+m\right) \qquad \text{for all } \left(i, j\right) \in \mathbb{Z} \times \mathbb{Z} . \end{align*} Let $\left[k\right] = \left\{1,2,\ldots,k\right\}$ for each positive integer $k$. Let $a$ be the number of all $\left(i, j\right) \in \left[n\right] \times \left[m\right]$ satisfying \begin{align*} f\left(i, j\right) = f\left(i+1, j\right) = f\left(i, j+1\right) . \end{align*} Let $b$ be the number of all $\left(i, j\right) \in \left[n\right] \times \left[m\right]$ satisfying \begin{align*} f\left(i, j\right) = f\left(i-1, j\right) = f\left(i, j-1\right) . \end{align*} Prove that $a = b$.

Determine the maximum possible value of \[\frac{\left(x^2+5x+12\right)\left(x^2+5x-12\right)\left(x^2-5x+12\right)\left(-x^2+5x+12\right)}{x^4}\] over all non-zero real numbers $x$. [i]2019 CCA Math Bonanza Lightning Round #3.4[/i]

Find all functions $f : Z_{>0} \to Z_{>0}$ with $a - f(b) | af(a) - bf(b)$ for all $a, b \in Z_{>0}$. [i](Theresia Eisenkoelbl)[/i]

Let $a_1,a_2,a_3,\ldots,a_n$ be a sequence of non-negative integers, where $n$ is a positive integer. Let \[ A_n={a_1+a_2+\cdots+a_n\over n}\ . \] Prove that \[ a_1!a_2!\ldots a_n!\ge\left(\lfloor A_n\rfloor !\right)^n \] where $\lfloor A_n\rfloor$ is the greatest integer less than or equal to $A_n$, and $a!=1\times 2\times\cdots\times a$ for $a\ge 1$(and $0!=1$). When does equality hold?

Let be a natural number $ n, $ denote with $ C $ the square in the complex plane whose vertices are the affixes of $ 2n\pi\left( \pm 1\pm i \right) , $ and consider the set $$ \Lambda = \left\{ \lambda\in\text{Hol} \left[ \mathbb{C}\longrightarrow\mathbb{C} \right] |z\in\mathbb{C}\implies |\lambda (z)|\le e^{|\text{Im}(z)|} \right\} $$ Prove the following implications. [b]a)[/b] $ \exists \alpha\in\mathbb{R}_{>0}\quad \forall z\in\partial C\quad \left| \cos z \right|\ge\alpha e^{|\text{Im}(z)|} $ [b]b)[/b] $ \forall f\in\Lambda\quad\frac{1}{2\pi i}\int_{\partial C} \frac{f(z)}{z^2\cos z} dz=f'(0)+\frac{4}{\pi^2}\sum_{p=-2n}^{2n-1} \frac{(-1)^{p+1} f(z-p)}{(1+2p)^2} $ [b]c)[/b] $ \forall f\in\Lambda\quad \sum_{p\in\mathbb{Z}}\frac{(-1)^pf\left( \frac{(1+2p)\pi}{2} \right)}{(1+2p)^2} =\frac{\pi^2 f'(0)}{4} $

Let a function $f$ satisfy $f(1) = 1$ and $f(1)+ f(2)+...+ f(n) = n^2f(n)$ for all $n \in N$. Determine $f(1995)$.

If $a,b,c$ are three real numbers and \[ a + \dfrac{1}{b} = b + \dfrac{1}{c} = c + \dfrac{1}{a} = t \] for some real number $t$, prove that $abc + t = 0 .$

Suppose that $ V$ is a locally compact topological space that admits no countable covering with compact sets. Let $ \textbf{C}$ denote the set of all compact subsets of the space $ V$ and $ \textbf{U}$ the set of open subsets that are not contained in any compact set. Let $ f$ be a function from $ \textbf{U}$ to $ \textbf{C}$ such that $ f(U)\subseteq U$ for all $ U \in \textbf{U}$. Prove that either (i) there exists a nonempty compact set $ C$ such that $ f(U)$ is not a proper subset of $ C$ whenever $ C \subseteq U \in \textbf{U}$, (ii) or for some compact set $ C$, the set \[ f^{-1}(C)= \bigcup \{U \in \textbf{U}\;: \ \;f(U)\subseteq C\ \}\] is an element of $ \textbf{U}$, that is, $ f^{-1}(C)$ is not contained in any compact set. [i]A. Mate[/i]

Let $ f$ be a function given by $ f(x) = \lg(x+1)-\frac{1}{2}\cdot\log_{3}x$. a) Solve the equation $ f(x) = 0$. b) Find the number of the subsets of the set \[ \{n | f(n^{2}-214n-1998) \geq 0,\ n \in\mathbb{Z}\}.\]

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) \to \mathbb{R}$ be a continuously differentiable function satisfying $$f(x) = \int_{x - 1}^xf(t)\mathrm{d}t$$ for all $x \geq 1$. Show that $f$ has bounded variation on $[1,\infty)$, i.e. $$\int_1^{\infty} |f'(x)|\mathrm{d}x < \infty.$$

Does there exist a sequence $\displaystyle{\left( {{a_n}} \right)}$ of complex numbers such that for every positive integer $\displaystyle{p}$ we have that $\displaystyle{\sum\limits_{n = 1}^{ + \infty } {a_n^p} }$ converges if and only if $\displaystyle{p}$ is not a prime? [i]Proposed by Tomáš Bárta, Charles University, Prague.[/i]

Prove that there exists a sequence $a(1),a(2),\dots,a(n),\dots$ of real numbers such that \[ a(n+m)\le a(n)+a(m)+\frac{n+m}{\log (n+m)} \] for all integers $m,n\ge 1$, and such that the set $\{a(n)/n:n\ge 1\}$ is everywhere dense on the real line. [i]Remark.[/i] A theorem of de Bruijn and Erdős states that if the inequality above holds with $f(n + m)$ in place of the last term on the right-hand side, where $f(n)\ge 0$ is nondecreasing and $\sum_{n=2}^\infty f(n)/n^2<\infty$, then $a(n)/n$ converges or tends to $(-\infty)$.

Let $f:\mathbb{R} \to\mathbb{R}$ be a function. For every $a\in\mathbb{Z}$ consider the function $f_a : \mathbb{R} \to\mathbb{R}$, $f_a(x) = (x - a)f(x)$. Prove that if there exist infinitely many values $a\in\mathbb{Z}$ for which the functions $f_a$ are increasing, then the function $f$ is monotonic.

Determine all functions $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ such that $f(a) + 2ab + 2f(b)$ divides $f(a)^2 + 4f(b)^2$ for any positive integers $a$ and $b$.

Does there exist a function $f : \mathbb{N} \rightarrow \mathbb{N}$ such that for every $n \ge 2$, \[f (f (n - 1)) = f (n + 1) - f (n)?\]

Consider a function $f:\mathbb{R}\rightarrow \mathbb{R}$. For $x\in \mathbb{R}$ we say that $f$ is [i]increasing in $x$[/i] if there exists $\epsilon_x > 0$ such that $f(x)\geq{f(a)}$, $\forall a\in (x-\epsilon_x,x)$ and $f(x)\leq f(b)$, $\forall b\in (x,x+\epsilon_x)$. $\textbf{(a)}$ Prove that if $f$ is increasing in $x$, $\forall x\in \mathbb{R}$ then $f$ is increasing over $\mathbb{R}$. $\textbf{(b)}$ We say that $f$ is [i]increasing to the left[/i] in $x$ if there exists $\epsilon_x > 0$ such that $f(x)\geq f(a) $, $ \forall a \in (x-\epsilon_x,x)$. Provide an example of a function $f: [0,1]\rightarrow \mathbb{R}$ for which there exists an infinite set $M \subset (0,1)$ such that $f$ is increasing to the left in every point of $M$, yet $f$ is increasing over no proper subinterval of $[0,1]$.

Consider the function $f(x)=5x^4-12x^3+30x^2-12x+5$. Let $f(x_1)=p$, wher $x_1$ and $p$ are non-negative integers, and $p$ is prime. Find with proof the largest possible value of $p$. [i]Proposed by tkhalid[/i]

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\]

Suppose that $p(n)$ is the number of ways to express $n$ as a sum of some naturall numbers (the two representations $4=1+1+2$ and $4=1+2+1$ are considered the same). Prove that for an infinite number of $n$'s $p(n)$ is even and for an infinite number of $n$'s $p(n)$ is odd.