This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 98

Let $I$ and $J$ be intervals. Let $\varphi,\psi:I\to\mathbb{R}$ be strictly increasing continuous functions and let $\Phi,\Psi:J\to\mathbb{R}$ be continuous functions. Suppose that $\varphi(x)+\psi(x)=x$ and $\Phi(u)+\Psi(u)=u$ holds for all $x\in I$ and $u\in J$. Show that if $f:I\to J$ is a continuous solution of the functional inequality $$f\big(\varphi(x)+\psi(y)\big)\le \Phi\big(f(x)\big)+\Psi\big(f(y)\big)\qquad (x,y\in I),$$then $\Phi\circ f\circ \varphi^{-1}$ and $\Psi\circ f\circ \psi^{-1}$ are convex functions.
Find all functions $f : R \to R$ such that $f(x^2)-f(y^2) \le (f(x)+y) (x-f(y))$ for all $x, y \in R$.
Let $R^+$ be the set of positive real numbers. Find all function $f : R^+ \to R$ such that, for all positive real number $x$ and $y$, the following conditions are satisfied: i) $2f (x) + 2f (y) \le f (x + y)$ ii) $(x + y)[y f (x) + x f (y)] \ge x y f (x + y)$
Consider those functions $ f: \mathbb{N} \mapsto \mathbb{N}$ which satisfy the condition \[ f(m \plus{} n) \geq f(m) \plus{} f(f(n)) \minus{} 1 \] for all $ m,n \in \mathbb{N}.$ Find all possible values of $ f(2007).$ [i]Author: Nikolai Nikolov, Bulgaria[/i]
Find all functions $f : R \to R$ such that $f(x^2)-f(y^2) \le (f(x)+y) (x-f(y))$ for all $x, y \in R$.
Let $c > 1$ be a real number. A function $f: [0 ,1 ] \to R$ is called c-friendly if $f(0) = 0, f(1) = 1$ and $|f(x) -f(y)| \le c|x - y|$ for all the numbers $x ,y \in [0,1]$. Find the maximum of the expression $|f(x) - f(y)|$ for all [i]c-friendly[/i] functions $f$ and for all the numbers $x,y \in [0,1]$.
Find all functions $f : \mathbb R \to \mathbb R$ for which \[f(a - b) f(c - d) + f(a - d) f(b - c) \leq (a - c) f(b - d),\] for all real numbers $a, b, c$ and $d$. Note that there is only one occurrence of $f$ on the right hand side!
Let $f, g$ be functions from the positive integers to the integers. Vlad the impala is jumping around the integer grid. His initial position is $x_0 = (0, 0)$, and for every $n \ge 1$, his jump is $x_n - x_{n - 1} = (\pm f(n), \pm g(n))$ or $(\pm g(n), \pm f(n)),$ with eight possibilities in total. Is it always possible that Vlad can choose his jumps to return to his initial location $(0, 0)$ infinitely many times when (a) $f, g$ are polynomials with integer coefficients? (b) $f, g$ are any pair of functions from the positive integers to the integers?
Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.
Let $\mathbb{N}$ be the set of positive integers. Let $f$ be a function defined on $\mathbb{N}$, which satisfies the inequality $f(n + 1) > f(f(n))$ for all $n \in \mathbb{N}$. Prove that for any $n$ we have $f(n) = n.$
Find all functions $f : \mathbb R \to \mathbb R$ for which \[f(a - b) f(c - d) + f(a - d) f(b - c) \leq (a - c) f(b - d),\] for all real numbers $a, b, c$ and $d$. Note that there is only one occurrence of $f$ on the right hand side!
Given a function $f\colon \mathbb{R}\rightarrow \mathbb{R} $ with $f(x)^2\le f(y)$ for all $x,y\in\mathbb{R} $, $x>y$, prove that $f(x)\in [0,1] $ for all $x\in \mathbb{R}$.
Let $ S\subseteq\mathbb{R}$ be a set of real numbers. We say that a pair $ (f, g)$ of functions from $ S$ into $ S$ is a [i]Spanish Couple[/i] on $ S$, if they satisfy the following conditions: (i) Both functions are strictly increasing, i.e. $ f(x) < f(y)$ and $ g(x) < g(y)$ for all $ x$, $ y\in S$ with $ x < y$; (ii) The inequality $ f\left(g\left(g\left(x\right)\right)\right) < g\left(f\left(x\right)\right)$ holds for all $ x\in S$. Decide whether there exists a Spanish Couple [list][*] on the set $ S \equal{} \mathbb{N}$ of positive integers; [*] on the set $ S \equal{} \{a \minus{} \frac {1}{b}: a, b\in\mathbb{N}\}$[/list] [i]Proposed by Hans Zantema, Netherlands[/i]
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} \to \mathbb{R}$ such that \[f(x + y) + y \le f(f(f(x)))\] holds for all $x, y \in \mathbb{R}$.
$f$ and $g$ are real-valued functions defined on the real line. For all $x$ and $y, f(x+y)+f(x-y)=2f(x)g(y)$. $f$ is not identically zero and $|f(x)|\le1$ for all $x$. Prove that $|g(x)|\le1$ for all $x$.
Prove that there exists exactly one function $ƒ$ which is defined for all $x \in R$, and for which holds: $\bullet$ $x \le y \Rightarrow f(x) \le f(y)$, for all $x, y \in R$, and $\bullet$ $f(f(x)) = x$, for all $x \in R$.
Let $\mathbb{N}_0$ denote the set of non-negative integers. Determine all non-negative integers $k$ for which there exists a function $f: \mathbb{N}_0 \to \mathbb{N}_0$ such that $f(2024) = k$ and $f(f(n)) \leq f(n+1) - f(n)$ for all non-negative integers $n$.
The real-valued function $f(x)$ is defined on the reals. It satisfies $|f(x)| \le A$, $|f''(x)| \le B$ for some positive $A, B$ (and all $x$). Show that $|f'(x)| \le C$, for some fixed$ C$, which depends only on $A$ and $B$. What is the smallest possible value of $C$?
Let $ S\subseteq\mathbb{R}$ be a set of real numbers. We say that a pair $ (f, g)$ of functions from $ S$ into $ S$ is a [i]Spanish Couple[/i] on $ S$, if they satisfy the following conditions: (i) Both functions are strictly increasing, i.e. $ f(x) < f(y)$ and $ g(x) < g(y)$ for all $ x$, $ y\in S$ with $ x < y$; (ii) The inequality $ f\left(g\left(g\left(x\right)\right)\right) < g\left(f\left(x\right)\right)$ holds for all $ x\in S$. Decide whether there exists a Spanish Couple [list][*] on the set $ S \equal{} \mathbb{N}$ of positive integers; [*] on the set $ S \equal{} \{a \minus{} \frac {1}{b}: a, b\in\mathbb{N}\}$[/list] [i]Proposed by Hans Zantema, Netherlands[/i]
Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.
The real-valued function $f$ is defined for $0 \le x \le 1, f(0) = 0, f(1) = 1$, and $\frac{1}{2} \le \frac{ f(z) - f(y)}{f(y) - f(x)} \le 2$ for all $0 \le x < y < z \le 1$ with $z - y = y -x$. Prove that $\frac{1}{7} \le f (\frac{1}{3} ) \le \frac{4}{7}$.
Find all functions $f:\mathbb R^+ \to \mathbb R^+$ satisfying \begin{align*} f\left(\frac{1}{x}\right) \geq 1 - \frac{\sqrt{f(x)f\left(\frac{1}{x}\right)}}{x} \geq x^2 f(x), \end{align*} for all positive real numbers $x$.
$f$ is a real-valued function defined on the reals such that $f(x) \le x$ and $f(x + y) \le f(x) + f(y)$ for all $x, y$. Prove that $f(x) = x$ for all $x$.
Consider functions $f$ satisfying the following four conditions: (1) $f$ is real-valued and defined for all real numbers. (2) For any two real numbers $x$ and $y$ we have $f(xy)=f(x)f(y)$. (3) For any two real numbers $x$ and $y$ we have $f(x+y) \le 2(f(x)+f(y))$. (4) We have $f(2)=4$. Prove that: a) There is a function $f$ with $f(3)=9$ satisfying the four conditions. b) For any function $f$ satisfying the four conditions, we have $f(3) \le 9$.