This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 476

2012 Estonia Team Selection Test, 6
Tags: combinatorics , IMO Shortlist , algorithm , Hi
Let $m$ be a positive integer, and consider a $m\times m$ checkerboard consisting of unit squares. At the centre of some of these unit squares there is an ant. At time $0$, each ant starts moving with speed $1$ parallel to some edge of the checkerboard. When two ants moving in the opposite directions meet, they both turn $90^{\circ}$ clockwise and continue moving with speed $1$. When more than $2$ ants meet, or when two ants moving in perpendicular directions meet, the ants continue moving in the same direction as before they met. When an ant reaches one of the edges of the checkerboard, it falls off and will not re-appear. Considering all possible starting positions, determine the latest possible moment at which the last ant falls off the checkerboard, or prove that such a moment does not necessarily exist. [i]Proposed by Toomas Krips, Estonia[/i]

2007 IMO Shortlist, 3
Tags: geometry , trapezoid , homothety , IMO Shortlist , DDIT , Hi
The diagonals of a trapezoid $ ABCD$ intersect at point $ P$. Point $ Q$ lies between the parallel lines $ BC$ and $ AD$ such that $ \angle AQD \equal{} \angle CQB$, and line $ CD$ separates points $ P$ and $ Q$. Prove that $ \angle BQP \equal{} \angle DAQ$. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

2017 Germany Team Selection Test, 3
Tags: number theory , IMO Shortlist , function , Divisibility , Hi
Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

2015 IMO Shortlist, C2
Tags: IMO 2015 , combinatorics , IMO Shortlist , IMO , Hi , geometrical combinatorics
We say that a finite set $\mathcal{S}$ of points in the plane is [i]balanced[/i] if, for any two different points $A$ and $B$ in $\mathcal{S}$, there is a point $C$ in $\mathcal{S}$ such that $AC=BC$. We say that $\mathcal{S}$ is [i]centre-free[/i] if for any three different points $A$, $B$ and $C$ in $\mathcal{S}$, there is no points $P$ in $\mathcal{S}$ such that $PA=PB=PC$. (a) Show that for all integers $n\ge 3$, there exists a balanced set consisting of $n$ points. (b) Determine all integers $n\ge 3$ for which there exists a balanced centre-free set consisting of $n$ points. Proposed by Netherlands

1984 IMO Longlists, 43
Tags: number theory , equation , Divisibility , power of 2 , IMO , IMO 1984 , Hi
Let $a,b,c,d$ be odd integers such that $0<a<b<c<d$ and $ad=bc$. Prove that if $a+d=2^k$ and $b+c=2^m$ for some integers $k$ and $m$, then $a=1$.

2020 USOMO, 2
Tags: AMC , USA(J)MO , geometry , 3D geometry , Hi
An empty $2020 \times 2020 \times 2020$ cube is given, and a $2020 \times 2020$ grid of square unit cells is drawn on each of its six faces. A [i]beam[/i] is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions: [list=] [*]The two $1 \times 1$ faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are $3 \cdot {2020}^2$ possible positions for a beam.) [*]No two beams have intersecting interiors. [*]The interiors of each of the four $1 \times 2020$ faces of each beam touch either a face of the cube or the interior of the face of another beam. [/list] What is the smallest positive number of beams that can be placed to satisfy these conditions? [i]Proposed by Alex Zhai[/i]

2013 Moldova Team Selection Test, 4
Tags: IMO Shortlist , combinatorics , Extremal combinatorics , Doublecounting , Hi
Let $n \geq 1$ be an integer. What is the maximum number of disjoint pairs of elements of the set $\{ 1,2,\ldots , n \}$ such that the sums of the different pairs are different integers not exceeding $n$?

2007 IMO, 5
Tags: IMO , number theory , Hi
Let $a$ and $b$ be positive integers. Show that if $4ab - 1$ divides $(4a^{2} - 1)^{2}$, then $a = b$. [i]Author: Kevin Buzzard and Edward Crane, United Kingdom [/i]

2020 Brazil Team Selection Test, 1
Tags: combinatorics , binomial coefficients , IMO Shortlist , IMO Shortlist 2019 , trivial , Hi
The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

2017 CCA Math Bonanza, I14
Tags: Hi
Find a pair $\left(x,y\right)$ of positive integers $x<y$ such that $$37^2+46^2+49^2-20^2-17^2=x^2+y^2.$$ Note: there may be several answers; just provide one of them. [i]2017 CCA Math Bonanza Individual Round #14

2023 USAJMO, 3
Tags: rotation , function , AMC , USA(J)MO , USAJMO , combinatorics , Hi
Consider an $n$-by-$n$ board of unit squares for some odd positive integer $n$. We say that a collection $C$ of identical dominoes is a [i]maximal grid-aligned configuration[/i] on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find the maximum value of $k(C)$ as a function of $n$. [i]Proposed by Holden Mui[/i]

2005 Germany Team Selection Test, 2
Tags: geometry , circumcircle , homothety , Triangle , IMO Shortlist , Hi
Let $O$ be the circumcenter of an acute-angled triangle $ABC$ with ${\angle B<\angle C}$. The line $AO$ meets the side $BC$ at $D$. The circumcenters of the triangles $ABD$ and $ACD$ are $E$ and $F$, respectively. Extend the sides $BA$ and $CA$ beyond $A$, and choose on the respective extensions points $G$ and $H$ such that ${AG=AC}$ and ${AH=AB}$. Prove that the quadrilateral $EFGH$ is a rectangle if and only if ${\angle ACB-\angle ABC=60^{\circ }}$. [i]Proposed by Hojoo Lee, Korea[/i]

2020 ELMO Problems, P1
Tags: algebra , functional equation , Hi
Let $\mathbb{N}$ be the set of all positive integers. Find all functions $f : \mathbb{N} \to \mathbb{N}$ such that $$f^{f^{f(x)}(y)}(z)=x+y+z+1$$ for all $x,y,z \in \mathbb{N}$. [i]Proposed by William Wang.[/i]

2007 IMO Shortlist, 2
Tags: modular arithmetic , number theory , Divisibility , IMO Shortlist , Hi
Let $b,n > 1$ be integers. Suppose that for each $k > 1$ there exists an integer $a_k$ such that $b - a^n_k$ is divisible by $k$. Prove that $b = A^n$ for some integer $A$. [i]Author: Dan Brown, Canada[/i]

2012 China Girls Math Olympiad, 8
Tags: AMC , AIME , number theory , Hi
Find the number of integers $k$ in the set $\{0, 1, 2, \dots, 2012\}$ such that $\binom{2012}{k}$ is a multiple of $2012$.

2015 EGMO, 2
Tags: combinatorics , EGMO , dominoes , counting , EGMO 2015 , Hi
A [i]domino[/i] is a $2 \times 1$ or $1 \times 2$ tile. Determine in how many ways exactly $n^2$ dominoes can be placed without overlapping on a $2n \times 2n$ chessboard so that every $2 \times 2$ square contains at least two uncovered unit squares which lie in the same row or column.

2019 EGMO, 2
Tags: combinatorics , EGMO 2019 , Hi
Let $n$ be a positive integer. Dominoes are placed on a $2n \times 2n$ board in such a way that every cell of the board is adjacent to exactly one cell covered by a domino. For each $n$, determine the largest number of dominoes that can be placed in this way. (A domino is a tile of size $2 \times 1$ or $1 \times 2$. Dominoes are placed on the board in such a way that each domino covers exactly two cells of the board, and dominoes do not overlap. Two cells are said to be adjacent if they are different and share a common side.)

2016 Germany Team Selection Test, 2
Tags: IMO Shortlist , functional equation , Hi
Determine all functions $f:\mathbb{Z}\rightarrow\mathbb{Z}$ with the property that \[f(x-f(y))=f(f(x))-f(y)-1\] holds for all $x,y\in\mathbb{Z}$.

2020 Latvia Baltic Way TST, 1
Tags: inequalities , Symmetric inequality , FTW , algebra , Hi
Prove that for positive reals $a,b,c$ satisfying $a+b+c=3$ the following inequality holds: $$ \frac{a}{1+2b^3}+\frac{b}{1+2c^3}+\frac{c}{1+2a^3} \ge 1 $$

2011 India IMO Training Camp, 2
Tags: inequalities , algebra , polynomial , IMO Shortlist , Hi
Let the real numbers $a,b,c,d$ satisfy the relations $a+b+c+d=6$ and $a^2+b^2+c^2+d^2=12.$ Prove that \[36 \leq 4 \left(a^3+b^3+c^3+d^3\right) - \left(a^4+b^4+c^4+d^4 \right) \leq 48.\] [i]Proposed by Nazar Serdyuk, Ukraine[/i]

2021 USAJMO, 5
Tags: number theory , greatest common divisor , AMC , USA(J)MO , USAMO , Hi
A finite set $S$ of positive integers has the property that, for each $s \in S,$ and each positive integer divisor $d$ of $s$, there exists a unique element $t \in S$ satisfying $\text{gcd}(s, t) = d$. (The elements $s$ and $t$ could be equal.) Given this information, find all possible values for the number of elements of $S$.

2010 Contests, 3
Tags: AMC , USA(J)MO , USAMO , inequalities , ceiling function , algebra , Hi
The 2010 positive numbers $a_1, a_2, \ldots , a_{2010}$ satisfy the inequality $a_ia_j \le i+j$ for all distinct indices $i, j$. Determine, with proof, the largest possible value of the product $a_1a_2\ldots a_{2010}$.

2005 Germany Team Selection Test, 2
Tags: inequalities , IMO Shortlist , Hi
If $a$, $b$ ,$c$ are three positive real numbers such that $ab+bc+ca = 1$, prove that \[ \sqrt[3]{ \frac{1}{a} + 6b} + \sqrt[3]{\frac{1}{b} + 6c} + \sqrt[3]{\frac{1}{c} + 6a } \leq \frac{1}{abc}. \]

2014 Belarus Team Selection Test, 3
Tags: number theory , prime divisor , polynomial , IMO Shortlist , imo shortlist n3 , Hi
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

1973 USAMO, 4
Tags: algebra , polynomial , Vieta , inequalities , complex numbers , Hi
Determine all roots, real or complex, of the system of simultaneous equations \begin{align*} x+y+z &= 3, \\ x^2+y^2+z^2 &= 3, \\ x^3+y^3+z^3 &= 3.\end{align*}