Found problems: 1488
1998 China Team Selection Test, 1
Find $k \in \mathbb{N}$ such that
[b]a.)[/b] For any $n \in \mathbb{N}$, there does not exist $j \in \mathbb{Z}$ which satisfies the conditions $0 \leq j \leq n - k + 1$ and $\left(
\begin{array}{c}
n\\
j\end{array} \right), \left( \begin{array}{c}
n\\
j + 1\end{array} \right), \ldots, \left( \begin{array}{c}
n\\
j + k - 1\end{array} \right)$ forms an arithmetic progression.
[b]b.)[/b] There exists $n \in \mathbb{N}$ such that there exists $j$ which satisfies $0 \leq j \leq n - k + 2$, and $\left(
\begin{array}{c}
n\\
j\end{array} \right), \left( \begin{array}{c}
n\\
j + 1\end{array} \right), \ldots , \left( \begin{array}{c}
n\\
j + k - 2\end{array} \right)$ forms an arithmetic progression.
Find all $n$ which satisfies part [b]b.)[/b]
2006 Italy TST, 1
Let $S$ be a string of $99$ characters, $66$ of which are $A$ and $33$ are $B$. We call $S$ [i]good[/i] if, for each $n$ such that $1\le n \le 99$, the sub-string made from the first $n$ characters of $S$ has an odd number of distinct permutations. How many good strings are there? Which strings are good?
2008 India Regional Mathematical Olympiad, 4
Find the number of all $ 6$-digit natural numbers such that the sum of their digits is $ 10$ and each of the digits $ 0,1,2,3$ occurs at least once in them.
[14 points out of 100 for the 6 problems]
2014 Contests, 3
$2014$ points are placed on a circumference. On each of the segments with end points on two of the $2014$ points is written a non-negative real number. For any convex polygon with vertices on some of the $2014$ points, the sum of the numbers written on their sides is less or equal than $1$. Find the maximum possible value for the sum of all the written numbers.
1993 India National Olympiad, 7
Let $A = \{ 1,2, 3 , \ldots, 100 \}$ and $B$ be a subset of $A$ having $53$ elements. Show that $B$ has 2 distinct elements $x$ and $y$ whose sum is divisible by $11$.
2002 India National Olympiad, 4
Is it true that there exist 100 lines in the plane, no three concurrent, such that they intersect in exactly 2002 points?
1996 Yugoslav Team Selection Test, Problem 1
Let $\mathfrak F=\{A_1,A_2,\ldots,A_n\}$ be a collection of subsets of the set $S=\{1,2,\ldots,n\}$ satisfying the following conditions:
(a) Any two distinct sets from $\mathfrak F$ have exactly one element in common;
(b) each element of $S$ is contained in exactly $k$ of the sets in $\mathfrak F$.
Can $n$ be equal to $1996$?
2012 USA TSTST, 8
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$.
1998 IberoAmerican, 1
Given 98 points in a circle. Mary and Joseph play alternatively in the next way:
- Each one draw a segment joining two points that have not been joined before.
The game ends when the 98 points have been used as end points of a segments at least once. The winner is the person that draw the last segment. If Joseph starts the game, who can assure that is going to win the game.
2011 Moldova Team Selection Test, 4
Initially, on the blackboard are written all natural numbers from $1$ to $20$. A move consists of selecting $2$ numbers $a<b$ written on the blackboard such that their difference is at least $2$, erasing these numbers and writting $a+1$ and $b-1$ instead. What is the maximum numbers of moves one can perform?
2002 China Team Selection Test, 1
$ A$ is a set of points on the plane, $ L$ is a line on the same plane. If $ L$ passes through one of the points in $ A$, then we call that $ L$ passes through $ A$.
(1) Prove that we can divide all the rational points into $ 100$ pairwisely non-intersecting point sets with infinity elements. If for any line on the plane, there are two rational points on it, then it passes through all the $ 100$ sets.
(2) Find the biggest integer $ r$, so that if we divide all the rational points on the plane into $ 100$ pairwisely non-intersecting point sets with infinity elements with any method, then there is at least one line that passes through $ r$ sets of the $ 100$ point sets.
1989 USAMO, 2
The 20 members of a local tennis club have scheduled exactly 14 two-person games among themselves, with each member playing in at least one game. Prove that within this schedule there must be a set of 6 games with 12 distinct players.
1995 Mexico National Olympiad, 2
Consider 6 points on a plane such that 8 of the distances between them are equal to 1. Prove that there are at least 3 points that form an equilateral triangle.
2008 Baltic Way, 14
Is it possible to build a $ 4\times 4\times4$ cube from blocks of the following shape consisting of $ 4$ unit cubes?
1990 Vietnam Team Selection Test, 3
There are $n\geq 3$ pupils standing in a circle, and always facing the teacher that stands at the centre of the circle. Each time the teacher whistles, two arbitrary pupils that stand next to each other switch their seats, while the others stands still. Find the least number $M$ such that after $M$ times of whistling, by appropriate switchings, the pupils stand in such a way that any two pupils, initially standing beside each other, will finally also stand beside each other; call these two pupils $ A$ and $ B$, and if $ A$ initially stands on the left side of $ B$ then $ A$ will finally stand on the right side of $ B$.
2003 Hong kong National Olympiad, 2
Let $ABCDEF$ regular hexagon of side length $1$ and $O$ is its center. In addition to the sides of the hexagon, line segments from $O$ to the every vertex are drawn, making as total of $12$ unit segments. Find the number paths of length $2003$ along these segments that star at $O$ and terminate at $O$.
2004 Tournament Of Towns, 7
Let A and B be two rectangles such that it is possible to get rectangle similar to A by putting together rectangles equal to B. Show that it is possible to get rectangle similar to B by putting together rectangles equal to A.
2005 MOP Homework, 7
Eight problems were given to each of $30$ students. After the test was given, point values of the problems were determined as follows: a problem is worth $n$ points if it is not solved by exactly $n$ contestants (no partial credit is given, only zero marks or full marks).
(a) Is it possible that the contestant having got more points that any other contestant had also solved less problems than any other contestant?
(b) Is it possible that the contestant having got less points than any other contestant has solved more problems than any other contestant?
2008 Tournament Of Towns, 7
A test consists of $30$ true or false questions. After the test (answering all $30$ questions), Victor gets his score: the number of correct answers. Victor is allowed to take the test (the same questions ) several times. Can Victor work out a strategy that insure him to get a perfect score after
[b](a) [/b] $30$th attempt?
[b](b)[/b] $25$th attempt?
(Initially, Victor does not know any answer)
2009 ITAMO, 3
A natural number $k$ is said $n$-squared if by colouring the squares of a $2n \times k$ chessboard, in any manner, with $n$ different colours, we can find $4$ separate unit squares of the same colour, the centers of which are vertices of a rectangle having sides parallel to the sides of the board. Determine, in function of $n$, the smallest natural $k$ that is $n$-squared.
2007 China Team Selection Test, 3
There are $ 63$ points arbitrarily on the circle $ \mathcal{C}$ with its diameter being $ 20$. Let $ S$ denote the number of triangles whose vertices are three of the $ 63$ points and the length of its sides is no less than $ 9$. Fine the maximum of $ S$.
2002 India IMO Training Camp, 6
Determine the number of $n$-tuples of integers $(x_1,x_2,\cdots ,x_n)$ such that $|x_i| \le 10$ for each $1\le i \le n$ and $|x_i-x_j| \le 10$ for $1 \le i,j \le n$.
2014 South africa National Olympiad, 5
Let $n > 1$ be an integer. An $n \times n$-square is divided into $n^2$ unit squares. Of these unit squares, $n$ are coloured green and $n$ are coloured blue, and all remaining ones are coloured white. Are there more such colourings for which there is exactly one green square in each row and exactly one blue square in each column; or colourings for which there is exactly one green square and exactly one blue square in each row?
1985 IMO Longlists, 69
Let $A$ and $B$ be two finite disjoint sets of points in the plane such that no three distinct
points in $A \cup B$ are collinear. Assume that at least one of the sets $A, B$ contains at least five points. Show that there exists a triangle all of whose vertices are contained in $A$ or in $B$ that does not contain in its interior any point from the other set.
2016 German National Olympiad, 2
A very well known family of mathematicians has three children called [i]Antonia, Bernhard[/i] and [i]Christian[/i]. Each evening one of the children has to do the dishes. One day, their dad decided to construct of plan that says which child has to do the dishes at which day for the following $55$ days.
Let $x$ be the number of possible such plans in which Antonia has to do the dishes on three consecutive days at least once. Furthermore, let $y$ be the number of such plans in which there are three consecutive days in which Antonia does the dishes on the first, Bernhard on the second and Christian on the third day.
Determine, whether $x$ and $y$ are different and if so, then decide which of those is larger.