Found problems: 4776
Prove that for any function $f(x)$, continuous or otherwise, $$f(f(x)) = x^2 - 1996$$ cannot hold for all real numbers $x$.
(S Bogatiy, M Smurov,)
Suppose $ a, b,$ and $ c$ are positive integers with $ a \plus{} b \plus{} c \equal{} 2006$, and $ a!b!c! \equal{} m\cdot10^n$, where $ m$ and $ n$ are integers and $ m$ is not divisible by 10. What is the smallest possible value of $ n$?
$ \textbf{(A) } 489 \qquad \textbf{(B) } 492 \qquad \textbf{(C) } 495 \qquad \textbf{(D) } 498 \qquad \textbf{(E) } 501$
Let $f$ be a non-constant polynomial such that \[ f(x-1) + f(x) + f(x+1) = \frac {f(x)^2}{2013x} \] for all nonzero real numbers $x$. Find the sum of all possible values of $f(1)$.
[i]Proposed by Ahaan S. Rungta[/i]
Let $Z^+$ denote the set of positive integers. Determine , with proof, if there exists a function $f:\mathbb{Z^+}\rightarrow\mathbb {Z^+}$ such that $f(f(f(f(f(n)))))$ = $2022n$ for all positive integers $n$.
The following light grid is given:
\begin{tabular}{cccc}
o & o & o & o \\
o & o & o & o \\
o & o & o & o \\
o & o & o & o
\end{tabular}
where `o` represents a switched-off light and `•` represents a switched-on light. Each time a light is pressed, it toggles its state (on/off) as well as the state of its four adjacent neighbors (left, right, above, below). The bottom edge lights are considered to be immediately above the top edge lights, and the same applies to the lateral edges.The right figure illustrates the effect of pressing a light in a corner.
Pressing a certain combination of lights results in all lights turning on. Prove that all lights must have been pressed at least once.
Let $ f:\mathbb{Z}_{>0}\rightarrow\mathbb{R} $ be a function such that for all $n > 1$ there is a prime divisor $p$ of $n$ such that \[ f(n)=f\left(\frac{n}{p}\right)-f(p). \]
Furthermore, it is given that $ f(2^{2014})+f(3^{2015})+f(5^{2016})=2013 $. Determine $ f(2014^2)+f(2015^3)+f(2016^5) $.
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$, satisfying \[
f(xy)(f(x) - f(y)) = (x-y)f(x)f(y)
\] for all $x,y$.
Find the least number of elements of a finite set $A$ such that there exists a function $f : \left\{1,2,3,\ldots \right\}\rightarrow A$ with the property: if $i$ and $j$ are positive integers and $i-j$ is a prime number, then $f(i)$ and $f(j)$ are distinct elements of $A$.
Let the $f:\mathbb{N}\rightarrow\mathbb{N}$ be the function such that
(i) For all positive integers $n,$ $f(n+f(n))=f(n)$
(ii) $f(n_o)=1$ for some $n_0$
Prove that $f(n)\equiv 1.$
Let $f(x)$ be a real-valued function satisfying $af(x)+bf(-x)=px^2+qx+r$. $a$ and $b$ are distinct real numbers and $p,q,r$ are non-zero real numbers. Then $f(x)=0$ will have real solutions when
(A)$\left(\frac{a+b}{a-b}\right)\leq\frac{q^2}{4pr}$
(B)$\left(\frac{a+b}{a-b}\right)\leq\frac{4pr}{q^2}$
(C)$\left(\frac{a+b}{a-b}\right)\geq\frac{q^2}{4pr}$
(D)$\left(\frac{a+b}{a-b}\right)\geq\frac{4pr}{q^2}$
Find all real functions $f$ definited on positive integers and satisying:
(a) $f(x+22)=f(x)$,
(b) $f\left(x^{2}y\right)=\left(f(x)\right)^{2}f(y)$
for all positive integers $x$ and $y$.
Consider the function
\[f(x)= \sin \biggl( \frac{\pi}{2} \lfloor x \rfloor \biggr).\]
Find the period of $f$ and sketch diagram of $f$ in one period. Also prove that $\lim_{x \to 1} f(x)$ does not exist.
We call a function $f: \mathbb{Q}^+ \to \mathbb{Q}^+$ [i]good[/i] if for all $x,y \in \mathbb{Q}^+$ we have: $$f(x)+f(y)\geq 4f(x+y).$$
a) Prove that for all good functions $f: \mathbb{Q}^+ \to \mathbb{Q}^+$ and $x,y,z \in \mathbb{Q}^+$ $$f(x)+f(y)+f(z) \geq 8f(x+y+z)$$
b) Does there exists a good functions $f: \mathbb{Q}^+ \to \mathbb{Q}^+$ and $x,y,z \in \mathbb{Q}^+$ such that $$f(x)+f(y)+f(z) < 9f(x+y+z) ?$$
How many real numbers $x$ are solutions to the following equation? \[ 2003^x + 2004^x = 2005^x \]
Determine all $ f:R\rightarrow R $ such that
$$ f(xf(y)+y^3)=yf(x)+f(y)^3 $$
Find all continuous functions $f\colon [0;1] \to R$ such that
\[\int_{0}^{1}f(x)dx = 2\int_{0}^{1}(f(x^{4}))^{2}dx+\frac{2}{7}\]
The function $g$ is defined about the natural numbers and satisfies the following conditions:
$g(2) = 1$
$g(2n) = g(n)$
$g(2n+1) = g(2n) +1.$
Where $n$ is a natural number such that $1 \leq n \leq 2002$.
Find the maximum value $M$ of $g(n).$ Also, calculate how many values of $n$ satisfy the condition of $g(n) = M.$
Show that $ 3^{2008} \plus{} 4^{2009}$ can be written as product of two positive integers each of which is larger than $ 2009^{182}$.
Let $n,k$ be given positive integers with $n>k$. Prove that:
\[ \frac{1}{n+1} \cdot \frac{n^n}{k^k (n-k)^{n-k}} < \frac{n!}{k! (n-k)!} < \frac{n^n}{k^k(n-k)^{n-k}} \]
Find all functions $f:\mathbb{R}\to \mathbb{R}$ such that for all $x, y\in \mathbb{R}$ the following holds:
\[f(x)+f(y)=f(xy)+f(f(x)+f(y))\]
Suppose that $a, b, c, A, B, C$ are real numbers, $a \not= 0$ and $A \not= 0$, such that \[|ax^2+ bx + c| \le |Ax^2+ Bx + C|\] for all real numbers $x$. Show that \[|b^2- 4ac| \le |B^2- 4AC|\]
Show that ${2n \choose n} \; \vert \; \text{lcm}(1,2, \cdots, 2n)$ for all positive integers $n$.
Find all positive integers $k$ for which there exists a nonlinear function $f:\mathbb{Z} \rightarrow\mathbb{Z}$ such that the equation $$f(a)+f(b)+f(c)=\frac{f(a-b)+f(b-c)+f(c-a)}{k}$$ holds for any integers $a,b,c$ satisfying $a+b+c=0$ (not necessarily distinct).
[i]Evan Chen[/i]
Let $f:\mathbb{R}^{\geq 0}\to\mathbb{R}$ be a function such that $f(x)-3x$ and $f(x)-x^3$ are ascendant functions. Prove that $f(x)-x^2-x$ is an ascendant function, too.
(We call the function $g(x)$ ascendant, when for every $x\leq{y}$ we have $g(x)\leq{g(y)}$.)
Do there exist a bounded function $f: \mathbb{R}\to\mathbb{R}$ such that $f(1)>0$ and $f(x)$ satisfies an inequality $f^2(x+y)\ge f^2(x)+2f(xy)+f^2(y)$?