Found problems: 1782
We have $n$ countries. Each country have $m$ persons who live in that country ($n>m>1$). We divide $m \cdot n$ persons into $n$ groups each with $m$ members such that there don't exist two persons in any groups who come from one country.
Prove that one can choose $n$ people into one class such that they come from different groups and different countries.
Let $n$ be a positive integer. Consider a triangular array of nonnegative integers as follows: \[
\begin{array}{rccccccccc}
\text{Row } 1: &&&&& a_{0,1} &&&& \smallskip\\
\text{Row } 2: &&&& a_{0,2} && a_{1,2} &&& \smallskip\\
&&& \vdots && \vdots && \vdots && \smallskip\\
\text{Row } n-1: && a_{0,n-1} && a_{1,n-1} && \cdots && a_{n-2,n-1} & \smallskip\\
\text{Row } n: & a_{0,n} && a_{1,n} && a_{2,n} && \cdots && a_{n-1,n}
\end{array}
\] Call such a triangular array [i]stable[/i] if for every $0 \le i < j < k \le n$ we have \[ a_{i,j} + a_{j,k} \le a_{i,k} \le a_{i,j} + a_{j,k} + 1. \] For $s_1, \ldots s_n$ any nondecreasing sequence of nonnegative integers, prove that there exists a unique stable triangular array such that the sum of all of the entries in row $k$ is equal to $s_k$.
A Pythagorean triple is a solution of the equation $x^2 + y^2 = z^2$ in positive integers such that $x < y$. Given any non-negative integer $n$ , show that some positive integer appears in precisely $n$ distinct Pythagorean triples.
Let $m$ be a positive integer, and let $a_0, a_1,\ldots,a_m$ be a sequence of reals such that $a_0=37$, $a_1=72$, $a_m=0$, and \[a_{k+1}=a_{k-1}-\frac{3}{a_k}\] for $k=1,2, \dots, m-1$. Find $m$.
On the cartesian plane are drawn several rectangles with the sides parallel to the coordinate axes. Assume that any two rectangles can be cut by a vertical or a horizontal line. Show that it's possible to draw one horizontal and one vertical line such that each rectangle is cut by at least one of these two lines.
Do there exist $2011$ positive integers $a_1 < a_2 < \ldots < a_{2011}$ such that $\gcd(a_i,a_j) = a_j - a_i$ for any $i$, $j$ such that $1 \le i < j \le 2011$?
Prove that if $P(x) = (x-a)^kQ(x)$, where $k$ is a positive integer, $a$ is a nonzero real number, $Q(x)$ is a nonzero polynomial, then $P(x)$ has at least $k + 1$ nonzero coefficients.
Let $ R$ be an infinite ring such that every subring of $ R$ different from $ \{0 \}$ has a finite index in $ R$. (By the index of a subring, we mean the index of its additive group in the additive group of $ R$.) Prove that the additive group of $ R$ is cyclic.
[i]L. Lovasz, J. Pelikan[/i]
The sequence $ \{x_n\}$ satisfies $ x_1 \equal{} \frac {1}{2}, x_{n \plus{} 1} \equal{} x_n \plus{} \frac {x_n^2}{n^2}$. Prove that $ x_{2001} < 1001$.
Let $ n \equal{} 2k \minus{} 1$ where $ k \geq 6$ is an integer. Let $ T$ be the set of all $ n\minus{}$tuples $ (x_1, x_2, \ldots, x_n)$ where $ x_i \in \{0,1\}$ $ \forall i \equal{} \{1,2, \ldots, n\}$ For $ x \equal{} (x_1, x_2, \ldots, x_n) \in T$ and $ y \equal{} (y_1, y_2, \ldots, y_n) \in T$ let $ d(x,y)$ denote the number of integers $ j$ with $ 1 \leq j \leq n$ such that $ x_i \neq x_j$, in particular $ d(x,x) \equal{} 0.$ Suppose that there exists a subset $ S$ of $ T$ with $ 2^k$ elements that has the following property: Given any element $ x \in T,$ there is a unique element $ y \in S$ with $ d(x, y) \leq 3.$ Prove that $ n \equal{} 23.$
Find all functions $f : \mathbb{Z} \rightarrow \mathbb{Z}$ such that for all integers $m,n$,
\[f(m - n + f(n)) = f(m) + f(n).\]
All sides and diagonals of a convex $n$-gon, $n\ge 3$, are coloured one of two colours. Show that there exist $\left[\frac{n+1}{3}\right]$ pairwise disjoint monochromatic segments.
[i](Two segments are disjoint if they do not share an endpoint or an interior point).[/i]
Let $h \ge 3$ be an integer and $X$ the set of all positive integers that are greater than or equal to $2h$. Let $S$ be a nonempty subset of $X$ such that the following two conditions hold:
[list]
[*]if $a + b \in S$ with $a \ge h, b \ge h$, then $ab \in S$;
[*]if $ab \in S$ with $a \ge h, b \ge h$, then $a + b \in S$.[/list]
Prove that $S = X$.
The fraction \[\dfrac1{99^2}=0.\overline{b_{n-1}b_{n-2}\ldots b_2b_1b_0},\] where $n$ is the length of the period of the repeating decimal expansion. What is the sum $b_0+b_1+\cdots+b_{n-1}$?
$\textbf{(A) }874\qquad
\textbf{(B) }883\qquad
\textbf{(C) }887\qquad
\textbf{(D) }891\qquad
\textbf{(E) }892\qquad$
Let $f(x)$ be a polynomial with integer coefficients. Define a sequence $a_0, a_1, \cdots $ of integers such that $a_0=0$ and $a_{n+1}=f(a_n)$ for all $n \ge 0$. Prove that if there exists a positive integer $m$ for which $a_m=0$ then either $a_1=0$ or $a_2=0$.
Let $a_1\in (0,1)$ and $(a_n)_{n\ge 1}$ a sequence of real numbers defined by $a_{n+1}=a_n(1-a_n^2),\ (\forall)n\ge 1$. Evaluate $\lim_{n\to \infty} a_n\sqrt{n}$.
For a positive integer $k\ge 2$ define $\mathcal{T}_k=\{(x,y)\mid x,y=0,1,\ldots, k-1\}$ to be a collection of $k^2$ lattice points on the cartesian coordinate plane. Let $d_1(k)>d_2(k)>\cdots$ be the decreasing sequence of the distinct distances between any two points in $T_k$. Suppose $S_i(k)$ be the number of distances equal to $d_i(k)$.
Prove that for any three positive integers $m>n>i$ we have $S_i(m)=S_i(n)$.
Prove that there exists a succession $a_1, a_2, ... , a_k, ...$, where each $a_i$ is a digit ($a_i \in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9)$ ) and $a_0=6$, such that, for each positive integrer $n$, the number $x_n=a_0+10a_1+100a_2+...+10^{n-1}a_{n-1}$ verify that $x_n^2-x_n$ is divisible by $10^n$.
Let $ c$ be a positive integer. The sequence $ a_1,a_2,\ldots$ is defined as follows $ a_1\equal{}c$, $ a_{n\plus{}1}\equal{}a_n^2\plus{}a_n\plus{}c^3$ for all positive integers $ n$. Find all $ c$ so that there are integers $ k\ge1$ and $ m\ge2$ so that $ a_k^2\plus{}c^3$ is the $ m$th power of some integer.
Is there a sequence $ a_1,a_2,\ldots$ of positive reals satisfying simoultaneously the following inequalities for all positive integers $ n$:
a) $ a_1\plus{}a_2\plus{}\ldots\plus{}a_n\le n^2$
b) $ \frac1{a_1}\plus{}\frac1{a_2}\plus{}\ldots\plus{}\frac1{a_n}\le2008$?
In a football season, even number $n$ of teams plays a simple series, i.e. each team plays once against each other team. Show that ona can group the series into $n-1$ rounds such that in every round every team plays exactly one match.
A function $f_n(x)\ (n=0,\ 1,\ 2,\ 3,\ \cdots)$ satisfies the following conditions:
(i) $f_0(x)=e^{2x}+1$.
(ii) $f_n(x)=\int_0^x (n+2t)f_{n-1}(t)dt-\frac{2x^{n+1}}{n+1}\ (n=1,\ 2,\ 3,\ \cdots).$
Find $\sum_{n=1}^{\infty} f_n'\left(\frac 12\right).$
Define the sequence $(x_n)$ by $x_0 = 0$ and for all $n \in \mathbb N,$
\[x_n=\begin{cases} x_{n-1} + (3^r - 1)/2,&\mbox{ if } n = 3^{r-1}(3k + 1);\\ x_{n-1} - (3^r + 1)/2, & \mbox{ if } n = 3^{r-1}(3k + 2).\end{cases}\]
where $k \in \mathbb N_0, r \in \mathbb N$. Prove that every integer occurs in this sequence exactly once.
Determine all functions $f$ from the reals to the reals for which
(1) $f(x)$ is strictly increasing and (2) $f(x) + g(x) = 2x$ for all real $x$,
where $g(x)$ is the composition inverse function to $f(x)$. (Note: $f$ and $g$ are said to be composition inverses if $f(g(x)) = x$ and $g(f(x)) = x$ for all real $x$.)
An integer is digitally divisible if both of the following conditions are fulfilled:
$(a)$ None of its digits is zero;
$(b)$ It is divisible by the sum of its digits
e.g. $322$ is digitally divisible. Show that there are infinitely many digitally divisible integers.