Found problems: 85335
2013 IMAC Arhimede, 2
For all positive integer $n$, we consider the number $$a_n =4^{6^n}+1943$$ Prove that $a_n$ is dividible by $2013$ for all $n\ge 1$, and find all values of $n$ for which $a_n - 207$ is the cube of a positive integer.
2007 Croatia Team Selection Test, 5
Let there be two circles. Find all points $M$ such that there exist two points, one on each circle such that $M$ is their midpoint.
2018 Belarusian National Olympiad, 10.8
The vertices of the regular $n$-gon and its center are marked. Two players play the following game: they, in turn, select a vertex and connect it by a segment to either the adjacent vertex or the center. The winner I a player if after his maveit is possible to get any marked point from any other moving along the segments. For each $n>2$ determine who has a winning strategy.
1989 Federal Competition For Advanced Students, 2
If $ a$ and $ b$ are nonnegative real numbers with $ a^2\plus{}b^2\equal{}4$, show that: $ \frac{ab}{a\plus{}b\plus{}2} \le \sqrt{2}\minus{}1$ and determine when equality occurs.
1998 Tournament Of Towns, 6
(a) Two people perform a card trick. The first performer takes $5$ cards from a $52$-card deck (previously shuffled by a member of the audience) , looks at them, and arranges them in a row from left to right: one face down (not necessarily the first one) , the others face up . The second performer guesses correctly the card which is face down. Prove that the performers can agree on a system which always makes this possible.
(b) For their second trick, the first performer arranges four cards in a row, face up, the fifth card is kept hidden. Can they still agree on a system which enables the second performer to correctly guess the hidden card?
(G Galperin)
2008 Junior Balkan Team Selection Tests - Romania, 5
Let $ n$ be an integer, $ n\geq 2$, and the integers $ a_1,a_2,\ldots,a_n$, such that $ 0 < a_k\leq k$, for all $ k \equal{} 1,2,\ldots,n$. Knowing that the number $ a_1 \plus{} a_2 \plus{} \cdots \plus{} a_n$ is even, prove that there exists a choosing of the signs $ \plus{}$, respectively $ \minus{}$, such that
\[ a_1 \pm a_2 \pm \cdots \pm a_n\equal{} 0.
\]
2017 Miklós Schweitzer, 2
Prove that a field $K$ can be ordered if and only if every $A\in M_n(K)$ symmetric matrix can be diagonalized over the algebraic closure of $K$. (In other words, for all $n\in\mathbb{N}$ and all $A\in M_n(K)$, there exists an $S\in GL_n(\overline{K})$ for which $S^{-1}AS$ is diagonal.)
2009 Jozsef Wildt International Math Competition, W. 30
Prove that $$\sum \limits_{0\leq i<j\leq n}(i+j) {{n}\choose{i}}{{n}\choose{j}}=n\left (2^{2n-1}-{{2n-1}\choose{n}} \right )$$
2014 JHMMC 7 Contest, 26
Alex is training to make $\text{MOP}$. Currently he will score a $0$ on $\text{the AMC,}\text{ the AIME,}\text{and the USAMO}$. He can expend $3$ units of effort to gain $6$ points on the $\text{AMC}$, $7$ units of effort to gain $10$ points on the $\text{AIME}$, and $10$ units of effort to gain $1$ point on the $\text{USAMO}$. He will need to get at least $200$ points on $\text{the AMC}$ and $\text{AIME}$ combined and get at least $21$ points on $\text{the USAMO}$ to make $\text{MOP}$. What is the minimum amount of effort he can expend to make $\text{MOP}$?
2002 China Team Selection Test, 1
Find all natural numbers $n (n \geq 2)$ such that there exists reals $a_1, a_2, \dots, a_n$ which satisfy \[ \{ |a_i - a_j| \mid 1\leq i<j \leq n\} = \left\{1,2,\dots,\frac{n(n-1)}{2}\right\}. \]
Let $A=\{1,2,3,4,5,6\}, B=\{7,8,9,\dots,n\}$. $A_i(i=1,2,\dots,20)$ contains eight numbers, three of which are chosen from $A$ and the other five numbers from $B$. $|A_i \cap A_j|\leq 2, 1\leq i<j\leq 20$. Find the minimum possible value of $n$.
1999 Harvard-MIT Mathematics Tournament, 2
For what single digit $n$ does $91$ divide the $9$-digit number $12345n789$?
1999 Mongolian Mathematical Olympiad, Problem 6
Let $f$ be a map of the plane into itself with the property that if $d(A,B)=1$, then $d(f(A),f(B))=1$, where $d(X,Y)$ denotes the distance between points $X$ and $Y$. Prove that for any positive integer $n$, $d(A,B)=n$ implies $d(f(A),f(B))=n$.
2016 Regional Olympiad of Mexico West, 3
A circle $\omega$ with center $O$ and radius $r$ is constructed. A point $P$ is chosen on the circumference $\omega$ and a point A is taken inside it, such that is outside the line that passes through $P$ and $O$. Point $B$ is constructed, the reflection of $A$ wrt $O$. and $P'$ is another point on the circumference such that the chord $PP'$ is perpendicular to $PA$. Let $Q$ be the point on the line $PP'$ that minimizes the sum of distances from $A$ to $Q$ and from $Q$ to $B$. Show that the value of the sum of the lengths $AQ+QB$ does not depend on the choice of points $P$ or $A$
2022 Thailand TST, 2
Let $ABCD$ be a quadrilateral inscribed in a circle $\Omega.$ Let the tangent to $\Omega$ at $D$ meet rays $BA$ and $BC$ at $E$ and $F,$ respectively. A point $T$ is chosen inside $\triangle ABC$ so that $\overline{TE}\parallel\overline{CD}$ and $\overline{TF}\parallel\overline{AD}.$ Let $K\ne D$ be a point on segment $DF$ satisfying $TD=TK.$ Prove that lines $AC,DT,$ and $BK$ are concurrent.
Kyiv City MO 1984-93 - geometry, 1989.9.1
The perimeter of the triangle $ABC$ is equal to $2p$, the length of the side$ AC$ is equal to $b$, the angle $ABC$ is equal to $\beta$. A circle with center at point $O$, inscribed in this triangle, touches the side $BC$ at point $K$. Calculate the area of the triangle $BOK$.
2001 Estonia National Olympiad, 2
Find the minimum value of $n$ such that, among any $n$ integers, there are three whose sum is divisible by $3$.
2009 Princeton University Math Competition, 6
Consider the solid with 4 triangles and 4 regular hexagons as faces, where each triangle borders 3 hexagons, and all the sides are of length 1. Compute the [i]square[/i] of the volume of the solid. Express your result in reduced fraction and concatenate the numerator with the denominator (e.g., if you think that the square is $\frac{1734}{274}$, then you would submit 1734274).
2019 NMTC Junior, 8
A circular disc is divided into $12$ equal sectors and one of $6$ different colours is used to colour each sector. No two adjacent sectors can have the same colour. Find the number of such distinct colorings possible.
2001 JBMO ShortLists, 8
Prove that no three points with integer coordinates can be the vertices of an equilateral triangle.
2016 Macedonia JBMO TST, 1
Solve the following equation in the set of integers
$x_{1}^4 + x_{2}^4 +...+ x_{14}^4=2016^3 - 1$.
2013 Stanford Mathematics Tournament, 10
A unit circle is centered at the origin and a tangent line to the circle is constructed in the first quadrant such that it makes an angle $5\pi/6$ with the $y$-axis. A series of circles centered on the $x$-axis are constructed such that each circle is both tangent to the previous circle and the original tangent line. Find the total area of the series of circles.
2021 Brazil National Olympiad, 3
Find all positive integers \(k\) for which there is an irrational \(\alpha>1\) and a positive integer \(N\) such that \(\left\lfloor\alpha^{n}\right\rfloor\) is a perfect square minus \(k\) for every integer \(n\) with \(n>N\).
2009 AMC 12/AHSME, 23
A region $ S$ in the complex plane is defined by \[ S \equal{} \{x \plus{} iy: \minus{} 1\le x\le1, \minus{} 1\le y\le1\}.\] A complex number $ z \equal{} x \plus{} iy$ is chosen uniformly at random from $ S$. What is the probability that $ \left(\frac34 \plus{} \frac34i\right)z$ is also in $ S$?
$ \textbf{(A)}\ \frac12\qquad \textbf{(B)}\ \frac23\qquad \textbf{(C)}\ \frac34\qquad \textbf{(D)}\ \frac79\qquad \textbf{(E)}\ \frac78$
2012 Indonesia TST, 2
An $m \times n$ chessboard where $m \le n$ has several black squares such that no two rows have the same pattern. Determine the largest integer $k$ such that we can always color $k$ columns red while still no two rows have the same pattern.
2011 Puerto Rico Team Selection Test, 1
The product of 22 integers is 1. Show that their sum can not be 0.