Found problems: 4776
2010 IMO, 3
Find all functions $g:\mathbb{N}\rightarrow\mathbb{N}$ such that \[\left(g(m)+n\right)\left(g(n)+m\right)\] is a perfect square for all $m,n\in\mathbb{N}.$
[i]Proposed by Gabriel Carroll, USA[/i]
2010 Romania Team Selection Test, 4
Let $n$ be an integer number greater than or equal to $2$, and let $K$ be a closed convex set of area greater than or equal to $n$, contained in the open square $(0, n) \times (0, n)$. Prove that $K$ contains some point of the integral lattice $\mathbb{Z} \times \mathbb{Z}$.
[i]Marius Cavachi[/i]
2013 ELMO Shortlist, 14
Let $O$ be a point (in the plane) and $T$ be an infinite set of points such that $|P_1P_2| \le 2012$ for every two distinct points $P_1,P_2\in T$. Let $S(T)$ be the set of points $Q$ in the plane satisfying $|QP| \le 2013$ for at least one point $P\in T$.
Now let $L$ be the set of lines containing exactly one point of $S(T)$. Call a line $\ell_0$ passing through $O$ [i]bad[/i] if there does not exist a line $\ell\in L$ parallel to (or coinciding with) $\ell_0$.
(a) Prove that $L$ is nonempty.
(b) Prove that one can assign a line $\ell(i)$ to each positive integer $i$ so that for every bad line $\ell_0$ passing through $O$, there exists a positive integer $n$ with $\ell(n) = \ell_0$.
[i]Proposed by David Yang[/i]
2005 Korea National Olympiad, 4
Find all $f: \mathbb R \to\mathbb R$ such that for all real numbers $x$, $f(x) \geq 0$ and for all real numbers $x$ and $y$, \[ f(x+y)+f(x-y)-2f(x)-2y^2=0. \]
2003 India Regional Mathematical Olympiad, 4
Find the number of ordered triples $(x,y,z)$ of non-negative integers satisfying
(i) $x \leq y \leq z$
(ii) $x + y + z \leq 100.$
2016 Taiwan TST Round 1, 3
Let $\mathbb{Z}^+$ denote the set of all positive integers. Find all surjective functions $f:\mathbb{Z}^+ \times \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ that satisfy all of the following conditions: for all $a,b,c \in \mathbb{Z}^+$,
(i)$f(a,b) \leq a+b$;
(ii)$f(a,f(b,c))=f(f(a,b),c)$
(iii)Both $\binom{f(a,b)}{a}$ and $\binom{f(a,b)}{b}$ are odd numbers.(where $\binom{n}{k}$ denotes the binomial coefficients)
2011 Tokio University Entry Examination, 6
(1) Let $x>0,\ y$ be real numbers. For variable $t$, find the difference of Maximum and minimum value of the quadratic function $f(t)=xt^2+yt$ in $0\leq t\leq 1$.
(2) Let $S$ be the domain of the points $(x,\ y)$ in the coordinate plane forming the following condition:
For $x>0$ and all real numbers $t$ with $0\leq t\leq 1$ , there exists real number $z$ for which $0\leq xt^2+yt+z\leq 1$ .
Sketch the outline of $S$.
(3) Let $V$ be the domain of the points $(x,\ y,\ z) $ in the coordinate space forming the following condition:
For $0\leq x\leq 1$ and for all real numbers $t$ with $0\leq t\leq 1$, $0\leq xt^2+yt+z\leq 1$ holds.
Find the volume of $V$.
[i]2011 Tokyo University entrance exam/Science, Problem 6[/i]
2014 NIMO Problems, 8
Define the function $\xi : \mathbb Z^2 \to \mathbb Z$ by $\xi(n,k) = 1$ when $n \le k$ and $\xi(n,k) = -1$ when $n > k$, and construct the polynomial \[ P(x_1, \dots, x_{1000}) = \prod_{n=1}^{1000} \left( \sum_{k=1}^{1000} \xi(n,k)x_k \right). \]
(a) Determine the coefficient of $x_1x_2 \dots x_{1000}$ in $P$.
(b) Show that if $x_1, x_2, \dots, x_{1000} \in \left\{ -1,1 \right\}$ then $P(x_1,x_2,\dots,x_{1000}) = 0$.
[i]Proposed by Evan Chen[/i]
2015 Romania National Olympiad, 1
Find all differentiable functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that verify the conditions:
$ \text{(i)}\quad\forall x\in\mathbb{Z} \quad f'(x) =0 $
$ \text{(ii)}\quad\forall x\in\mathbb{R}\quad f'(x)=0\implies f(x)=0 $
2012 India PRMO, 16
Let $N$ be the set of natural numbers. Suppose $f: N \to N$ is a function satisfying the following conditions:
(a) $f(mn) =f(m)f(n)$
(b) $f(m) < f(n)$ if $m < n$
(c) $f(2) = 2$
What is the sum of $\Sigma_{k=1}^{20}f(k)$?
2011 Postal Coaching, 3
Suppose $f : \mathbb{R} \longrightarrow \mathbb{R}$ be a function such that
\[2f (f (x)) = (x^2 - x)f (x) + 4 - 2x\]
for all real $x$. Find $f (2)$ and all possible values of $f (1)$. For each value of $f (1)$, construct a function achieving it and satisfying the given equation.
2016 India IMO Training Camp, 2
Find all functions $f:\mathbb R\to\mathbb R$ such that $$f\left( x^2+xf(y)\right)=xf(x+y)$$ for all reals $x,y$.
1996 Moldova Team Selection Test, 11
Let $A{}$ be a set with $n{}$ $(n\geq3)$ elements. Iterations $f^2,f^2,\ldots$ of the function $f:A\rightarrow A$ are defined as $f^2(x)=f(f(x)), f^{i+1}=f(f^i(x)), \forall i\geq2$. Find the number of functions $f:A\rightarrow A$ with the property: the function $f^{n-2}$ is constant, but $f^{n-3}$ is not.
1990 Romania Team Selection Test, 2
Prove that in any triangle $ABC$ the following inequality holds: \[ \frac{a^{2}}{b+c-a}+\frac{b^{2}}{a+c-b}+\frac{c^{2}}{a+b-c}\geq 3\sqrt{3}R. \]
[i]Laurentiu Panaitopol[/i]
2019 Belarusian National Olympiad, 9.3
Positive real numbers $a$ and $b$ satisfy the following conditions: the function $f(x)=x^3+ax^2+2bx-1$ has three different real roots, while the function $g(x)=2x^2+2bx+a$ doesn't have real roots.
Prove that $a-b>1$.
[i](V. Karamzin)[/i]
2018 Pan-African Shortlist, A1
Find all functions $f : \mathbb{Z} \to \mathbb{Z}$ such that $(f(x + y))^2 = f(x^2) + f(y^2)$ for all $x, y \in \mathbb{Z}$.
1999 Dutch Mathematical Olympiad, 1
Let $f: \mathbb{Z} \rightarrow \{-1,1\}$ be a function such that \[ f(mn) =f(m)f(n),\ \forall m,n \in \mathbb{Z}. \] Show that there exists a positive integer $a$ such that $1 \leq a \leq 12$ and $f(a) = f(a + 1) = 1$.
2016 China Second Round Olympiad, Q10
Let $f(x)$ is an odd function on $R$ , $f(1)=1$ and $f(\frac{x}{x-1})=xf(x)$ $(\forall x<0)$.
Find the value of $f(1)f(\frac{1}{100})+f(\frac{1}{2})f(\frac{1}{99})+f(\frac{1}{3})f(\frac{1}{98})+\cdots +f(\frac{1}{50})f(\frac{1}{51}).$
2014 PUMaC Algebra B, 2
$f$ is a function whose domain is the set of nonnegative integers and whose range is contained in the set of nonnegative integers. $f$ satisfies the condition that $f(f(n))+f(n)=2n+3$ for all nonnegative integers $n$. Find $f(2014)$.
2008 China Second Round Olympiad, 2
Let $f(x)$ be a periodic function with periods $T$ and $1$($0<T<1$).Prove that:
(1)If $T$ is rational,then there exists a prime $p$ such that $\frac{1}{p}$ is also a period of $f$;
(2)If $T$ is irrational,then there exists a strictly decreasing infinite sequence {$a_n$},with $1>a_n>0$ for all positive integer $n$,such that all $a_n$ are periods of $f$.
2005 District Olympiad, 4
Let $(A,+,\cdot)$ be a finite unit ring, with $n\geq 3$ elements in which there exist [b]exactly[/b] $\dfrac {n+1}2$ perfect squares (e.g. a number $b\in A$ is called a perfect square if and only if there exists an $a\in A$ such that $b=a^2$). Prove that
a) $1+1$ is invertible;
b) $(A,+,\cdot)$ is a field.
[i]Proposed by Marian Andronache[/i]
1989 AMC 12/AHSME, 28
Find the sum of the roots of $\tan^2x-9\tan x+1=0$ that are between $x=0$ and $x=2\pi$ radians.
$ \textbf{(A)}\ \frac{\pi}{2} \qquad\textbf{(B)}\ \pi \qquad\textbf{(C)}\ \frac{3\pi}{2} \qquad\textbf{(D)}\ 3\pi \qquad\textbf{(E)}\ 4\pi $
1999 Vietnam Team Selection Test, 2
Let a triangle $ABC$ inscribed in circle $\Gamma$ be given. Circle $\Theta$ lies in angle $Â$ of triangle and touches sides $AB, AC$ at $M_1, N_1$ and touches internally $\Gamma$ at $P_1$. The points $M_2, N_2, P_2$ and $M_3, N_3, P_3$ are defined similarly to angles $B$ and $C$ respectively. Show that $M_1N_1, M_2N_2$ and $M_3N_3$ intersect each other at their midpoints.
2010 N.N. Mihăileanu Individual, 2
Let be a sequence of functions $ \left( f_n \right)_{n\ge 2}:\mathbb{R}_{\ge 0}\longrightarrow\mathbb{R} $ defined, for each $ n\ge 2, $ as
$$ f_n(x)=2nx^{2+n} -2(n+2)x^{1+n} +(2+n)x +1. $$
[b]a)[/b] Prove that $ f_n $ has an unique local maxima $ x_n, $ for any $ n\ge 2. $
[b]b)[/b] Show that $ 1=\lim_{n\to\infty } x_n. $
[i]Cătălin Zîrnă[/i]
2017 South East Mathematical Olympiad, 1
Let $x_i \in \{0, 1\} (i = 1, 2, \cdots, n)$. If the function $f = f(x_1, x_2, \cdots, x_n)$ only equals $0$ or $1$, then define $f$ as an "$n$-variable Boolean function" and denote
$$D_n (f) = \{ (x_1, x_2, \cdots, x_n) | f(x_1, x_2, \cdots, x_n) = 0 \}$$.
$(1)$ Determine the number of $n$-variable Boolean functions;
$(2)$ Let $g$ be a $10$-variable Boolean function satisfying
$$g(x_1, x_2, \cdots, x_{10}) \equiv 1 + x_1 + x_1 x_2 + x_1 x_2 x_3 + \cdots + x_1 x_2\cdots x_{10} \pmod{2}$$
Evaluate the size of the set $D_{10} (g)$ and $\sum\limits_{(x_1, x_2, \cdots, x_{10}) \in D_{10} (g)} (x_1 + x_2 + x_3 + \cdots + x_{10})$.