Found problems: 275
2010 Danube Mathematical Olympiad, 1
Determine all integer numbers $n\ge 3$ such that the regular $n$-gon can be decomposed into isosceles triangles by non-intersecting diagonals.
2012 Balkan MO, 4
Let $\mathbb{Z}^+$ be the set of positive integers. Find all functions $f:\mathbb{Z}^+ \rightarrow\mathbb{Z}^+$ such that the following conditions both hold:
(i) $f(n!)=f(n)!$ for every positive integer $n$,
(ii) $m-n$ divides $f(m)-f(n)$ whenever $m$ and $n$ are different positive integers.
1993 Balkan MO, 1
Let $a,b,c,d,e,f$ be six real numbers with sum 10, such that \[ (a-1)^2+(b-1)^2+(c-1)^2+(d-1)^2+(e-1)^2+(f-1)^2 = 6. \] Find the maximum possible value of $f$.
[i]Cyprus[/i]
1983 USAMO, 4
Six segments $S_1, S_2, S_3, S_4, S_5,$ and $S_6$ are given in a plane. These are congruent to the edges $AB, AC, AD, BC, BD,$ and $CD$, respectively, of a tetrahedron $ABCD$. Show how to construct a segment congruent to the altitude of the tetrahedron from vertex $A$ with straight-edge and compasses.
1975 Canada National Olympiad, 5
$ A,B,C,D$ are four "consecutive" points on the circumference of a circle and $ P, Q, R, S$ are points on the circumference which are respectively the midpoints of the arcs $ AB,BC,CD,DA$. Prove that $ PR$ is perpendicular to $ QS$.
2025 USAJMO, 3
Let $m$ and $n$ be positive integers, and let $\mathcal R$ be a $2m\times{2n}$ grid of unit squares.
A [i]domino[/i] is a $1\times2{}$ or $2\times{1}$ rectangle. A subset $S$ of grid squares in $\mathcal R$ is [i]domino-tileable[/i] if dominoes can be placed to cover every square of $S$ exactly once with no domino extending outside of $S$. [i]Note[/i]: The empty set is domino tileable.
An [i]up-right path[/i] is a path from the lower-left corner of $\mathcal R$ to the upper-right corner of $\mathcal R$ formed by exactly $2m+2n$ edges of the grid squares.
Determine, with proof, in terms of $m$ and $n$, the number of up-right paths that divide $\mathcal R$ into two domino-tileable subsets.
2021 USAMO, 3
Let $n \geq 2$ be an integer. An $n \times n$ board is initially empty. Each minute, you may perform one of three moves:
[list]
[*] If there is an L-shaped tromino region of three cells without stones on the board (see figure; rotations not allowed), you may place a stone in each of those cells.
[*] If all cells in a column have a stone, you may remove all stones from that column.
[*] If all cells in a row have a stone, you may remove all stones from that row.
[/list]
[asy]
unitsize(20);
draw((0,0)--(4,0)--(4,4)--(0,4)--(0,0));
fill((0.2,3.8)--(1.8,3.8)--(1.8, 1.8)--(3.8, 1.8)--(3.8, 0.2)--(0.2, 0.2)--cycle, grey);
draw((0.2,3.8)--(1.8,3.8)--(1.8, 1.8)--(3.8, 1.8)--(3.8, 0.2)--(0.2, 0.2)--(0.2, 3.8), linewidth(2));
draw((0,2)--(4,2));
draw((2,4)--(2,0));
[/asy]
For which $n$ is it possible that, after some non-zero number of moves, the board has no stones?
2025 USAMO, 2
Let $n$ and $k$ be positive integers with $k<n$. Let $P(x)$ be a polynomial of degree $n$ with real coefficients, nonzero constant term, and no repeated roots. Suppose that for any real numbers $a_0,\,a_1,\,\ldots,\,a_k$ such that the polynomial $a_kx^k+\cdots+a_1x+a_0$ divides $P(x)$, the product $a_0a_1\cdots a_k$ is zero. Prove that $P(x)$ has a nonreal root.
2023 USAJMO, 6
Isosceles triangle $ABC$, with $AB=AC$, is inscribed in circle $\omega$. Let $D$ be an arbitrary point inside $BC$ such that $BD\neq DC$. Ray $AD$ intersects $\omega$ again at $E$ (other than $A$). Point $F$ (other than $E$) is chosen on $\omega$ such that $\angle DFE = 90^\circ$. Line $FE$ intersects rays $AB$ and $AC$ at points $X$ and $Y$, respectively. Prove that $\angle XDE = \angle EDY$.
[i]Proposed by Anton Trygub[/i]
2017 USAJMO, 6
Let $P_1$, $P_2$, $\dots$, $P_{2n}$ be $2n$ distinct points on the unit circle $x^2+y^2=1$, other than $(1,0)$. Each point is colored either red or blue, with exactly $n$ red points and $n$ blue points. Let $R_1$, $R_2$, $\dots$, $R_n$ be any ordering of the red points. Let $B_1$ be the nearest blue point to $R_1$ traveling counterclockwise around the circle starting from $R_1$. Then let $B_2$ be the nearest of the remaining blue points to $R_2$ travelling counterclockwise around the circle from $R_2$, and so on, until we have labeled all of the blue points $B_1, \dots, B_n$. Show that the number of counterclockwise arcs of the form $R_i \to B_i$ that contain the point $(1,0)$ is independent of the way we chose the ordering $R_1, \dots, R_n$ of the red points.
2012 USAMO, 5
Let $P$ be a point in the plane of $\triangle ABC$, and $\gamma$ a line passing through $P$. Let $A', B', C'$ be the points where the reflections of lines $PA, PB, PC$ with respect to $\gamma$ intersect lines $BC, AC, AB$ respectively. Prove that $A', B', C'$ are collinear.
2015 USAMO, 4
Steve is piling $m\geq 1$ indistinguishable stones on the squares of an $n\times n$ grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in some manner, he can then perform [i]stone moves[/i], defined as follows. Consider any four grid squares, which are corners of a rectangle, i.e. in positions $(i, k), (i, l), (j, k), (j, l)$ for some $1\leq i, j, k, l\leq n$, such that $i<j$ and $k<l$. A stone move consists of either removing one stone from each of $(i, k)$ and $(j, l)$ and moving them to $(i, l)$ and $(j, k)$ respectively, or removing one stone from each of $(i, l)$ and $(j, k)$ and moving them to $(i, k)$ and $(j, l)$ respectively.
Two ways of piling the stones are equivalent if they can be obtained from one another by a sequence of stone moves.
How many different non-equivalent ways can Steve pile the stones on the grid?
2024 USAJMO, 3
Let $a(n)$ be the sequence defined by $a(1)=2$ and $a(n+1)=(a(n))^{n+1}-1$ for each integer $n\geq 1$. Suppose that $p>2$ is a prime and $k$ is a positive integer. Prove that some term of the sequence $a(n)$ is divisible by $p^k$.
[i]Proposed by John Berman[/i]
2010 Contests, 1
Let $AXYZB$ be a convex pentagon inscribed in a semicircle of diameter $AB$. Denote by $P$, $Q$, $R$, $S$ the feet of the perpendiculars from $Y$ onto lines $AX$, $BX$, $AZ$, $BZ$, respectively. Prove that the acute angle formed by lines $PQ$ and $RS$ is half the size of $\angle XOZ$, where $O$ is the midpoint of segment $AB$.
2019 USAJMO, 1
There are $a+b$ bowls arranged in a row, numbered $1$ through $a+b$, where $a$ and $b$ are given positive integers. Initially, each of the first $a$ bowls contains an apple, and each of the last $b$ bowls contains a pear.
A legal move consists of moving an apple from bowl $i$ to bowl $i+1$ and a pear from bowl $j$ to bowl $j-1$, provided that the difference $i-j$ is even. We permit multiple fruits in the same bowl at the same time. The goal is to end up with the first $b$ bowls each containing a pear and the last $a$ bowls each containing an apple. Show that this is possible if and only if the product $ab$ is even.
2001 USAMO, 1
Each of eight boxes contains six balls. Each ball has been colored with one of $n$ colors, such that no two balls in the same box are the same color, and no two colors occur together in more than one box. Determine, with justification, the smallest integer $n$ for which this is possible.
1986 USAMO, 2
During a certain lecture, each of five mathematicians fell asleep exactly twice. For each pair of mathematicians, there was some moment when both were asleep simultaneously. Prove that, at some moment, three of them were sleeping simultaneously.
2007 USAMO, 5
Prove that for every nonnegative integer $n$, the number $7^{7^{n}}+1$ is the product of at least $2n+3$ (not necessarily distinct) primes.
2003 USAMO, 1
Prove that for every positive integer $n$ there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.
1988 USAMO, 2
The cubic equation $x^3 + ax^2 + bx + c = 0$ has three real roots. Show that $a^2-3b\geq 0$, and that $\sqrt{a^2-3b}$ is less than or equal to the difference between the largest and smallest roots.
2024 USAMO, 6
Let $n > 2$ be an integer and let $\ell \in \{1, 2,\dots, n\}$. A collection $A_1,\dots,A_k$ of (not necessarily distinct) subsets of $\{1, 2,\dots, n\}$ is called $\ell$-large if $|A_i| \ge \ell$ for all $1 \le i \le k$. Find, in terms of $n$ and $\ell$, the largest real number $c$ such that the inequality
\[ \sum_{i=1}^k\sum_{j=1}^k x_ix_j\frac{|A_i\cap A_j|^2}{|A_i|\cdot|A_j|}\ge c\left(\sum_{i=1}^k x_i\right)^2 \]
holds for all positive integer $k$, all nonnegative real numbers $x_1,x_2,\dots,x_k$, and all $\ell$-large collections $A_1,A_2,\dots,A_k$ of subsets of $\{1,2,\dots,n\}$.
[i]Proposed by Titu Andreescu and Gabriel Dospinescu[/i]
2014 India IMO Training Camp, 2
Let $n$ be a natural number.A triangulation of a convex n-gon is a division of the polygon into $n-2$ triangles by drawing $n-3$ diagonals no two of which intersect at an interior point of the polygon.Let $f(n)$ denote the number of triangulations of a regular n-gon such that each of the triangles formed is isosceles.Determine $f(n)$ in terms of $n$.
2009 India IMO Training Camp, 3
Let $ a,b$ be two distinct odd natural numbers.Define a Sequence $ { < a_n > }_{n\ge 0}$ like following:
$ a_1 \equal{} a \\
a_2 \equal{} b \\
a_n \equal{} \text{largest odd divisor of }(a_{n \minus{} 1} \plus{} a_{n \minus{} 2})$.
Prove that there exists a natural number $ N$ such that $ a_n \equal{} gcd(a,b) \forall n\ge N$.
1984 USAMO, 2
The geometric mean of any set of $m$ non-negative numbers is the $m$-th root of their product.
$\quad (\text{i})\quad$ For which positive integers $n$ is there a finite set $S_n$ of $n$ distinct positive integers such that the geometric mean of any subset of $S_n$ is an integer?
$\quad (\text{ii})\quad$ Is there an infinite set $S$ of distinct positive integers such that the geometric mean of any finite subset of $S$ is an integer?
2012 USAMO, 1
Find all integers $n \geq 3$ such that among any $n$ positive real numbers $a_1, a_2, \hdots, a_n$ with $\text{max}(a_1,a_2,\hdots,a_n) \leq n \cdot \text{min}(a_1,a_2,\hdots,a_n)$, there exist three that are the side lengths of an acute triangle.