Simplify $$\dbinom{2020}{1010}\dbinom{1010}{1010}+\dbinom{2019}{1010}\dbinom{1011}{1010}+\cdots+\dbinom{1011}{1010}\dbinom{2019}{1010} + \dbinom{1010}{1010}\dbinom{2020}{1010}.$$

Let $U$ be the set of all complex numbers $m$ such that the $4$ roots of $(x^2+2x+5)(x^2-2mx+25)=0$ are concyclic in the complex plane. One can show that when the points of $U$ are plotted on the complex plane, it is visualized as the finite union of some curves. Find the sum of the lengths of those curves (i.e. the perimeter of $U$).

Over all natural numbers $n$ with 16 (not necessarily distinct) prime divisors, one of them maximizes the value of $s(n)/n$, where $s(n)$ denotes the sum of the divisors of $n$. What is the value of $d(d(n))$, where $d(n)$ is the the number of divisors of $n$?

Complex numbers $\omega_1, \ldots, \omega_n$ each have magnitude $1.$ Let $z$ be a complex number distinct from $\omega_1, \ldots, \omega_n$ such that $$\frac{z+\omega_1}{z-\omega_1}+\ldots+\frac{z+\omega_n}{z-\omega_n}=0.$$ Prove that $|z|=1.$

Consider the $5$ by $5$ by $5$ equilateral triangular grid as shown: [asy] size(5cm); real n = 5; for (int i = 0; i < n; ++i) { draw((0.5*i,0.866*i)--(n-0.5*i,0.866*i)); } for (int i = 0; i < n; ++i) { draw((n-i,0)--((n-i)/2,(n-i)*0.866)); } for (int i = 0; i < n; ++i) { draw((i,0)--((n+i)/2,(n-i)*0.866)); } [/asy] Ethan chooses two distinct upward-oriented equilateral triangles bounded by the gridlines. The probability that Ethan chooses two triangles that share exactly one vertex can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Andrew Wen[/i]

George is taking a ten-question true-false exam, where the answer key has been selected uniformly at random; however, he doesn't know any of the answers! Luckily, a friend has helpfully hinted that no two consecutive questions have true as the correct answer. If George takes the exam and maximizes the expected number of questions he gets correct, how many of his answers are expected to be right?

The value of \[\frac{1}{20}-\frac{1}{21}+\frac{1}{20\times 21}\] can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Nathan Xiong[/i]

We have 7 buckets labelled 0-6. Initially bucket 0 is empty, while bucket $n$ (for each $1 \leq n \leq 6$) contains the list $[1,2, \ldots, n]$. Consider the following program: choose a subset $S$ of $[1,2,\ldots,6]$ uniformly at random, and replace the contents of bucket $|S|$ with $S$. Let $\tfrac{p}{q}$ be the probability that bucket 5 still contains $[1,2, \ldots, 5]$ after two executions of this program, where $p,q$ are positive coprime integers. Find $p$.

Suppose $x$, $y$, and $z$ are nonzero complex numbers such that $(x+y+z)(x^2+y^2+z^2)=x^3+y^3+z^3$. Compute \[(x+y+z)\left(\dfrac1x+\dfrac1y+\dfrac1z\right).\]

Mr. DoBa likes to listen to music occasionally while he does his math homework. When he listens to classical music, he solves one problem every $3$ minutes. When he listens to rap music, however, he only solves one problem every $5$ minutes. Mr. DoBa listens to a playlist comprised of $60\%$ classical music and $40\%$ rap music. Each song is exactly $4$ minutes long. Suppose that the expected number of problems he solves in an hour does not depend on whether or not Mr. DoBa is listening to music at any given moment, and let $m$ the average number of problems Mr. DoBa solves per minute when he is not listening to music. Determine the value of $1000m$.

Jason starts in a cell of the grid below. Every second he moves to an adjacent cell (i.e., two cells that share a side) that he has not visited yet. Find the maximum possible number of cells that Jason can visit. [asy] size(3cm); draw((1,0)--(4,0)); draw((0,1)--(5,1)); draw((0,2)--(5,2)); draw((0,3)--(5,3)); draw((0,4)--(5,4)); draw((1,5)--(4,5)); draw((0,1)--(0,4)); draw((1,0)--(1,5)); draw((2,0)--(2,5)); draw((3,0)--(3,5)); draw((4,0)--(4,5)); draw((5,1)--(5,4)); [/asy]

Let $S$ be a subset of the natural numbers such that $0\in S$, and for all $n\in\mathbb N$, if $n$ is in $S$, then both $2n+1$ and $3n+2$ are in $S$. What is the smallest number of elements $S$ can have in the range $\{0,1,\ldots, 2019\}$?

Real numbers $x$ and $y$ satisfy \begin{align*} x^2 + y^2 &= 2023 \\ (x-2)(y-2) &= 3. \end{align*} Find the largest possible value of $|x-y|$. [i]Proposed by Howard Halim[/i]

Call a convex quadrilateral [i]angle-Pythagorean[/i] if the degree measures of its angles are integers $w\leq x \leq y \leq z$ satisfying $$w^2+x^2+y^2=z^2.$$ Determine the maximum possible value of $x+y$ for an angle-Pythagorean quadrilateral.

Jonathan finds all ordered triples $(a, b, c)$ of positive integers such that $abc = 720$. For each ordered triple, he writes their sum $a + b + c$ on the board. (Numbers may appear more than once.) What is the sum of all the numbers written on the board?

Suppose that $$\frac{(\sqrt2)^5 + 1}{\sqrt2 + 1} \times \frac{2^5 + 1}{2 + 1} \times \frac{4^5 + 1}{4 + 1} \times \frac{16^5 + 1}{16 + 1} =\frac{m}{7 + 3\sqrt2}$$ for some integer $m$. How many $0$’s are in the binary representation of $m$? (For example, the number $20 = 10100_2$ has three $0$’s in its binary representation.)

For a positive integer $k$, define the $k$-[i]pop[/i] of a positive integer $n$ as the infinite sequence of integers $a_1, a_2, ...$ such that $a_1 = n$ and $$a_{i+1}= \left\lfloor \frac{a_i}{k} \right\rfloor , i = 1, 2, ..$$ where $ \lfloor x\rfloor $ denotes the greatest integer less than or equal to $x$. Furthermore, define a positive integer $m$ to be $k$-[i]pop avoiding[/i] if $k$ does not divide any nonzero term in the $k$-pop of $m$. For example, $14$ is 3-pop avoiding because $3$ does not divide any nonzero term in the $3$-pop of $14$, which is $14, 4, 1, 0, 0, ....$ Suppose that the number of positive integers less than $13^{2018}$ which are $13$-pop avoiding is equal to N. What is the remainder when $N$ is divided by $1000$?

Let $\triangle ABC$ be equilateral with integer side length. Point $X$ lies on $\overline{BC}$ strictly between $B$ and $C$ such that $BX<CX$. Let $C'$ denote the reflection of $C$ over the midpoint of $\overline{AX}$. If $BC'=30$, find the sum of all possible side lengths of $\triangle ABC$. [i]Proposed by Connor Gordon[/i]

Michael and Andrew are playing the game Bust, which is played as follows: Michael chooses a positive integer less than or equal to $99$, and writes it on the board. Andrew then makes a move, which consists of him choosing a positive integer less than or equal to $ 8$ and increasing the integer on the board by the integer he chose. Play then alternates in this manner, with each person making exactly one move, until the integer on the board becomes greater than or equal to $100$. The person who made the last move loses. Let S be the sum of all numbers for which Michael could choose initially and win with both people playing optimally. Find S.

A positive integer $N$ is a [i]triple-double[/i] if there exists non-negative integers $a$, $b$, $c$ such that $2^a + 2^b + 2^c = N$. How many three-digit numbers are triple-doubles? [i]Proposed by Giacomo Rizzo[/i]

Quadrilateral $ABCD$ with $AC = 800$ is inscribed in a circle, and $E, W, X, Y, Z$ are the midpoints of segments $BD$, $AB$, $BC$, $CD$, $DA$, respectively. If the circumcenters of $EW Z$ and $EXY$ are $O_1$ and $O_2$, respectively, determine $O_1O_2$.

How many ordered triples $(a,b,c)$ of integers satisfy the inequality \[a^2+b^2+c^2 \leq a+b+c+2?\] Let $T = TNYWR$. David rolls a standard $T$-sided die repeatedly until he first rolls $T$, writing his rolls in order on a chalkboard. What is the probability that he is able to erase some of the numbers he's written such that all that's left on the board are the numbers $1, 2, \dots, T$ in order?

Albert writes down all of the multiples of $9$ between $9$ and $999,$ inclusive. Compute the sum of the digits he wrote.

Let $\triangle ABC$ be a triangle with $AB=3$ and $AC=5$. Select points $D, E,$ and $F$ on $\overline{BC}$ in that order such that $\overline{AD}\perp \overline{BC}$, $\angle BAE=\angle CAE$, and $\overline{BF}=\overline{CF}$. If $E$ is the midpoint of segment $\overline{DF}$, what is $BC^2$? Let $T = TNYWR$, and let $T = 10X + Y$ for an integer $X$ and a digit $Y$. Suppose that $a$ and $b$ are real numbers satisfying $a+\frac1b=Y$ and $\frac{b}a=X$. Compute $(ab)^4+\frac1{(ab)^4}$.

Brandon wants to split his orchestra of $20$ violins, $15$ violas, $10$ cellos, and $5$ basses into three distinguishable groups, where all of the players of each instrument are indistinguishable. He wants each group to have at least one of each instrument and for each group to have more violins than violas, more violas than cellos, and more cellos than basses. How many ways are there for Brandon to split his orchestra following these conditions?