Found problems: 4776
Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(2f(x)) = f(x - f(y)) + f(x) + y$$ for all $x, y \in \mathbb{R}$.
Let $\mathbb{N}$ be the set of all positive integers. The function $f: \mathbb{N} \to \mathbb{N}$ satisfies
$f(1)=3, f(mn)=f(m)f(n)-f(m+n)+2$ for all $m,n \in \mathbb{N}$.
Prove that $f$ does not exist.
Comment: The original problem asked for the value of $f(2006)$, which obviously does not exist when $f$ does not. This was probably a mistake by the Olympiad committee. Hence the modified problem.
$G$ is a set of non-constant functions $f$. Each $f$ is defined on the real line and has the form $f(x)=ax+b$ for some real $a,b$. If $f$ and $g$ are in $G$, then so is $fg$, where $fg$ is defined by $fg(x)=f(g(x))$. If $f$ is in $G$, then so is the inverse $f^{-1}$. If $f(x)=ax+b$, then $f^{-1}(x)= \frac{x-b}{a}$. Every $f$ in $G$ has a fixed point (in other words we can find $x_f$ such that $f(x_f)=x_f$. Prove that all the functions in $G$ have a common fixed point.
Find all functions $f:\mathbb{Z}_{>0}\rightarrow\mathbb{Z}_{>0}$ with the following properties:
1) For every natural number $n\geq 3$, $\gcd(f(n),n)\neq 1$.
2) For every natural number $n\geq 3$, there exists $i_n\in\mathbb{Z}_{>0}$, $1\leq i_n\leq n-1$, such that $f(n)=f(i_n)+f(n-i_n)$.
[i]Proposed by Pavel Ciurea[/i]
If $f(x) = ax^4-bx^2+x+5$ and $f(-3) = 2$, then $f(3) =$
$\textbf{(A)}\ -5 \qquad
\textbf{(B)}\ -2 \qquad
\textbf{(C)}\ 1 \qquad
\textbf{(D)}\ 3 \qquad
\textbf{(E)}\ 8$
Determine all functions $ f: \mathbb{R} \mapsto \mathbb{R}$ with $ x,y \in \mathbb{R}$ such that
\[ f(x \minus{} f(y)) \equal{} f(x\plus{}y) \plus{} f(y)\]
Let $A_1,A_2,\dots, A_n$ be finite, nonempty sets. Define the function
\[f(t)=\sum_{k=1}^n \sum_{1\leq i_1<i_2<\dots<i_k\leq n} (-1)^{k-1}t^{|A_{i_1}\cup A_{i_2}\cup \dots\cup A_{i_k}|}.\]
Prove that $f$ is nondecreasing on $[0,1].$
($|A|$ denotes the number of elements in $A.$)
Let $A$ be a set of functions $f : R\to R$.
For all $f_1, f_2 \in A$ there exists a $f_3 \in A$ such that $f_1(f_2(y) - x)+ 2x = f_3(x + y)$ for all $x, y \in R$.
Prove that for all $f \in A$, we have $f(x - f(x))= 0$ for all $x \in R$.
Find all sequences $a_{0}, a_{1},\ldots, a_{n}$ of real numbers such that $a_{n}\neq 0$, for which the following statement is true:
If $f: \mathbb{R}\to\mathbb{R}$ is an $n$ times differentiable function
and $x_{0}<x_{1}<\ldots <x_{n}$ are real numbers such that
$f(x_{0})=f(x_{1})=\ldots =f(x_{n})=0$ then there is $h\in (x_{0}, x_{n})$ for which \[a_{0}f(h)+a_{1}f'(h)+\ldots+a_{n}f^{(n)}(h)=0.\]
(1) For real numbers $x,\ a$ such that $0<x<a,$ prove the following inequality.
\[\frac{2x}{a}<\int_{a-x}^{a+x}\frac{1}{t}\ dt<x\left(\frac{1}{a+x}+\frac{1}{a-x}\right). \]
(2) Use the result of $(1)$ to prove that $0.68<\ln 2<0.71.$
Let $n\geq 2$ be a given integer. Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that
\[f(x-f(y))=f(x+y^n)+f(f(y)+y^n), \qquad \forall x,y \in \mathbb R.\]
Let $M,a,b,r$ be non-negative integers with $a,r\ge 2$, and suppose there exists a function $f:\mathbb{Z}\rightarrow\mathbb{Z}$ satisfying the following conditions:
(1) For all $n\in \mathbb{Z}$, $f^{(r)}(n)=an+b$ where $f^{(r)}$ denotes the composition of $r$ copies of $f$
(2) For all $n\ge M$, $f(n)\ge 0$
(3) For all $n>m>M$, $n-m|f(n)-f(m)$
Show that $a$ is a perfect $r$-th power.
Suppose from $(m+2)\times(n+2)$ rectangle we cut $4$, $1\times1$ corners. Now on first and last row first and last columns we write $2(m+n)$ real numbers. Prove we can fill the interior $m\times n$ rectangle with real numbers that every number is average of it's $4$ neighbors.
Suppose $a$ and $b$ are two positive real numbers such that the roots of the cubic equation $x^3 - ax + b = 0$ are all real. If $\alpha$ is a root of this cubic with minimal absolute value, prove that \[ \dfrac{b}{a} < \alpha < \dfrac{3b}{2a}. \]
Let $ f:\mathbb{D}\longrightarrow\mathbb{C} $ be a continuous function, where $ \mathbb{D} $ is the closed unit disk. Suppose that $ f $ is holomorphic on the open unit disk and that $ e^{i\theta } $ are roots, for any $ \theta\in\left[ 0,\pi /4 \right] . $ Show that $ f=0_{\mathbb{D}} . $
A continuous function $f : [a,b] \to [a,b]$ is called piecewise monotone if $[a, b]$ can be subdivided into finitely many subintervals
$$I_1 = [c_0,c_1], I_2 = [c_1,c_2], \dots , I_\ell = [ c_{\ell - 1},c_\ell ]$$
such that $f$ restricted to each interval $I_j$ is strictly monotone, either increasing or decreasing. Here we are assuming that $a = c_0 < c_1 < \cdots < c_{\ell - 1} < c_\ell = b$. We are also assuming that each $I_j$ is a maximal interval on which $f$ is strictly monotone. Such a maximal interval is called a lap of the function $f$, and the number $\ell = \ell (f)$ of distinct laps is called the lap number of $f$. If $f : [a,b] \to [a,b]$ is a continuous piecewise-monotone function, show that the sequence $( \sqrt[n]{\ell (f^n )})$ converges; here $f^n$ means $f$ composed with itself $n$-times, so $f^2 (x) = f(f(x))$ etc.
Let there be given an acute angle $\angle AOB = 3\alpha$, where $\overline{OA}= \overline{OB}$. The point $A$ is the center of a circle with radius $\overline{OA}$. A line $s$ parallel to $OA$ passes through $B$. Inside the given angle a variable line $t$ is drawn through $O$. It meets the circle in $O$ and $C$ and the given line $s$ in $D$, where $\angle AOC = x$. Starting from an arbitrarily chosen position $t_0$ of $t$, the series $t_0, t_1, t_2, \ldots$ is determined by defining $\overline{BD_{i+1}}=\overline{OC_i}$ for each $i$ (in which $C_i$ and $D_i$ denote the positions of $C$ and $D$, corresponding to $t_i$). Making use of the graphical representations of $BD$ and $OC$ as functions of $x$, determine the behavior of $t_i$ for $i\to \infty$.
Let $\mathcal{H}$ be the set of all lines in the plane. Call a function $f:\mathbb{R}^2\to\mathcal{H}$ [i]polarising[/i], if $P\in f(Q)$ implies $Q\in f(P)$ for any pair of points $P,Q\in\mathbb{R}^2.$
[list=a]
[*]Show that there is no surjective polarising function.
[*]Give an example of an injective polarising function.
[*]Prove that for every injective polarising function there exists a point $P$ in the plane for which $P\in f(P).$
[/list]
Let $ \{f_n \}_{n=0}^{\infty}$ be a uniformly bounded sequence of real-valued measurable functions defined on $ [0,1]$ satisfying \[ \int_0^1 f_n^2=1.\] Further, let $ \{ c_n \}$ be a sequence of real numbers with \[ \sum_{n=0}^{\infty} c_n^2= +\infty.\] Prove that some re-arrangement of the series $ \sum_{n=0}^{\infty} c_nf_n$ is divergent on a set of positive measure.
[i]J. Komlos[/i]
The function $f$ from the set $\mathbb{N}$ of positive integers into itself is defined by the equality \[f(n)=\sum_{k=1}^{n} \gcd(k,n),\qquad n\in \mathbb{N}.\]
a) Prove that $f(mn)=f(m)f(n)$ for every two relatively prime ${m,n\in\mathbb{N}}$.
b) Prove that for each $a\in\mathbb{N}$ the equation $f(x)=ax$ has a solution.
c) Find all ${a\in\mathbb{N}}$ such that the equation $f(x)=ax$ has a unique solution.
If $\min \left \{ \frac{ax^2+b}{\sqrt{x^2+1}} \mid x \in \mathbb{R}\right \} = 3$, then (1) Find the range of $b$; (2) for every given $b$, find $a$.
Actually, this is an MO I participated in :) but it's really hard to get problems from this year if you don't know some people.
P1. Let $f$ be a function satisfying $f(x + 1) + f(x - 1) = \sqrt{2} f(x)$, for all reals $x$. If $f(x - 1) = a$ and $f(x) = b$, determine the value of $f(x + 4)$.
[hide=Remarks]We found out that this is the modified version of a problem from LMNAS UGM 2008, Senior High School Level, on its First Round. This is also the same with Arthur Engel's "Problem Solving Strategies" Book, Example Problem E2.[/hide]
P2. The sequence of "Sanga" numbers is formed by the following procedure.
i. Pick a positive integer $n$.
ii. The first term of the sequence $(U_1)$ is $9n$.
iii. For $k \geq 2$, $U_k = U_{k-1} - 17$.
Sanga$[r]$ is the "Sanga" sequence whose smallest positive term is $r$.
As an example, for $n = 3$, the "Sanga" sequence which is formed is $27, 10, -7, -24, -41, \ldots.$ Since the smallest positive term of such sequence is $10$, for $n = 3$, the sequence formed is called Sanga$[10]$. For $n \leq 100$, determine the sum of all $n$ which makes the sequence Sanga$[4]$.
P3. The cube $ABCD.EFGH$ has an edge length of 6 cm. Point $R$ is on the extension of line (segment) $EH$ with $EH : ER = 1 : 2$, such that triangle $AFR$ cuts edge $GH$ at point $P$ and cuts edge $DH$ at $Q$. Determine the area of the region bounded by the quadrilateral $AFPQ$.
[url=https://artofproblemsolving.com/community/q1h2395046p19649729]P4[/url]. Ten skydivers are planning to form a circle formation when they are in the air by holding hands with both adjacent skydivers. If each person has 2 choices for the colour of his/her uniform to be worn, that is, red or white, determine the number of different colour formations that can be constructed.
P5. After pressing the start button, a game machine works according to the following procedure.
i. It picks 7 numbers randomly from 1 to 9 (these numbers are integers, not stated but corrected) without showing it on screen.
ii. It shows the product of the seven chosen numbes on screen.
iii. It shows a calculator menu (it does not function as a calculator) on screen and asks the player whether the sum of the seven chosen numbers is odd or even.
iv. Shows the seven chosen numbers and their sum and products.
v. Releases a prize if the guess of the player was correct or shows the message "Try again" on screen if the guess by the player was incorrect. (Although the player is not allowed to guess with those numbers, and the machine's procedures are started all over again.)
Kiki says that this game is really easy since the probability of winning is greater than $90$%. Explain, whether you agree with Kiki.
Determine all functions $f:(0,\infty)\to\mathbb{R}$ satisfying $$\left(x+\frac{1}{x}\right)f(y)=f(xy)+f\left(\frac{y}{x}\right)$$ for all $x,y>0$.
Let $f: \mathbb{R}\to\mathbb{R}$ be a continuous function, and $a<b$ be two points in the image of $f$ (that is, there exists $x,y$ such that $f(x)=a$ and $f(y)=b$).
Show that there is an interval $I$ such that $f(I)=[a,b]$.
Given a tetrahedron $ABCD$, $E$, $F$, $G$, are on the respectively on the segments $AB$, $AC$ and $AD$. Prove that:
i) area $EFG \leq$ max{area $ABC$,area $ABD$,area $ACD$,area $BCD$}.
ii) The same as above replacing "area" for "perimeter".