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

Find all functions $f: \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$, for which $f(k+1)>f(f(k)) \quad \forall k \geq 1$.
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}$.
Find all injective function $f: N \to N$ satisfying that for all positive integers $m,n$, we have: $f(n(f(m)) \le nm$
Find all functions $f : \mathbb{N}\rightarrow \mathbb{N}$ satisfying following condition: \[f(n+1)>f(f(n)), \quad \forall n \in \mathbb{N}.\]
Let $f : \mathbb R \to \mathbb R$ be a real-valued function defined on the set of real numbers that satisfies \[f(x + y) \leq yf(x) + f(f(x))\] for all real numbers $x$ and $y$. Prove that $f(x) = 0$ for all $x \leq 0$. [i]Proposed by Igor Voronovich, Belarus[/i]
Let $\mathcal{F}$ be the family of bijective increasing functions $f\colon [0,1] \to [0,1]$, and let $a \in (0,1)$. Determine the best constants $m_a$ and $M_a$, such that for all $f \in \mathcal{F}$ we have \[m_a \leq f(a) + f^{-1}(a) \leq M_a.\] [i](Dan Schwarz)[/i]
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]
A function $f: R \to R$ satisfies the conditions: $f (x + 19) \le f (x) + 19$ and $f (x + 94) \ge f (x) + 94$ for all $x \in R$. Prove that $f (x + 1) = f (x) + 1$ for all $x \in R$.
Find all functions $f : R \to R$ satisfying the conditions: 1. $f (x + 1) \ge f (x) + 1$ for all $x \in R$ 2. $f (x y) \ge f (x)f (y)$ for all $x, y \in R$
Consider all polynomials $P(x)$ with real coefficients that have the following property: for any two real numbers $x$ and $y$ one has \[|y^2-P(x)|\le 2|x|\quad\text{if and only if}\quad |x^2-P(y)|\le 2|y|.\] Determine all possible values of $P(0)$. [i]Proposed by Belgium[/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]
Let $ f : [0, 1] \to\ R $ be a function such that :- $1.)$ $f(x) \ge 0$ for all $x$ in $[0,1]$ . $2.)$ $f(1) = 1$ . $3.)$ If $x_1 , x_2$ are in $[0,1]$ such that $x_1 + x_2 \le 1$ , then $f(x_1) + f(x_2) \le f(x_1 + x_2)$ . Show that $f(x) \le 2x $ for all $x$ in $ [0,1] $.
Find all polynomials $p$ with real coefficients such that for all real $x$ , $xp(x)p(1-x)+x^3 +100 \ge 0$.
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(x^2 + y) \ge (\frac{1}{x} + 1)f(y)$$ holds for all $x \in \mathbb{R} \setminus \{0\}$ and all $y \in \mathbb{R}$.
Let $a > 0$ be a real number and let $f : R \to R$ be a function satisfying $$f(x_1) + f(x_2) \ge a f(x_1 + x_2), \forall x_1 ,x_2 \in R.$$ Prove that $$f(x_1) + f(x_2) +(x_3) \ge \frac{3a^2}{a+2} f(x_1+ x_2 + x_3), \forall x_1 ,x_2,x_3 \in R$$.
Denote by $\mathbb{N}$ the positive integers. Let $f:\mathbb{N} \rightarrow \mathbb{N}$ be a function such that, for any $w,x,y,z \in \mathbb{N}$, \[ f(f(f(z)))f(wxf(yf(z)))=z^{2}f(xf(y))f(w). \] Show that $f(n!) \ge n!$ for every positive integer $n$. [i]Pakawut Jiradilok[/i]
Find all functions $f : Z^+ \to Z^+$ such that $n^3 - n^2 \le f(n) \cdot (f(f(n)))^2 \le n^3 + n^2$ for every $n$ in positive integers
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]
Let $S$ denote the set of $2$ by $2$ matrices with integer entries and determinant $1$, and let $T$ denote those matrices of $S$ which are congruent to the identity matrix $I\pmod3$ (so $\begin{pmatrix}a&b\\c&d\end{pmatrix}\in T$ means that $a,b,c,d\in\mathbb Z,ad-bc=1,$ and $3$ divides $b,c,a-1,d-1$). (a) Let $f:T\to\mathbb R$ be a function such that for every $X,Y\in T$ with $Y\ne I$, either $f(XY)>f(X)$ or $f(XY^{-1})>f(X)$. Show that given two finite nonempty subsets $A,B$ of $T$, there are matrices $a\in A$ and $b\in B$ such that if $a'\in A$, $b'\in B$ and $a'b'=ab$, then $a'=a$ and $b'=b$. (b) Show that there is no $f:S\to\mathbb R$ such that for every $X,Y\in S$ with $Y\ne\pm I$, either $f(XY)>f(X)$ or $f(XY^{-1})>f(X)$.
Let $f$ be a function that is defined for all positive integers and whose values are positive integers. For $f$ it also holds that $f (n + 1)> f (n)$ and $f (f (n)) = 3n$, for each positive integer $n$. Calculate $f (2019)$.
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]
$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$.
Find all functions $f : Z \to Z$ satisfying the following two conditions: (i) for all integers $x$ we have $f(f(x)) = x$, (ii) for all integers $x$ and y such that $x + y$ is odd, we have $f(x) + f(y) \ge x + y$.
Find all functions $f : Z^+ \to Z^+$ such that $f(k + 1) >f(f(k))$ for $k > 1$, where $Z^+$ is the set of positive integers.