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

Find all functions $f:\mathbb R\to\mathbb R$ such that $$f\left( x^2+xf(y)\right)=xf(x+y)$$ for all reals $x,y$.
For every positive integer $N\geq 2$ with prime factorisation $N=p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}$ we define \[f(N):=1+p_1a_1+p_2a_2+\cdots+p_ka_k.\] Let $x_0\geq 2$ be a positive integer. We define the sequence $x_{n+1}=f(x_n)$ for all $n\geq 0.$ Prove that this sequence is eventually periodic and determine its fundamental period.
Find all continuous functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that \[(f(x)f(y)-1)f(x+y)=2f(x)f(y)-f(x)-f(y)\quad \forall x,y\in \mathbb{R}\]
Let $\mathbb{Z}$ denote the set of integers and $S \subset \mathbb{Z} $ be the set of integers that are at least $10^{100}$. Fix a positive integer $c$. Determine all functions $f: S \rightarrow \mathbb{Z} $ satisfying $f(xy+c)=f(x)+f(y)$, for all $x,y \in S$
Number $a$ is such that $\forall a_1, a_2, a_3, a_4 \in \mathbb{R}$, there are integers $k_1, k_2, k_3, k_4$ such that $\sum_{1 \leq i < j \leq 4} ((a_i - k_i) - (a_j - k_j))^2 \leq a$. Find the minimum of $a$.
Find all integers $b$ such that there exists a positive real number $x$ with \[ \dfrac {1}{b} = \dfrac {1}{\lfloor 2x \rfloor} + \dfrac {1}{\lfloor 5x \rfloor} \] Here, $\lfloor y \rfloor$ denotes the greatest integer that is less than or equal to $y$.
Let $0 < a, b, c < 1$ with $ab + bc + ca = 1$. Prove that \[\frac{a}{1-a^2} + \frac{b}{1-b^2} + \frac{c}{1-c^2} \geq \frac {3 \sqrt{3}}{2}.\] Determine when equality holds.
Find all functions $f:(1,+\infty) \rightarrow (1,+\infty)$ that satisfy the following condition: for arbitrary $x,y>1$ and $u,v>0$, inequality $f(x^uy^v)\le f(x)^{\dfrac{1}{4u}}f(y)^{\dfrac{1}{4v}}$ holds.
If $T$ and $T_1$ are two triangles with angles $x, y, z$ and $x_1, y_1, z_1$, respectively, prove the inequality \[\frac{\cos x_1}{\sin x}+\frac{\cos y_1}{\sin y}+\frac{\cos z_1}{\sin z} \leq \cot x+\cot y+\cot z.\]
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}$
What is the remainder when $2011^{(2011^{(2011^{(2011^{2011})})})}$ is divided by $19$ ? $\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 2 \qquad\textbf{(E)}\ 1$
Prove that, for a function $f \colon \mathbb{R} \to \mathbb{R}$, the following $2$ statements are equivalent: a) $f$ is differentiable, with continuous first derivative. b) For any $a\in\mathbb{R}$ and for any two sequences $(x_n)_{n\geq 1},(y_n)_{n\geq 1}$, convergent to $a$, such that $x_n \neq y_n$ for any positive integer $n$, the sequence $\left(\frac{f(x_n)-f(y_n)}{x_n-y_n}\right)_{n\geq 1}$ is convergent.
Let $ f, g: \mathbb {R} \to \mathbb {R} $ function such that $ f (x + g (y)) = - x + y + 1 $ for each pair of real numbers $ x $ e $ y $. What is the value of $ g (x + f (y) $?
If $k$ is a positive number and $f$ is a function such that, for every positive number $x$, \[\left[f(x^2+1)\right]^{\sqrt{x}}=k;\] then, for every positive number $y$, \[\left[f(\frac{9+y^2}{y^2})\right]^{\sqrt{\frac{12}{y}}}\] is equal to $\textbf{(A) }\sqrt{k}\qquad\textbf{(B) }2k\qquad\textbf{(C) }k\sqrt{k}\qquad\textbf{(D) }k^2\qquad \textbf{(E) }y\sqrt{k}$
The sequence \[\log_{12}{162},\, \log_{12}{x},\, \log_{12}{y},\, \log_{12}{z},\, \log_{12}{1250}\] is an arithmetic progression. What is $x$? $ \textbf{(A)} \ 125\sqrt{3} \qquad \textbf{(B)} \ 270 \qquad \textbf{(C)} \ 162\sqrt{5} \qquad \textbf{(D)} \ 434 \qquad \textbf{(E)} \ 225\sqrt{6}$
Let $a,b$ be the smaller sides of a right triangle. Let $c$ be the hypothenuse and $h$ be the altitude from the right angle. Fint the maximal value of $\frac{c+h}{a+b}$.
Let $A=\{1, 3, 5, 7, 9\}$ and $B=\{2, 4, 6, 8, 10\}$. Let $f$ be a randomly chosen function from the set $A\cup B$ into itself. There are relatively prime positive integers $m$ and $n$ such that $\frac{m}{n}$ is the probablity that $f$ is a one-to-one function on $A\cup B$ given that it maps $A$ one-to-one into $A\cup B$ and it maps $B$ one-to-one into $A\cup B$. Find $m+n$.
Find all functions $ f: \mathbb{Z}\setminus\{0\}\to \mathbb{Q}$ such that for all $ x,y \in \mathbb{Z}\setminus\{0\}$: \[ f \left( \frac{x+y}{3}\right) =\frac{f(x)+f(y)}{2}, \; \; x, y \in \mathbb{Z}\setminus\{0\}\]
Evaluate \[\int_{-\ln 2}^0\ \frac{dx}{\cos ^2 h x \cdot \sqrt{1-2a\tanh x +a^2}}\ (a>0)\]
Let $f:\mathbb{N}^*\rightarrow \mathbb{N}^*$ be a function such that $\frac{x^3+3x^2f(y)}{x+f(y)}+\frac{y^3+3y^2f(x)}{y+f(x)}=\frac{(x+y)^3}{f(x+y)},~(\forall)x,y\in\mathbb{N}^*.$ $a)$ Prove that $f(1)=1.$ $b)$ Find function $f.$
Let $\mathbb{N}_0$ and $\mathbb{Z}$ be the set of all non-negative integers and the set of all integers, respectively. Let $f:\mathbb{N}_0\rightarrow\mathbb{Z}$ be a function defined as \[f(n)=-f\left(\left\lfloor\frac{n}{3}\right\rfloor \right)-3\left\{\frac{n}{3}\right\} \] where $\lfloor x \rfloor$ is the greatest integer smaller than or equal to $x$ and $\{ x\}=x-\lfloor x \rfloor$. Find the smallest integer $n$ such that $f(n)=2010$.
Let $f : \mathbb{Z} \rightarrow \mathbb{Z}^+$ be a function, and define $h : \mathbb{Z} \times \mathbb{Z} \rightarrow \mathbb{Z}^+$ by $h(x, y) = \gcd (f(x), f(y))$. If $h(x, y)$ is a two-variable polynomial in $x$ and $y$, prove that it must be constant.
How many functions $\{f : 1,2, \cdots, 2013\} \rightarrow \{1,2, \cdots, 2013\}$ satisfy $f(j) < f(i) + j - i$ for all integers $i,j$ such that $1 \leq i < j \leq 2013$ ?
Let $S$ be the set of all positive integers that are [i]not[/i] perfect squares. For $n$ in $S,$ consider choices of integers $a_1,a_2,\dots, a_r$ such that $n<a_1<a_2<\cdots<a_r$ and $n\cdot a_1\cdot a_2\cdots a_r$ is a perfect square, and let $f(n)$ be the minimum of $a_r$ over all such choices. For example, $2\cdot 3\cdot 6$ is a perfect square, while $2\cdot 3,2\cdot 4, 2\cdot 5, 2\cdot 3\cdot 4,$ $2\cdot 3\cdot 5, 2\cdot 4\cdot 5,$ and $2\cdot 3\cdot 4\cdot 5$ are not, and so $f(2)=6.$ Show that the function $f$ from $S$ to the integers is one-to-one.