Compute the number of two-digit numbers $\overline{ab}$ with nonzero digits $a$ and $b$ such that $a$ and $b$ are both factors of $\overline{ab}$. [i]Proposed by Nathan Xiong[/i]

Evaluate \[ \frac{1}{729} \sum_{a=1}^{9} \sum_{b=1}^9 \sum_{c=1}^9 \left( abc+ab+bc+ca+a+b+c \right). \][i]Proposed by Evan Chen[/i]

Let $ABC$ be a triangle with incenter $I$, and whose incircle is tangent to $\overline{BC}$, $\overline{CA}$, $\overline{AB}$ at $D$, $E$, $F$, respectively. Let $K$ be the foot of the altitude from $D$ to $\overline{EF}$. Suppose that the circumcircle of $\triangle AIB$ meets the incircle at two distinct points $C_1$ and $C_2$, while the circumcircle of $\triangle AIC$ meets the incircle at two distinct points $B_1$ and $B_2$. Prove that the radical axis of the circumcircles of $\triangle BB_1B_2$ and $\triangle CC_1C_2$ passes through the midpoint $M$ of $\overline{DK}$. [i]Proposed by Danielle Wang[/i]

Let $ABC$ be an acute-angled triangle inscribed in circle $(O)$. Let $G$ be a point on the small arc $AC$ of $(O)$ and $(K)$ be a circle passing through $A$ and $G$. Bisector of $\angle BAC$ cuts $(K)$ again at $P$. The point $E$ is chosen on $(K)$ such that $AE$ is parallel to $BC$. The line $PK$ meets the perpendicular bisector of $BC$ at $F$. Prove that $\angle EGF = 90^o$.

[list] (a) Consider an ellipse in the plane. Prove that there exists a Riemannian metric which is defined on the whole plane, and with respect to which the ellipse is a geodesic. Prove that the Gaussian curvature of any such Riemannian metric takes a positive value. (b) Consider two nonintersecting, simple closed smooth curves in the plane. Prove that if there is a Riemmanian metric defined on the whole plane and the two curves are geodesics of that metric, then the Gaussian curvature of the metric vanishes somewhere. [/list] [i]Proposed by Tran Quoc Binh[/i]

Let $N$ be the number of ways to place $4$ bishops on a $5 \times 5$ chessboard such that no $3$ are on the same diagonal. Find the remainder when $N$ is divided by $100$. (Note: the length of a diagonal on a $5 \times 5$ chessboard can be 2, 3, 4, or 5.)

Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.

Let $P$ be any point inside an acute triangle. Let $D$ and $d$ be respectively the maximum and minimum distances from $P$ to any point on the perimeter of the triangle. (a) Prove that $D \ge 2d$. (b) Determine when equality holds

Let $ f(x)\equal{}\sum_{k\equal{}1}^n a_k x^k$ and $ g(x)\equal{}\sum_{k\equal{}1}^n \frac{a_k x^k}{2^k \minus{}1}$ be two polynomials with real coefficients. Let g(x) have $ 0,2^{n\plus{}1}$ as two of its roots. Prove That $ f(x)$ has a positive root less than $ 2^n$.

Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence. [list] [*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence. [*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list] [i]Mitchell Lee and Benjamin Gunby.[/i]

Prove that for every prime number $p$ and positive integer $a$, there exists a natural number $n$ such that $p^n$ contains $a$ consecutive equal digits.

In parallelogram $ABCD$, points $M$ and $N$ are selected on sides $AB$ and $BC$ respectively so that $AM = NC$, $Q$ is the intersection point of segments $AN$ and $CM$. Prove that $DQ$ is the bisector of angle $D$.

In the quadrilateral $ABCD$, we have $\measuredangle BAD = 100^{\circ}$, $\measuredangle BCD = 130^{\circ}$, and $AB=AD=1$ centimeter. Find the length of diagonal $AC$.

For which natural numbers $n$ can the polynomial $f (x) = x^n + x^{n-1} +...+ x + 1$ as write $f (x) = g (h (x))$, where $g$ and $h$ should be real polynomials of degrees greater than $1$?

The first three terms of an arithmetic progression are $ x \minus{} 1, x \plus{} 1, 2x \plus{} 3,$ in the order shown. The value of $ x$ is: $ \textbf{(A)}\ \minus{} 2 \qquad \textbf{(B)}\ 0 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ \text{undetermined}$

Alice is standing on the circumference of a large circular room of radius $10$. There is a circular pillar in the center of the room of radius $5$ that blocks Alice’s view. The total area in the room Alice can see can be expressed in the form $\frac{m\pi}{n} +p\sqrt{q}$, where $m$ and $n$ are relatively prime positive integers and $p$ and $q$ are integers such that $q$ is square-free. Compute $m + n + p + q$. (Note that the pillar is not included in the total area of the room.) [img]https://cdn.artofproblemsolving.com/attachments/1/9/a744291a61df286735d63d8eb09e25d4627852.png[/img]

Determine all sequences $p_1, p_2, \dots $ of prime numbers for which there exists an integer $k$ such that the recurrence relation \[ p_{n+2} = p_{n+1} + p_n + k \] holds for all positive integers $n$.

Two circles intersect at points $P$ and $Q$. The straight line intersects these circles at points $A$, $B$, $C$, $D$, as shown in fig. . Prove that $\angle APB = \angle CQD$. [img]https://cdn.artofproblemsolving.com/attachments/1/a/a581e11be68bbb628db5b5b8e75c7ff6e196c5.png[/img]

Let $n$ be a positive integer. Find the number of sequences $x_{1},x_{2},\ldots x_{2n-1},x_{2n}$, where $x_{i}\in\{-1,1\}$ for each $i$, satisfying the following condition: for any integer $k$ and $m$ such that $1\le k\le m\le n$ then the following inequality holds \[\left|\sum_{i=2k-1}^{2m}x_{i}\right|\le\ 2\]

On a large, flat field $n$ people are positioned so that for each person the distances to all the other people are different. Each person holds a water pistol and at a given signal fires and hits the person who is closest. When $n$ is odd show that there is at least one person left dry. Is this always true when $n$ is even?

Compute the number of geometric sequences of length $3$ where each number is a positive integer no larger than $10$.

Proof that there exist constant $\lambda$, so that for any positive integer $m(\ge 2)$, and any lattice triangle $T$ in the Cartesian coordinate plane, if $T$ contains exactly one $m$-lattice point in its interior(not containing boundary), then $T$ has area $\le \lambda m^3$. PS. lattice triangles are triangles whose vertex are lattice points; $m$-lattice points are lattice points whose both coordinates are divisible by $m$.

Bamicin is initially at $(20, 20)$ in a cartesian plane. Every minute, if Bamicin is at point $P$, Bamicin can move to a lattice point exactly $37$ units from $P$. Determine all lattice points Bamicin can visit.

The matrix \[A=\begin{pmatrix} a_{11} & \ldots & a_{1n} \\ \vdots & \ldots & \vdots \\ a_{n1} & \ldots & a_{nn} \end{pmatrix}\] satisfies the inequality $\sum_{j=1}^n |a_{j1}x_1 + \cdots+ a_{jn}x_n| \leq M$ for each choice of numbers $x_i$ equal to $\pm 1$. Show that \[|a_{11} + a_{22} + \cdots+ a_{nn}| \leq M.\]

Let $f: \mathbb{N} \to \mathbb{N}$ be an arbitrary function. Prove that there exist two positive integers $x$ and $y$ which satisfy $f(x+y) \le f(2x+f(y))$. [i](Proposed by David Anghel, Romania)[/i]