Olympiad problems

2005 Tournament of Towns, 3

Tags:

There are eight identical Black Queens in the first row of a chessboard and eight identical White Queens in the last row. The Queens move one at a time, horizontally, vertically or diagonally by any number of squares as long as no other Queens are in the way. Black and White Queens move alternately. What is the minimal number of moves required for interchanging the Black and White Queens? [i](5 points)[/i]

2010 AMC 10, 17

Tags:

Every high school in the city of Euclid sent a team of 3 students to a math contest. Each participant in the contest received a different score. Andrea's score was the median among all students, and hers was the highest score on her team. Andrea's teammates Beth and Carla placed 37th and 64th, respectively. How many schools are in the city? $ \textbf{(A)}\ 22\qquad\textbf{(B)}\ 23\qquad\textbf{(C)}\ 24\qquad\textbf{(D)}\ 25\qquad\textbf{(E)}\ 26$

1985 Tournament Of Towns, (082) T3

Find all real solutions of the system of equations $\begin{cases} (x + y) ^3 = z \\ (y + z) ^3 = x \\ ( z+ x) ^3 = y \end{cases} $ (Based on an idea by A . Aho , J. Hop croft , J. Ullman )

2014 JHMMC 7 Contest, 16

Tags: integer , poet s strategy

The sum of two integers is $8$. The sum of the squares of those two integers is $34$. What is the product of the two integers?

1988 IMO Longlists, 88

Tags: geometry

Seven circles are given. That is, there are six circles inside a fixed circle, each tangent to the fixed circle and tangent to the two other adjacent smaller circles. If the points of contact between the six circles and the larger circle are, in order, $A_1, A_2, A_3, A_4, A_5$ and $A_6$ prove that \[ A_1 A_2 \cdot A_3 A_4 \cdot A_5 A_6 = A_2 A_3 \cdot A_4 A_5 \cdot A_6 A_1. \]

2024 Kyiv City MO Round 1, Problem 1

Tags: number theory , algebra , divisibility

Find all pairs of positive integers $(a, b)$ such that $4b - 1$ is divisible by $3a + 1$ and $3a - 1$ is divisible by $2b + 1$.

2025 Kyiv City MO Round 1, Problem 1

Tags: number theory , bruteforce , algebra

Find all three-digit numbers that are $ 5 $ times greater than the product of their digits.

1989 IMO Shortlist, 20

Tags: combinatorics , geometric inequality , combinatorial inequality , point set

Let $ n$ and $ k$ be positive integers and let $ S$ be a set of $ n$ points in the plane such that [b]i.)[/b] no three points of $ S$ are collinear, and [b]ii.)[/b] for every point $ P$ of $ S$ there are at least $ k$ points of $ S$ equidistant from $ P.$ Prove that: \[ k < \frac {1}{2} \plus{} \sqrt {2 \cdot n} \]

2011 AMC 12/AHSME, 25

Tags: geometry , incenter , circumcircle , trigonometry , function , inequalities , calculus

Triangle $ABC$ has $\angle BAC=60^\circ$, $\angle CBA \le 90^\circ$, $BC=1$, and $AC \ge AB$. Let $H$, $I$, and $O$ be the orthocenter, incenter, and circumcenter of $\triangle ABC$, respectively. Assume that the area of the pentagon $BCOIH$ is the maximum possible. What is $\angle CBA$? $\textbf{(A)}\ 60 ^\circ \qquad \textbf{(B)}\ 72 ^\circ\qquad \textbf{(C)}\ 75 ^\circ \qquad \textbf{(D)}\ 80 ^\circ\qquad \textbf{(E)}\ 90 ^\circ$

1979 Polish MO Finals, 2

Tags: geometry , 3d geometry , tetrahedron

Prove that the four lines, joining the vertices of a tetrahedron with the incenters of the opposite faces, have a common point if and only if the three products of the lengths of opposite sides are equal.

1996 Italy TST, 2

Tags: combinatorics , boolean lattice method , set

2. Let $A_1,A_2,...,A_n$be distinct subsets of an n-element set $ X$ ($n \geq 2$). Show that there exists an element $x$ of $X$ such that the sets $A_1\setminus \{x\}$ ,:......., $A_n\setminus \{x\}$ are all distinct.

2013 Stanford Mathematics Tournament, 12

Tags:

Suppose Robin and Eddy walk along a circular path with radius $r$ in the same direction. Robin makes a revolution around the circular path every $3$ minutes and Eddy makes a revolution every minute. Jack stands still at a distance $R>r$ from the center of the circular path. At time $t=0$, Robin and Eddy are at the same point on the path, and Jack, Robin, and Eddy, and the center of the path are collinear. When is the next time the three people (but not necessarily the center of the path) are collinear?

2016 Bundeswettbewerb Mathematik, 3

Tags: perpendicular , chord , geometry , circles

Let $A,B,C$ and $D$ be points on a circle in this order. The chords $AC$ and $BD$ intersect in point $P$. The perpendicular to $AC$ through C and the perpendicular to $BD$ through $D$ intersect in point $Q$. Prove that the lines $AB$ and $PQ$ are perpendicular.

1987 China Team Selection Test, 1

Tags: geometry , rectangle , ratio , analytic geometry , symmetry , hyperbola , conic

Given a convex figure in the Cartesian plane that is symmetric with respect of both axis, we construct a rectangle $A$ inside it with maximum area (over all posible rectangles). Then we enlarge it with center in the center of the rectangle and ratio lamda such that is covers the convex figure. Find the smallest lamda such that it works for all convex figures.

2017 CMIMC Individual Finals, 1

Tags: algebra

Find all real numbers $x$ such that the expression \[\log_2 |1 + \log_2 |2 + \log_2 |x| | |\] does not have a defined value.

Russian TST 2015, P4

Tags: number theory

Let $p \geq 5$ be a prime number. Prove that there exists a positive integer $a < p-1$ such that neither of $a^{p-1}-1$ and $(a+1)^{p-1}-1$ is divisible by $p^{2}$ .

2005 All-Russian Olympiad, 4

Tags: geometry , perimeter , graph theory , combinatorics

A white plane is partitioned onto cells (in a usual way). A finite number of cells are coloured black. Each black cell has an even (0, 2 or 4) adjacent (by the side) white cells. Prove that one may colour each white cell in green or red such that every black cell will have equal number of red and green adjacent cells.

2014 Postal Coaching, 3

Tags: parameterization , combinatorics

Fix positive integers $k$ and $n$.Derive a simple expression involving Fibonacci numbers for the number of sequences $(T_1,T_2,\ldots,T_k)$ of subsets $T_i$ of $[n]$ such that $T_1\subseteq T_2\supseteq T_3\subseteq T_4\supseteq\ldots$. [color=#008000]Moderator says: and the original source for this one is Richard Stanley, [i]Enumerative Combinatorics[/i] vol. 1 (1st edition), exercise 1.15.[/color]

Ukrainian TYM Qualifying - geometry, 2011.5

Tags: geometry , locus , circumcenter , fixed

The circle $\omega_0$ touches the line at point A. Let $R$ be a given positive number. We consider various circles $\omega$ of radius $R$ that touch a line $\ell$ and have two different points in common with the circle $\omega_0$. Let $D$ be the touchpoint of the circle $\omega_0$ with the line $\ell$, and the points of intersection of the circles $\omega$ and $\omega_0$ are denoted by $B$ and $C$ (Assume that the distance from point $B$ to the line $\ell$ is greater than the distance from point $C$ to this line). Find the locus of the centers of the circumscribed circles of all such triangles $ABD$.

1952 Putnam, A6

Tags:

A man has a rectangular block of wood $m$ by $n$ by $r$ inches ($m, n,$ and $r$ are integers). He paints the entire surface of the block, cuts the block into inch cubes, and notices that exactly half the cubes are completely unpainted. Prove that the number of essentially different blocks with this property is finite. (Do [i] not [/i] attempt to enumerate them.)

2005 Iran MO (3rd Round), 5

Tags: induction , prime number , number theory

Let $a,b,c\in \mathbb N$ be such that $a,b\neq c$. Prove that there are infinitely many prime numbers $p$ for which there exists $n\in\mathbb N$ that $p|a^n+b^n-c^n$.

2024 Romania National Olympiad, 4

Tags: finite field , abstract algebra

Let $\mathbb{L}$ be a finite field with $q$ elements. Prove that: a) If $q \equiv 3 \pmod 4$ and $n \ge 2$ is a positive integer divisible by $q-1,$ then $x^n=(x^2+1)^n$ for all $x \in \mathbb{L}^{\times}.$ b) If there exists a positive integer $n \ge 2$ such that $x^n=(x^2+1)^n$ for all $x \in \mathbb{L}^{\times},$ then $q \equiv 3 \pmod 4$ and $q-1$ divides $n.$

1974 Chisinau City MO, 81

Tags: number theory

Determine which number each letter denotes in the equalities $(YX)^Y=BYX$ and $(AA)^H = AHHA$, if different (identical) letters correspond to different (identical) numbers.

1967 IMO, 6

Tags: combinatorics , recurrence relation , system of equations

In a sports meeting a total of $m$ medals were awarded over $n$ days. On the first day one medal and $\frac{1}{7}$ of the remaining medals were awarded. On the second day two medals and $\frac{1}{7}$ of the remaining medals were awarded, and so on. On the last day, the remaining $n$ medals were awarded. How many medals did the meeting last, and what was the total number of medals ?

1993 AIME Problems, 2

Tags: analytic geometry

During a recent campaign for office, a candidate made a tour of a country which we assume lies in a plane. On the first day of the tour he went east, on the second day he went north, on the third day west, on the fourth day south, on the fifth day east, etc. If the candidate went $n^2/2$ miles on the $n^{\text{th}}$ day of this tour, how many miles was he from his starting point at the end of the $40^{\text{th}}$ day?