Found problems: 1800
2012 Iran MO (2nd Round), 1
[b]a)[/b] Do there exist $2$-element subsets $A_1,A_2,A_3,...$ of natural numbers such that each natural number appears in exactly one of these sets and also for each natural number $n$, sum of the elements of $A_n$ equals $1391+n$?
[b]b)[/b] Do there exist $2$-element subsets $A_1,A_2,A_3,...$ of natural numbers such that each natural number appears in exactly one of these sets and also for each natural number $n$, sum of the elements of $A_n$ equals $1391+n^2$?
[i]Proposed by Morteza Saghafian[/i]
2010 CentroAmerican, 3
A token is placed in one square of a $m\times n$ board, and is moved according to the following rules:
[list]
[*]In each turn, the token can be moved to a square sharing a side with the one currently occupied.
[*]The token cannot be placed in a square that has already been occupied.
[*]Any two consecutive moves cannot have the same direction.[/list]
The game ends when the token cannot be moved. Determine the values of $m$ and $n$ for which, by placing the token in some square, all the squares of the board will have been occupied in the end of the game.
2007 China Team Selection Test, 3
Let $ n$ be positive integer, $ A,B\subseteq[0,n]$ are sets of integers satisfying $ \mid A\mid \plus{} \mid B\mid\ge n \plus{} 2.$ Prove that there exist $ a\in A, b\in B$ such that $ a \plus{} b$ is a power of $ 2.$
2008 Bulgaria Team Selection Test, 1
Let $n$ be a positive integer. There is a pawn in one of the cells of an $n\times n$ table. The pawn moves from an arbitrary cell of the $k$th column, $k \in \{1,2, \cdots, n \}$, to an arbitrary cell in the $k$th row. Prove that there exists a sequence of $n^{2}$ moves such that the pawn goes through every cell of the table and finishes in the starting cell.
1989 Bundeswettbewerb Mathematik, 4
Positive integers $x_1, x_2, \dots, x_n$ ($n \ge 4$) are arranged in a circle such that each $x_i$ divides the sum of the neighbors; that is \[ \frac{x_{i-1}+x_{i+1}}{x_i} = k_i \] is an integer for each $i$, where $x_0 = x_n$, $x_{n+1} = x_1$. Prove that \[ 2n \le k_1 + k_2 + \dots + k_n < 3n. \]
2011 India National Olympiad, 4
Suppose five of the nine vertices of a regular nine-sided polygon are arbitrarily chosen. Show that one can select four among these five such that they are the vertices of a trapezium.
2000 Spain Mathematical Olympiad, 2
Four points are given inside or on the boundary of a unit square. Prove that at least two of these points are on a mutual distance at most $1.$
2003 Federal Math Competition of S&M, Problem 4
Let $ n$ be an even number, and $ S$ be the set of all arrays of length $ n$ whose elements are from the set $ \left\{0,1\right\}$. Prove that $ S$ can be partitioned into disjoint three-element subsets such that for each three arrays $ \left(a_i\right)_{i \equal{} 1}^n$, $ \left(b_i\right)_{i \equal{} 1}^n$, $ \left(c_i\right)_{i \equal{} 1}^n$ which belong to the same subset and for each $ i\in\left\{1,2,...,n\right\}$, the number $ a_i \plus{} b_i \plus{} c_i$ is divisible by $ 2$.
2008 Saint Petersburg Mathematical Olympiad, 7
A square with side $2008$ is broken into regions that are all squares with side $1$. In every region, either $0$ or $1$ is written, and the number of $1$'s and $0$'s is the same. The border between two of the regions is removed, and the numbers in each of them are also removed, while in the new region, their arithmetic mean is recorded. After several of those operations, there is only one square left, which is the big square itself. Prove that it is possible to perform these operations in such a way, that the final number in the big square is less than $\frac{1}{2^{10^6}}$.
2002 Iran MO (2nd round), 6
Let $G$ be a simple graph with $100$ edges on $20$ vertices. Suppose that we can choose a pair of disjoint edges in $4050$ ways. Prove that $G$ is regular.
2008 Moldova Team Selection Test, 4
A non-empty set $ S$ of positive integers is said to be [i]good[/i] if there is a coloring with $ 2008$ colors of all positive integers so that no number in $ S$ is the sum of two different positive integers (not necessarily in $ S$) of the same color. Find the largest value $ t$ can take so that the set $ S\equal{}\{a\plus{}1,a\plus{}2,a\plus{}3,\ldots,a\plus{}t\}$ is good, for any positive integer $ a$.
[hide="P.S."]I have the feeling that I've seen this problem before, so if I'm right, maybe someone can post some links...[/hide]
2007 Croatia Team Selection Test, 6
$\displaystyle 2n$ students $\displaystyle (n \geq 5)$ participated at table tennis contest, which took $\displaystyle 4$ days. In every day, every student played a match. (It is possible that the same pair meets twice or more times, in different days) Prove that it is possible that the contest ends like this:
- there is only one winner;
- there are $\displaystyle 3$ students on the second place;
- no student lost all $\displaystyle 4$ matches.
How many students won only a single match and how many won exactly $\displaystyle 2$ matches? (In the above conditions)
2014 Bulgaria National Olympiad, 2
Every cell of a $m \times n$ chess board, $m\ge 2,n\ge 2$, is colored with one of four possible colors, e.g white, green, red, blue. We call such coloring good if the four cells of any $2\times 2$ square of the chessboard are colored with pairwise different colors. Determine the number of all good colorings of the chess board.
[i]Proposed by N. Beluhov[/i]
2007 Indonesia MO, 4
A 10-digit arrangement $ 0,1,2,3,4,5,6,7,8,9$ is called [i]beautiful[/i] if (i) when read left to right, $ 0,1,2,3,4$ form an increasing sequence, and $ 5,6,7,8,9$ form a decreasing sequence, and (ii) $ 0$ is not the leftmost digit. For example, $ 9807123654$ is a beautiful arrangement. Determine the number of beautiful arrangements.
1990 India National Olympiad, 4
Consider the collection of all three-element subsets drawn from the set $ \{1,2,3,4,\dots,299,300\}$.
Determine the number of those subsets for which the sum of the elements is a multiple of 3.
2010 All-Russian Olympiad, 2
There are $100$ random, distinct real numbers corresponding to $100$ points on a circle. Prove that you can always choose $4$ consecutive points in such a way that the sum of the two numbers corresponding to the points on the outside is always greater than the sum of the two numbers corresponding to the two points on the inside.
2000 Greece National Olympiad, 4
The subsets $A_1,A_2,\ldots ,A_{2000}$ of a finite set $M$ satisfy $|A_i|>\frac{2}{3}|M|$ for each $i=1,2,\ldots ,2000$. Prove that there exists $m\in M$ which belongs to at least $1334$ of the subsets $A_i$.
2004 Balkan MO, 4
The plane is partitioned into regions by a finite number of lines no three of which are concurrent. Two regions are called "neighbors" if the intersection of their boundaries is a segment, or half-line or a line (a point is not a segment). An integer is to be assigned to each region in such a way that:
i) the product of the integers assigned to any two neighbors is less than their sum;
ii) for each of the given lines, and each of the half-planes determined by it, the sum of the integers, assigned to all of the regions lying on this half-plane equal to zero.
Prove that this is possible if and only if not all of the lines are parallel.
2013 Mediterranean Mathematics Olympiad, 2
Determine the least integer $k$ for which the following story could hold true:
In a chess tournament with $24$ players, every pair of players plays at least $2$ and at most $k$ games against each other. At the end of the tournament, it turns out that every player has played a different number of games.
2010 All-Russian Olympiad, 1
There are $24$ different pencils, $4$ different colors, and $6$ pencils of each color. They were given to $6$ children in such a way that each got $4$ pencils. What is the least number of children that you can randomly choose so that you can guarantee that you have pencils of all colors.
P.S. for 10 grade gives same problem with $40$ pencils, $10$ of each color and $10$ children.
2014 Mediterranean Mathematics Olympiad, 2
Consider increasing integer sequences with elements from $1,\ldots,10^6$. Such a sequence is [i]Adriatic[/i] if its first element equals 1 and if every element is at least twice the preceding element. A sequence is [i]Tyrrhenian[/i] if its final element equals $10^6$ and if every element is strictly greater than the sum of all preceding elements.
Decide whether the number of Adriatic sequences is smaller than, equal to, or greater than the number of Tyrrhenian sequences.
(Proposed by Gerhard Woeginger, Austria)
1999 CentroAmerican, 3
The digits of a calculator (with the exception of 0) are shown in the form indicated by the figure below, where there is also a button ``+":
[img]6965[/img]
Two players $A$ and $B$ play in the following manner: $A$ turns on the calculator and presses a digit, and then presses the button ``+". $A$ passes the calculator to $B$, which presses a digit in the same row or column with the one pressed by $A$ that is not the same as the last one pressed by $A$; and then presses + and returns the calculator to $A$, repeating the operation in this manner successively. The first player that reaches or exceeds the sum of 31 loses the game. Which of the two players have a winning strategy and what is it?
1976 Miklós Schweitzer, 2
Let $ G$ be an infinite graph such that for any countably infinite vertex set $ A$ there is a vertex $ p$, not in $A$, joined to infinitely many elements of $ A$. Show that $ G$ has a countably infinite vertex set $ A$ such that $ G$ contains uncountably infinitely many vertices $ p$ joined to infinitely many elements of $ A$.
[i]P. Erdos, A. Hajnal[/i]
2014 China Team Selection Test, 3
$A$ is the set of points of a convex $n$-gon on a plane. The distinct pairwise distances between any $2$ points in $A$ arranged in descending order is $d_1>d_2>...>d_m>0$. Let the number of unordered pairs of points in $A$ such that their distance is $d_i$ be exactly $\mu _i$, for $i=1, 2,..., m$.
Prove: For any positive integer $k\leq m$, $\mu _1+\mu _2+...+\mu _k\leq (3k-1)n$.
2024 Dutch IMO TST, 3
Player Zero and Player One play a game on a $n \times n$ board ($n \ge 1$). The columns of this $n \times n$ board are numbered $1,2,4,\dots,2^{n-1}$. Turn my turn, the players put their own number in one of the free cells (thus Player Zero puts a $0$ and Player One puts a $1$). Player Zero begins. When the board is filled, the game ends and each row yields a (reverse binary) number obtained by adding the values of the columns with a $1$ in that row. For instance, when $n=4$, a row with $0101$ yields the number $0 \cdot1+1 \cdot 2+0 \cdot 4+1 \cdot 8=10$.
a) For which natural numbers $n$ can Player One always ensure that at least one of the row numbers is divisible by $4$?
b) For which natural numbers $n$ can Player One always ensure that at least one of the row numbers is divisible by $3$?