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

Find all functions $f : R \to R$ such that for all $x, y \in R$: $$f(x + yf(x + y)) = y^2 + f(xf(y + 1)).$$
Show that there is no polynomial $P(x)$ of degree $998$ with real coefficients which satisfies $P(x^2 + 1) = P(x)^2 - 1$ for all $x$.
Does there exist a function $f: \mathbb R \to \mathbb R $ satisfying the following conditions: (i) for each real $y$ there is a real $x$ such that $f(x)=y$ , and (ii) $f(f(x)) = (x - 1)f(x) + 2$ for all real $x$ ? [i]Proposed by Igor I. Voronovich, Belarus[/i]
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.
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$.
Determine all functions $f$ on the set of positive rational numbers such that $f(xf(x) + f(y)) = f(x)^2 + y$ for all positive rational numbers $x, y$.
Prove that there is no function $f$ from the set of non-negative integers into itself such that $f(f(n))=n+1987$ for all $n$.
Determine all functions $f: \mathbb{R} \to \mathbb{R}$, such that $$f(xf(y)+1)=y+f(f(x)f(y))$$ for all $x, y \in \mathbb{R}$. (Theresia Eisenkölbl)
Find all functions $ f : R \to R$ that satisfies $$xf(y) - yf(x)= f\left(\frac{y}{x}\right)$$ for all $x, y \in R$.
Find all positive integers $ k$ for which the following statement is true: If $ F(x)$ is a polynomial with integer coefficients satisfying the condition $ 0 \leq F(c) \leq k$ for each $ c\in \{0,1,\ldots,k \plus{} 1\}$, then $ F(0) \equal{} F(1) \equal{} \ldots \equal{} F(k \plus{} 1)$.
The function $f(n)$ is defined on the positive integers and takes non-negative integer values. $f(2)=0,f(3)>0,f(9999)=3333$ and for all $m,n:$ \[ f(m+n)-f(m)-f(n)=0 \text{ or } 1. \] Determine $f(1982)$.
Find all functions $f: \mathbb{Z^+} \to \mathbb{Z^+}$ such that for all integers $a, b, c$ we have $$ af(bc)+bf(ac)+cf(ab)=(a+b+c)f(ab+bc+ac). $$ [i]Note. The set $\mathbb{Z^+}$ refers to the set of positive integers.[/i] [i]Proposed by Mojtaba Zare, Iran[/i]
Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that \[ f(x) f(y) = |x - y| \cdot f \left( \frac{xy + 1}{x - y} \right) \] Holds for all $x \not= y \in \mathbb{R}$
Determine all nonzero integers $a$ for which there exists two functions $f,g:\mathbb Q\to\mathbb Q$ such that \[f(x+g(y))=g(x)+f(y)+ay\text{ for all } x,y\in\mathbb Q.\] Also, determine all pairs of functions with this property. [i]Vasile Pop[/i]
A continuous function $f : R \to R$ satisfies the conditions $f(1000) = 999$ and $f(x)f(f(x)) = 1$ for all real $x$. Determine $f(500)$.
Find all functions $f,g$:$R \to R$ such that $f(x+yg(x))=g(x)+xf(y)$ for $x,y \in R$.
Let function $f : \mathbb Z_{\geq 0}^0 \to \mathbb N$ satisfy the following conditions: (i) $ f(0, 0, 0) = 1;$ (ii) $f(x, y, z) = f(x - 1, y, z) + f(x, y - 1, z) + f(x, y, z - 1);$ (iii) when applying above relation iteratively, if any of $x', y', z$' is negative, then $f(x', y', z') = 0.$ Prove that if $x, y, z$ are the side lengths of a triangle, then $\frac{\left(f(x,y,z) \right) ^k}{ f(mx ,my, mz)}$ is not an integer for any integers $k, m > 1.$
Find all functions $ f: \mathbb{N^{*}}\to \mathbb{N^{*}}$ satisfying \[ \left(f^{2}\left(m\right)+f\left(n\right)\right) \mid \left(m^{2}+n\right)^{2}\] for any two positive integers $ m$ and $ n$. [i]Remark.[/i] The abbreviation $ \mathbb{N^{*}}$ stands for the set of all positive integers: $ \mathbb{N^{*}}=\left\{1,2,3,...\right\}$. By $ f^{2}\left(m\right)$, we mean $ \left(f\left(m\right)\right)^{2}$ (and not $ f\left(f\left(m\right)\right)$). [i]Proposed by Mohsen Jamali, Iran[/i]
Find all the following functions $f:R\to R$ , which for arbitrary valid $x,y$ holds equality: $$f(xf(x+y))+f((x+y)f(y))=(x+y)^2$$ (Vadym Koval)
Find all functions $f$ from real numbers to real numbers such that $$2f((x+y)^2)=f(x+y)+(f(x))^2+(4y-1)f(x)-2y+4y^2$$ holds for all real numbers $x$ and $y$.
Let f be a function defined in the set $\{0, 1, 2,...\}$ of non-negative integers, satisfying $f(2x) = 2f(x), f(4x+1) = 4f(x) + 3$, and $f(4x-1) = 2f(2x - 1) -1$. Show that $f $ is an injection, i.e. if $f(x) = f(y)$, then $x = y$.
Let $n$ be a positive integer greater than $2$. Find all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ satisfying: $(f(x+y))^{n} = f(x^{n})+f(y^{n}),$ for all integers $x,y$
Find all functions $f : R \to R$ satisfying $f(x + xy + f(y))=(f(x) + \frac12)(f(y) + \frac12 )$ for all $x, y \in R$.
Find all functions $f:\mathbb N\to\mathbb N_0$ such that for all $m,n\in\mathbb N$, \begin{align*} f(mn)&=f(m)f(n)\\ f(m+n)&=\min(f(m),f(n))\qquad\text{if }f(m)\ne f(n)\end{align*}
Let $f: \mathbb{Z}_{>0} \rightarrow \mathbb{Z}$ be a function with the following properties: (i) $f(1) = 0$ (ii) $f(p) = 1$ for all prime numbers $p$ (iii) $f(xy) = y \cdot f(x) + x \cdot f(y)$ for all $x,y$ in $\mathbb{Z}_{>0}$ Determine the smallest integer $n \ge 2015$ that satisfies $f(n) = n$. (Gerhard J. Woeginger)