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: 1513

A function $f$ is called injective if when $f(n) = f(m)$, then $n = m$. Suppose that $f$ is injective and $\frac{1}{f(n)}+\frac{1}{f(m)}=\frac{4}{f(n) + f(m)}$. Prove $m = n$
Determine all functions $f : R \to R$ such that $f(xy + f(x)) = xf(y) + f(x)$ holds for any $x, y \in R$.
Find all functions $f: \mathbb{Z}\rightarrow\mathbb{Z}$ such that for all $x,y \in \mathbb{Z}$: \[f(x-y+f(y))=f(x)+f(y).\]
Determine all functions $f\colon\mathbb{Z}_{>0}\to\mathbb{Z}_{>0}$ such that, for all positive integers $a$ and $b$, \[ f^{bf(a)}(a+1)=(a+1)f(b). \]
Find all functions $f : R \to R$ such that $$2f(x)f(x + y) -f(x^2) =\frac{x}{2}(f(2x) + 4f(f(y)))$$ for all $x, y \in R$.
We denote by $\mathbb{R}^\plus{}$ the set of all positive real numbers. Find all functions $f: \mathbb R^ \plus{} \rightarrow\mathbb R^ \plus{}$ which have the property: \[f(x)f(y)\equal{}2f(x\plus{}yf(x))\] for all positive real numbers $x$ and $y$. [i]Proposed by Nikolai Nikolov, Bulgaria[/i]
Let $\mathbb{N}$ denote the set of positive integers. Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that for positive integers $a$ and $b,$ \[f(a^2 + b^2) = f(a)f(b) \text{ and } f(a^2) = f(a)^2.\]
Determine all strictly increasing functions $f: R \to R$ satisfying $f (f(x) + y) = f(x + y) + f (0)$ for all $x,y \in R$.
Find all real-valued functions $f$ satisfying $f(2x + f(y)) + f(f(y)) = 4x + 8y$ for all real numbers $x$ and $y$.
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}$.
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]
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$.
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.
Determine all functions $f : \mathbb{R}^+ \to \mathbb{R}^+$ such that \[ f(2x+f(y))=x+y +f(f(x)) , \ \ \ \forall x,y \in \mathbb{R}^+.\]
Find all functions $f:\mathbb Z\to\mathbb Z$ such that $$19f(x)-17f(f(x))=2x$$for all $x\in\mathbb Z$.
Find all functions $f$ defined on all real numbers and taking real values such that \[f(f(y)) + f(x - y) = f(xf(y) - x),\] for all real numbers $x, y.$
Let $N =\{1, 2, 3, ...\}$ be the set of all natural numbers and $f : N\to N$ be a function. Suppose $f(1) = 1$, $f(2n) = f(n)$ and $f(2n + 1) = f(2n) + 1$ for all natural numbers $n$. (i) Calculate the maximum value $M$ of $f(n)$ for $n \in N$ with $1 \le n \le 1994$. (ii) Find all $n \in N$, with 1 \le n \le 1994, such that $f(n) = M$.
A function $f : Z \to Z$ is given so that $f(m + n) = f(m) + f(n) + 2mn - 2548$ for all positive integers $m, n$. Given that $f(2548) = -2548$, find the value of $f(2)$.
Determine all functions $f: \mathbb{R} \to \mathbb{R}$ such that $$ f(x^3) + f(y)^3 + f(z)^3 = 3xyz $$ for all real numbers $x$, $y$ and $z$ with $x+y+z=0$.
Let $\mathbb{Z}$ be the set of integers. Determine all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ such that, for all integers $a$ and $b$, $$f(2a)+2f(b)=f(f(a+b)).$$ [i]Proposed by Liam Baker, South Africa[/i]
Suppose that $T\in \mathbb N$ is given. Find all functions $f:\mathbb Z \to \mathbb C$ such that, for all $m\in \mathbb Z$ we have $f(m+T)=f(m)$ and: $$\forall a,b,c \in \mathbb Z: f(a)\overline{f(a+b)f(a+c)}f(a+b+c)=1.$$ Where $\overline{a}$ is the complex conjugate of $a$.
Find all the functions $f: \mathbb{R} \to\mathbb{R}$ such that \[f(x-f(y))=f(f(y))+xf(y)+f(x)-1\] for all $x,y \in \mathbb{R} $.
Determine all polynomials $P$ such that for every real number $x$, $P(x)^2 +P(-x) = P(x^2)+P(x)$
Find all functions $f : Z \to Z$ satisfying $f(m + n) + f(mn -1) = f(m)f(n) + 2$ for all $m, n \in Z$.
Find all function $f:\mathbb R^+ \rightarrow \mathbb R^+$ such that: \[f\left(\frac{f(x)}{x}+y\right)=1+f(y), \quad \forall x,y \in \mathbb R^+.\]