Found problems: 1488
2005 Italy TST, 3
Let $N$ be a positive integer. Alberto and Barbara write numbers on a blackboard taking turns, according to the following rules. Alberto starts writing $1$, and thereafter if a player has written $n$ on a certain move, his adversary is allowed to write $n+1$ or $2n$ as long as he/she does not obtain a number greater than $N$. The player who writes $N$ wins.
$(a)$ Determine which player has a winning strategy for $N=2005$.
$(b)$ Determine which player has a winning strategy for $N=2004$.
$(c)$ Find for how many integers $N\le 2005$ Barbara has a winning strategy.
2009 Tuymaada Olympiad, 4
Each of the subsets $ A_1$, $ A_2$, $ \dots,$ $ A_n$ of a 2009-element set $ X$ contains at least 4 elements. The intersection of every two of these subsets contains at most 2 elements. Prove that in $ X$ there is a 24-element subset $ B$ containing neither of the sets $ A_1$, $ A_2$, $ \dots,$ $ A_n$.
1986 USAMO, 5
By a partition $\pi$ of an integer $n\ge 1$, we mean here a representation of $n$ as a sum of one or more positive integers where the summands must be put in nondecreasing order. (E.g., if $n=4$, then the partitions $\pi$ are $1+1+1+1$, $1+1+2$, $1+3, 2+2$, and $4$).
For any partition $\pi$, define $A(\pi)$ to be the number of $1$'s which appear in $\pi$, and define $B(\pi)$ to be the number of distinct integers which appear in $\pi$. (E.g., if $n=13$ and $\pi$ is the partition $1+1+2+2+2+5$, then $A(\pi)=2$ and $B(\pi) = 3$).
Prove that, for any fixed $n$, the sum of $A(\pi)$ over all partitions of $\pi$ of $n$ is equal to the sum of $B(\pi)$ over all partitions of $\pi$ of $n$.
2002 Vietnam National Olympiad, 3
Let be given two positive integers $ m$, $ n$ with $ m < 2001$, $ n < 2002$. Let distinct real numbers be written in the cells of a $ 2001 \times 2002$ board (with $ 2001$ rows and $ 2002$ columns). A cell of the board is called [i]bad[/i] if the corresponding number is smaller than at least $ m$ numbers in the same column and at least $ n$ numbers in the same row. Let $ s$ denote the total number of [i]bad[/i] cells. Find the least possible value of $ s$.
2010 India IMO Training Camp, 6
Let $n\ge 2$ be a given integer. Show that the number of strings of length $n$ consisting of $0'$s and $1'$s such that there are equal number of $00$ and $11$ blocks in each string is equal to
\[2\binom{n-2}{\left \lfloor \frac{n-2}{2}\right \rfloor}\]
2005 All-Russian Olympiad, 3
Given 2005 distinct numbers $a_1,\,a_2,\dots,a_{2005}$. By one question, we may take three different indices $1\le i<j<k\le 2005$ and find out the set of numbers $\{a_i,\,a_j,\,a_k\}$ (unordered, of course). Find the minimal number of questions, which are necessary to find out all numbers $a_i$.
2014 India Regional Mathematical Olympiad, 4
A person moves in the $x-y$ plane moving along points with integer co-ordinates $x$ and $y$ only. When she is at a point $(x,y)$, she takes a step based on the following rules:
(a) if $x+y$ is even she moves to either $(x+1,y)$ or $(x+1,y+1)$;
(b) if $x+y$ is odd she moves to either $(x,y+1)$ or $(x+1,y+1)$.
How many distinct paths can she take to go from $(0,0)$ to $(8,8)$ given that she took exactly three steps to the right $((x,y)$ to $(x+1,y))$?
2010 Malaysia National Olympiad, 2
A meeting is held at a round table. It is known that 7 women have a woman on their right side, and 12 women have a man on their right side. It is also known that 75% of the men have a woman on their right side. How many people are sitting at the round table?
2018 Latvia Baltic Way TST, P5
Alice and Bob play a game on a numbered row of $n \ge 5$ squares. At the beginning a pebble is put on the first square and then the players make consecutive moves; Alice starts. During a move a player is allowed to choose one of the following:
[list]
[*] move the pebble one square forward;
[*] move the pebble four squares forward;
[*] move the pebble two squares backwards.
[/list]
All of the possible moves are only allowed if the pebble stays within the borders of the square row.
The player who moves the pebble to the last square (a.k.a $n\text{-th}$) wins. Determine for which values of $n$ each of the players has a winning strategy.
2013 Miklós Schweitzer, 1
Let $q$ be a positive integer. Prove there exists a constant $C_q$ such that the following inequality holds for any finite set $A$ of integers:
\[|A+qA|\ge (q+1)|A|-C_q.\]
[i]Proposed by Antal Balog.[/i]
2007 Pan African, 3
In a country, towns are connected by roads. Each town is directly connected to exactly three other towns. Show that there exists a town from which you can make a round-trip, without using the same road more than once, and for which the number of roads used is not divisible by $3$. (Not all towns need to be visited.)
2006 Bulgaria Team Selection Test, 3
[b]Problem 6.[/b] Let $p>2$ be prime. Find the number of the subsets $B$ of the set $A=\{1,2,\ldots,p-1\}$ such that, the sum of the elements of $B$ is divisible by $p.$
[i] Ivan Landgev[/i]
2010 Tournament Of Towns, 7
Several fleas sit on the squares of a $10\times 10$ chessboard (at most one fea per square). Every minute, all fleas simultaneously jump to adjacent squares. Each fea begins jumping in one of four directions (up, down, left, right), and keeps jumping in this direction while it is possible; otherwise, it reverses direction on the opposite. It happened that during one hour, no two fleas ever occupied the same square. Find the maximal possible number of fleas on the board.
1983 USAMO, 3
Each set of a finite family of subsets of a line is a union of two closed intervals. Moreover, any three of the sets of the family have a point in common. Prove that there is a point which is common to at least half the sets of the family.
1993 All-Russian Olympiad, 2
Is it true that any two rectangles of equal area can be placed in the plane such that any horizontal line intersecting at least one of them will also intersect the other, and the segments of intersection will be equal?
2004 Junior Tuymaada Olympiad, 5
50 knights of King Arthur sat at the Round Table. A glass of white or red wine stood before each of them. It is known that at least one glass of red wine and at least one glass of white wine stood on the table. The king clapped his hands twice. After the first clap every knight with a glass of red wine before him took a glass from his left neighbour. After the second clap every knight with a glass of white wine (and possibly something more) before him gave this glass to the left neughbour of his left neighbour. Prove that some knight was left without wine.
[i]Proposed by A. Khrabrov, incorrect translation from Hungarian[/i]
1982 Canada National Olympiad, 3
Let $\mathbb{R}^n$ be the $n$-dimensional Euclidean space. Determine the smallest number $g(n)$ of a points of a set in $\mathbb{R}^n$ such that every point in $\mathbb{R}^n$ is an irrational distance from at least one point in that set.
2009 Iran MO (3rd Round), 8
Sone of vertices of the infinite grid $\mathbb{Z}^{2}$ are missing. Let's take the remainder as a graph. Connect two edges of the graph if they are the same in one component and their other components have a difference equal to one. Call every connected component of this graph a [b]branch[/b].
Suppose that for every natural $n$ the number of missing vertices in the $(2n+1)\times(2n+1)$ square centered by the origin is less than $\frac{n}{2}$.
Prove that among the branches of the graph, exactly one has an infinite number of vertices.
Time allowed for this problem was 90 minutes.
2003 ITAMO, 5
In each lattice-point of an $m \times n$ grid and in the centre of each of the formed unit squares a pawn is placed.
a) Find all such grids with exactly $500$ pawns.
b) Prove that there are infinitely many positive integers $k$ for which therer is no grid containing exactly $k$ pawns.
2007 India IMO Training Camp, 3
Given a finite string $S$ of symbols $X$ and $O$, we denote $\Delta(s)$ as the number of$X'$s in $S$ minus the number of $O'$s (For example, $\Delta(XOOXOOX)=-1$). We call a string $S$ [b]balanced[/b] if every sub-string $T$ of (consecutive symbols) $S$ has the property $-1\leq \Delta(T)\leq 2.$ (Thus $XOOXOOX$ is not balanced, since it contains the sub-string $OOXOO$ whose $\Delta$ value is $-3.$ Find, with proof, the number of balanced strings of length $n$.
2012 CentroAmerican, 1
Trilandia is a very unusual city. The city has the shape of an equilateral triangle of side lenght 2012. The streets divide the city into several blocks that are shaped like equilateral triangles of side lenght 1. There are streets at the border of Trilandia too. There are 6036 streets in total. The mayor wants to put sentinel sites at some intersections of the city to monitor the streets. A sentinel site can monitor every street on which it is located. What is the smallest number of sentinel sites that are required to monitor every street of Trilandia?
1998 All-Russian Olympiad, 7
Let n be an integer at least 4. In a convex n-gon, there is NO four vertices lie on a same circle. A circle is called circumscribed if it passes through 3 vertices of the n-gon and contains all other vertices. A circumscribed circle is called boundary if it passes through 3 consecutive vertices, a circumscribed circle is called inner if it passes through 3 pairwise non-consecutive points. Prove the number of boundary circles is 2 more than the number of inner circles.
2004 Tournament Of Towns, 2
A box contains red, green, blue, and white balls, 111 balls in all. If you take out 100 balls without looking, then there will always be 4 balls of different colors among them. What is the smallest number of balls you must take out without looking to guarantee that among them there will always be balls of at least 3 different colors?
2022 Grosman Mathematical Olympiad, P5
$n$ lines are given in the plane so that no three of them concur and no two are parallel.
Show that there is a non-self-intersecting path consisting of $n$ straight segments so that each of the given lines contains exactly one of the segments of the path.
2005 Moldova Team Selection Test, 3
Does there exist such a configuration of 22 circles and 22 point, that any circle contains at leats 7 points and any point belongs at least to 7 circles?