Let $S$ be the set of points inside a given equilateral triangle $ABC$ with side $1$ or on its boundary. For any $M \in S, a_M, b_M, c_M$ denote the distances from $M$ to $BC,CA,AB$, respectively. Define \[f(M) = a_M^3 (b_M - c_M) + b_M^3(c_M - a_M) + c_M^3(a_M - b_M).\] [b](a)[/b] Describe the set $\{M \in S | f(M) \geq 0\}$ geometrically. [b](b)[/b] Find the minimum and maximum values of $f(M)$ as well as the points in which these are attained.

Let $f : \{ 1, 2, 3, \dots \} \to \{ 2, 3, \dots \}$ be a function such that $f(m + n) | f(m) + f(n) $ for all pairs $m,n$ of positive integers. Prove that there exists a positive integer $c > 1$ which divides all values of $f$.

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.

Let $f (n)$ be a function satisfying the following three conditions for all positive integers $n$: (a) $f (n)$ is a positive integer, (b) $f (n + 1) > f (n)$, (c) $f ( f (n)) = 3n$. Find $f (2001)$.

Let $ n > 3$ be a fixed integer and $ x_1,x_2,\ldots, x_n$ be positive real numbers. Find, in terms of $ n$, all possible real values of \[ {x_1\over x_n\plus{}x_1\plus{}x_2} \plus{} {x_2\over x_1\plus{}x_2\plus{}x_3} \plus{} {x_3\over x_2\plus{}x_3\plus{}x_4} \plus{} \cdots \plus{} {x_{n\minus{}1}\over x_{n\minus{}2}\plus{}x_{n\minus{}1}\plus{}x_n} \plus{} {x_n\over x_{n\minus{}1}\plus{}x_n\plus{}x_1}\]

Let $f:\mathbb{R}\to\mathbb{R}$ be a monotonic function and $F:\mathbb{R}\to\mathbb{R}$ given by \[F(x)=\int_0^xf(t)\ \text{d}t.\] Prove that if $F$ has a finite derivative, then $f$ is continuous. [i]Dorin Andrica & Mihai Piticari[/i]

Find all functions $ f :\mathbb{Z}\mapsto\mathbb{Z} $ such that following conditions holds: $a)$ $f(n) \cdot f(-n)=f(n^2)$ for all $n\in\mathbb{Z}$ $b)$ $f(m+n)=f(m)+f(n)+2mn$ for all $m,n\in\mathbb{Z}$

Let $a, b, c$ be positive real numbers in the interval $[0, 1]$ with $a+b, b+c, c+a \ge 1$. Prove that \[ 1 \le (1-a)^2 + (1-b)^2 + (1-c)^2 + \frac{2\sqrt{2} abc}{\sqrt{a^2+b^2+c^2}}. \]

Let $n$ be a positive integer and $f:[0,1] \to \mathbb{R}$ be an integrable function. Prove that there exists a point $c \in \left[0,1- \frac{1}{n} \right],$ such that [center] $ \int\limits_c^{c+\frac{1}{n}}f(x)\mathrm{d}x=0$ or $\int\limits_0^c f(x) \mathrm{d}x=\int\limits_{c+\frac{1}{n}}^1f(x)\mathrm{d}x.$ [/center]

Let $f(x)=ax^2+bx+c$ be a quadratic function, the graph of which doesn't intersect the x-axis. Prove that $$a(2a+3b+6c)>0.$$

Find all functions $f \colon \mathbb{R_{+}}\to \mathbb{R_{+}}$ satisfying : \[f ( f (x)-x) = 2x\] for all $x > 0$.

Given two rational numbers $ a,b, $ find the functions $ f:\mathbb{Q}\longrightarrow\mathbb{Q} $ that verify $$ f(x+a+f(y))=f(x+b)+y, $$ for any rational $ x,y. $ [i]Vasile Pop[/i]

Let $a,b,c,d$ be four non-negative numbers satisfying \[ a+b+c+d=1. \] Prove the inequality \[ a \cdot b \cdot c + b \cdot c \cdot d + c \cdot d \cdot a + d \cdot a \cdot b \leq \frac{1}{27} + \frac{176}{27} \cdot a \cdot b \cdot c \cdot d. \]

Evaluate $\int_1^{e^2} \frac{(2x^2+2x+1)e^{x}}{\sqrt{x}}\ dx.$

Prove that the series $\sum_p c_p f(px)$, where the summation is over all primes, unconditionally converges in $L^2[0,1]$ for every $1$-periodic function $f$ whose restriction to $[0,1]$ is in $L^2[0,1]$ if and only if $\sum_p |c_p|<\infty$. ([i]Unconditional convergence[/i] means convergence for all rearrangements.) [G. Halasz]

Let $\mathbb N$ denote the set of positive integers, and for a function $f$, let $f^k(n)$ denote the function $f$ applied $k$ times. Call a function $f : \mathbb N \to \mathbb N$ [i]saturated[/i] if \[ f^{f^{f(n)}(n)}(n) = n \] for every positive integer $n$. Find all positive integers $m$ for which the following holds: every saturated function $f$ satisfies $f^{2014}(m) = m$. [i]Proposed by Evan Chen[/i]

Prove that the function $ f:\mathbb{R}\longrightarrow\mathbb{R} , f(x)=\text{arcsin} \frac{2x}{1+x^2} $ admits primitives and describe a primitive of it.

Let $\mathbb{Z}_{\ge 0}$ be the set of all nonnegative integers. Find all the functions $f: \mathbb{Z}_{\ge 0} \rightarrow \mathbb{Z}_{\ge 0} $ satisfying the relation \[ f(f(f(n))) = f(n+1 ) +1 \] for all $ n\in \mathbb{Z}_{\ge 0}$.

For how many integer values of $m$, (i) $1\le m \le 5000$ (ii) $[\sqrt{m}] =[\sqrt{m+125}]$ Note: $[x]$ is the greatest integer function

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]

A continuous function $f : R \to R$ satisfies the conditions $f(1000) = 999$ and $f(x)f(f(x)) = 1$ for all real $x$. Determine $f(500)$.

For a set $S$ of $n$ points, let $d_1 > d_2 >... > d_k > ...$ be the distances between the points. A function $f_k: S \to N$ is called a [i]coloring function[/i] if, for any pair $M,N$ of points in $S$ with $MN \le d_k$ , it takes the value $f_k(M)+ f_k(N)$ at some point. Prove that for each $m \in N$ there are positive integers $n,k$ and a set $S$ of $n$ points such that every coloring function $f_k$ of $S$ satisfies $| f_k(S)| \le m$

For a unit circle $O$, arrange points $A,B,C,D$ and $E$ in that order evenly along $O$'s circumference. For each of those points, draw the arc centered at that point inside O from the point to its left to the point to its right. Denote the outermost intersections of these arcs as $A', B', C', D'$ and $E'$, where the prime of any point is opposite the point. The length of $AC'$ can be written as an expression $f(x)$, where $f$ is a trigonometric function. Find this expression.

Let $ M $ be a set of nonzero real numbers and $ f:M\longrightarrow M $ be a function having the property that the identity function is $ f+f^{-1} . $ [b]1)[/b] Prove that $ m\in M\iff -m\in M. $ [b]2)[/b] Show that $ f $ is odd. [b]3)[/b] Determine the cardinal of $ M. $

Let $f:\mathbb{R}\longrightarrow \mathbb{R}$ be a function such that $f(x+y+xy)=f(x)+f(y)+f(xy)$ for all $x, y\in\mathbb{R}$. Prove that $f$ satisfies $f(x+y)=f(x)+f(y)$ for all $x, y\in\mathbb{R}$.