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 $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:R->R$ such that : $f(1)=1$ and for any $x\in R$ i) $f(x+5)\geq f(x)+5$ ii)$f(x+1)\leq f(x)+1$ If $g(x)=f(x)+1-x$ find g(2016)
Let $f(x) = \frac{1}{1+x}$ where $x$ is a positive real number, and for any positive integer $n$, let $g_n(x) = x + f(x) + f(f(x)) + ... + f(f(... f(x)))$, the last term being $f$ composed with itself $n$ times. Prove that (i) $g_n(x) > g_n(y)$ if $x > y > 0$. (ii) $g_n(1) = \frac{F_1}{F_2}+\frac{F_2}{F_3}+...+\frac{F_{n+1}}{F_{n+2}}$ , where $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1} +F_n$ for $n \ge 1$.
Source: 1976 Euclid Part A Problem 10 ----- If $f$, $g$, $h$, and $k$ are functions and $a$ and $b$ are numbers such that $f(x)=(x-1)g(x)+3=(x+1)h(x)+1=(x^2-1)k(x)+ax+b$ for all $x$, then $(a,b)$ equals $\textbf{(A) } (-2,1) \qquad \textbf{(B) } (-1,2) \qquad \textbf{(C) } (1,1) \qquad \textbf{(D) } (1,2) \qquad \textbf{(E) } (2,1)$
Let $-1<a<0$, $\theta=\arcsin a$. Then the solution set to the inequality $\sin x<a$ is $\text{(A)}\{x|2n\pi+\theta<x<(2n+1)\pi-\theta,n\in\mathbb{Z}\}$ $\text{(B)}\{x|2n\pi-\theta<x<(2n+1)\pi+\theta,n\in\mathbb{Z}\}$ $\text{(C)}\{x|(2n-1)\pi+\theta<x<2n\pi-\theta,n\in\mathbb{Z}\}$ $\text{(D)}\{x|(2n-1)\pi-\theta<x<2n\pi+\theta,n\in\mathbb{Z}\}$
Let $f(x)$ be a function which is differentiable twice and $f''(x)>0$ on $[0,\ 1]$. For a positive integer $n$, find $\lim_{n\to\infty} n\left\{\int_0^1 f(x)\ dx-\frac{1}{n}\sum_{k=0}^{n-1} f\left(\frac{k}{n}\right)\right\}.$
Let be a function $ f:\mathbb{N}\longrightarrow\mathbb{N} $ satisfying $ \text{(i)} f(1)=1 $ $ \text{(ii)} f(p)=1+f(p-1), $ for any prime $ p $ $ \text{(iii)} f(p_1p_2\cdots p_u)=f(p_1)+f(p_2)+\cdots f(p_u), $ for any natural number $ u $ and any primes $ p_1,p_2,\ldots ,p_u. $ Show that $ 2^{f(n)}\le n^3\le 3^{f(n)}, $ for any natural $ n\ge 2. $
Let $0 \le a < b$ be real numbers. Prove that there is no continuous function $f : [a, b] \to \mathbb{R}$ such that \[ \int_a^b f(x)x^{2n} \mathrm dx>0 \quad \text{and} \quad \int_a^b f(x)x^{2n+1} \mathrm dx <0 \] for every integer $n \ge 0$.
Let $\mathbb{R}$ denote the set of all real numbers. Determine all functions $f:\mathbb{R}\to\mathbb{R}$ such that for all real numbers $x$ and $y$, \[f(xy+xf(x))=f(x)\left(f(x)+f(y)\right).\]
Find the nondecreasing functions $ f:[0,1]\rightarrow\mathbb{R} $ that satisfy $$ \left| \int_0^1 f(x)e^{nx} dx\right|\le 2008 , $$ for any nonnegative integer $ n. $ [i]Mihai Piticari[/i]
Given a function $ f:\mathbb{N}\longrightarrow\mathbb{N} , $ find the necessary and sufficient condition that makes the sequence $$ \left(\left( 1+\frac{(-1)^{f(n)}}{n+1} \right)^{(-1)^{-f(n+1)}\cdot(n+2)}\right)_{n\ge 1} $$ to be monotone.
Let $x_1, x_2, \ldots , x_n \ (n \geq 1)$ be real numbers such that $0 \leq x_j \leq \pi, \ j = 1, 2,\ldots, n.$ Prove that if $\sum_{j=1}^n (\cos x_j +1) $ is an odd integer, then $\sum_{j=1}^n \sin x_j \geq 1.$
Suppose that $f:[-1,1] \to \mathbb{R}$ is continuous and satisfies \[\left(\int_{-1}^1 e^xf(x) dx\right)^2 \ge \left(\int_{-1}^1 f(x) dx\right)\left(\int_{-1}^1 e^{2x}f(x) dx\right).\] Prove that there exists a point $c \in (-1,1)$ such that $f(c)=0$.
Let $f: \mathbb{R} \to \mathbb{R}$ be a continuous function such that $f(x)+\sin(f(x)) \ge x,$ for all $x \in \mathbb{R}.$ Prove that $$\int\limits_0^{\pi} f(x) \mathrm{d}x \ge \frac{\pi^2}{2}-2.$$
Given is a function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $|f(x+y)-f(x)-f(y)|\leq 1$. Prove the existence of an additive function $g:\mathbb{R}\rightarrow \mathbb{R}$ (that is $g(x+y)=g(x)+g(y)$) such that $|f(x)-g(x)|\leq 1$ for any $x \in \mathbb{R}$
Let $\mathbb{R}$ be the set of real numbers. Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function such that \[f(x+y)f(x-y)\geqslant f(x)^2-f(y)^2\] for every $x,y\in\mathbb{R}$. Assume that the inequality is strict for some $x_0,y_0\in\mathbb{R}$. Prove that either $f(x)\geqslant 0$ for every $x\in\mathbb{R}$ or $f(x)\leqslant 0$ for every $x\in\mathbb{R}$.
Find all functions $f:\mathbb{N}^{\ast}\rightarrow\mathbb{N}^{\ast}$ with the properties: [list=a] [*]$ f(m+n) -1 \mid f(m)+f(n),\quad \forall m,n\in\mathbb{N}^{\ast} $ [*]$ n^{2}-f(n)\text{ is a square } \;\forall n\in\mathbb{N}^{\ast} $[/list]
For all natural numbers $n$, define $f(n) = \tau (n!) - \tau ((n-1)!)$, where $\tau(a)$ denotes the number of positive divisors of $a$. Prove that there exist infinitely many composite $n$, such that for all naturals $m < n$, we have $f(m) < f(n)$.
Let $p$ and $q$ be complex polynomials with $\deg p>\deg q$ and let $f(z)=\frac{p(z)}{q(z)}$. Suppose that all roots of $p$ lie inside the unit circle $|z|=1$ and that all roots of $q$ lie outside the unit circle. Prove that $$\max_{|z|=1}|f'(z)|>\frac{\deg p-\deg q}2\max_{|z|=1}|f(z)|.$$
Let $f_0(x)=x+|x-100|-|x+100|$, and for $n\geq 1$, let $f_n(x)=|f_{n-1}(x)|-1$. For how many values of $x$ is $f_{100}(x)=0$? $\textbf{(A) }299\qquad \textbf{(B) }300\qquad \textbf{(C) }301\qquad \textbf{(D) }302\qquad \textbf{(E) }303\qquad$
Find both extrema of the function $ x\to\frac{\sin x-3}{\cos x +2} .$
If $f(2x)=\frac{2}{2+x}$ for all $x>0$, then $2f(x)=$ $ \textbf{(A)}\ \frac{2}{1+x} \qquad\textbf{(B)}\ \frac{2}{2+x} \qquad\textbf{(C)}\ \frac{4}{1+x} \qquad\textbf{(D)}\ \frac{4}{2+x} \qquad\textbf{(E)}\ \frac{8}{4+x} $
Let $ n>4$ be a positive integer such that $ n$ is composite (not a prime) and divides $ \varphi (n) \sigma (n) \plus{}1$, where $ \varphi (n)$ is the Euler's totient function of $ n$ and $ \sigma (n)$ is the sum of the positive divisors of $ n$. Prove that $ n$ has at least three distinct prime factors.
Let $ n\left(A\right)$ be the number of distinct real solutions of the equation $ x^{6} \minus{}2x^{4} \plus{}x^{2} \equal{}A$. When $ A$ takes every value on real numbers, the set of values of $ n\left(A\right)$ is $\textbf{(A)}\ \left\{0,1,2,3,4,5,6\right\} \\ \textbf{(B)}\ \left\{0,2,4,6\right\} \\ \textbf{(C)}\ \left\{0,3,4,6\right\} \\ \textbf{(D)}\ \left\{0,2,3,4,6\right\} \\ \textbf{(E)}\ \left\{0,2,3,4\right\}$
We say that a function $f:\mathbb{R}^k \rightarrow \mathbb{R}$ is a metapolynomial if, for some positive integers $m$ and $n$, it can be represented in the form \[f(x_1,\cdots , x_k )=\max_{i=1,\cdots , m} \min_{j=1,\cdots , n}P_{i,j}(x_1,\cdots , x_k),\] where $P_{i,j}$ are multivariate polynomials. Prove that the product of two metapolynomials is also a metapolynomial.