Found problems: 1782
2007 Hungary-Israel Binational, 1
A given rectangle $ R$ is divided into $mn$ small rectangles by straight lines parallel to its sides. (The distances between the parallel lines may not be equal.) What is the minimum number of appropriately selected rectangles’ areas that should be known in order to determine the area of $ R$?
2008 China Western Mathematical Olympiad, 4
Given an integer $ m\geq 2$, and two real numbers $ a,b$ with $ a > 0$ and $ b\neq 0$. The sequence $ \{x_n\}$ is such that $ x_1 \equal{} b$ and $ x_{n \plus{} 1} \equal{} ax^{m}_{n} \plus{} b$, $ n \equal{} 1,2,...$. Prove that
(1)when $ b < 0$ and m is even, the sequence is bounded if and only if $ ab^{m \minus{} 1}\geq \minus{} 2$;
(2)when $ b < 0$ and m is odd, or when $ b > 0$ the sequence is bounded if and only if $ ab^{m \minus{} 1}\geq\frac {(m \minus{} 1)^{m \minus{} 1}}{m^m}$.
1985 Bundeswettbewerb Mathematik, 3
Starting with the sequence $F_1 = (1,2,3,4, \ldots)$ of the natural numbers further sequences are generated as follows: $F_{n+1}$ is created from $F_n$ by the following rule: the order of elements remains unchanged, the elements from $F_n$ which are divisible by $n$ are increased by 1 and the other elements from $F_n$ remain unchanged. Example: $F_2 = (2,3,4,5 \ldots)$ and $F_3 = (3,3,5,5, \ldots)$. Determine all natural numbers $n$ such that exactly the first $n-1$ elements of $F_n$ take the value $n.$
2010 India IMO Training Camp, 6
Let $n\ge 2$ be a given integer. Show that the number of strings of length $n$ consisting of $0'$s and $1'$s such that there are equal number of $00$ and $11$ blocks in each string is equal to
\[2\binom{n-2}{\left \lfloor \frac{n-2}{2}\right \rfloor}\]
2005 Germany Team Selection Test, 3
Let $b$ and $c$ be any two positive integers. Define an integer sequence $a_n$, for $n\geq 1$, by $a_1=1$, $a_2=1$, $a_3=b$ and $a_{n+3}=ba_{n+2}a_{n+1}+ca_n$.
Find all positive integers $r$ for which there exists a positive integer $n$ such that the number $a_n$ is divisible by $r$.
2012 Balkan MO Shortlist, C1
Let $n$ be a positive integer. Let $P_n=\{2^n,2^{n-1}\cdot 3, 2^{n-2}\cdot 3^2, \dots, 3^n \}.$ For each subset $X$ of $P_n$, we write $S_X$ for the sum of all elements of $X$, with the convention that $S_{\emptyset}=0$ where $\emptyset$ is the empty set. Suppose that $y$ is a real number with $0 \leq y \leq 3^{n+1}-2^{n+1}.$
Prove that there is a subset $Y$ of $P_n$ such that $0 \leq y-S_Y < 2^n$
2008 China Team Selection Test, 4
Prove that for arbitary positive integer $ n\geq 4$, there exists a permutation of the subsets that contain at least two elements of the set $ G_{n} \equal{} \{1,2,3,\cdots,n\}$: $ P_{1},P_{2},\cdots,P_{2^n \minus{} n \minus{} 1}$ such that $ |P_{i}\cap P_{i \plus{} 1}| \equal{} 2,i \equal{} 1,2,\cdots,2^n \minus{} n \minus{} 2.$
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.
2010 Contests, 1
Assume real numbers $a_i,b_i\,(i=0,1,\cdots,2n)$ satisfy the following conditions:
(1) for $i=0,1,\cdots,2n-1$, we have $a_i+a_{i+1}\geq 0$;
(2) for $j=0,1,\cdots,n-1$, we have $a_{2j+1}\leq 0$;
(2) for any integer $p,q$, $0\leq p\leq q\leq n$, we have $\sum_{k=2p}^{2q}b_k>0$.
Prove that $\sum_{i=0}^{2n}(-1)^i a_i b_i\geq 0$, and determine when the equality holds.
2008 Moldova Team Selection Test, 4
Find the number of even permutations of $ \{1,2,\ldots,n\}$ with no fixed points.
2003 Bulgaria Team Selection Test, 3
Some of the vertices of a convex $n$-gon are connected by segments, such that any two of them have no common interior point. Prove that, for any $n$ points in general position, there exists a one-to-one correspondence between the points and the vertices of the $n$ gon, such that any two segments between the points, corresponding to the respective segments from the $n$ gon, have no common interior point.
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]
1965 Miklós Schweitzer, 7
Prove that any uncountable subset of the Euclidean $ n$-space contains an countable subset with the property that the distances between different pairs of points are different (that is, for any points $ P_1 \not\equal{} P_2$ and $ Q_1\not\equal{} Q_2$ of this subset, $ \overline{P_1P_2}\equal{}\overline{Q_1Q_2}$ implies either $ P_1\equal{}Q_1$ and $ P_2\equal{}Q_2$, or $ P_1\equal{}Q_2$ and $ P_2\equal{}Q_1$). Show that a similar statement is not valid if the Euclidean $ n$-space is replaced with a (separable) Hilbert space.
2006 Austrian-Polish Competition, 8
Let $A\subset \{x|0\le x<1\}$ with the following properties:
1. $A$ has at least 4 members.
2. For all pairwise different $a,b,c,d\in A$, $ab+cd\in A$ holds.
Prove: $A$ has infinetly many members.
1987 IMO Longlists, 25
Numbers $d(n,m)$, with $m, n$ integers, $0 \leq m \leq n$, are defined by $d(n, 0) = d(n, n) = 0$ for all $n \geq 0$ and
\[md(n,m) = md(n-1,m)+(2n-m)d(n-1,m-1) \text{ for all } 0 < m < n.\]
Prove that all the $d(n,m)$ are integers.
2014 BMO TST, 1
Prove that for $n\ge 2$ the following inequality holds:
$$\frac{1}{n+1}\left(1+\frac{1}{3}+\ldots +\frac{1}{2n-1}\right) >\frac{1}{n}\left(\frac{1}{2}+\ldots+\frac{1}{2n}\right).$$
2002 Balkan MO, 2
Let the sequence $ \{a_n\}_{n\geq 1}$ be defined by $ a_1 \equal{} 20$, $ a_2 \equal{} 30$ and $ a_{n \plus{} 2} \equal{} 3a_{n \plus{} 1} \minus{} a_n$ for all $ n\geq 1$. Find all positive integers $ n$ such that $ 1 \plus{} 5a_n a_{n \plus{} 1}$ is a perfect square.
1967 IMO Longlists, 18
If $x$ is a positive rational number show that $x$ can be uniquely expressed in the form $x = \sum^n_{k=1} \frac{a_k}{k!}$ where $a_1, a_2, \ldots$ are integers, $0 \leq a_n \leq n - 1$, for $n > 1,$ and the series terminates. Show that $x$ can be expressed as the sum of reciprocals of different integers, each of which is greater than $10^6.$
PEN A Problems, 63
There is a large pile of cards. On each card one of the numbers $1$, $2$, $\cdots$, $n$ is written. It is known that the sum of all numbers of all the cards is equal to $k \cdot n!$ for some integer $k$. Prove that it is possible to arrange cards into $k$ stacks so that the sum of numbers written on the cards in each stack is equal to $n!$.
1986 China Team Selection Test, 4
Given a triangle $ABC$ for which $C=90$ degrees, prove that given $n$ points inside it, we can name them $P_1, P_2 , \ldots , P_n$ in some way such that:
$\sum^{n-1}_{k=1} \left( P_K P_{k+1} \right)^2 \leq AB^2$ (the sum is over the consecutive square of the segments from $1$ up to $n-1$).
[i]Edited by orl.[/i]
2010 Contests, 3
Let $x_1, x_2, \ldots ,x_n(n\ge 2)$ be real numbers greater than $1$. Suppose that $|x_i-x_{i+1}|<1$ for $i=1, 2,\ldots ,n-1$. Prove that
\[\frac{x_1}{x_2}+\frac{x_2}{x_3}+\ldots +\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1}<2n-1\]
2003 Balkan MO, 1
Can one find 4004 positive integers such that the sum of any 2003 of them is not divisible by 2003?
2004 Putnam, A3
Define a sequence $\{u_n\}_{n=0}^{\infty}$ by $u_0=u_1=u_2=1,$ and thereafter by the condition that
$\det\begin{vmatrix} u_n & u_{n+1} \\ u_{n+2} & u_{n+3} \end{vmatrix}=n!$
for all $n\ge 0.$ Show that $u_n$ is an integer for all $n.$ (By convention, $0!=1$.)
2007 Korea National Olympiad, 4
Two real sequence $ \{x_{n}\}$ and $ \{y_{n}\}$ satisfies following recurrence formula;
$ x_{0}\equal{} 1$, $ y_{0}\equal{} 2007$
$ x_{n\plus{}1}\equal{} x_{n}\minus{}(x_{n}y_{n}\plus{}x_{n\plus{}1}y_{n\plus{}1}\minus{}2)(y_{n}\plus{}y_{n\plus{}1})$,
$ y_{n\plus{}1}\equal{} y_{n}\minus{}(x_{n}y_{n}\plus{}x_{n\plus{}1}y_{n\plus{}1}\minus{}2)(x_{n}\plus{}x_{n\plus{}1})$
Then show that for all nonnegative integer $ n$, $ {x_{n}}^{2}\leq 2007$.
2010 All-Russian Olympiad, 1
Let $a \neq b a,b \in \mathbb{R}$ such that $(x^2+20ax+10b)(x^2+20bx+10a)=0$ has no roots for $x$. Prove that $20(b-a)$ is not an integer.