Found problems: 1782
A convex polygon is such that the distance between any two vertices does not exceed $ 1$.
$ (i)$ Prove that the distance between any two points on the boundary of the polygon does not exceed $ 1$.
$ (ii)$ If $ X$ and $ Y$ are two distinct points inside the polygon, prove that there exists a point $ Z$ on the boundary of the polygon such that $ XZ \plus{} YZ\le1$.
Let $ x_0 \equal{} 1$ and for $ n\ge0,$ let $ x_{n \plus{} 1} \equal{} 3x_n \plus{} \left\lfloor x_n\sqrt {5}\right\rfloor.$ In particular, $ x_1 \equal{} 5,\ x_2 \equal{} 26,\ x_3 \equal{} 136,\ x_4 \equal{} 712.$ Find a closed-form expression for $ x_{2007}.$ ($ \lfloor a\rfloor$ means the largest integer $ \le a.$)
Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions:
\[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n;
\]
\[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n.
\]
[i]Author: Dusan Dukic, Serbia[/i]
There are $n$ students each having $r$ positive integers. Their $nr$ positive integers are all different. Prove that we can divide the students into $k$ classes satisfying the following conditions.
(a) $ k \le 4r $
(b) If a student $A$ has the number $m$, then the student $B$ in the same class can't have a number $l$ such that
\[ (m-1)! < l < (m+1)!+1 \]
Each vertex of a finite graph can be coloured either black or white. Initially all vertices are black. We are allowed to pick a vertex $P$ and change the colour of $P$ and all of its neighbours. Is it possible to change the colour of every vertex from black to white by a
sequence of operations of this type?
Note: A finite graph consists of a finite set of vertices and a finite set of edges between vertices. If there is an edge between vertex $A$ and vertex $B,$ then $A$ and $B$ are neighbours of each other.
Santa Claus has at least $n$ gifts for $n$ children. For $i\in\{1,2, ... , n\}$, the $i$-th child considers $x_i > 0$ of these items to be desirable. Assume that
\[\dfrac{1}{x_1}+\cdots+\dfrac{1}{x_n}\le1.\]
Prove that Santa Claus can give each child a gift that this child likes.
Let $S = \{1,2,\dots,2014\}$. For each non-empty subset $T \subseteq S$, one of its members is chosen as its representative. Find the number of ways to assign representatives to all non-empty subsets of $S$ so that if a subset $D \subseteq S$ is a disjoint union of non-empty subsets $A, B, C \subseteq S$, then the representative of $D$ is also the representative of one of $A$, $B$, $C$.
[i]Warut Suksompong, Thailand[/i]
Let $a_1,\ldots,a_n$ and $b_1\ldots,b_n$ be $2n$ real numbers. Prove that there exists an integer $k$ with $1\le k\le n$ such that
$ \sum_{i=1}^n|a_i-a_k| ~~\le~~ \sum_{i=1}^n|b_i-a_k|.$
(Proposed by Gerhard Woeginger, Austria)
A positive integer $n$ is said to be a [i]perfect power[/i] if $n=a^b$ for some integers $a,b$ with $b>1$.
$(\text{a})$ Find $2004$ perfect powers in arithmetic progression.
$(\text{b})$ Prove that perfect powers cannot form an infinite arithmetic progression.
Let $a_{1}=1$, $a_{2}=2$, $a_{3}$, $a_{4}$, $\cdots$ be the sequence of positive integers of the form $2^{\alpha}3^{\beta}$, where $\alpha$ and $\beta$ are nonnegative integers. Prove that every positive integer is expressible in the form \[a_{i_{1}}+a_{i_{2}}+\cdots+a_{i_{n}},\] where no summand is a multiple of any other.
Find all functions $ f: Z \rightarrow R$ that verify the folowing two conditions:
(i) for each pair of integers $ (m,n)$ with $ m<n$ one has $ f(m)<f(n)$;
(ii) for each pair of integers $ (m,n)$ there exists an integer $ k$ such that $ f(m)\minus{}f(n)\equal{}f(k)$.
Given a fixed positive integer $a\geq 9$. Prove: There exist finitely many positive integers $n$, satisfying:
(1)$\tau (n)=a$
(2)$n|\phi (n)+\sigma (n)$
Note: For positive integer $n$, $\tau (n)$ is the number of positive divisors of $n$, $\phi (n)$ is the number of positive integers $\leq n$ and relatively prime with $n$, $\sigma (n)$ is the sum of positive divisors of $n$.
The real numbers $a_1,a_2,\dots,a_n$ are given such that $|a_i|\leq 1$
for all $i=1,2,\dots,n$ and
$a_1+a_2+\cdots+a_n=0$.
a) Prove that there exists $k\in\{1,2,\dots,n\}$ such that
\[ |a_1+2a_2+\cdots+ka_k|\leq\frac{2k+1}{4}. \]
b) Prove that for $n > 2$ the bound above is the best possible.
[i]Radu Gologan, Dan Schwarz[/i]
Do there exist integers $m, n$ and a function $f\colon \mathbb R \to \mathbb R$ satisfying simultaneously the following two conditions?
$\bullet$ i) $f(f(x))=2f(x)-x-2$ for any $x \in \mathbb R$;
$\bullet$ ii) $m \leq n$ and $f(m)=n$.
Suppose there are 18 lighthouses on the Persian Gulf. Each of the lighthouses lightens an angle with size 20 degrees. Prove that we can choose the directions of the lighthouses such that whole of the blue Persian (always Persian) Gulf is lightened.
Given an integer $ n > 3.$ Prove that there exists a set $ S$ consisting of $ n$ pairwisely distinct positive integers such that for any two different non-empty subset of $ S$:$ A,B, \frac {\sum_{x\in A}x}{|A|}$ and $ \frac {\sum_{x\in B}x}{|B|}$ are two composites which share no common divisors.
Let $n$ be a positive integer, and $a_j$, for $j=1,2,\ldots,n$ are complex numbers. Suppose $I$ is an arbitrary nonempty subset of $\{1,2,\ldots,n\}$, the inequality $\left|-1+ \prod_{j\in I} (1+a_j) \right| \leq \frac 12$ always holds.
Prove that $\sum_{j=1}^n |a_j| \leq 3$.
Find the largest integer $n$ such that $n$ is divisible by all positive integers less than $\sqrt[3]{n}$.
We are given $2001$ balloons and a positive integer $k$. Each balloon has been blown up to a certain size (not necessarily the same for each balloon). In each step it is allowed to choose at most $k$ balloons and equalize their sizes to their arithmetic mean. Determine the smallest value of $k$ such that, whatever the initial sizes are, it is possible to make all the balloons have equal size after a finite number of steps.
Let $p_1(x)=p(x)=4x^3-3x$ and $p_{n+1}(x)=p(p_n(x))$ for each positive integer $n$. Also, let $A(n)$ be the set of all the real roots of the equation $p_n(x)=x$.
Prove that $A(n)\subseteq A(2n)$ and that the product of the elements of $A(n)$ is the average of the elements of $A(2n)$.
In Lineland there are $n\geq1$ towns, arranged along a road running from left to right. Each town has a [i]left bulldozer[/i] (put to the left of the town and facing left) and a [i]right bulldozer[/i] (put to the right of the town and facing right). The sizes of the $2n$ bulldozers are distinct. Every time when a left and right bulldozer confront each other, the larger bulldozer pushes the smaller one off the road. On the other hand, bulldozers are quite unprotected at their rears; so, if a bulldozer reaches the rear-end of another one, the first one pushes the second one off the road, regardless of their sizes.
Let $A$ and $B$ be two towns, with $B$ to the right of $A$. We say that town $A$ can [i]sweep[/i] town $B$ [i]away[/i] if the right bulldozer of $A$ can move over to $B$ pushing off all bulldozers it meets. Similarly town $B$ can sweep town $A$ away if the left bulldozer of $B$ can move over to $A$ pushing off all bulldozers of all towns on its way.
Prove that there is exactly one town that cannot be swept away by any other one.
A prime number $p$ is a [b]moderate[/b] number if for every $2$ positive integers $k > 1$ and $m$, there exists k positive integers $n_1, n_2, ..., n_k $ such that \[ n_1^2+n_2^2+ ... +n_k^2=p^{k+m} \]
If $q$ is the smallest [b]moderate[/b] number, then determine the smallest prime $r$ which is not moderate and $q < r$.
Given positive numbers $a_1$ and $b_1$, consider the sequences defined by
\[a_{n+1}=a_n+\frac{1}{b_n},\quad b_{n+1}=b_n+\frac{1}{a_n}\quad (n \ge 1)\]
Prove that $a_{25}+b_{25} \geq 10\sqrt{2}$.
Find all positive integers $n$ such that $9^{n}-1$ is divisible by $7^n$.
\begin{quote}
Ted quite likes haikus, \\
poems with five-seven-five, \\
but Ted knows few words.
He knows $2n$ words \\
that contain $n$ syllables \\
for every int $n$.
Ted can only write \\
$N$ distinct haikus. Find $N$. \\
Take mod one hundred.
\end{quote}
Ted loves creating haikus (Japanese three-line poems with $5$, $7$, $5$ syllables each), but his vocabulary is rather limited. In particular, for integers $1 \le n \le 7$, he knows $2n$ words with $n$ syllables. Furthermore, words cannot cross between lines, but may be repeated. If Ted can make $N$ distinct haikus, compute the remainder when $N$ is divided by $100$.
[i]Proposed by Lewis Chen[/i]