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

2000 IMC, 1

Does every monotone increasing function $f : \mathbb[0,1] \rightarrow \mathbb[0,1]$ have a fixed point? What about every monotone decreasing function?

2021 Israel Olympic Revenge, 1

Let $\mathbb N$ be the set of positive integers. Find all functions $f\colon\mathbb N\to\mathbb N$ such that $$\frac{f(x)-f(y)+x+y}{x-y+1}$$ is an integer, for all positive integers $x,y$ with $x>y$.

2013 Miklós Schweitzer, 8

Let ${f : \Bbb{R} \rightarrow \Bbb{R}}$ be a continuous and strictly increasing function for which \[ \displaystyle f^{-1}\left(\frac{f(x)+f(y)}{2}\right)(f(x)+f(y)) =(x+y)f\left(\frac{x+y}{2}\right) \] for all ${x,y \in \Bbb{R}} ({f^{-1}}$ denotes the inverse of ${f})$. Prove that there exist real constants ${a \neq 0}$ and ${b}$ such that ${f(x)=ax+b}$ for all ${x \in \Bbb{R}}.$ [i]Proposed by Zoltán Daróczy[/i]

1991 China Team Selection Test, 2

Let $f$ be a function $f: \mathbb{N} \cup \{0\} \mapsto \mathbb{N},$ and satisfies the following conditions: (1) $f(0) = 0, f(1) = 1,$ (2) $f(n+2) = 23 \cdot f(n+1) + f(n), n = 0,1, \ldots.$ Prove that for any $m \in \mathbb{N}$, there exist a $d \in \mathbb{N}$ such that $m | f(f(n)) \Leftrightarrow d | n.$

1990 Balkan MO, 4

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$.

2005 Postal Coaching, 19

Find all functions $f : \mathbb{R} \mapsto \mathbb{R}$ such that $f(xy+f(x)) = xf(y) +f(x)$ for all $x,y \in \mathbb{R}$.

2005 Iran Team Selection Test, 3

Suppose $S= \{1,2,\dots,n\}$ and $n \geq 3$. There is $f:S^k \longmapsto S$ that if $a,b \in S^k$ and $a$ and $b$ differ in all of elements then $f(a) \neq f(b)$. Prove that $f$ is a function of one of its elements.

1997 Romania National Olympiad, 4

Suppose that $(f_n)_{n\in N}$ be the sequence from all functions $f_n:[0,1]\rightarrow \mathbb{R^+}$ s.t. $f_0$ be the continuous function and $\forall x\in [0,1] , \forall n\in \mathbb {N} , f_{n+1}(x)=\int_0^x \frac {1}{1+f_n (t)}dt$. Prove that for every $x\in [0,1]$ the sequence of $(f_n(x))_{n\in N}$ be the convergent sequence and calculate the limitation.

1990 IMO Longlists, 66

Find all the continuous bounded functions $f: \mathbb R \to \mathbb R$ such that \[(f(x))^2 -(f(y))^2 = f(x + y)f(x - y) \text{ for all } x, y \in \mathbb R.\]

2011 Iran MO (3rd Round), 2

Let $n$ and $k$ be two natural numbers such that $k$ is even and for each prime $p$ if $p|n$ then $p-1|k$. let $\{a_1,....,a_{\phi(n)}\}$ be all the numbers coprime to $n$. What's the remainder of the number $a_1^k+.....+a_{\phi(n)}^k$ when it's divided by $n$? [i]proposed by Yahya Motevassel[/i]

2021-IMOC, A8

Find all functions $f : \mathbb{N} \to \mathbb{N}$ with $$f(x) + yf(f(x)) < x(1 + f(y)) + 2021$$ holds for all positive integers $x,y.$

1988 Romania Team Selection Test, 14

Let $\Delta$ denote the set of all triangles in a plane. Consider the function $f: \Delta\to(0,\infty)$ defined by $f(ABC) = \min \left( \dfrac ba, \dfrac cb \right)$, for any triangle $ABC$ with $BC=a\leq CA=b\leq AB = c$. Find the set of values of $f$.

2012 Pre-Preparation Course Examination, 3

Consider the set $\mathbb A=\{f\in C^1([-1,1]):f(-1)=-1,f(1)=1\}$. Prove that there is no function in this function space that gives us the minimum of $S=\int_{-1}^1x^2f'(x)^2dx$. What is the infimum of $S$ for the functions of this space?

2005 iTest, 4

The function f is defined on the set of integers and satisfies $\bullet$ $f(n) = n - 2$, if $n \ge 2005$ $\bullet$ $f(n) = f(f(n+7))$, if $n < 2005$. Find $f(3)$.

2006 Moldova National Olympiad, 10.2

Let $n$ be a positive integer, $n\geq 2$. Let $M=\{0,1,2,\ldots n-1\}$. For an integer nonzero number $a$ we define the function $f_{a}: M\longrightarrow M$, such that $f_{a}(x)$ is the remainder when dividing $ax$ at $n$. Find a necessary and sufficient condition such that $f_{a}$ is bijective. And if $f_{a}$ is bijective and $n$ is a prime number, prove that $a^{n(n-1)}-1$ is divisible by $n^{2}$.

2005 Regional Competition For Advanced Students, 3

For which values of $ k$ and $ d$ has the system $ x^3\plus{}y^3\equal{}2$ and $ y\equal{}kx\plus{}d$ no real solutions $ (x,y)$?

1963 Miklós Schweitzer, 6

Show that if $ f(x)$ is a real-valued, continuous function on the half-line $ 0\leq x < \infty$, and \[ \int_0^{\infty} f^2(x)dx <\infty\] then the function \[ g(x)\equal{}f(x)\minus{}2e^{\minus{}x}\int_0^x e^tf(t)dt\] satisfies \[ \int _0^{\infty}g^2(x)dx\equal{}\int_0^{\infty}f^2(x)dx.\] [B. Szokefalvi-Nagy]

2016 IMO Shortlist, N6

Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

2014 Thailand Mathematical Olympiad, 2

Find all functions $f : R \to R$ satisfying $f(xy - 1) + f(x)f(y) = 2xy - 1$ for all real numbers $x, y$

2006 District Olympiad, 3

A set $M$ of positive integers is called [i]connected[/i] if for any element $x\in M$ at least one of the numbers $x-1,x+1$ is in $M$. Let $U_n$ be the number of the connected subsets of $\{1,2,\ldots,n\}$. a) Compute $U_7$; b) Find the smallest number $n$ such that $U_n \geq 2006$.

1993 All-Russian Olympiad, 3

Find all functions $f(x)$ with the domain of all positive real numbers, such that for any positive numbers $x$ and $y$, we have $f(x^y)=f(x)^{f(y)}$.

1996 IMO Shortlist, 6

Let $ n$ be an even positive integer. Prove that there exists a positive inter $ k$ such that \[ k \equal{} f(x) \cdot (x\plus{}1)^n \plus{} g(x) \cdot (x^n \plus{} 1)\] for some polynomials $ f(x), g(x)$ having integer coefficients. If $ k_0$ denotes the least such $ k,$ determine $ k_0$ as a function of $ n,$ i.e. show that $ k_0 \equal{} 2^q$ where $ q$ is the odd integer determined by $ n \equal{} q \cdot 2^r, r \in \mathbb{N}.$ Note: This is variant A6' of the three variants given for this problem.

2014 Middle European Mathematical Olympiad, 1

Determine all functions $f:\mathbb{R} \to \mathbb{R}$ such that \[ xf(y) + f(xf(y)) - xf(f(y)) - f(xy) = 2x + f(y) - f(x+y)\] holds for all $x,y \in \mathbb{R}$.

2014 Romania Team Selection Test, 4

Let $n$ be a positive integer and let $A_n$ respectively $B_n$ be the set of nonnegative integers $k<n$ such that the number of distinct prime factors of $\gcd(n,k)$ is even (respectively odd). Show that $|A_n|=|B_n|$ if $n$ is even and $|A_n|>|B_n|$ if $n$ is odd. Example: $A_{10} = \left\{ 0,1,3,7,9 \right\}$, $B_{10} = \left\{ 2,4,5,6,8 \right\}$.

2025 Philippine MO, P8

Let $\mathbb{N}$ be the set of positive integers. Find all functions $f : \mathbb{N} \to \mathbb{N}$ such that for all $m, n \in \mathbb{N}$, \[m^2f(m) + n^2f(n) + 3mn(m + n)\] is a perfect cube.