Found problems: 1269
2002 Germany Team Selection Test, 1
Let $P$ denote the set of all ordered pairs $ \left(p,q\right)$ of nonnegative integers. Find all functions $f: P \rightarrow \mathbb{R}$ satisfying
\[ f(p,q) \equal{} \begin{cases} 0 & \text{if} \; pq \equal{} 0, \\
1 \plus{} \frac{1}{2} f(p+1,q-1) \plus{} \frac{1}{2} f(p-1,q+1) & \text{otherwise} \end{cases}
\]
Compare IMO shortlist problem 2001, algebra A1 for the three-variable case.
2015 Thailand TSTST, 2
Find all functions $f: \mathbb R \to \mathbb R$ such that for all reals $x$ and $y$,
\[f(f(x - y)) = f(x)f(y) + f(x) - f(y) - xy.\]
2004 India IMO Training Camp, 3
Suppose the polynomial $P(x) \equiv x^3 + ax^2 + bx +c$ has only real zeroes and let $Q(x) \equiv 5x^2 - 16x + 2004$. Assume that $P(Q(x)) = 0$ has no real roots. Prove that $P(2004) > 2004$
1997 Iran MO (3rd Round), 1
Find all strictly ascending functions $f$ such that for all $x\in \mathbb R$,
\[f(1-x)=1-f(f(x)).\]
2006 China Team Selection Test, 1
Let $k$ be an odd number that is greater than or equal to $3$. Prove that there exists a $k^{th}$-degree integer-valued polynomial with non-integer-coefficients that has the following properties:
(1) $f(0)=0$ and $f(1)=1$; and.
(2) There exist infinitely many positive integers $n$ so that if the following equation: \[ n= f(x_1)+\cdots+f(x_s), \] has integer solutions $x_1, x_2, \dots, x_s$, then $s \geq 2^k-1$.
2014 Iran MO (3rd Round), 3
Let $p,q\in \mathbb{R}[x]$ such that $p(z)q(\overline{z})$ is always a real number for every complex number $z$. Prove that $p(x)=kq(x)$ for some constant $k \in \mathbb{R}$ or $q(x)=0$.
[i]Proposed by Mohammad Ahmadi[/i]
1994 Cono Sur Olympiad, 1
The positive integrer number $n$ has $1994$ digits. $14$ of its digits are $0$'s and the number of times that the other digits: $1, 2, 3, 4, 5, 6, 7, 8, 9$ appear are in proportion $1: 2: 3: 4: 5: 6: 7: 8: 9$, respectively. Prove that $n$ is not a perfect square.
2010 Costa Rica - Final Round, 3
Christian Reiher and Reid Barton want to open a security box, they already managed to discover the algorithm to generate the key codes and they obtained the following information:
$i)$ In the screen of the box will appear a sequence of $n+1$ numbers, $C_0 = (a_{0,1},a_{0,2},...,a_{0,n+1})$
$ii)$ If the code $K = (k_1,k_2,...,k_n)$ opens the security box then the following must happen:
a) A sequence $C_i = (a_{i,1},a_{i,2},...,a_{i,n+1})$ will be asigned to each $k_i$ defined as follows:
$a_{i,1} = 1$ and $a_{i,j} = a_{i-1,j}-k_ia_{i,j-1}$, for $i,j \ge 1$
b) The sequence $(C_n)$ asigned to $k_n$ satisfies that $S_n = \sum_{i=1}^{n+1}|a_i|$ has its least possible value, considering all possible sequences $K$.
The sequence $C_0$ that appears in the screen is the following:
$a_{0,1} = 1$ and $a_0,i$ is the sum of the products of the elements of each of the subsets with $i-1$ elements of the set $A =$ {$1,2,3,...,n$}, $i\ge 2$, such that $a_{0, n+1} = n!$
Find a sequence $K = (k_1,k_2,...,k_n)$ that satisfies the conditions of the problem and show that there exists at least $n!$ of them.
2012 Traian Lălescu, 1
Let $a,b,c,\alpha,\beta,\gamma \in\mathbb{R}$ such as $a^2+b^2+c^2 \neq 0 \neq \alpha\beta\gamma$ and $24^{\alpha}\neq 3^{\beta} \neq 2012^{\gamma} \neq 24^{\alpha}$. Prove that the equation \[ a \cdot 24^{\alpha x}+b \cdot 3^{\beta x} + c \cdot 2012^{\gamma x}=0 \] has at most two real solutions.
2014 Vietnam Team Selection Test, 5
Find all polynomials $P(x),Q(x)$ which have integer coefficients and satify the following condtion: For the sequence $(x_n )$ defined by \[x_0=2014,x_{2n+1}=P(x_{2n}),x_{2n}=Q(x_{2n-1}) \quad n\geq 1\]
for every positive integer $m$ is a divisor of some non-zero element of $(x_n )$
2002 China Team Selection Test, 1
Given that $ a_1\equal{}1$, $ a_2\equal{}5$, $ \displaystyle a_{n\plus{}1} \equal{} \frac{a_n \cdot a_{n\minus{}1}}{\sqrt{a_n^2 \plus{} a_{n\minus{}1}^2 \plus{} 1}}$. Find a expression of the general term of $ \{ a_n \}$.
2005 South africa National Olympiad, 6
Consider the increasing sequence $1,2,4,5,7,9,10,12,14,16,17,19,\dots$ of positive integers, obtained by concatenating alternating blocks $\{1\},\{2,4\},\{5,7,9\},\{10,12,14,16\},\dots$ of odd and even numbers. Each block contains one more element than the previous one and the first element in each block is one more than the last element of the previous one. Prove that the $n$-th element of the sequence is given by \[2n-\Big\lfloor\frac{1+\sqrt{8n-7}}{2}\Big\rfloor.\]
(Here $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.)
2006 South East Mathematical Olympiad, 1
Suppose $a>b>0$, $f(x)=\dfrac{2(a+b)x+2ab}{4x+a+b}$. Show that there exists an unique positive number $x$, such that $f(x)=\left(\dfrac{a^{\frac{1}{3}}+b^{\frac{1}{3}}}{2} \right)^3$.
2009 All-Russian Olympiad, 3
How many times changes the sign of the function \[ f(x)\equal{}\cos x\cos\frac{x}{2}\cos\frac{x}{3}\cdots\cos\frac{x}{2009}\] at the interval $ \left[0, \frac{2009\pi}{2}\right]$?
2014 Contests, 2
Find all polynomials $P(x)$ with real coefficients such that $P(2014) = 1$ and, for some integer $c$:
$xP(x-c) = (x - 2014)P(x)$
2013 Canada National Olympiad, 1
Determine all polynomials $P(x)$ with real coefficients such that
\[(x+1)P(x-1)-(x-1)P(x)\]
is a constant polynomial.
2008 Germany Team Selection Test, 1
A sequence $ (S_n), n \geq 1$ of sets of natural numbers with $ S_1 = \{1\}, S_2 = \{2\}$ and
\[{ S_{n + 1} = \{k \in }\mathbb{N}|k - 1 \in S_n \text{ XOR } k \in S_{n - 1}\}.
\]
Determine $ S_{1024}.$
2009 Croatia Team Selection Test, 1
Solve in the set of real numbers:
\[ 3\left(x^2 \plus{} y^2 \plus{} z^2\right) \equal{} 1,
\]
\[ x^2y^2 \plus{} y^2z^2 \plus{} z^2x^2 \equal{} xyz\left(x \plus{} y \plus{} z\right)^3.
\]
2011 Polish MO Finals, 3
Let $n\geq 3$ be an odd integer. Determine how many real solutions there are to the set of $n$ equations
\[\left\{\begin{array}{cc}x_1(x_1+1)=x_2(x_2-1)\\x_2(x_2+1)=x_3(x_3-1)\\ \vdots \\ x_n(x_n+1) = x_1(x_1-1)\end{array}\right.\]
2011 Moldova Team Selection Test, 1
Find all real numbers $x, y$ such that:
$y+3\sqrt{x+2}=\frac{23}2+y^2-\sqrt{49-16x}$
2003 Baltic Way, 1
Find all functions $f:\mathbb{Q}^{+}\rightarrow \mathbb{Q}^{+}$ which for all $x \in \mathbb{Q}^{+}$ fulfil
\[f\left(\frac{1}{x}\right)=f(x) \ \ \text{and} \ \ \left(1+\frac{1}{x}\right)f(x)=f(x+1). \]
2005 Postal Coaching, 3
Find all real $\alpha$ s.t.
\[ [ \sqrt{n + \alpha} + \sqrt{n} ] = [ \sqrt{4n+1} ] \] holds for all natural numbers $n$
2002 China Team Selection Test, 3
Sequence $ \{ f_n(a) \}$ satisfies $ \displaystyle f_{n\plus{}1}(a) \equal{} 2 \minus{} \frac{a}{f_n(a)}$, $ f_1(a) \equal{} 2$, $ n\equal{}1,2, \cdots$. If there exists a natural number $ n$, such that $ f_{n\plus{}k}(a) \equal{} f_{k}(a), k\equal{}1,2, \cdots$, then we call the non-zero real $ a$ a $ \textbf{periodic point}$ of $ f_n(a)$.
Prove that the sufficient and necessary condition for $ a$ being a $ \textbf{periodic point}$ of $ f_n(a)$ is $ p_n(a\minus{}1)\equal{}0$, where $ \displaystyle p_n(x)\equal{}\sum_{k\equal{}0}^{\left[ \frac{n\minus{}1}{2} \right]} (\minus{}1)^k C_n^{2k\plus{}1}x^k$, here we define $ \displaystyle \frac{a}{0}\equal{} \infty$ and $ \displaystyle \frac{a}{\infty} \equal{} 0$.
1988 IMO Longlists, 28
Find a necessary and sufficient condition on the natural number $ n$ for the equation
\[ x^n \plus{} (2 \plus{} x)^n \plus{} (2 \minus{} x)^n \equal{} 0
\]
to have a integral root.
2014 Dutch IMO TST, 5
Let $P(x)$ be a polynomial of degree $n \le 10$ with integral coefficients such that for every $k \in \{1, 2, \dots, 10\}$ there is an integer $m$ with $P(m) = k$. Furthermore, it is given that $|P(10) - P(0)| < 1000$. Prove that for every integer $k$ there is an integer $m$ such that $P(m) = k.$