Olympiad problems

1997 Tournament Of Towns, (552) 2

$M$ is the midpoint of the side $BC$ of a triangle $ABC$. Construct a line $\ell$ intersecting the triangle and parallel to $BC$ such that the segment of $\ell$ between the sides $AB$ and $AC$ is the hypotenuse of a right-angled triangle with $M$ being its third vertex. (Folklore)

2012 India IMO Training Camp, 1

Tags: geometry , incenter , symmetry , reflection , IMO Shortlist

Let $ABC$ be a triangle with $AB=AC$ and let $D$ be the midpoint of $AC$. The angle bisector of $\angle BAC$ intersects the circle through $D,B$ and $C$ at the point $E$ inside the triangle $ABC$. The line $BD$ intersects the circle through $A,E$ and $B$ in two points $B$ and $F$. The lines $AF$ and $BE$ meet at a point $I$, and the lines $CI$ and $BD$ meet at a point $K$. Show that $I$ is the incentre of triangle $KAB$. [i]Proposed by Jan Vonk, Belgium and Hojoo Lee, South Korea[/i]

2019 MMATHS, 2

Tags: MMATHS , geometry

In the trapezoid $ABCD$, both $\angle B$ and $\angle C$ are right angles, and all four sides of the trapezoid are tangent to the same circle. If $\overline{AB} = x$ and $\overline{CD} = y$, find the area of $ABCD$ (with proof).

1987 Bundeswettbewerb Mathematik, 2

Tags: combinatorics , Subset , cardinality , number

Let $n$ be a positive integer and $M=\{1,2,\ldots, n\}.$ A subset $T\subset M$ is called [i]heavy[/i] if each of its elements is greater or equal than $|T|.$ Let $f(n)$ denote the number of heavy subsets of $M.$ Describe a method for finding $f(n)$ and use it to calculate $f(32).$

2019 JBMO Shortlist, N1

Tags: number theory , Junior , JBMO , Balkan , 2019 , prime numbers

Find all prime numbers $p$ for which there exist positive integers $x$, $y$, and $z$ such that the number $x^p + y^p + z^p - x - y - z$ is a product of exactly three distinct prime numbers.

2023 Moldova EGMO TST, 8

Tags: combinatorics

Prove that the number $1$ can be written as a sum of $2023$ fractions of the form $\frac{1}{k_i}$, where all nonnegative integers $k_i (1\leq i\leq 2023)$ are distinct.

2012 NIMO Problems, 1

Tags:

Hexagon $ABCDEF$ is inscribed in a circle. If $\measuredangle ACE = 35^{\circ}$ and $\measuredangle CEA = 55^{\circ}$, then compute the sum of the degree measures of $\angle ABC$ and $\angle EFA$. [i]Proposed by Isabella Grabski[/i]

1992 IMO Shortlist, 7

Tags: geometry , incenter , angle bisector , circles , IMO Shortlist , IMO Longlist , Casey s theorem

Two circles $ \Omega_{1}$ and $ \Omega_{2}$ are externally tangent to each other at a point $ I$, and both of these circles are tangent to a third circle $ \Omega$ which encloses the two circles $ \Omega_{1}$ and $ \Omega_{2}$. The common tangent to the two circles $ \Omega_{1}$ and $ \Omega_{2}$ at the point $ I$ meets the circle $ \Omega$ at a point $ A$. One common tangent to the circles $ \Omega_{1}$ and $ \Omega_{2}$ which doesn't pass through $ I$ meets the circle $ \Omega$ at the points $ B$ and $ C$ such that the points $ A$ and $ I$ lie on the same side of the line $ BC$. Prove that the point $ I$ is the incenter of triangle $ ABC$. [i]Alternative formulation.[/i] Two circles touch externally at a point $ I$. The two circles lie inside a large circle and both touch it. The chord $ BC$ of the large circle touches both smaller circles (not at $ I$). The common tangent to the two smaller circles at the point $ I$ meets the large circle at a point $ A$, where the points $ A$ and $ I$ are on the same side of the chord $ BC$. Show that the point $ I$ is the incenter of triangle $ ABC$.

2012 May Olympiad, 2

Tags: inequalities , rotation , geometry , geometric transformation

The vertices of two regular octagons are numbered from $1$ to $8$, in some order, which may vary between both octagons (each octagon must have all numbers from $1$ to $8$). After this, one octagon is placed on top of the other so that every vertex from one octagon touches a vertex from the other. Then, the numbers of the vertices which are in contact are multiplied (i.e., if vertex $A$ has a number $x$ and is on top of vertex $A'$ that has a number $y$, then $x$ and $y$ are multiplied), and the $8$ products are then added. Prove that, for any order in which the vertices may have been numbered, it is always possible to place one octagon on top of the other so that the final sum is at least $162$. Note: the octagons can be rotated.

2007 Princeton University Math Competition, 1

Tags:

If $g \square K$ is defined as $gK+g^2$ and $g \diamondsuit K$ is defined as $g+3K$, what is $(2 \square 3)(3 \diamondsuit 2)$?

2024 Princeton University Math Competition, A4 / B6

Tags: algebra

Compute the number of solutions to $1+\cos(\theta)+\cos(2\theta)+\ldots+\cos(2024\theta) = \tfrac{1}{2}$ for $\theta \in [0,2\pi].$

2022 HMNT, 6

Tags: geometry

A regular octagon is inscribed in a circle of radius 2. Alice and Bob play a game in which they take turns claiming vertices of the octagon, with Alice going first. A player wins as soon as they have selected three points that form a right angle. If all points are selected without either player winning, the game ends in a draw. Given that both players play optimally, find all positive areas of the convex polygon formed by Alice's points at the end of the game.

2007 Junior Balkan MO, 3

Tags: combinatorics proposed , combinatorics , combinatorial geometry , Hi

Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.

2020 CMIMC Team, 3

Tags: team , 2020

Let $ABC$ be a triangle with centroid $G$ and $BC = 3$. If $ABC$ is similar to $GAB$, compute the area of $ABC$.

2006 Belarusian National Olympiad, 6

Tags: combinatorics , table , Sum , max

An $n \times m$ table ( $n \le m$ ) is filled in accordance with the rules of the game "Minesweeper": mines are placed at some cells (not more than one mine at the cell) and in the remaining cells one writes the number of the mines in the neighboring (by side or by vertex) cells. Then the sum of allnumbers in the table is computed (this sum is equal to $9$ for the picture). What is the largest possible value of this sum? (V. Lebed) [img]https://cdn.artofproblemsolving.com/attachments/2/9/726ccdbc57807788a5f6e88a5acb42b10a6cc0.png[/img]

2009 Romania Team Selection Test, 3

Tags: function , complex analysis , trigonometry , inequalities , floor function , complex numbers , algebra proposed

Given an integer $n\geq 2$ and a closed unit disc, evaluate the maximum of the product of the lengths of all $\frac{n(n-1)}{2}$ segments determined by $n$ points in that disc.

2015 ELMO Problems, 5

Tags: Elmo , combinatorics

Let $m, n, k > 1$ be positive integers. For a set $S$ of positive integers, define $S(i,j)$ for $i<j$ to be the number of elements in $S$ strictly between $i$ and $j$. We say two sets $(X,Y)$ are a [i]fat[/i] pair if \[ X(i,j)\equiv Y(i,j) \pmod{n} \] for every $i,j \in X \cap Y$. (In particular, if $\left\lvert X \cap Y \right\rvert < 2$ then $(X,Y)$ is fat.) If there are $m$ distinct sets of $k$ positive integers such that no two form a fat pair, show that $m<n^{k-1}$. [i]Proposed by Allen Liu[/i]

2015 Purple Comet Problems, 11

Tags: Purple Comet

Suppose that the vertices of a polygon all lie on a rectangular lattice of points where adjacent points on the lattice are a distance 1 apart. Then the area of the polygon can be found using Pick’s Formula: $I + \frac{B}{2}$ −1, where I is the number of lattice points inside the polygon, and B is the number of lattice points on the boundary of the polygon. Pat applied Pick’s Formula to ﬁnd the area of a polygon but mistakenly interchanged the values of I and B. As a result, Pat’s calculation of the area was too small by 35. Using the correct values for I and B, the ratio n = $\frac{I}{B}$ is an integer. Find the greatest possible value of n.

2023 Harvard-MIT Mathematics Tournament, 9

Tags: geometry

Point $Y$ lies on line segment $XZ$ such that $XY = 5$ and $Y Z = 3$. Point $G$ lies on line $XZ$ such that there exists a triangle $ABC$ with centroid $G$ such that $X$ lies on line $BC$, $Y$ lies on line $AC$, and $Z$ lies on line $AB$. Compute the largest possible value of $XG$.

LMT Speed Rounds, 2016.13

Tags:

Find the area enclosed by the graph of $|x|+|2y|=12$. [i]Proposed by Nathan Ramesh

2010 Federal Competition For Advanced Students, P2, 1

Tags: algebra , inequalities

Show that $\frac{(x - y)^7 + (y - z)^7 + (z - x)^7 - (x - y)(y - z)(z - x) ((x - y)^4 + (y - z)^4 + (z - x)^4)} {(x - y)^5 + (y - z)^5 + (z - x)^5} \ge 3$ holds for all triples of distinct integers $x, y, z$. When does equality hold?

1975 Chisinau City MO, 93

Tags: algebra

Prove that $(a^2 + b^2 + c^2)^ 2 = 2 (a^4 + b^4 + c^4)$ if $a + b + c = 0$.

2016 District Olympiad, 3

Tags: inequalities

Let be nonnegative real numbers $ a,b,c, $ holding the inequality: $ \sum_{\text{cyc}} \frac{a}{b+c+1} \le 1. $ Prove that $ \sum_{\text{cyc}} \frac{1}{b+c+1} \ge 1. $

1985 AMC 8, 1

Tags:

$ \frac{3 \times 5}{9 \times 11} \times \frac{7 \times 9 \times 11}{3 \times 5 \times 7}\equal{}$ \[ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 0 \qquad \textbf{(C)}\ 49 \qquad \textbf{(D)}\ \frac{1}{49} \qquad \textbf{(E)}\ 50 \]

2005 All-Russian Olympiad Regional Round, 8.2

Tags: combinatorics , game , game strategy

In the middle cell of the $1 \times 2005$ strip there is a chip. Two players each queues move it: first, the first player moves the piece one cell in any direction, then the second one moves it $2$ cells, the $1$st - by $4$ cells, the 2nd by $8$, etc. (the $k$-th shift occurs by $2^{k-1}$ cells). That, whoever cannot make another move loses. Who can win regardless of the opponent's play?