Prove that $ \frac {( \minus{} 1)^n}{n!}\int_1^2 (\ln x)^n\ dx \equal{} 2\sum_{k \equal{} 1}^n \frac {( \minus{} \ln 2)^k}{k!} \plus{} 1$.

Find the smallest constant $ C$ such that for all real $ x,y$ \[ 1\plus{}(x\plus{}y)^2 \leq C \cdot (1\plus{}x^2) \cdot (1\plus{}y^2)\] holds.

Let $f:\mathbb{R}\to (0;+\infty )$ be a continuous function such that $\underset{x\to -\infty }{\mathop{\lim }}\,f(x)=\underset{x\to +\infty }{\mathop{\lim }}\,f(x)=0.$ a) Prove that $f(x)$ has the maximum value on $\mathbb{R}.$ b) Prove that there exist two sequeneces $({{x}_{n}}),({{y}_{n}})$ with ${{x}_{n}}<{{y}_{n}},\forall n=1,2,3,...$ such that they have the same limit when $n$ tends to infinity and $f({{x}_{n}})=f({{y}_{n}})$ for all $n.$

Let $S=\{1,2,...,100\}$ . Find number of functions $f: S\to S$ satisfying the following conditions a)$f(1)=1$ b)$f$ is bijective c)$f(n)=f(g(n))f(h(n))\forall n\in S$, where $g(n),h(n)$ are positive integer numbers such that $g(n)\leq h(n),n=g(n)h(n)$ that minimize $h(n)-g(n)$.

For every $ n\in\mathbb{N}$ let $ d(n)$ denote the number of (positive) divisors of $ n$. Find all functions $ f: \mathbb{N}\to\mathbb{N}$ with the following properties: [list][*] $ d\left(f(x)\right) \equal{} x$ for all $ x\in\mathbb{N}$. [*] $ f(xy)$ divides $ (x \minus{} 1)y^{xy \minus{} 1}f(x)$ for all $ x$, $ y\in\mathbb{N}$.[/list] [i]Proposed by Bruno Le Floch, France[/i]

Let be a natural number $ n, $ two $ \text{n-tuplets} $ of real numbers $ a:=\left( a_1,a_2,\ldots, a_n \right) , b:=\left( b_1,b_2,\ldots, b_n \right) , $ and the function $ f:\mathbb{R}\longrightarrow\mathbb{R}, f(x)=\sum_{i=1}^na_i\cos \left( b_ix \right) $. Prove that if the numbers of $ b $ are all positive and pairwise distinct, [b]a)[/b] then, $ f\ge 0 $ implies that the numbers of $ a $ are all equal. [b]b)[/b] if the numbers of $ a $ are all nonzero and $ f $ is periodic, then the ratio of any two numbers of $ b $ is rational. [i]Marin Tolosi[/i]

In $xyz$ space, find the volume of the solid expressed by $x^2+y^2\leq z\le \sqrt{3}y+1.$

A circular disk is partitioned into $ 2n$ equal sectors by $ n$ straight lines through its center. Then, these $ 2n$ sectors are colored in such a way that exactly $ n$ of the sectors are colored in blue, and the other $ n$ sectors are colored in red. We number the red sectors with numbers from $ 1$ to $ n$ in counter-clockwise direction (starting at some of these red sectors), and then we number the blue sectors with numbers from $ 1$ to $ n$ in clockwise direction (starting at some of these blue sectors). Prove that one can find a half-disk which contains sectors numbered with all the numbers from $ 1$ to $ n$ (in some order). (In other words, prove that one can find $ n$ consecutive sectors which are numbered by all numbers $ 1$, $ 2$, ..., $ n$ in some order.) [hide="Problem 8 from CWMO 2007"]$ n$ white and $ n$ black balls are placed at random on the circumference of a circle.Starting from a certain white ball,number all white balls in a clockwise direction by $ 1,2,\dots,n$. Likewise number all black balls by $ 1,2,\dots,n$ in anti-clockwise direction starting from a certain black ball.Prove that there exists a chain of $ n$ balls whose collection of numbering forms the set $ \{1,2,3\dots,n\}$.[/hide]

If $0 \leq a \leq b \leq c \leq d,$ prove that \[a^bb^cc^dd^a \geq b^ac^bd^ca^d.\]

Function $f(x)=\frac{x}{1-2^x}-\frac{x}{2}$ is $\text{(A)}$ an even function, not an odd function. $\text{(B)}$ an odd function, not an even function. $\text{(C)}$ an even function, also an odd function. $\text{(D)}$ neither an even function, nor an odd function.

Let $n \geq 5$ be an integer. Find the largest integer $k$ (as a function of $n$) such that there exists a convex $n$-gon $A_{1}A_{2}\dots A_{n}$ for which exactly $k$ of the quadrilaterals $A_{i}A_{i+1}A_{i+2}A_{i+3}$ have an inscribed circle. (Here $A_{n+j} = A_{j}$.)

An infinite sequence of real numbers $a_1,a_2,a_3,\dots$ is called $\emph{spooky}$ if $a_1=1$ and for all integers $n>1$, \[\begin{array}{c@{\;\,}c@{\;\,}c@{\;\,}c@{\;\,}c@{\;\,}c@{\;\,}c@{\;\,}c@{\;\,}c@{\;\,}c@{\;\,}c@{\;\,}c@{\;\,}c} na_1&+&(n-1)a_2&+&(n-2)a_3&+&\dots&+&2a_{n-1}&+&a_n&<&0,\\ n^2a_1&+&(n-1)^2a_2&+&(n-2)^2a_3&+&\dots&+&2^2a_{n-1}&+&a_n&>&0. \end{array}\]Given any spooky sequence $a_1,a_2,a_3,\dots$, prove that \[2013^3a_1+2012^3a_2+2011^3a_3+\cdots+2^3a_{2012}+a_{2013}<12345.\]

The audience arranges $n$ coins in a row. The sequence of heads and tails is chosen arbitrarily. The audience also chooses a number between $1$ and $n$ inclusive. Then the assistant turns one of the coins over, and the magician is brought in to examine the resulting sequence. By an agreement with the assistant beforehand, the magician tries to determine the number chosen by the audience. [list][b](a)[/b] Prove that if this is possible for some $n$, then it is also possible for $2n$. [b](b)[/b] Determine all $n$ for which this is possible.[/list]

Let $f$ be any function that maps the set of real numbers into the set of real numbers. Prove that there exist real numbers $x$ and $y$ such that \[f\left(x-f(y)\right)>yf(x)+x\] [i]Proposed by Igor Voronovich, Belarus[/i]

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ that satisfy the conditions \[f(1+xy)-f(x+y)=f(x)f(y) \quad \text{for all } x,y \in \mathbb{R},\] and $f(-1) \neq 0$.

Find the function $f(x)$ such that \[f(x)^2f\left(\frac{1-x}{x+1}\right) =64x \] for $x\not=0,x\not=1,x\not=-1$.

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$.

Determine all positive integers $n$ such that the number $n(n+2)(n+4)$ has at most $15$ positive divisors.

Find all real-valued functions $f$ on the reals such that $f(-x) = -f(x)$, $f(x+1) = f(x) + 1$ for all $x$, and $f\left(\dfrac{1}{x}\right) = \dfrac{f(x)}{x^2}$ for $x \not = 0$.

Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Define the function $f: \mathbb N \cup \{0\} \to \mathbb{Q}$ as follows: $f(0) = 0$ and \[ f(3n+k) = -\frac{3f(n)}{2} + k , \] for $k = 0, 1, 2$. Show that $f$ is one-to-one and determine the range of $f$.

Prove or disprove the existence of a function $f : S \to R$ such that for all $x \ne y \in S$ we have $|f(x) - f(y)| \ge \frac{1}{x^2 + y^2}$, in each of the cases: a) $S = R$ b) $S = Q$.

Find all functions $f: \mathbb{R}\to\mathbb{R}$ that satidfy : $$2f(x+y+xy)= a f(x)+ bf(y)+f(xy)$$ for any $x,y \in\mathbb{R}$ όπου $a,b\in\mathbb{R}$ with $a^2-a\ne b^2-b$

Consider the polynomials $P\left(x\right)=16x^4+40x^3+41x^2+20x+16$ and $Q\left(x\right)=4x^2+5x+2$. If $a$ is a real number, what is the smallest possible value of $\frac{P\left(a\right)}{Q\left(a\right)}$? [i]2016 CCA Math Bonanza Team #6[/i]

Let $\mathbb{N}_0=\{0,1,2 \cdots \}$. Does there exist a function $f: \mathbb{N}__0 \to \mathbb{N}_0$ such that: \[ f^{2003}(n)=5n, \forall n \in \mathbb{N}_0 \] where we define: $f^1(n)=f(n)$ and $f^{k+1}(n)=f(f^k(n))$, $\forall k \in \mathbb{N}_0$?