Found problems: 396
2009 Brazil Team Selection Test, 3
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements.
[i]Proposed by Jorge Tipe, Peru[/i]
2000 Pan African, 3
A company has five directors. The regulations of the company require that any majority (three or more) of the directors should be able to open its strongroom, but any minority (two or less) should not be able to do so. The strongroom is equipped with ten locks, so that it can only be opened when keys to all ten locks are available. Find all positive integers $n$ such that it is possible to give each of the directors a set of keys to $n$ different locks, according to the requirements and regulations of the company.
2006 India IMO Training Camp, 2
Let $u_{jk}$ be a real number for each $j=1,2,3$ and each $k=1,2$ and let $N$ be an integer such that
\[\max_{1\le k \le 2} \sum_{j=1}^3 |u_{jk}| \leq N\]
Let $M$ and $l$ be positive integers such that $l^2 <(M+1)^3$. Prove that there exist integers $\xi_1,\xi_2,\xi_3$ not all zero, such that
\[\max_{1\le j \le 3}\xi_j \le M\ \ \ \ \text{and} \ \ \ \left|\sum_{j=1}^3 u_{jk}\xi_k\right| \le \frac{MN}{l} \ \ \ \ \text{for k=1,2}\]
2009 Romania Team Selection Test, 2
A square of side $N=n^2+1$, $n\in \mathbb{N}^*$, is partitioned in unit squares (of side $1$), along $N$ rows and $N$ columns. The $N^2$ unit squares are colored using $N$ colors, $N$ squares with each color. Prove that for any coloring there exists a row or a column containing unit squares of at least $n+1$ colors.
2010 Czech-Polish-Slovak Match, 1
Find all triples $(a,b,c)$ of positive real numbers satisfying the system of equations
\[ a\sqrt{b}-c \&= a,\qquad b\sqrt{c}-a \&= b,\qquad c\sqrt{a}-b \&= c. \]
2009 China Team Selection Test, 2
Let $ n,k$ be given positive integers satisfying $ k\le 2n \minus{} 1$. On a table tennis tournament $ 2n$ players take part, they play a total of $ k$ rounds match, each round is divided into $ n$ groups, each group two players match. The two players in different rounds can match on many occasions. Find the greatest positive integer $ m \equal{} f(n,k)$ such that no matter how the tournament processes, we always find $ m$ players each of pair of which didn't match each other.
2011 Turkey Team Selection Test, 3
Let $A$ and $B$ be sets with $2011^2$ and $2010$ elements, respectively. Show that there is a function $f:A \times A \to B$ satisfying the condition $f(x,y)=f(y,x)$ for all $(x,y) \in A \times A$ such that for every function $g:A \to B$ there exists $(a_1,a_2) \in A \times A$ with $g(a_1)=f(a_1,a_2)=g(a_2)$ and $a_1 \neq a_2.$
2012 Online Math Open Problems, 44
Given a set of points in space, a [i]jump[/i] consists of taking two points, $P$ and $Q,$ and replacing $P$ with the reflection of $P$ over $Q$. Find the smallest number $n$ such that for any set of $n$ lattice points in $10$-dimensional-space, it is possible to perform a finite number of jumps so that some two points coincide.
[i]Author: Anderson Wang[/i]
2010 China Girls Math Olympiad, 7
For given integer $n \geq 3$, set $S =\{p_1, p_2, \cdots, p_m\}$ consists of permutations $p_i$ of $(1, 2, \cdots, n)$. Suppose that among every three distinct numbers in $\{1, 2, \cdots, n\}$, one of these number does not lie in between the other two numbers in every permutations $p_i$ ($1 \leq i \leq m$). (For example, in the permutation $(1, 3, 2, 4)$, $3$ lies in between $1$ and $4$, and $4$ does not lie in between $1$ and $2$.) Determine the maximum value of $m$.
2002 Putnam, 2
Given any five points on a sphere, show that some four of them must lie on a closed hemisphere.
1978 IMO Shortlist, 8
Let $S$ be the set of all the odd positive integers that are not multiples of $5$ and that are less than $30m$, $m$ being an arbitrary positive integer. What is the smallest integer $k$ such that in any subset of $k$ integers from $S$ there must be two different integers, one of which divides the other?
1997 Vietnam National Olympiad, 3
In the unit cube, given 75 points, no three of which are collinear. Prove that there exits a triangle whose vertices are among the given points and whose area is not greater than 7/72.
2006 Mathematics for Its Sake, 3
Show that if the point $ M $ is situated in the interior of a square $ ABCD, $ then, among the segments $ MA,MB,MC,MD, $
[b]a)[/b] at most one of them is greater with a factor of $ \sqrt 5/2 $ than the side of the square.
[b]b)[/b] at most two of them are greater than the side of the square.
[b]c)[/b] at most three of them are greater with a factor of $ \sqrt 2/2 $ than the side of the square.
2012 India IMO Training Camp, 2
Let $S$ be a nonempty set of primes satisfying the property that for each proper subset $P$ of $S$, all the prime factors of the number $\left(\prod_{p\in P}p\right)-1$ are also in $S$. Determine all possible such sets $S$.
2014 Taiwan TST Round 2, 4
Prove that in any set of $2000$ distinct real numbers there exist two pairs $a>b$ and $c>d$ with $a \neq c$ or $b \neq d $, such that \[ \left| \frac{a-b}{c-d} - 1 \right|< \frac{1}{100000}. \]
2003 China Western Mathematical Olympiad, 3
Let $ n$ be a given positive integer. Find the smallest positive integer $ u_n$ such that for any positive integer $ d$, in any $ u_n$ consecutive odd positive integers, the number of them that can be divided by $ d$ is not smaller than the number of odd integers among $ 1, 3, 5, \ldots, 2n \minus{} 1$ that can be divided by $ d$.
2018 AMC 10, 17
Let $S$ be a set of 6 integers taken from $\{1,2,\dots,12\}$ with the property that if $a$ and $b$ are elements of $S$ with $a<b$, then $b$ is not a multiple of $a$. What is the least possible value of an element in $S$?
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 7$
2018 Spain Mathematical Olympiad, 4
Points on a spherical surface with radius $4$ are colored in $4$ different colors. Prove that there exist two points with the same color such that the distance between them is either $4\sqrt{3}$ or $2\sqrt{6}$.
(Distance is Euclidean, that is, the length of the straight segment between the points)
2011 Indonesia MO, 4
An island has $10$ cities, where some of the possible pairs of cities are connected by roads. A [i]tour route[/i] is a route starting from a city, passing exactly eight out of the other nine cities exactly once each, and returning to the starting city. (In other words, it is a loop that passes only nine cities instead of all ten cities.) For each city, there exists a tour route that doesn't pass the given city. Find the minimum number of roads on the island.
1990 Putnam, B3
Let $S$ be a set of $ 2 \times 2 $ integer matrices whose entries $a_{ij}(1)$ are all squares of integers and, $(2)$ satisfy $a_{ij} \le 200$. Show that $S$ has more than $ 50387 (=15^4-15^2-15+2) $ elements, then it has two elements that commute.
2012 USA TSTST, 1
Find all infinite sequences $a_1, a_2, \ldots$ of positive integers satisfying the following properties:
(a) $a_1 < a_2 < a_3 < \cdots$,
(b) there are no positive integers $i$, $j$, $k$, not necessarily distinct, such that $a_i+a_j=a_k$,
(c) there are infinitely many $k$ such that $a_k = 2k-1$.
2012 India Regional Mathematical Olympiad, 6
A computer program generated $175$ positive integers at random, none of which had a prime divisor grater than $10.$ Prove that there are three numbers among them whose product is the cube of an integer.
2001 All-Russian Olympiad, 4
Consider a convex $2000$-gon, no three of whose diagonals have a common point. Each of its diagonals is colored in one of $999$ colors. Prove that there exists a triangle all of whose sides lie on diagonals of the same color. (Vertices of the triangle need not be vertices of the original polygon.)
1991 Brazil National Olympiad, 4
Show that there exists $n>2$ such that $1991 | 1999 \ldots 91$ (with $n$ 9's).
1986 Canada National Olympiad, 5
Let $u_1$, $u_2$, $u_3$, $\dots$ be a sequence of integers satisfying the recurrence relation $u_{n + 2} = u_{n + 1}^2 - u_n$. Suppose $u_1 = 39$ and $u_2 = 45$. Prove that 1986 divides infinitely many terms of the sequence.