Found problems: 2349
Determine all functions $ f: \mathbb{N}_0 \rightarrow \mathbb{N}_0$ such that $ f(f(n))\plus{}f(n)\equal{}2n\plus{}6$ for all $ n \in \mathbb{N}_0$.
Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ f(x^3\plus{}y^3)\equal{}xf(x^2)\plus{}yf(y^2)\] for all real numbers $ x$ and $ y$.
[i]Hery Susanto, Malang[/i]
Let $ f(0) \equal{} f(1) \equal{} 0$ and
\[ f(n\plus{}2) \equal{} 4^{n\plus{}2} \cdot f(n\plus{}1) \minus{} 16^{n\plus{}1} \cdot f(n) \plus{} n \cdot 2^{n^2}, \quad n \equal{} 0, 1, 2, \ldots\]
Show that the numbers $ f(1989), f(1990), f(1991)$ are divisible by $ 13.$
Find all triples $(f,g,h)$ of injective functions from the set of real numbers to itself satisfying
\begin{align*}
f(x+f(y)) &= g(x) + h(y) \\
g(x+g(y)) &= h(x) + f(y) \\
h(x+h(y)) &= f(x) + g(y)
\end{align*}
for all real numbers $x$ and $y$. (We say a function $F$ is [i]injective[/i] if $F(a)\neq F(b)$ for any distinct real numbers $a$ and $b$.)
[i]Proposed by Evan Chen[/i]
Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that for all positive integers $n$, there exists an unique positive integer $k$, satisfying $f^k(n)\leq n+k+1$.
Find all functions $f : \mathbb{Z}\rightarrow \mathbb{Z}$ satisfying
\[f^{a^{2} + b^{2}}(a+b) = af(a) +bf(b)\]
for all integers $a$ and $b$
[b]p1.[/b] Find $$2^{\left(0^{\left(2^3\right)}\right)}$$
[b]p2.[/b] Amy likes to spin pencils. She has an $n\%$ probability of dropping the $n$th pencil. If she makes $100$ attempts, the expected number of pencils Amy will drop is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$.
[b]p3.[/b] Determine the units digit of $3 + 3^2 + 3^3 + 3^4 +....+ 3^{2022} + 3^{2023}$.
[b]p4.[/b] Cyclic quadrilateral $ABCD$ is inscribed in circle $\omega$ with center $O$ and radius $20$. Let the intersection of $AC$ and $BD$ be $E$, and let the inradius of $\vartriangle AEB$ and $\vartriangle CED$ both be equal to $7$. Find $AE^2 - BE^2$.
[b]p5.[/b] An isosceles right triangle is inscribed in a circle which is inscribed in an isosceles right triangle that is inscribed in another circle. This larger circle is inscribed in another isosceles right triangle. If the ratio of the area of the largest triangle to the area of the smallest triangle can be expressed as $a+b\sqrt{c}$, such that $a, b$ and $c$ are positive integers and no square divides $c$ except $1$, find $a + b + c$.
[b]p6.[/b] Jonny has three days to solve as many ISL problems as he can. If the amount of problems he solves is equal to the maximum possible value of $gcd \left(f(x), f(x+1) \right)$ for $f(x) = x^3 +2$ over all positive integer values of $x$, then find the amount of problems Jonny solves.
[b]p7.[/b] Three points $X$, $Y$, and $Z$ are randomly placed on the sides of a square such that $X$ and $Y$ are always on the same side of the square. The probability that non-degenerate triangle $\vartriangle XYZ$ contains the center of the square can be written as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$.
[b]p8.[/b] Compute the largest integer less than $(\sqrt7 +\sqrt3)^6$.
[b]p9.[/b] Find the minimum value of the expression $\frac{(x+y)^2}{x-y}$ given $x > y > 0$ are real numbers and $xy = 2209$.
[b]p10.[/b] Find the number of nonnegative integers $n \le 6561$ such that the sum of the digits of $n$ in base $9$ is exactly $4$ greater than the sum of the digits of $n$ in base $3$.
[b]p11.[/b] Estimation (Tiebreaker) Estimate the product of the number of people who took the December contest, the sum of all scores in the November contest, and the number of incorrect responses for Problem $1$ and Problem $2$ on the October Contest.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Find all functions $f : R \to R$ satisfying $f(x)f(y) = f(x + y) + xy$ for all $x, y \in R$.
Does there exist a surjective function $f:R \to R$ such that the expression $f(x + y) - f(x) - f(y)$ takes exactly two values $0$ and $1$ for various real $x$ and $y$ ?
(E. Barabanov)
Let $ f(0) \equal{} f(1) \equal{} 0$ and
\[ f(n\plus{}2) \equal{} 4^{n\plus{}2} \cdot f(n\plus{}1) \minus{} 16^{n\plus{}1} \cdot f(n) \plus{} n \cdot 2^{n^2}, \quad n \equal{} 0, 1, 2, \ldots\]
Show that the numbers $ f(1989), f(1990), f(1991)$ are divisible by $ 13.$
Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ such that $f(x^3)-f(y^3)=(x^2+xy+y^2)(f(x)-f(y))$.
Find all functions $f:\mathbb{R}\to \mathbb{R}$ such that for all $x,y\in \mathbb{R}$ one has
\[f(f(x)+y)=f(x+f(y))\]
and in addition the set $f^{-1}(a)=\{b\in \mathbb{R}\mid f(b)=a\}$ is a finite set for all $a\in \mathbb{R}$.
Let $\mathbb{N}_{\ge 1}$ be the set of positive integers.
Find all functions $f \colon \mathbb{N}_{\ge 1} \to \mathbb{N}_{\ge 1}$ such that, for all positive integers $m$ and $n$:
(a) $n = \left(f(2n)-f(n)\right)\left(2 f(n) - f(2n)\right)$,
(b)$f(m)f(n) - f(mn) = \left(f(2m)-f(m)\right)\left(2 f(n) - f(2n)\right) + \left(f(2n)-f(n)\right)\left(2 f(m) - f(2m)\right)$,
(c) $m-n$ divides $f(2m)-f(2n)$ if $m$ and $n$ are distinct odd prime numbers.
Determine all functions $f : Z\to Z$, where $Z$ is the set of integers, such that $$f(m + f(f(n))) = -f(f(m + 1)) - n$$ for all integers $m$ and $n$.
The function $f:\mathbb{N} \rightarrow \mathbb{N}$ verifies:
$1) f(n+2)-2022 \cdot f(n+1)+2021 \cdot f(n)=0, \forall n \in \mathbb{N};$
$2) f(20^{22})=f(22^{20});$
$3) f(2021)=2022$.
Find all possible values of $f(2022)$.
Find all functions $f: \mathbb R \rightarrow \mathbb R$ such that
\[f(x+xy+f(y)) = \left(f(x)+\frac{1}{2}\right) \left(f(y)+\frac{1}{2}\right)\]
holds for all real numbers $x,y$.
Find all functions $f : R \to R$ satisfying $(x^2 + y^2)f(xy) = f(x)f(y)f(x^2 + y^2)$ for all real numbers $x$ and $y$.
Find all $f:\mathbb{R}\rightarrow \mathbb{R}$ satisfying (for all $x,y \in \mathbb{R}$): $f(x+y)^2 - f(2x^2) = f(y-x)f(y+x) + 2x\cdot f(y)$.
Consider a function $f: \mathbb Z \to \mathbb Z$ such that for every integer $n \ge 0$, there are at most $0.001n^2$ pairs of integers $(x,y)$ for which $f(x+y) \neq f(x)+f(y)$ and $\max\{ \lvert x \rvert, \lvert y \rvert \} \le n$. Is it possible that for some integer $n \ge 0$, there are more than $n$ integers $a$ such that $f(a) \neq a \cdot f(1)$ and $\lvert a \rvert \le n$?
[i]Proposed by David Yang[/i]
Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that for all real $x,y$:
$$ f(x^2) + xf(y) = f(x) f(x + f(y)) \, . $$
Carl chooses a [i]functional expression[/i]* $E$ which is a finite nonempty string formed from a set $x_1, x_2, \dots$ of variables and applications of a function $f$, together with addition, subtraction, multiplication (but not division), and fixed real constants. He then considers the equation $E = 0$, and lets $S$ denote the set of functions $f \colon \mathbb R \to \mathbb R$ such that the equation holds for any choices of real numbers $x_1, x_2, \dots$. (For example, if Carl chooses the functional equation
$$ f(2f(x_1)+x_2) - 2f(x_1)-x_2 = 0, $$
then $S$ consists of one function, the identity function.
(a) Let $X$ denote the set of functions with domain $\mathbb R$ and image exactly $\mathbb Z$. Show that Carl can choose his functional equation such that $S$ is nonempty but $S \subseteq X$.
(b) Can Carl choose his functional equation such that $|S|=1$ and $S \subseteq X$?
*These can be defined formally in the following way: the set of functional expressions is the minimal one (by inclusion) such that (i) any fixed real constant is a functional expression, (ii) for any positive integer $i$, the variable $x_i$ is a functional expression, and (iii) if $V$ and $W$ are functional expressions, then so are $f(V)$, $V+W$, $V-W$, and $V \cdot W$.
[i]Proposed by Carl Schildkraut[/i]
Find all functions $f$ from the set of real numbers to itself satisfying
\[ f(x(1+y)) = f(x)(1 + f(y)) \]
for all real numbers $x, y$.
Find all functions $f : Z \to Z$ for which $f(g(n)) - g(f(n))$ is independent on $n$ for any $g : Z \to Z$.
Does there exist a function $f:\mathbb{R}\to \mathbb{R}$ such that $$f(x^2+f(y))=f(x)^2-y$$ for all $x, y\in \mathbb{R}$?
Find all functions $f:\mathbb{Z}\to \mathbb{Z}_{>0}$ for which
\[f(x+f(y))^2+f(y+f(x))^2=f(f(x)+f(y))^2+1\]
holds for any $x,y\in \mathbb{Z}$.