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

Find all pairs of function $f : Q \rightarrow R$ and $g : Q \rightarrow R,$ for which equations \begin{align*} f(x+y) &= f(x) f(y) + g(x) g(y) \\ g(x+y) &= f(x)g(y) + g(x)f(y) + g(x)g(y) \end{align*} holds for all rational numbers $x$ and $y.$ [i]Proposed by Gurgen Asatryan, Armenia [/i]
Find all polynomials $p$ with real coefficients such that for all real $x$ $$(x-8)p(2x)=8(x-1)p(x).$$
Let $\mathbb{N}$ denote the set of positive integers. Find all functions $f:\mathbb{N}\longrightarrow\mathbb{N}$ such that \[n+f(m)\mid f(n)+nf(m)\] for all $m,n\in \mathbb{N}$ [i]Proposed by Dorlir Ahmeti, Albania[/i]
Find all functions $f : \mathbb{Z} \to \mathbb{Z}$ that satisfy the conditions: $i) f(f(x)) = xf(x) - x^2 + 2,\forall x\in\mathbb{Z}$ $ii) f$ takes all integer values
Determine is there a function $a: \mathbb{N} \rightarrow \mathbb{N}$ such that: $i)$ $a(0)=0$ $ii)$ $a(n)=n-a(a(n))$, $\forall n \in$ $ \mathbb{N}$. If exists prove: $a)$ $a(k)\geq a(k-1)$ $b)$ Does not exist positive integer $k$ such that $a(k-1)=a(k)=a(k+1)$.
Find all functions \( f: \mathbb{R} \rightarrow \mathbb{R} \) such that for all \( x, y \in \mathbb{R} \), \[ f(x + f(2y)) + f(x^2 - y) = f(f(x)) f(x + 1) + 2y - f(y). \]
Let $n\in\mathbb{Z}$, $n\geq 2$. Find all functions $f:\mathbb{R}_{>0}\rightarrow\mathbb{R}_{>0}$ such that $$f(x_1+\dots +x_n)^2=\sum_{i=1}^nf(x_i) ^2+ 2\sum_{i<j}f(x_ix_j),$$ for all $x_1,\dots ,x_n\in\mathbb{R}_{>0}$. [i]Proposed by Andrei Vila[/i]
Find all real numbers $a$ such that there exist $f:\mathbb{R} \to \mathbb{R}$ with$$f(x+f(y))=f(x)+a\lfloor y \rfloor $$for all $x,y\in \mathbb{R}$
Determine all functions $f: R \longrightarrow R$ such that $f(x+y)-f(x-y)=f(x)*f(y)$ for $x,y \in R$
Let \(f:\mathbb R\to\mathbb R\) be a function such that for all real numbers \(x\neq1\), \[f(x-f(x))+f(x)=\frac{x^2-x+1}{x-1}.\] Find all possible values of \(f(2023)\). [i]Proposed by Linus Tang[/i]
Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ for which these two conditions hold simultaneously (i) For all $m,n \in \mathbb{N}$ we have: $$ \frac{f(mn)}{\gcd(m,n)} = \frac{f(m)f(n)}{f(\gcd(m,n))};$$ (ii) For all prime numbers $p$, there exists a prime number $q$ such that $f(p^{2025})=q^{2025}$.
Let $ f$ be a function from the set of real numbers $ \mathbb{R}$ into itself such for all $ x \in \mathbb{R},$ we have $ |f(x)| \leq 1$ and \[ f \left( x \plus{} \frac{13}{42} \right) \plus{} f(x) \equal{} f \left( x \plus{} \frac{1}{6} \right) \plus{} f \left( x \plus{} \frac{1}{7} \right).\] Prove that $ f$ is a periodic function (that is, there exists a non-zero real number $ c$ such $ f(x\plus{}c) \equal{} f(x)$ for all $ x \in \mathbb{R}$).
Find the continuous functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ having the following property: $$ f\left( x+\frac{1}{n}\right) \le f(x) +\frac{1}{n},\quad\forall n\in\mathbb{Z}^* ,\quad\forall x\in\mathbb{R} . $$
Let $p$ be a prime number and let $\mathbb{F}_p$ be the finite field with $p$ elements. Consider an automorphism $\tau$ of the polynomial ring $\mathbb{F}_p[x]$ given by \[\tau(f)(x)=f(x+1).\] Let $R$ denote the subring of $\mathbb{F}_p[x]$ consisting of those polynomials $f$ with $\tau(f)=f$. Find a polynomial $g \in \mathbb{F}_p[x]$ such that $\mathbb{F}_p[x]$ is a free module over $R$ with basis $g,\tau(g),\dots,\tau^{p-1}(g)$.
Find all $g:\mathbb{R}\to\mathbb{R}$ so that there exists a unique $f:\mathbb{R}\to\mathbb{R}$ satisfying $f(0)=g(0)$ and \[f(x+g(y))+f(-x-g(-y))=g(x+f(y))+g(-x-f(-y))\] for all $x,y\in\mathbb{R}$. [i] Proposed by usjl[/i]
Find all continuous functions $f : R \to R$ such that $$f(x + f(y)) = f(x + y) + y,$$ for all $x, y \in R$. No proof is required for this problem.
The function $f(x,y)$ satisfies: $f(0,y)=y+1, f(x+1,0) = f(x,1), f(x+1,y+1)=f(x,f(x+1,y))$ for all non-negative integers $x,y$. Find $f(4,1981)$.
Suppose $f:\mathbb{N}\rightarrow \mathbb{N}$ is a function such that $$f^n(n) = 2n$$ for all $n\in \mathbb{N}$. Must $f(n) = n+1$ for all $n$?
Let $ \mathbb{N}_0$ denote the set of nonnegative integers. Find all functions $ f$ from $ \mathbb{N}_0$ to itself such that \[ f(m \plus{} f(n)) \equal{} f(f(m)) \plus{} f(n)\qquad \text{for all} \; m, n \in \mathbb{N}_0. \]
Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that $f(x)f(y)=f(x+y)+xy$ for all $x,y\in \mathbb{R}$.
Find all $n$ such that there is a real polynomial $f(x)$ of degree $n$ such that $f(x) \ge f'(x)$ for all real $x$.
Let $\mathbb{Q}$ be the set of rational numbers. A function $f: \mathbb{Q} \to \mathbb{Q}$ is called aquaesulian if the following property holds: for every $x,y \in \mathbb{Q}$, \[ f(x+f(y)) = f(x) + y \quad \text{or} \quad f(f(x)+y) = x + f(y). \] Show that there exists an integer $c$ such that for any aquaesulian function $f$ there are at most $c$ different rational numbers of the form $f(r) + f(-r)$ for some rational number $r$, and find the smallest possible value of $c$.
Find all functions $f : \mathbb{Q}[\sqrt{2}] \to \mathbb{Q}[\sqrt{2}]$ such that for all $x, y \in \mathbb{Q}[\sqrt{2}]$, $$ f(xy) = f(x)f(y) \quad \text{and} \quad f(x + y) = f(x) + f(y), $$ where $\mathbb{Q}[\sqrt{2}] = \{ a + b\sqrt{2} \mid a, b \in \mathbb{Q} \}$. [I]Proposed by Stijn Cambie, Belgium[/i]
Find all functions $f : R \to R$ such that $x f(x)-y f(y) = (x-y)f(x+y)$ for all $x,y \in R$.
$\mathbb{Z}[x]$ represents the set of all polynomials with integer coefficients. Find all functions $f:\mathbb{Z}[x]\rightarrow \mathbb{Z}[x]$ such that for any 2 polynomials $P,Q$ with integer coefficients and integer $r$, the following statement is true. \[P(r)\mid Q(r) \iff f(P)(r)\mid f(Q)(r).\] (We define $a|b$ if and only if $b=za$ for some integer $z$. In particular, $0|0$.) [i]Proposed by the4seasons.[/i]