Found problems: 1269
2004 China Team Selection Test, 3
Find all positive integer $ n$ satisfying the following condition: There exist positive integers $ m$, $ a_1$, $ a_2$, $ \cdots$, $ a_{m\minus{}1}$, such that $ \displaystyle n \equal{} \sum_{i\equal{}1}^{m\minus{}1} a_i(m\minus{}a_i)$, where $ a_1$, $ a_2$, $ \cdots$, $ a_{m\minus{}1}$ may not distinct and $ 1 \leq a_i \leq m\minus{}1$.
2007 ISI B.Stat Entrance Exam, 9
Let $X \subset \mathbb{R}^2$ be a set satisfying the following properties:
(i) if $(x_1,y_1)$ and $(x_2,y_2)$ are any two distinct elements in $X$, then
\[\text{ either, }\ \ x_1>x_2 \text{ and } y_1>y_2\\ \text{ or, } \ \ x_1<x_2 \text{ and } y_1<y_2\]
(ii) there are two elements $(a_1,b_1)$ and $(a_2,b_2)$ in $X$ such that for any $(x,y) \in X$,
\[a_1\le x \le a_2 \text{ and } b_1\le y \le b_2\]
(iii) if $(x_1,y_1)$ and $(x_2,y_2)$ are two elements of $X$, then for all $\lambda \in [0,1]$,
\[\left(\lambda x_1+(1-\lambda)x_2, \lambda y_1 + (1-\lambda)y_2\right) \in X\]
Show that if $(x,y) \in X$, then for some $\lambda \in [0,1]$,
\[x=\lambda a_1 +(1-\lambda)a_2, y=\lambda b_1 +(1-\lambda)b_2\]
2012 Albania National Olympiad, 3
Let $S_i$ be the sum of the first $i$ terms of the arithmetic sequence $a_1,a_2,a_3\ldots $. Show that the value of the expression
\[\frac{S_i}{i}(j-k) + \frac{S_j}{j}(k-i) +\ \frac{S_k}{k}(i-j)\]
does not depend on the numbers $i,j,k$ nor on the choice of the arithmetic sequence $a_1,a_2,a_3,\ldots$.
2003 China Team Selection Test, 2
Given an integer $a_1$($a_1 \neq -1$), find a real number sequence $\{ a_n \}$($a_i \neq 0, i=1,2,\cdots,5$) such that $x_1,x_2,\cdots,x_5$ and $y_1,y_2,\cdots,y_5$ satisfy $b_{i1}x_1+b_{i2}x_2+\cdots +b_{i5}x_5=2y_i$, $i=1,2,3,4,5$, then $x_1y_1+x_2y_2+\cdots+x_5y_5=0$, where $b_{ij}=\prod_{1 \leq k \leq i} (1+ja_k)$.
1989 IMO Longlists, 91
For $ \phi: \mathbb{N} \mapsto \mathbb{Z}$ let us define \[ M_{\phi} \equal{} \{f: \mathbb{N} \mapsto \mathbb{Z}, f(x) > f(\phi(x)), \forall x \in \mathbb{N} \}.\] Prove that if $ M_{\phi_1} \equal{} M_{\phi_2} \neq \emptyset,$ then $ \phi_1 \equal{} \phi_2.$ Does this property remain true if \[ M_{\phi} \equal{} \{f: \mathbb{N} \mapsto \mathbb{N}, f(x) > f(\phi(x)), \forall x \in \mathbb{N} \}?\]
1992 China Team Selection Test, 2
Let $n \geq 2, n \in \mathbb{N},$ find the least positive real number $\lambda$ such that for arbitrary $a_i \in \mathbb{R}$ with $i = 1, 2, \ldots, n$ and $b_i \in \left[0, \frac{1}{2}\right]$ with $i = 1, 2, \ldots, n$, the following holds:
\[\sum^n_{i=1} a_i = \sum^n_{i=1} b_i = 1 \Rightarrow \prod^n_{i=1} a_i \leq \lambda \sum^n_{i=1} a_i b_i.\]
2003 China Team Selection Test, 2
Find all functions $f,g$:$R \to R$ such that $f(x+yg(x))=g(x)+xf(y)$ for $x,y \in R$.
2002 China Team Selection Test, 3
Let \[ f(x_1,x_2,x_3) = -2 \cdot (x_1^3+x_2^3+x_3^3) + 3 \cdot (x_1^2(x_2+x_3) + x_2^2 \cdot (x_1+x_3) + x_3^2 \cdot ( x_1+x_2 ) - 12x_1x_2x_3. \] For any reals $r,s,t$, we denote \[ g(r,s,t)=\max_{t\leq x_3\leq t+2} |f(r,r+2,x_3)+s|. \] Find the minimum value of $g(r,s,t)$.
2004 India IMO Training Camp, 3
Determine all functionf $f : \mathbb{R} \mapsto \mathbb{R}$ such that
\[ f(x+y) = f(x)f(y) - c \sin{x} \sin{y} \] for all reals $x,y$ where $c> 1$ is a given constant.
2006 Tuymaada Olympiad, 4
Find all functions $f: (0,\infty)\rightarrow(0,\infty)$ with the following properties: $f(x+1)=f(x)+1$ and $f\left(\frac{1}{f(x)}\right)=\frac{1}{x}$.
[i]Proposed by P. Volkmann[/i]
1999 China Team Selection Test, 2
For a fixed natural number $m \geq 2$, prove that
[b]a.)[/b] There exists integers $x_1, x_2, \ldots, x_{2m}$ such that \[x_i x_{m + i} = x_{i + 1} x_{m + i - 1} + 1, i = 1, 2, \ldots, m \hspace{2cm}(*)\]
[b]b.)[/b] For any set of integers $\lbrace x_1, x_2, \ldots, x_{2m}$ which fulfils (*), an integral sequence $\ldots, y_{-k}, \ldots, y_{-1}, y_0, y_1, \ldots, y_k, \ldots$ can be constructed such that $y_k y_{m + k} = y_{k + 1} y_{m + k - 1} + 1, k = 0, \pm 1, \pm 2, \ldots$ such that $y_i = x_i, i = 1, 2, \ldots, 2m$.
2007 Moldova National Olympiad, 11.6
Define $(b_{n})$ to be: $b_{0}=12$, $b_{1}=\frac{\sqrt{3}}{2}$ adn $b_{n+1}+b_{n-1}=b_{n}\cdot\sqrt{3}$. Find $b_{0}+b_{1}+\dots+b_{2007}$.
Note. Maybe this seems too easy, but I want to post all the problems...
2009 Tuymaada Olympiad, 1
A magician asked a spectator to think of a three-digit number $ \overline{abc}$ and then to tell him the sum of numbers $ \overline{acb}$, $ \overline{bac}$, $ \overline{bca}$, $ \overline{cab}$, and $ \overline{cba}$. He claims that when he knows this sum he can determine the original number. Is that so?
2014 Portugal MO, 1
The ship [i]Meridiano do Bacalhau[/i] does its fishing business during $64$ days. Each day the capitain chooses a direction which may be either north or south and the ship sails that direction in that day. On the first day of business the ship sails $1$ mile, on the second day sails $2$ miles; generally, on the $n$-th day it sails $n$ miles. After of the $64$-th day, the ship was $2014$ miles north from its initial position. What is the greatest number of days that the ship could have sailed south?
2012 China Second Round Olympiad, 10
Given a sequence $\{a_n\}$ whose terms are non-zero real numbers. For any positive integer $n$, the equality
\[(\sum_{i=1}^{n}a_i)^2=\sum_{i=1}^{n}a_i^3\]
holds.
[b](1)[/b] If $n=3$, find all possible sequence $a_1,a_2,a_3$;
[b](2)[/b] Does there exist such a sequence $\{a_n\}$ such that $a_{2011}=-2012$?
2005 Olympic Revenge, 3
Find all functions $f: R \rightarrow R$ such that
\[f(x+yf(x))+f(xf(y)-y)=f(x)-f(y)+2xy\]
for all $x,y \in R$
1985 Federal Competition For Advanced Students, P2, 4
Find all natural numbers $ n$ such that the equation:
$ a_{n\plus{}1} x^2\minus{}2x \sqrt{a_1^2\plus{}a_2^2\plus{}...\plus{}a_{n\plus{}1}^2}\plus{}a_1\plus{}a_2\plus{}...\plus{}a_n\equal{}0$
has real solutions for all real numbers $ a_1,a_2,...,a_{n\plus{}1}$.
2011 Czech and Slovak Olympiad III A, 4
Consider a quadratic polynomial $ax^2+bx+c$ with real coefficients satisfying $a\ge 2$, $b\ge 2$, $c\ge 2$. Adam and Boris play the following game. They alternately take turns with Adam first. On Adam’s turn, he can choose one of the polynomial’s coefficients and replace it with the sum of the other two coefficients. On Boris’s turn, he can choose one of the polynomial’s coefficients and replace it with the product of the other two coefficients. The winner is the player who first produces a polynomial with two distinct real roots. Depending on the values of $a$, $b$ and $c$, determine who has a winning strategy.
2002 Mediterranean Mathematics Olympiad, 2
Suppose $x, y, a$ are real numbers such that $x+y = x^3 +y^3 = x^5 +y^5 = a$. Find all possible values of $a.$
2000 APMO, 1
Compute the sum: $\sum_{i=0}^{101} \frac{x_i^3}{1-3x_i+3x_i^2}$ for $x_i=\frac{i}{101}$.
2008 Moldova National Olympiad, 9.1
Let $ f_m: \mathbb R \to \mathbb R$, $ f_m(x)\equal{}(m^2\plus{}m\plus{}1)x^2\minus{}2(m^2\plus{}1)x\plus{}m^2\minus{}m\plus{}1,$ where $ m \in \mathbb R$.
1) Find the fixed common point of all this parabolas.
2) Find $ m$ such that the distance from that fixed point to $ Oy$ is minimal.
1988 Federal Competition For Advanced Students, P2, 4
Let $ a_{ij}$ be nonnegative integers such that $ a_{ij}\equal{}0$ if and only if $ i>j$ and that $ \displaystyle\sum_{j\equal{}1}^{1988}a_{ij}\equal{}1988$ holds for all $ i\equal{}1,...,1988$. Find all real solutions of the system of equations:
$ \displaystyle\sum_{j\equal{}1}^{1988} (1\plus{}a_{ij})x_j\equal{}i\plus{}1, 1 \le i \le 1988$.
1988 Vietnam National Olympiad, 1
A bounded sequence $ (x_n)_{n\ge 1}$ of real numbers satisfies $ x_n \plus{} x_{n \plus{} 1} \ge 2x_{n \plus{} 2}$ for all $ n \ge 1$. Prove that this sequence has a finite limit.
1987 China Team Selection Test, 3
Let $r_1=2$ and $r_n = \prod^{n-1}_{k=1} r_i + 1$, $n \geq 2.$ Prove that among all sets of positive integers such that $\sum^{n}_{k=1} \frac{1}{a_i} < 1,$ the partial sequences $r_1,r_2, ... , r_n$ are the one that gets nearer to 1.
2010 Brazil National Olympiad, 2
Let $P(x)$ be a polynomial with real coefficients. Prove that there exist positive integers $n$ and $k$ such that $k$ has $n$ digits and more than $P(n)$ positive divisors.