The six-digit number $\underline{2}\,\underline{0}\,\underline{2}\,\underline{1}\,\underline{0}\,\underline{A}$ is prime for only one digit $A.$ What is $A?$ $(\textbf{A})\: 1\qquad(\textbf{B}) \: 3\qquad(\textbf{C}) \: 5 \qquad(\textbf{D}) \: 7\qquad(\textbf{E}) \: 9$

Let $ABC$ be a triangle with semiperimeter $s$ and inradius $r$. The semicircles with diameters $BC$, $CA$, $AB$ are drawn on the outside of the triangle $ABC$. The circle tangent to all of these three semicircles has radius $t$. Prove that \[\frac{s}{2}<t\le\frac{s}{2}+\left(1-\frac{\sqrt{3}}{2}\right)r. \] [i]Alternative formulation.[/i] In a triangle $ABC$, construct circles with diameters $BC$, $CA$, and $AB$, respectively. Construct a circle $w$ externally tangent to these three circles. Let the radius of this circle $w$ be $t$. Prove: $\frac{s}{2}<t\le\frac{s}{2}+\frac12\left(2-\sqrt3\right)r$, where $r$ is the inradius and $s$ is the semiperimeter of triangle $ABC$. [i]Proposed by Dirk Laurie, South Africa[/i]

For each interger $n\geq 4$, we consider the $m$ subsets $A_1, A_2,\dots, A_m$ of $\{1, 2, 3,\dots, n\}$, such that $A_1$ has exactly one element, $A_2$ has exactly two elements,...., $A_m$ has exactly $m$ elements and none of these subsets is contained in any other set. Find the maximum value of $m$.

There $100$ people seated at a round table $50$ women and $50$ men. Show that there are two people of opposite gender that stay between two people of opposite gender. (WWMM, MMWW, WMWM, MWMW)

Zachary tries to simplify the fraction $\frac{2020}{5050}$ by dividing the numerator and denominator by the same integer to get the fraction $\frac{m}{n}$ , where $m$ and $n$ are both positive integers. Find the sum of the (not necessarily distinct) prime factors of the sum of all the possible values of $m +n$

The graph of $ y\equal{}\log x$ $\textbf{(A)}\text{Cuts the }y\text{-axis} \qquad\\ \textbf{(B)}\ \text{Cuts all lines perpendicular to the }x\text{-axis} \qquad\\ \textbf{(C)}\ \text{Cuts the }x\text{-axis} \qquad\\ \textbf{(D)}\ \text{Cuts neither axis} \qquad\\ \textbf{(E)}\ \text{Cuts all circles whose center is at the origin}$

A pet shop sells cats and two types of birds: ducks and parrots. In the shop, $\tfrac{1}{12}$ of animals are ducks, and $\tfrac{1}{4}$ of birds are ducks. Given that there are $56$ cats in the pet shop, how many ducks are there in the pet shop?

William writes the number $1$ on a blackboard. Every turn, he erases the number $N$ currently on the blackboard and replaces it with either $4N + 1$ or $8N + 1$ until it exceeds $1000$, after which no more moves are made. If the minimum possible value of the final number on the blackboard is $M$, find the remainder when $M$ is divided by $1000$.

Solve in positive integers the following equation: \[{1\over n^2}-{3\over 2n^3}={1\over m^2}\] [i]Proposed by A. Golovanov[/i]

$n$ people sit in a circle. Each of them is either a liar (always lies) or a truthteller (always tells the truth). Every person knows exactly who speaks the truth and who lies. In their turn, each person says 'the person two seats to my left is a truthteller'. It is known that there's at least one liar and at least one truthteller in the circle. [list=a] [*] Is it possible that $n=2017?$ [*] Is it possible that $n=5778?$ [/list]

A country has $n$ cities, labelled $1,2,3,\dots,n$. It wants to build exactly $n-1$ roads between certain pairs of cities so that every city is reachable from every other city via some sequence of roads. However, it is not permitted to put roads between pairs of cities that have labels differing by exactly $1$, and it is also not permitted to put a road between cities $1$ and $n$. Let $T_n$ be the total number of possible ways to build these roads. (a) For all odd $n$, prove that $T_n$ is divisible by $n$. (b) For all even $n$, prove that $T_n$ is divisible by $n/2$.

The sum of the real numbers $x_1, x_2, ...,x_n$ belonging to the segment $[a, b]$ is equal to zero. Prove that $$x_1^2+ x_2^2+ ...+x_n^2 \le - nab.$$

Find all solutions to $aabb=n^4-6n^3$, where $a$ and $b$ are non-zero digits, and $n$ is an integer. ($a$ and $b$ are not necessarily distinct.)

Let $n$ be a positive integer. Suppose that we have disks of radii $1, 2, . . . , n.$ Of each size there are two disks: a transparent one and an opaque one. In every disk there is a small hole in the centre, with which we can stack the disks using a vertical stick. We want to make stacks of disks that satisfy the following conditions: $i)$ Of each size exactly one disk lies in the stack. $ii)$ If we look at the stack from directly above, we can see the edges of all of the $n$ disks in the stack. (So if there is an opaque disk in the stack,no smaller disks may lie beneath it.) Determine the number of distinct stacks of disks satisfying these conditions. (Two stacks are distinct if they do not use the same set of disks, or, if they do use the same set of disks and the orders in which the disks occur are different.)

A chord of a circle is perpendicular to a radius at the midpoint of the radius. The ratio of the area of the larger of the two regions into which the chord divides the circle to the smaller can be expressed in the form $\frac{a\pi+b\sqrt{c}}{d\pi-e\sqrt{f}}$, where $a$, $b$, $c$, $d$, $e$, and $f$ are positive integers, $a$ and $e$ are relatively prime, and neither $c$ nor $f$ is divisible by the square of any prime. Find the remainder when the product $abcdef$ is divided by 1000.

It is known that a polynomial $P$ with integer coefficients has degree $2022$. What is the maximum $n$ such that there exist integers $a_1, a_2, \cdots a_n$ with $P(a_i)=i$ for all $1\le i\le n$? [Extra: What happens if $P \in \mathbb{Q}[X]$ and $a_i\in \mathbb{Q}$ instead?]