Let $X$ be the set of all positive real numbers. Find all functions $f : X \longrightarrow X$ such that \[f (x + y) \ge f (x) + yf (f (x))\] for all $x$ and $y$ in $X$.

Let be two nonzero real numbers $ a,b, $ and a function $ f:\mathbb{R}\longrightarrow [0,\infty ) $ satisfying the functional equation $$ f(x+a+b)+f(x)=f(x+a)+f(x+b) . $$ [b]1)[/b] Prove that $ f $ is periodic if $ a/b $ is rational. [b]2)[/b] If $ a/b $ is not rational, could $ f $ be nonperiodic?

Let functions $f, g: \mathbb{R}^+ \to \mathbb{R}^+$ satisfy the following: \[ f(g(x)y + f(x)) = (y+2015)f(x) \] for every $x,y \in \mathbb{R}^+$. (a) Prove that $g(x) = \frac{f(x)}{2015}$ for every $x \in \mathbb{R}^+. $ (b) State an example of function that satisfy the equation above and $f(x), g(x) \ge 1$ for every $x \in \mathbb{R}^+$.

For any positive integer $n$ and $0 \leqslant i \leqslant n$, denote $C_n^i \equiv c(n,i)\pmod{2}$, where $c(n,i) \in \left\{ {0,1} \right\}$. Define \[f(n,q) = \sum\limits_{i = 0}^n {c(n,i){q^i}}\] where $m,n,q$ are positive integers and $q + 1 \ne {2^\alpha }$ for any $\alpha \in \mathbb N$. Prove that if $f(m,q)\left| {f(n,q)} \right.$, then $f(m,r)\left| {f(n,r)} \right.$ for any positive integer $r$.

Let $f_1(x) = \frac{2}{3}-\frac{3}{3x+1}$, and for $n \ge 2$, define $f_n(x) = f_1(f_{n-1} (x))$. The value of x that satisfies $f_{1001}(x) = x - 3$ can be expressed in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Let $V$ be the set of non-collinear pairs of vectors in $\mathbb{R}^3$, and $H$ be the set of lines passing through the origin. Is is true that for every continuous map $f\colon V\rightarrow H$ there exists a continuous map $g\colon V\rightarrow \mathbb{R}^3\,\backslash\,\{ 0\}$ such that $g(v)\in f(v)$ for all $v\in V$? (translated by Miklós Maróti)

Prove that for all $n\in\mathbb{Z}^+$, we have \[ \sum\limits_{p=1}^n\sum\limits_{q=1}^p\left\lfloor -\frac{1+\sqrt{8q+(2p-1)^2}}{2}\right\rfloor =-\frac{n(n+1)(n+2)}{3} \]

Given a real number $\alpha$ and consider function $\varphi(x)=x^2e^{\alpha x}$ for $x\in\mathbb R$. Find all function $f:\mathbb R\to\mathbb R$ that satisfy: $$f(\varphi(x)+f(y))=y+\varphi(f(x))$$ forall $x,y\in\mathbb R$

Let $ f:\mathbb{R}\longrightarrow\mathbb{R} $ be a function that satisfies the conditions: $ \text{(i)}\quad \lim_{x\to\infty} (f\circ f) (x) =\infty =-\lim_{x\to -\infty} (f\circ f) (x) $ $ \text{(ii)}\quad f $ has Darboux’s property [b]a)[/b] Prove that the limits of $ f $ at $ \pm\infty $ exist. [b]b)[/b] Is possible for the limits from [b]a)[/b] to be finite?

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $f(0) \in \mathbb Q$ and \[f(x+f(y)^2 ) = {f(x+y)}^2.\] (25 points)

Consider the following function. $\textbf{procedure }\textsc{M}(x)$ $\qquad\textbf{if }0\leq x\leq 1$ $\qquad\qquad\textbf{return }x$ $\qquad\textbf{return }\textsc{M}(x^2\bmod 2^{32})$ Let $f:\mathbb N\to\mathbb N$ be defined such that $f(x) = 0$ if $\textsc{M}(x)$ does not terminate, and otherwise $f(x)$ equals the number of calls made to $\textsc{M}$ during the running of $\textsc{M}(x)$, not including the initial call. For example, $f(1) = 0$ and $f(2^{31}) = 1$. Compute the number of ones in the binary expansion of \[ f(0) + f(1) + f(2) + \cdots + f(2^{32} - 1). \]

Let $N$ be a natural number. Find (with prove) the number of solutions in the segment $[1,N]$ of the equation $x^2-[x^2]=(x-[x])^2$, where $[x]$ means the floor function of $x$.

We know that the function $ f: \left[ 0,\frac{\pi }{2}\right]\longrightarrow [a,b], f(x)=\sqrt[n]{\cos x } +\sqrt[n]{\sin x} , $ is surjective for a given natural number $ n\ge 2. $ Determine the numbers $ a,b, $ and the monotony of $ f. $

It is possible to choose $ x > \frac {2}{3}$ in such a way that the value of $ \log_{10}(x^2 \plus{} 3) \minus{} 2 \log_{10}x$ is $ \textbf{(A)}\ \text{negative} \qquad \textbf{(B)}\ \text{zero} \qquad \textbf{(C)}\ \text{one}$ $ \textbf{(D)}\ \text{smaller than any positive number that might be specified}$ $ \textbf{(E)}\ \text{greater than any positive number that might be specified}$

$P,Q,R$ are non-zero polynomials that for each $z\in\mathbb C$, $P(z)Q(\bar z)=R(z)$. a) If $P,Q,R\in\mathbb R[x]$, prove that $Q$ is constant polynomial. b) Is the above statement correct for $P,Q,R\in\mathbb C[x]$?

$n$ is a positive integer, $K$ the set of polynoms of real variables $x_1,x_2,...,x_{n+1}$ and $y_1,y_2,...,y_{n+1}$, function $f:K\rightarrow K$ satisfies \[f(p+q)=f(p)+f(q),\quad f(pq)=f(p)q+pf(q),\quad (\forall)p,q\in K.\] If $f(x_i)=(n-1)x_i+y_i,\quad f(y_i)=2ny_i$ for all $i=1,2,...,n+1$ and \[\prod_{i=1}^{n+1}(tx_i+y_i)=\sum_{i=0}^{n+1}p_it^{n+1-i}\] for any real $t$, prove, that for all $k=1,...,n+1$ \[f(p_{k-1})=kp_k+(n+1)(n+k-2)p_{k-1}\]

Find all functions $f: \mathbb N \to \mathbb N$ for which \[ f(n) + f(n+1) = f(n+2)f(n+3)-1996\] holds for all positive integers $n$.

Actually, this is an MO I participated in :) but it's really hard to get problems from this year if you don't know some people. P1. Let $f$ be a function satisfying $f(x + 1) + f(x - 1) = \sqrt{2} f(x)$, for all reals $x$. If $f(x - 1) = a$ and $f(x) = b$, determine the value of $f(x + 4)$. [hide=Remarks]We found out that this is the modified version of a problem from LMNAS UGM 2008, Senior High School Level, on its First Round. This is also the same with Arthur Engel's "Problem Solving Strategies" Book, Example Problem E2.[/hide] P2. The sequence of "Sanga" numbers is formed by the following procedure. i. Pick a positive integer $n$. ii. The first term of the sequence $(U_1)$ is $9n$. iii. For $k \geq 2$, $U_k = U_{k-1} - 17$. Sanga$[r]$ is the "Sanga" sequence whose smallest positive term is $r$. As an example, for $n = 3$, the "Sanga" sequence which is formed is $27, 10, -7, -24, -41, \ldots.$ Since the smallest positive term of such sequence is $10$, for $n = 3$, the sequence formed is called Sanga$[10]$. For $n \leq 100$, determine the sum of all $n$ which makes the sequence Sanga$[4]$. P3. The cube $ABCD.EFGH$ has an edge length of 6 cm. Point $R$ is on the extension of line (segment) $EH$ with $EH : ER = 1 : 2$, such that triangle $AFR$ cuts edge $GH$ at point $P$ and cuts edge $DH$ at $Q$. Determine the area of the region bounded by the quadrilateral $AFPQ$. [url=https://artofproblemsolving.com/community/q1h2395046p19649729]P4[/url]. Ten skydivers are planning to form a circle formation when they are in the air by holding hands with both adjacent skydivers. If each person has 2 choices for the colour of his/her uniform to be worn, that is, red or white, determine the number of different colour formations that can be constructed. P5. After pressing the start button, a game machine works according to the following procedure. i. It picks 7 numbers randomly from 1 to 9 (these numbers are integers, not stated but corrected) without showing it on screen. ii. It shows the product of the seven chosen numbes on screen. iii. It shows a calculator menu (it does not function as a calculator) on screen and asks the player whether the sum of the seven chosen numbers is odd or even. iv. Shows the seven chosen numbers and their sum and products. v. Releases a prize if the guess of the player was correct or shows the message "Try again" on screen if the guess by the player was incorrect. (Although the player is not allowed to guess with those numbers, and the machine's procedures are started all over again.) Kiki says that this game is really easy since the probability of winning is greater than $90$%. Explain, whether you agree with Kiki.

Find at least one function $f: \mathbb R \rightarrow \mathbb R$ such that $f(0)=0$ and $f(2x+1) = 3f(x) + 5$ for any real $x$.

Fix a positive real number $c>1$ and positive integer $n$. Initially, a blackboard contains the numbers $1,c,\ldots, c^{n-1}$. Every minute, Bob chooses two numbers $a,b$ on the board and replaces them with $ca+c^2b$. Prove that after $n-1$ minutes, the blackboard contains a single number no less than \[\left(\dfrac{c^{n/L}-1}{c^{1/L}-1}\right)^L,\] where $\phi=\tfrac{1+\sqrt 5}2$ and $L=1+\log_\phi(c)$.

Let $P(x)$ be a nonzero polynomial of degree $n>1$ with nonnegative coefficients such that function $y=P(x)$ is odd. Is that possible thet for some pairwise distinct points $A_{1}, A_{2}, \dots A_{n}$ on the graph $G: y = P(x)$ the following conditions hold: tangent to $G$ at $A_{1}$ passes through $A_{2}$, tangent to $G$ at $A_{2}$ passes through $A_{3}$, $\dots$, tangent to $G$ at $A_{n}$ passes through $A_{1}$?

Consider the multiplicative group $A=\{z\in\mathbb{C}|z^{2006^k}=1, 0<k\in\mathbb{Z}\}$ of all the roots of unity of degree $2006^k$ for all positive integers $k$. Find the number of homomorphisms $f:A\to A$ that satisfy $f(f(x))=f(x)$ for all elements $x\in A$.

A particle of unit mass moves on a straight line under the action of a force which is a function $f(v)$ of the velocity $v$ of the particle, but the form of the function is not known. A motion is observed, and the distance $x$ covered in time $t$ satisfies the formula $x= at^2 + bt+c$, where $a,b,c$ have numerical values determined by observation of the motion. Find the function $f(v)$ for the range of $v$ covered by the experiment.

Find all functions such that $ f: \mathbb{R}^\plus{} \rightarrow \mathbb{R}^\plus{}$ and $ f(x\plus{}f(y))\equal{}yf(xy\plus{}1)$ for every $ x,y\in \mathbb{R}^\plus{}$.

Let $\varphi$ denote the Euler phi-function. Prove that for every positive integer $n$ $$2^{n(n+1)} | 32 \cdot \varphi \left( 2^{2^n} - 1 \right).$$