Navvye/Olympiad-Problems-CSV huggingface dataset:
2009 Tournament Of Towns
In rhombus $ABCD$, angle $A$ equals $120^o$. Points $M$ and $N$ are chosen on sides $BC$ and $CD$ so that angle $NAM$ equals $30^o$. Prove that the circumcenter of triangle $NAM$ lies on a diagonal of of the rhombus.
2009 Tournament Of Towns
There are two numbers on a board, $1/2009$ and $1/2008$. Alex and Ben play the following game. At each move, Alex names a number $x$ (of his choice), while Ben responds by increasing one of the numbers on the board (of his choice) by $x$. Alex wins if at some moment one of the numbers on the board becomes $1$. Can Alex win (no matter how Ben plays)?
2009 Tournament Of Towns
(a) Find a polygon which can be cut by a straight line into two congruent parts so that one side of the polygon is divided in half while another side at a ratio of $1 : 2$.

(b) Does there exist a convex polygon with this property?
2009 Tournament Of Towns
In each square of a $101\times 101$ board, except the central one, is placed either a sign " turn" or a sign " straight". The chess piece " car" can enter any square on the boundary of the board from outside (perpendicularly to the boundary). If the car enters a square with the sign " straight" then it moves to the next square in the same direction, otherwise (in case it enters a square with the sign " turn") it turns either to the right or to the left ( its choice). Can one place the signs in such a way that the car never enter the central square?
2009 Tournament Of Towns
Consider an infinite sequence consisting of distinct positive integers such that each term (except the rst one) is either an arithmetic mean or a geometric mean of two neighboring terms. Does it necessarily imply that starting at some point the sequence becomes either arithmetic progression or a geometric progression?
2009 Tournament Of Towns
A castle is surrounded by a circular wall with $9$ towers which are guarded by knights during the night. Every hour the castle clock strikes and the guards shift to the neighboring towers, each guard always moves in the same direction (either clockwise or counterclockwise). Given that (i) during the night each knight guards every tower (ii) at some hour each tower was guarded by at least two knights (iii) at some hour exactly $5$ towers were guarded by single knights, prove that at some hour one of the towers was unguarded.
2009 Tournament Of Towns
Angle $C$ of an isosceles triangle $ABC$ equals $120^o$. Each of two rays emitting from vertex $C$ (inwards the triangle) meets $AB$ at some point ($P_i$) reflects according to the rule the angle of incidence equals the angle of reflection" and meets lateral side of triangle ABC at point $Q_i$ ($i = 1,2$). Given that angle between the rays equals 60^ο, prove that area of triangle $P_1CP_2$ equals the sum of areas of triangles $AQ_1P_1$ and $BQ_2P_2$ ($AP_1 < AP_2$).
2009 Tournament Of Towns
Let ${n \choose k}$ be the number of ways that $k$ objects can be chosen (regardless of order) from a set of $n$ objects. Prove that if positive integers k and l are greater than $1$ and less than $n$, then integers ${n \choose k}$ and ${n \choose l}$ have a common divisor greater than $1$.
2009 Tournament Of Towns
Several points on the plane are given, no three of them lie on the same line. Some of these points are connected by line segments. Assume that any line that does not pass through any of these points intersects an even number of these segments. Prove that from each point exits an even number of the segments.
2009 Tournament Of Towns
For each positive integer $n$, denote by $O(n)$ its greatest odd divisor. Given any positive integers $x_1 = a$ and $x_2 = b$, construct an innite sequence of positive integers as follows: $x_n = O(x_{n-1} + x_{n-2})$, where $n = 3,4,...$

(a) Prove that starting from some place, all terms of the sequence are equal to the same integer.

(b) Express this integer in terms of $a$ and $b$.
2009 Tournament Of Towns
Several zeros and ones are written down in a row. Consider all pairs of digits (not necessarily adjacent) such that the left digit is $1$ while the right digit is $0$. Let $M$ be the number of the pairs in which $1$ and $0$ are separated by an even number of digits (possibly zero), and let $N$ be the number of the pairs in which $1$ and $0$ are separated by an odd number of digits. Prove that $M \ge N$.
2009 Tournament Of Towns
Suppose that $X$ is an arbitrary point inside a tetrahedron. Through each vertex of the tetrahedron, draw a straight line that is parallel to the line segment connecting $X$ with the intersection point of the medians of the opposite face. Prove that these four lines meet at the same point.
2009 Tournament Of Towns
A rectangle is dissected into several smaller rectangles. Is it possible that for each pair of these rectangles, the line segment connecting their centers intersects some third rectangle?
2009 Tournament Of Towns
Each square of a $10\times 10$ board contains a chip. One may choose a diagonal containing an even number of chips and remove any chip from it. Find the maximal number of chips that can be removed from the board by these operations.
2009 Tournament Of Towns
Three planes dissect a parallelepiped into eight hexahedrons such that all of their faces are quadrilaterals (each plane intersects two corresponding pairs of opposite faces of the parallelepiped and does not intersect the remaining two faces). One of the hexahedrons has a circumscribed sphere. Prove that each of these hexahedrons has a circumscribed sphere.
2009 Tournament Of Towns
An integer $n > 1$ is given. Two players in turns mark points on a circle. First Player uses red color while Second Player uses blue color. The game is over when each player marks $n$ points. Then each player nds the arc of maximal length with ends of his color, which does not contain any other marked points. A player wins if his arc is longer (if the lengths are equal, or both players have no such arcs, the game ends in a draw). Which player has a winning strategy?
2009 Tournament Of Towns
Initially a number $6$ is written on a blackboard. At $n$-th step an integer $k$ on the blackboard is replaced by $k+gcd(k,n)$. Prove that at each step the number on the blackboard increases either by $1$ or by a prime number.
2010 Tournament Of Towns
Each of six fruit baskets contains pears, plums and apples. The number of plums in each basket equals the total number of apples in all other baskets combined while the number of apples in each basket equals the total number of pears in all other baskets combined. Prove that the total number of fruits is a multiple of $31$.
2010 Tournament Of Towns
Karlson and Smidge divide a cake in a shape of a square in the following way. First, Karlson places a candle on the cake (chooses some interior point). Then Smidge makes a straight cut from the candle to the boundary in the direction of his choice. Then Karlson makes a straight cut from the candle to the boundary in the direction perpendicular to Smidge's cut. As a result, the cake is split into two pieces; Smidge gets the smaller one. Smidge wants to get a piece which is no less than a quarter of the cake. Can Karlson prevent Smidge from getting the piece of that size?
2010 Tournament Of Towns
An angle is given in a plane. Using only a compass, one must find out

$(a)$ if this angle is acute. Find the minimal number of circles one must draw to be sure.

$(b)$ if this angle equals $31^{\circ}$.(One may draw as many circles as one needs).
2010 Tournament Of Towns
At the math contest each participant met at least $3$ pals who he/she already knew. Prove that the Jury can choose an even number of participants (more than two) and arrange them around a table so that each participant be set between these who he/she knows.
2010 Tournament Of Towns
$101$ numbers are written on a blackboard: $1^2, 2^2, 3^2, \cdots, 101^2$. Alex choses any two numbers and replaces them by their positive difference. He repeats this operation until one number is left on the blackboard. Determine the smallest possible value of this number.
2010 Tournament Of Towns
Alex has a piece of cheese. He chooses a positive number $a\neq 1$ and cuts the piece into several pieces one by one. Every time he chooses a piece and cuts it in the same ratio $1:a.$ His goal is to divide the cheese into two piles of equal masses. Can he do it?
2010 Tournament Of Towns
Let $M$ be the midpoint of side $AC$ of the triangle $ABC$. Let $P$ be a point on the side $BC$. If $O$ is the point of intersection of $AP$ and $BM$ and $BO = BP$, determine the ratio $\frac{OM}{PC}$ .
2010 Tournament Of Towns
Each of $999$ numbers placed in a circular way is either $1$ or $-1$. (Both values appear). Consider the total sum of the products of every $10$ consecutive numbers.

$(a)$ Find the minimal possible value of this sum.

$(b)$ Find the maximal possible value of this sum.
2010 Tournament Of Towns
Can it happen that the sum of digits of some positive integer $n$ equals $100$ while the sum of digits of number $n^3$ equals $100^3$?
2010 Tournament Of Towns
$N$ horsemen are riding in the same direction along a circular road. Their speeds are constant and pairwise distinct. There is a single point on the road where the horsemen can surpass one another. Can they ride in this fashion for arbitrarily long time? Consider the cases:

$(a) N = 3;$

$(b) N = 10.$
2010 Tournament Of Towns
A broken line consists of $31$ segments. It has no self intersections, and its start and end points are distinct. All segments are extended to become straight lines. Find the least possible number of straight lines.
2010 Tournament Of Towns
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.
2010 Tournament Of Towns
$2010$ ships deliver bananas, lemons and pineapples from South America to Russia. The total number of bananas on each ship equals the number of lemons on all other ships combined, while the total number of lemons on each ship equals the total number of pineapples on all other ships combined. Prove that the total number of fruits is a multiple of $31$.
2010 Tournament Of Towns
Let $f(x)$ be a function such that every straight line has the same number of intersection points with the graph $y = f(x)$ and with the graph $y = x^2$. Prove that $f(x) = x^2.$
2010 Tournament Of Towns
Is it possible to cover the surface of a regular octahedron by several regular hexagons without gaps and overlaps? (A regular octahedron has $6$ vertices, each face is an equilateral triangle, each vertex belongs to $4$ faces.)
2010 Tournament Of Towns
Assume that $P(x)$ is a polynomial with integer non negative coefficients, different from constant. Baron Munchausen claims that he can restore $P(x)$ provided he knows the values of $P(2)$ and $P(P(2))$ only. Is the baron's claim valid?
2010 Tournament Of Towns
A needle (a segment) lies on a plane. One can rotate it $45^{\circ}$ round any of its endpoints. Is it possible that after several rotations the needle returns to initial position with the endpoints interchanged?
2010 Tournament Of Towns
Is it possible to split all straight lines in a plane into the pairs of perpendicular lines, so that every line belongs to a single pair?
2010 Tournament Of Towns
Alex has a piece of cheese. He chooses a positive number a and cuts the piece into several pieces one by one. Every time he choses a piece and cuts it in the same ratio $1 : a$. His goal is to divide the cheese into two piles of equal masses. Can he do it if

$(a) a$ is irrational?

$(b) a$ is rational, $a \neq 1?$
2010 Tournament Of Towns
Consider a composition of functions $\sin, \cos, \tan, \cot, \arcsin, \arccos, \arctan, \arccos$, applied to the number $1$. Each function may be applied arbitrarily many times and in any order. (ex: $\sin \cos \arcsin \cos \sin\cdots 1$). Can one obtain the number $2010$ in this way?
2010 Tournament Of Towns
$5000$ movie fans gathered at a convention. Each participant had watched at least one movie. The participants should be split into discussion groups of two kinds. In each group of the first kind, the members would discuss a movie they all watched. In each group of the second kind, each member would tell about the movie that no one else in this group had watched. Prove that the chairman can always split the participants into exactly 100 groups. (A group consisting of one person is allowed; in this case this person submits a report).
2010 Tournament Of Towns
$33$ horsemen are riding in the same direction along a circular road. Their speeds are constant and pairwise distinct. There is a single point on the road where the horsemen can surpass one another. Can they ride in this fashion for arbitrarily long time ?
2010 Tournament Of Towns
Quadrilateral $ABCD$ is circumscribed around the circle with centre $I$. Let points $M$ and $N$ be the midpoints of sides $AB$ and $CD$ respectively and let $\frac{IM}{AB} = \frac{IN}{CD}$. Prove that $ABCD$ is either a trapezoid or a parallelogram.
2010 Tournament Of Towns
A multi-digit number is written on the blackboard. Susan puts in a number of plus signs between some pairs of adjacent digits. The addition is performed and the process is repeated with the sum. Prove that regardless of what number was initially on the blackboard, Susan can always obtain a single-digit number in at most ten steps.
2010 Tournament Of Towns
In a multiplication table, the entry in the $i$-th row and the $j$-th column is the product $ij$ From an $m\times n$ subtable with both $m$ and $n$ odd, the interior $(m-2) (n-2)$ rectangle is removed, leaving behind a frame of width $1$. The squares of the frame are painted alternately black and white. Prove that the sum of the numbers in the black squares is equal to the sum of the numbers in the white squares.
2010 Tournament Of Towns
In a quadrilateral $ABCD$ with an incircle, $AB = CD; BC < AD$ and $BC$ is parallel to $AD$. Prove that the bisector of $\angle C$ bisects the area of $ABCD$.
2010 Tournament Of Towns
A $1\times 1\times 1$ cube is placed on an $8\times 8$ chessboard so that its bottom face coincides with a square of the chessboard. The cube rolls over a bottom edge so that the adjacent face now lands on the chessboard. In this way, the cube rolls around the chessboard, landing on each square at least once. Is it possible that a particular face of the cube never lands on the chessboard?
2010 Tournament Of Towns
In a school, more than $90\% $ of the students know both English and German, and more than $90\%$ percent of the students know both English and French. Prove that more than $90\%$ percent of the students who know both German and French also know English.
2010 Tournament Of Towns
A circle is divided by $2N$ points into $2N$ arcs of length $1$. These points are joined in pairs to form $N$ chords. Each chord divides the circle into two arcs, the length of each being an even integer. Prove that $N$ is even.
2010 Tournament Of Towns
A round coin may be used to construct a circle passing through one or two given points on the plane. Given a line on the plane, show how to use this coin to construct two points such that they dene a line perpendicular to the given line. Note that the coin may not be used to construct a circle tangent to the given line.
2010 Tournament Of Towns
Pete has an instrument which can locate the midpoint of a line segment, and also the point which divides the line segment into two segments whose lengths are in a ratio of $n : (n + 1)$, where $n$ is any positive integer. Pete claims that with this instrument, he can locate the point which divides a line segment into two segments whose lengths are at any given rational ratio. Is Pete right?
2010 Tournament Of Towns
At a circular track, $10$ cyclists started from some point at the same time in the same direction with different constant speeds. If any two cyclists are at some point at the same time again, we say that they meet. No three or more of them have met at the same time. Prove that by the time every two cyclists have met at least once, each cyclist has had at least $25$ meetings.
2010 Tournament Of Towns
A rectangle is divided into $2\times 1$ and $1\times 2$ dominoes. In each domino, a diagonal is drawn, and no two diagonals have common endpoints. Prove that exactly two corners of the rectangle are endpoints of these diagonals.
2010 Tournament Of Towns
For each side of a given pentagon, divide its length by the total length of all other sides. Prove that the sum of all the fractions obtained is less than 2.
2010 Tournament Of Towns
In acute triangle $ABC$, an arbitrary point $P$ is chosen on altitude $AH$. Points $E$ and $F$ are the midpoints of sides $CA$ and $AB$ respectively. The perpendiculars from $E$ to $CP$ and from $F$ to $BP$ meet at point $K$. Prove that $KB = KC$.
2010 Tournament Of Towns
Merlin summons the $n$ knights of Camelot for a conference. Each day, he assigns them to the $n$ seats at the Round Table. From the second day on, any two neighbours may interchange their seats if they were not neighbours on the first day. The knights try to sit in some cyclic order which has already occurred before on an earlier day. If they succeed, then the conference comes to an end when the day is over. What is the maximum number of days for which Merlin can guarantee that the conference will last?
2010 Tournament Of Towns
The exchange rate in a Funny-Money machine is $s$ McLoonies for a Loonie or $\frac{1}{s}$ Loonies for a McLoonie, where $s$ is a positive real number. The number of coins returned is rounded off to the nearest integer. If it is exactly in between two integers, then it is rounded up to the greater integer.

$(a)$ Is it possible to achieve a one-time gain by changing some Loonies into McLoonies and changing all the McLoonies back to Loonies?

$(b)$ Assuming that the answer to $(a)$ is "yes", is it possible to achieve multiple gains by repeating this procedure, changing all the coins in hand and back again each time?
2010 Tournament Of Towns
The diagonals of a convex quadrilateral $ABCD$ are perpendicular to each other and intersect at the point $O$. The sum of the inradii of triangles $AOB$ and $COD$ is equal to the sum of the inradii of triangles $BOC$ and $DOA$.

$(a)$ Prove that $ABCD$ has an incircle.

$(b)$ Prove that $ABCD$ is symmetric about one of its diagonals.
2010 Tournament Of Towns
From a police station situated on a straight road innite in both directions, a thief has stolen a police car. Its maximal speed equals $90$% of the maximal speed of a police cruiser. When the theft is discovered some time later, a policeman starts to pursue the thief on a cruiser. However, he does not know in which direction along the road the thief has gone, nor does he know how long ago the car has been stolen. Is it possible for the policeman to catch the thief?
2010 Tournament Of Towns
A square board is dissected into $n^2$ rectangular cells by $n-1$ horizontal and $n-1$ vertical lines. The cells are painted alternately black and white in a chessboard pattern. One diagonal consists of $n$ black cells which are squares. Prove that the total area of all black cells is not less than the total area of all white cells.
2010 Tournament Of Towns
In a tournament with $55$ participants, one match is played at a time, with the loser dropping out. In each match, the numbers of wins so far of the two participants differ by not more than $1$. What is the maximal number of matches for the winner of the tournament?
2010 Tournament Of Towns
There are $100$ points on the plane. All $4950$ pairwise distances between two points have been recorded.

$(a)$ A single record has been erased. Is it always possible to restore it using the remaining records?

$(b)$ Suppose no three points are on a line, and $k$ records were erased. What is the maximum value of $k$ such that restoration of all the erased records is always possible?
2010 Tournament Of Towns
At a circular track, $2n$ cyclists started from some point at the same time in the same direction with different constant speeds. If any two cyclists are at some point at the same time again, we say that they meet. No three or more of them have met at the same time. Prove that by the time every two cyclists have met at least once, each cyclist has had at least $n^2$ meetings.
2010 Tournament Of Towns
For each side of a given polygon, divide its length by the total length of all other sides. Prove that the sum of all the fractions obtained is less than $2$.
2010 Tournament Of Towns
Two dueling wizards are at an altitude of $100$ above the sea. They cast spells in turn, and each spell is of the form "decrease the altitude by $a$ for me and by $b$ for my rival" where $a$ and $b$ are real numbers such that $0 < a < b$. Different spells have different values for $a$ and $b$. The set of spells is the same for both wizards, the spells may be cast in any order, and the same spell may be cast many times. A wizard wins if after some spell, he is still above water but his rival is not. Does there exist a set of spells such that the second wizard has a guaranteed win, if the number of spells is

$(a)$ finite;

$(b)$ infinite?
2010 Tournament Of Towns
The quadrilateral $ABCD$ is inscribed in a circle with center $O$. The diagonals $AC$ and $BD$ do not pass through $O$. If the circumcentre of triangle $AOC$ lies on the line $BD$, prove that the circumcentre of triangle $BOD$ lies on the line $AC$.
2010 Tournament Of Towns
Each cell of a $1000\times 1000$ table contains $0$ or $1$. Prove that one can either cut out $990$ rows so that at least one $1$ remains in each column, or cut out $990$ columns so that at least one $0$ remains in each row.
2010 Tournament Of Towns
A square is divided into congruent rectangles with sides of integer lengths. A rectangle is important if it has at least one point in common with a given diagonal of the square. Prove that this diagonal bisects the total area of the important rectangles
2011 Tournament of Towns
The numbers from $1$ to $2010$ inclusive are placed along a circle so that if we move along the circle in clockwise order, they increase and decrease alternately. Prove that the difference between some two adjacent integers is even.
2011 Tournament of Towns
A rectangle is divided by $10$ horizontal and $10$ vertical lines into $121$ rectangular cells. If $111$ of them have integer perimeters, prove that they all have integer perimeters.
2011 Tournament of Towns
Worms grow at the rate of $1$ metre per hour. When they reach their maximal length of $1$  metre, they stop growing. A full-grown worm may be dissected into two not necessarily equal parts. Each new worm grows at the rate of $1$ metre per hour. Starting with $1$ full-grown worm, can one obtain $10$ full-grown worms in less than $1$ hour?
2011 Tournament of Towns
Each diagonal of a convex quadrilateral divides it into two isosceles triangles. The two diagonals of the same quadrilateral divide it into four isosceles triangles. Must this quadrilateral be a square?
2011 Tournament of Towns
A dragon gave a captured knight $100$ coins. Half of them are magical, but only dragon knows which are. Each day, the knight should divide the coins into two piles (not necessarily equal in size). The day when either magic coins or usual coins are spread equally between the piles, the dragon set the knight free. Can the knight guarantee himself a freedom in at most

(a)  $50$ days?

(b)  $25$ days?
2011 Tournament of Towns
Does there exist a hexagon that can be divided into four congruent triangles by a straight

cut?
2011 Tournament of Towns
Passing through the origin of the coordinate plane are $180$ lines, including the coordinate axes,

which form $1$ degree angles with one another at the origin. Determine the sum of the x-coordinates

of the points of intersection of these lines with the line $y = 100-x$