Find all pairs of integers $m, n \geq 2$ such that $$n\mid 1+m^{3^n}+m^{2\cdot 3^n}.$$

Kelvin and Quinn are collecting trading cards; there are $6$ distinct cards that could appear in a pack. Each pack contains exactly one card, and each card is equally likely. Kelvin buys packs until he has at least one copy of every card, and then he stops buying packs. If Quinn is missing exactly one card, the probability that Kelvin has at least two copies of the card Quinn is missing is expressible as $\tfrac{m}{n}$ for coprime positive integers $m$ and $n$. Determine $m+n$.

The points $D$ and $E$ on the circumcircle of an acute triangle $ABC$ are such that $AD=AE = BC$. Let $H$ be the common point of the altitudes of triangle $ABC$. It is known that $AH^{2}=BH^{2}+CH^{2}$. Prove that $H$ lies on the segment $DE$. [i]Proposed by D. Shiryaev[/i]

It is known about the triangle $ABC$ that $3 BC = CA + AB$. Let the $A$-symmedian of triangle $ABC$ intersect the circumcircle of triangle $ABC$ at point $D$. Prove that $\frac{1}{BD}+ \frac{1}{CD}= \frac{6}{AD}$. (Ercole Suppa, Italy)

Consider a triangle $ABC$ with $AB = 13, BC = 14, CA = 15$. A line perpendicular to $BC$ divides the interior of $\vartriangle BC$ into two regions of equal area. Suppose that the aforesaid perpendicular cuts $BC$ at $D$, and cuts $\vartriangle ABC$ again at $E$. If $L$ is the length of the line segment $DE$, find $L^2$.

Let $n=2k-1$, where $k\ge 6$ is an integer. Let $T$ be the set of all $n$-tuples $$\textbf{x}=(x_1,x_2,\dots ,x_n), \text{ where, for } i=1,2,\dots ,n, \text{ } x_i \text{ is } 0 \text{ or } 1.$$ For $\textbf{x}=(x_1,x_2,\dots ,x_n)$ and $\textbf{y}=(y_1,y_2,\dots ,y_n)$ in $T$, let $d(\textbf{x},\textbf{y})$ denote the number of integers $j$ with $1\le j\le n$ such that $x_j\neq x_y$. $($In particular, $d(\textbf{x},\textbf{x})=0)$. Suppose that there exists a subset $S$ of $T$ with $2^k$ elements which has the following property: given any element $\textbf{x}$ in $T$, there is a unique $\textbf{y}$ in $S$ with $d(\textbf{x},\textbf{y})\le 3$. Prove that $n=23$.

Determine the largest and smallest fractions $F = \frac{y-x}{x+4y}$ if the real numbers $x$ and $y$ satisfy the equation $x^2y^2 + xy + 1 = 3y^2$.

Prove that the arithmetic mean $a$ of $x_1,\ldots ,x_n$ satisfies \[ (x_1-a)^2+\ldots +(x_n-a)^2\le \frac{1}{2}(|x_1-a|+\ldots +|x_n-a|)^2\]

In the rectangle $ABCD$, $AB = 2BC$. An equilateral triangle $ABE$ is constructed on the side $AB$ of the rectangle so that its sides $AE$ and $BE$ intersect the segment $CD$. Point $M$ is the midpoint of $BE$. Find the $\angle MCD$.

A sequence $\left(a_n\right)$ with $a_1 = 1$ satisfies the following recursion: In the decimal expansion of $a_n$ (without trailing zeros) let $k$ be the smallest digest then $a_{n+1} = a_n + 2^k.$ How many digits does $a_{9 \cdot 10^{2010}}$ have in the decimal expansion?

In a certain country there are $2023$ islands and $2022$ bridges, such that every bridge connects two different islands and any two islands have at most one bridge in common, and from any island, using bridges one can get to any other island. If in any three islands there is an island with bridges connected to each of the other two islands, call these three islands an "island group". We know that any two "island group"s have at least $1$ common island. What is the minimum number of islands with only $1$ bridge connected to it?

Let $m, n \ge 2$ be integers. Carl is given $n$ marked points in the plane and wishes to mark their centroid.* He has no standard compass or straightedge. Instead, he has a device which, given marked points $A$ and $B$, marks the $m-1$ points that divide segment $\overline{AB}$ into $m$ congruent parts (but does not draw the segment). For which pairs $(m,n)$ can Carl necessarily accomplish his task, regardless of which $n$ points he is given? *Here, the [i]centroid[/i] of $n$ points with coordinates $(x_1, y_1), \dots, (x_n, y_n)$ is the point with coordinates $\left( \frac{x_1 + \dots + x_n}{n}, \frac{y_1 + \dots + y_n}{n}\right)$. [i]Proposed by Holden Mui and Carl Schildkraut[/i]

Let $a, b, c$ be nonzero real numbers such that $a + b + c = 0$. Determine the maximum possible value of $\frac{a^2b^2c^2}{ (a^2 + ab + b^2)(b^2 + bc + c^2)(c^2 + ca + a^2)}$ .

Cut the non-equilateral triangle into four similar triangles, among which not all are the same.

Let $ABC$ be an acute, non-isosceles triangle with altitude $AD$ ($D \in BC$), $M$ is the midpoint of $AD$ and $O$ is the circumcenter. Line $AO$ meets $BC$ at $K$ and circle of center $K$, radius $KA$ cuts $AB,AC$ at $E, F$ respectively. Prove that $AO$ bisects $EF$.

Let $P(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_0$ be a polynomial of degree $n\geq 3.$ Knowing that $a_{n-1}=-\binom{n}{1}$ and $a_{n-2}=\binom{n}{2},$ and that all the roots of $P$ are real, find the remaining coefficients. Note that $\binom{n}{r}=\frac{n!}{(n-r)!r!}.$

Describe the region $R$ consisting of the points $(a,b)$ of the cartesian plane for which both (possibly complex) roots of the polynomial $z^2+az+b$ have absolute value smaller than $1$.

Let $D$ be a regular dodecagon in the plane. How many squares are there in the plane at least two vertices in common with the vertices of $D$?

Circles $\omega_1$ and $\omega_2$ have radii $r_1<r_2$ respectively and intersect at distinct points $X$ and $Y$. The common external tangents intersect at point $Z$. The common tangent closer to $X$ touches $\omega_1$ and $\omega_2$ at $P$ and $Q$ respectively. Line $ZX$ intersects $\omega_1$ and $\omega_2$ again at points $R$ and $S$ and lines $RP$ and $SQ$ intersect again at point $T$. If $XT=8$, $XZ=15$, and $XY=12$, then what is $\tfrac{r_1}{r_2}$?

Let $L$ be the common point of the symmedians of triangle $ABC$, and $BH$ be its altitude. It is known that $\angle ALH = 180^o -2\angle A$. Prove that $\angle CLH = 180^o - 2\angle C$.

Let $n > 2$ be an integer and let $m = \sum k^3$, where the sum is taken over all integers $k$ with $1 \leq k < n$ that are relatively prime to $n$. Prove that $n$ divides $m$.

In a football tournament of one round (each team plays each other once, $2$ points for win , $1$ point for draw and $0$ points for loss), $28$ teams compete. During the tournament more than $75\%$ of the matches finished in a draw . Prove that there were two teams who finished with the same number of points. (M . Vora, gymnasium student , Hungary)

We define $\mathbb F_{101}[x]$ as the set of all polynomials in $x$ with coefficients in $\mathbb F_{101}$ (the integers modulo $101$ with usual addition and subtraction), so that two polynomials are equal if and only if the coefficients of $x^k$ are equal in $\mathbb F_{101}$ for each nonnegative integer $k$. For example, $(x+3)(100x+5)=100x^2+2x+15$ in $\mathbb F_{101}[x]$ because the corresponding coefficients are equal modulo $101$. We say that $f(x)\in\mathbb F_{101}[x]$ is \emph{lucky} if it has degree at most $1000$ and there exist $g(x),h(x)\in\mathbb F_{101}[x]$ such that \[f(x)=g(x)(x^{1001}-1)+h(x)^{101}-h(x)\] in $\mathbb F_{101}[x]$. Find the number of lucky polynomials. [i]Proposed by Michael Ren.[/i]

Find all positive integers $ n$ having the following properties:in two-dimensional Cartesian coordinates, there exists a convex $ n$ lattice polygon whose lengths of all sides are odd numbers, and unequal to each other. (where lattice polygon is defined as polygon whose coordinates of all vertices are integers in Cartesian coordinates.)

Let $ I,O $ denote the incenter, respectively, the circumcenter of a triangle $ ABC. $ The $ A\text{-excircle} $ touches the lines $ AB,AC,BC $ at $ K,L, $ respectively, $ M. $ The midpoint of $ KL $ lies on the circumcircle of $ ABC. $ Show that the points $ I,M,O $ are collinear. [i]Павел Кожевников[/i]