Found problems: 4776
2001 Federal Competition For Advanced Students, Part 2, 1
Find all functions $f :\mathbb R \to \mathbb R$ such that for all real $x, y$
\[f(f(x)^2 + f(y)) = xf(x) + y.\]
1999 IMC, 4
Prove that there's no function $f: \mathbb{R}^+\rightarrow\mathbb{R}^+$ such that $f(x)^2\ge f(x+y)\left(f(x)+y\right)$ for all $x,y>0$.
1995 French Mathematical Olympiad, Problem 5
Let $f$ be a bijection from $\mathbb N$ to itself. Prove that one can always find three natural number $a,b,c$ such that $a<b<c$ and $f(a)+f(c)=2f(b)$.
2006 Italy TST, 3
Find all functions $f : \mathbb{Z} \rightarrow \mathbb{Z}$ such that for all integers $m,n$,
\[f(m - n + f(n)) = f(m) + f(n).\]
2014 ELMO Shortlist, 5
Let $\mathbb R^\ast$ denote the set of nonzero reals. Find all functions $f: \mathbb R^\ast \to \mathbb R^\ast$ satisfying \[ f(x^2+y)+1=f(x^2+1)+\frac{f(xy)}{f(x)} \] for all $x,y \in \mathbb R^\ast$ with $x^2+y\neq 0$.
[i]Proposed by Ryan Alweiss[/i]
2005 Bulgaria Team Selection Test, 4
Let $a_{i}$ and $b_{i}$, where $i \in \{1,2, \dots, 2005 \}$, be real numbers such that the inequality $(a_{i}x-b_{i})^{2} \ge \sum_{j=1, j \not= i}^{2005} (a_{j}x-b_{j})$ holds for all $x \in \mathbb{R}$ and all $i \in \{1,2, \dots, 2005 \}$. Find the maximum possible number of positive numbers amongst $a_{i}$ and $b_{i}$, $i \in \{1,2, \dots, 2005 \}$.
2023 Indonesia TST, A
Find all function $f: \mathbb{R} \rightarrow \mathbb{R}$ satisfied
\[f(x+y) + f(x)f(y) = f(xy) + 1 \]
$\forall x, y \in \mathbb{R}$
2011 APMO, 5
Determine all functions $f:\mathbb{R}\to\mathbb{R}$, where $\mathbb{R}$ is the set of all real numbers, satisfying the following two conditions:
1) There exists a real number $M$ such that for every real number $x,f(x)<M$ is satisfied.
2) For every pair of real numbers $x$ and $y$,
\[ f(xf(y))+yf(x)=xf(y)+f(xy)\]
is satisfied.
2001 AMC 12/AHSME, 24
In $ \triangle ABC$, $ \angle ABC \equal{} 45^\circ$. Point $ D$ is on $ \overline{BC}$ so that $ 2 \cdot BD \equal{} CD$ and $ \angle DAB \equal{} 15^\circ$. Find $ \angle ACB$.
[asy]
pair A, B, C, D;
A = origin;
real Bcoord = 3*sqrt(2) + sqrt(6);
B = Bcoord/2*dir(180);
C = sqrt(6)*dir(120);
draw(A--B--C--cycle);
D = (C-B)/2.4 + B;
draw(A--D);
label("$A$", A, dir(0));
label("$B$", B, dir(180));
label("$C$", C, dir(110));
label("$D$", D, dir(130));
[/asy]
$ \textbf{(A)} \ 54^\circ \qquad \textbf{(B)} \ 60^\circ \qquad \textbf{(C)} \ 72^\circ \qquad \textbf{(D)} \ 75^\circ \qquad \textbf{(E)} \ 90^\circ$
1981 Spain Mathematical Olympiad, 5
Given a nonzero natural number $n$, let $f_n$ be the function of the closed interval $[0, 1]$ in $R$ defined like this:
$$f_n(x) = \begin{cases}n^2x, \,\,\, if \,\,\, 0 \le x < 1/n\\ 3/n, \,\,\,if \,\,\,1/n \le x \le 1 \end{cases}$$
a) Represent the function graphically.
b) Calculate $A_n =\int_0^1 f_n(x) dx$.
c) Find, if it exists, $\lim_{n\to \infty} A_n$ .
2018 Ramnicean Hope, 3
[b]a)[/b] Let $ u $ be a polynom in $ \mathbb{Q}[X] . $ Prove that the function $ E_u:\mathbb{Q}[X]\longrightarrow\mathbb{Q}[X] $ defined as $ E_u(P)=P(u) $ is an endomorphism.
[b]b)[/b] Let $ E $ be an injective endomorphism of $ \mathbb{Q} [X] . $ Show that there exists a nonconstant polynom $ v $ in $ \mathbb{Q}[X] $ such that $ E(P)=P(v) , $ for any $ P $ in $ \mathbb{Q}[X] . $
[b]c)[/b] Let $ A $ be an automorphism of $ \mathbb{Q}[X] . $ Demonstrate that there is a nonzero constant polynom $ w $ in $ \mathbb{Q}[X] $ which has the property that $ A(P)=P(w) , $ for any $ P $ in $ \mathbb{Q}[X] . $
[i]Marcel Țena[/i]
2013 China Girls Math Olympiad, 4
Find the number of polynomials $f(x)=ax^3+bx$ satisfying both following conditions:
(i) $a,b\in\{1,2,\ldots,2013\}$;
(ii) the difference between any two of $f(1),f(2),\ldots,f(2013)$ is not a multiple of $2013$.
Taiwan TST 2015 Round 1, 2
Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\]
[i]Proposed by Denmark[/i]
2005 China National Olympiad, 4
The sequence $\{a_n\}$ is defined by: $a_1=\frac{21}{16}$, and for $n\ge2$,\[ 2a_n-3a_{n-1}=\frac{3}{2^{n+1}}. \]Let $m$ be an integer with $m\ge2$. Prove that: for $n\le m$, we have\[ \left(a_n+\frac{3}{2^{n+3}}\right)^{\frac{1}{m}}\left(m-\left(\frac{2}{3}\right)^{{\frac{n(m-1)}{m}}}\right)<\frac{m^2-1}{m-n+1}. \]
1984 AMC 12/AHSME, 16
The function $f(x)$ satisfies $f(2+x) = f(2-x)$ for all real numbers $x$. If the equation $f(x) = 0$ has exactly four distinct real roots, then the sum of these roots is
A. 0
B. 2
C. 4
D. 6
E. 8
2012 Romania Team Selection Test, 1
Prove that for any positive integer $n\geq 2$ we have that \[\sum_{k=2}^n \lfloor \sqrt[k]{n}\rfloor=\sum_{k=2}^n\lfloor\log_{k}n\rfloor.\]
1986 Vietnam National Olympiad, 2
Find all $ n > 1$ such that the inequality \[ \sum_{i\equal{}1}^nx_i^2\ge x_n\sum_{i\equal{}1}^{n\minus{}1}x_i\] holds for all real numbers $ x_1$, $ x_2$, $ \ldots$, $ x_n$.
2025 Israel TST, P1
Let \(\mathcal{F}\) be a family of functions from \(\mathbb{R}^+ \to \mathbb{R}^+\). It is known that for all \( f, g \in \mathcal{F} \), there exists \( h \in \mathcal{F} \) such that for all \( x, y \in \mathbb{R}^+ \), the following equation holds:
\[
y^2 \cdot f\left(\frac{g(x)}{y}\right) = h(xy)
\]
Prove that for all \( f \in \mathcal{F} \) and all \( x \in \mathbb{R}^+ \), the following identity is satisfied:
\[
f\left(\frac{x}{f(x)}\right) = 1.
\]
2009 Indonesia TST, 3
Find all function $ f: \mathbb{R} \rightarrow \mathbb{R}$ such that
\[ f(x \plus{} y)(f(x) \minus{} y) \equal{} xf(x) \minus{} yf(y)
\]
for all $ x,y \in \mathbb{R}$.
1994 Vietnam Team Selection Test, 3
Calculate
\[T = \sum \frac{1}{n_1! \cdot n_2! \cdot \cdots n_{1994}! \cdot (n_2 + 2 \cdot n_3 + 3 \cdot n_4 + \ldots + 1993 \cdot n_{1994})!}\]
where the sum is taken over all 1994-tuples of the numbers $n_1, n_2, \ldots, n_{1994} \in \mathbb{N} \cup \{0\}$ satisfying $n_1 + 2 \cdot n_2 + 3 \cdot n_3 + \ldots + 1994 \cdot n_{1994} = 1994.$
1985 Traian Lălescu, 1.2
Is there a real interval $ I $ for which there exists a primitivable function $ f:I\longrightarrow I $ with the property that $ (f\circ f) (x)=-x, $ for all $ x\in I $ ?
2013 ELMO Shortlist, 5
Let $a,b,c$ be positive reals satisfying $a+b+c = \sqrt[7]{a} + \sqrt[7]{b} + \sqrt[7]{c}$. Prove that $a^a b^b c^c \ge 1$.
[i]Proposed by Evan Chen[/i]
2004 Alexandru Myller, 1
Find the number of self-maps of a set of $ 5 $ elements having the property that the preimage of any element of this set has $ 2 $ elements at most.
[i]Adrian Zanoschi[/i]
1991 IMTS, 1
For every positive integer $n$, form the number $n/s(n)$, where $s(n)$ is the sum of digits of $n$ in base 10. Determine the minimum value of $n/s(n)$ in each of the following cases:
(i) $10 \leq n \leq 99$
(ii) $100 \leq n \leq 999$
(iii) $1000 \leq n \leq 9999$
(iv) $10000 \leq n \leq 99999$
2011 IMO Shortlist, 4
Determine all pairs $(f,g)$ of functions from the set of positive integers to itself that satisfy \[f^{g(n)+1}(n) + g^{f(n)}(n) = f(n+1) - g(n+1) + 1\] for every positive integer $n$. Here, $f^k(n)$ means $\underbrace{f(f(\ldots f)}_{k}(n) \ldots ))$.
[i]Proposed by Bojan Bašić, Serbia[/i]