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: 4776

Let $a, b, c$ be positive reals with $a^{2014}+b^{2014}+c^{2014}+abc=4$. Prove that \[ \frac{a^{2013}+b^{2013}-c}{c^{2013}} + \frac{b^{2013}+c^{2013}-a}{a^{2013}} + \frac{c^{2013}+a^{2013}-b}{b^{2013}} \ge a^{2012}+b^{2012}+c^{2012}. \][i]Proposed by David Stoner[/i]
For every natural number $n$ we define \[f(n)=\left\lfloor n+\sqrt{n}+\frac{1}{2}\right\rfloor\] Show that for every integer $k \geq 1$ the equation \[f(f(n))-f(n)=k\] has exactly $2k-1$ solutions.
Find all functions $f$ from the real numbers to the real numbers such that $f(xy) \le \frac12 \left(f(x) + f(y) \right)$ for all real numbers $x$ and $y$.
Let $ P$ be a plane. Prove that there exists no function $ f: P\rightarrow P$ such that for every convex quadrilateral $ ABCD$, the points $ f(A),f(B),f(C),f(D)$ are the vertices of a concave quadrilateral. [i]Dinu Şerbănescu[/i]
Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that $f(x)f(y)+f(x+y)=xy$ for all real numbers $x$ and $y$.
Let $f\in C^3(\mathbb{R})$ nonnegative function with $f(0)=f'(0)=0, f''(0)>0$. Define $g(x)$ as follows: \[ \{ \begin{array}{ccc}g(x)= (\frac{\sqrt{f(x)}}{f'(x)})' &\text{for}& x\not=0 \\ g(x)=0 &\text{for}& x=0\end{array} \] (a) Show that $g$ is bounded in some neighbourhood of $0$. (b) Is the above true for $f\in C^2(\mathbb{R})$?
The ratio $ \dfrac{10^{2000}\plus{}10^{2002}}{10^{2001}\plus{}10^{2001}}$ is closest to which of the following numbers? $ \text{(A)}\ 0.1\qquad \text{(B)}\ 0.2\qquad \text{(C)}\ 1\qquad \text{(D)}\ 5\qquad \text{(E)}\ 10$
Let $ S$ be the set of all real numbers strictly greater than −1. Find all functions $ f: S \to S$ satisfying the two conditions: (a) $ f(x \plus{} f(y) \plus{} xf(y)) \equal{} y \plus{} f(x) \plus{} yf(x)$ for all $ x, y$ in $ S$; (b) $ \frac {f(x)}{x}$ is strictly increasing on each of the two intervals $ \minus{} 1 < x < 0$ and $ 0 < x$.
Let $f(x)$ be a continuous function such that $f(2x^2-1)=2xf(x)$ for all $x$. Show that $f(x)=0$ for $-1\le x \le 1$.
For a real-valued function $f(x,y)$ of two positive real variables $x$ and $y$, define $f$ to be [i]linearly bounded[/i] if and only if there exists a positive number $K$ such that $|f(x,y)| < K(x+y)$ for all positive $x$ and $y.$ Find necessary and sufficient conditions on the real numbers $\alpha$ and $\beta$ such that $x^{\alpha}y^{\beta}$ is linearly bounded.
Find all functions $f: \mathbb{R}^2 \rightarrow \mathbb{R}$, such that 1) $f(0,x)$ is non-decreasing ; 2) for any $x,y \in \mathbb{R}$, $f(x,y)=f(y,x)$ ; 3) for any $x,y,z \in \mathbb{R}$, $(f(x,y)-f(y,z))(f(y,z)-f(z,x))(f(z,x)-f(x,y))=0$ ; 4) for any $x,y,a \in \mathbb{R}$, $f(x+a,y+a)=f(x,y)+a$ .
The real function $f$ is defined for $\forall$ $x\in \mathbb{R}$ and $f(0)=0$. Also $f(9+x)=f(9-x)$ and $f(x-10)=f(-x-10)$ for $\forall$ $x\in \mathbb{R}$. What’s the least number of zeros $f$ can have in the interval $[0;2014]$? Does this change, if $f$ is also continuous?
Let $ f:[-1,1]\longrightarrow\mathbb{R} $ a derivable function and a non-negative integer $ n. $ Show that there is a $ c\in [-1,1] $ so that: $$ \int_{-1}^1 x^{2n+1} f(x)dx =\frac{2}{2n+3}f'(c). $$
For which values of $ k$ and $ d$ has the system $ x^3\plus{}y^3\equal{}2$ and $ y\equal{}kx\plus{}d$ no real solutions $ (x,y)$?
The maximum value of function $f(x)=\sqrt{x^4-3x^2-6x+13}-\sqrt{x^4-x^2+1}$ is________.
Suppose that $a_{1},a_{2},\dots,a_{k}\in\mathbb C$ that for each $1\leq i\leq k$ we know that $|a_{k}|=1$. Suppose that \[\lim_{n\to\infty}\sum_{i=1}^{k}a_{i}^{n}=c.\] Prove that $c=k$ and $a_{i}=1$ for each $i$.
Find all functions $f:\mathbb {Z}\to\mathbb Z$, satisfy that for any integer ${a}$, ${b}$, ${c}$, $$2f(a^2+b^2+c^2)-2f(ab+bc+ca)=f(a-b)^2+f(b-c)^2+f(c-a)^2$$
A real-valued function $ f$ satisfies for all reals $ x$ and $ y$ the equality \[ f (xy) \equal{} f (x)y \plus{} x f (y). \] Prove that this function satisfies for all reals $ x$ and $ y \ne 0$ the equality \[ f\left(\frac{x}{y}\right)\equal{}\frac{f (x)y \minus{} x f (y)}{y^2} \]
Given a function $f(x)=x^{2}+ax+b$ with $a,b \in R$, if there exists a real number $m$ such that $\left| f(m) \right| \leq \frac{1}{4}$ and $\left| f(m+1) \right| \leq \frac{1}{4}$, then find the maximum and minimum of the value of $\Delta=a^{2}-4b$.
Let $ P(x)$ be the real polynomial function, $ P(x) \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} d.$ Prove that if $ |P(x)| \leq 1$ for all $ x$ such that $ |x| \leq 1,$ then \[ |a| \plus{} |b| \plus{} |c| \plus{} |d| \leq 7.\]
Each positive integer is coloured red or blue. A function $f$ from the set of positive integers to itself has the following two properties: (a) if $x\le y$, then $f(x)\le f(y)$; and (b) if $x,y$ and $z$ are (not necessarily distinct) positive integers of the same colour and $x+y=z$, then $f(x)+f(y)=f(z)$. Prove that there exists a positive number $a$ such that $f(x)\le ax$ for all positive integers $x$. [i](United Kingdom) Ben Elliott[/i]
A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation $$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$ Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.
Let $\displaystyle{z}$ be a complex number with $\displaystyle{\left| {z + 1} \right| > 2}$. Prove that $\displaystyle{\left| {{z^3} + 1} \right| > 1}$. [i]Proposed by Walther Janous and Gerhard Kirchner, Innsbruck.[/i]
Find all real-valued functions on the positive integers such that $f(x + 1019) = f(x)$ for all $x$, and $f(xy) = f(x) f(y)$ for all $x,y$.
Set $p\ge 5$ be a prime number and $n$ be a natural number. Let $f$ be a function $ f: \mathbb{Z_{ \neq }}_0 \rightarrow \mathbb{ N }_0 $ satisfy the following conditions: i) For all sequences of integers satisfy $ a_i \not\in \{0, 1\} $, and $ p $ $\not |$ $ a_i-1 $, $ \forall $ $ 1 \le i \le p-2 $,\\ $$ \displaystyle \sum^{p-2}_{i=1}f(a_i)=f(a_1a_2 \cdots a_{p-2}) $$ ii) For all coprime integers $ a $ and $ b $, $ a \equiv b \pmod p \Rightarrow f(a)=f(b) $ iii) There exist $k \in \mathbb{Z}_{\neq 0} $ that satisfy $ f(k)=n $ Prove that the number of such functions is $ d(n) $, where $ d(n) $ denotes the number of divisors of $ n $.