Found problems: 1800
2002 Tournament Of Towns, 4
$2002$ cards with numbers $1,2,\ldots ,2002$ written on them are put on a table face up. Two players $A,B$ take turns to pick up a card until all are gone. $A$ goes first. The player who gets the last digit of the sum of his cards larger than his opponent wins.
Who has a winning strategy and how should one play to win?
2016 Bulgaria JBMO TST, 4
Given is a table 4x4 and in every square there is 0 or 1. In a move we choose row or column and we change the numbers there. Call the square "zero" if we cannot decrease the number of zeroes in it. Call "degree of the square" the number zeroes in a "zero" square. Find all possible values of the degree.
2011 Canada National Olympiad, 3
Amy has divided a square into finitely many white and red rectangles, each with sides parallel to the sides of the square. Within each white rectangle, she writes down its width divided by its height. Within each red rectangle, she writes down its height divided by its width. Finally, she calculates $x$, the sum of these numbers. If the total area of white equals the total area of red, determine the minimum of $x$.
1992 Vietnam National Olympiad, 3
Label the squares of a $1991 \times 1992$ rectangle $(m, n)$ with $1 \leq m \leq 1991$ and $1 \leq n \leq 1992$. We wish to color all the squares red. The first move is to color red the squares $(m, n), (m+1, n+1), (m+2, n+1)$for some $m < 1990, n < 1992$. Subsequent moves are to color any three (uncolored) squares in the same row, or to color any three (uncolored) squares in the same column. Can we color all the squares in this way?
1999 Brazil National Olympiad, 4
On planet Zork there are some cities. For every city there is a city at the diametrically opposite point. Certain roads join the cities on Zork. If there is a road between cities $P$ and $Q$, then there is also a road between the cities $P'$ and $Q'$ diametrically opposite to $P$ and $Q$. In plus, the roads do not cross each other and for any two cities $P$ and $Q$ it is possible to travel from $P$ to $Q$.
The prices of Kriptonita in Urghs (the planetary currency) in two towns connected by a road differ by at most 100. Prove that there exist two diametrically opposite cities in which the prices of Kriptonita differ by at most 100 Urghs.
2007 Kazakhstan National Olympiad, 2
Each cell of a $100$ x $100$ board is painted in one of $100$ different colors so that there are exactly $100$ cells of each color. Prove that there is a row or column in which there are at least $10$ cells of different colors.
2007 Indonesia TST, 4
Let $ S$ be a finite family of squares on a plane such that every point on that plane is contained in at most $ k$ squares in $ S$. Prove that $ P$ can be divided into $ 4(k\minus{}1)\plus{}1$ sub-family such that in each sub-family, each pair of squares are disjoint.
2011 Mexico National Olympiad, 1
$25$ lightbulbs are distributed in the following way: the first $24$ are placed on a circumference, placing a bulb at each vertex of a regular $24$-gon, and the remaining bulb is placed on the center of said circumference.
At any time, the following operations may be applied:
[list]
[*] Take two vertices on the circumference with an odd amount of vertices between them, and change the state of the bulbs on those vertices and the center bulb.
[*] Take three vertices on the circumference that form an equilateral triangle, change the state of the bulbs on those vertices and the center bulb.[/list]
Prove from any starting configuration of on and off lightbulbs, it is always possible to reach a configuration where all the bulbs are on.
2003 Italy TST, 2
For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A [i]tromino[/i] is an $L$-shape formed by three connected unit squares.
$(a)$ For which values of $n$ is it possible to cover all the black squares with non-overlapping trominoes lying entirely on the chessboard?
$(b)$ When it is possible, find the minimum number of trominoes needed.
2008 Romania National Olympiad, 3
Let $ A\equal{}\{1,2,\ldots, 2008\}$. We will say that set $ X$ is an $ r$-set if $ \emptyset \neq X \subset A$, and $ \sum_{x\in X} x \equiv r \pmod 3$. Let $ X_r$, $ r\in\{0,1,2\}$ be the set of $ r$-sets.
Find which one of $ X_r$ has the most elements.
2024 Austrian MO National Competition, 5
Let $n$ be a positive integer and let $z_1,z_2,\dots,z_n$ be positive integers such that for $j=1,2,\dots,n$ the inequalites $z_j \le j$ hold and $z_1+z_2+\dots+z_n$ is even.
Prove that the number $0$ occurs among the values
\[z_1 \pm z_2 \pm \dots \pm z_n,\]
where $+$ or $-$ can be chosen independently for each operation.
[i](Walther Janous)[/i]
2012 ITAMO, 3
Let $n$ be an integer greater than or equal to $2$. There are $n$ people in one line, each of which is either a [i]scoundrel[/i] (who always lie) or a [i]knight[/i] (who always tells the truth). Every person, except the first, indicates a person in front of him/her and says "This person is a scoundrel" or "This person is a knight." Knowing that there are strictly more scoundrel than knights, seeing the statements show that it is possible to determine each person whether he/she is a scoundrel or a knight.
2012 Turkey Team Selection Test, 3
Two players $A$ and $B$ play a game on a $1\times m$ board, using $2012$ pieces numbered from $1$ to $2012.$ At each turn, $A$ chooses a piece and $B$ places it to an empty place. After $k$ turns, if all pieces are placed on the board increasingly, then $B$ wins, otherwise $A$ wins. For which values of $(m,k)$ pairs can $B$ guarantee to win?
2005 Georgia Team Selection Test, 1
1. The transformation $ n \to 2n \minus{} 1$ or $ n \to 3n \minus{} 1$, where $ n$ is a positive integer, is called the 'change' of $ n$. Numbers $ a$ and $ b$ are called 'similar', if there exists such positive integer, that can be got by finite number of 'changes' from both $ a$ and $ b$. Find all positive integers 'similar' to $ 2005$ and less than $ 2005$.
2014 Baltic Way, 10
In a country there are $100$ airports. Super-Air operates direct flights between some pairs of airports (in both directions). The [i]traffic[/i] of an airport is the number of airports it has a direct Super-Air connection with. A new company, Concur-Air, establishes a direct flight between two airports if and only if the sum of their traffics is at least $100.$ It turns out that there exists a round-trip of Concur-Air flights that lands in every airport exactly once. Show that then there also exists a round-trip of Super-Air flights that lands in every airport exactly once.
2003 Bulgaria Team Selection Test, 3
Some of the vertices of a convex $n$-gon are connected by segments, such that any two of them have no common interior point. Prove that, for any $n$ points in general position, there exists a one-to-one correspondence between the points and the vertices of the $n$ gon, such that any two segments between the points, corresponding to the respective segments from the $n$ gon, have no common interior point.
2015 Romania Masters in Mathematics, 3
A finite list of rational numbers is written on a blackboard. In an [i]operation[/i], we choose any two numbers $a$, $b$, erase them, and write down one of the numbers \[
a + b, \; a - b, \; b - a, \; a \times b, \; a/b \text{ (if $b \neq 0$)}, \; b/a \text{ (if $a \neq 0$)}.
\] Prove that, for every integer $n > 100$, there are only finitely many integers $k \ge 0$, such that, starting from the list \[ k + 1, \; k + 2, \; \dots, \; k + n, \] it is possible to obtain, after $n - 1$ operations, the value $n!$.
2012 Iran MO (3rd Round), 3
Prove that if $n$ is large enough, among any $n$ points of plane we can find $1000$ points such that these $1000$ points have pairwise distinct distances. Can you prove the assertion for $n^{\alpha}$ where $\alpha$ is a positive real number instead of $1000$?
2005 Cono Sur Olympiad, 3
The monetary unit of a certain country is called Reo, and all the coins circulating are integers values of Reos. In a group of three people, each one has 60 Reos in coins (but we don't know what kind of coins each one has). Each of the three people can pay each other any integer value between 1 and 15 Reos, including, perhaps with change. Show that the three persons together can pay exactly (without change) any integer value between 45 and 135 Reos, inclusive.
2002 Polish MO Finals, 3
Three non-negative integers are written on a blackboard. A move is to replace two of the integers $k,m$ by $k+m$ and $|k-m|$. Determine whether we can always end with triplet which has at least two zeros
2012 Indonesia TST, 1
A cycling group that has $4n$ members will have several cycling events, such that:
a) Two cycling events are done every week; once on Saturday and once on Sunday.
b) Exactly $2n$ members participate in any cycling event.
c) No member may participate in both cycling events of a week.
d) After all cycling events are completed, the number of events where each pair of members meet is the same for all pairs of members.
Prove that after all cycling events are completed, the number of events where each group of three members meet is the same value $t$ for all groups of three members, and that for $n \ge 2$, $t$ is divisible by $n-1$.
2005 Brazil National Olympiad, 4
We have four charged batteries, four uncharged batteries and a radio which needs two charged batteries to work.
Suppose we don't know which batteries are charged and which ones are uncharged. Find the least number of attempts sufficient to make sure the radio will work. An attempt consists in putting two batteries in the radio and check if the radio works or not.
1974 Miklós Schweitzer, 2
Let $ G$ be a $ 2$-connected nonbipartite graph on $ 2n$ vertices. Show that the vertex set of $ G$ can be split into two classes of $ n$ elements such that the edges joining the two classes form a connected, spanning subgraph.
[i]L. Lovasz[/i]
2007 France Team Selection Test, 1
Do there exist $5$ points in the space, such that for all $n\in\{1,2,\ldots,10\}$ there exist two of them at distance between them $n$?
2011 China Team Selection Test, 3
For a given integer $n\ge 2$, let $a_0,a_1,\ldots ,a_n$ be integers satisfying $0=a_0<a_1<\ldots <a_n=2n-1$. Find the smallest possible number of elements in the set $\{ a_i+a_j \mid 0\le i \le j \le n \}$.