Call a polygon [i]normal[/i] if it can be inscribed in a unit circle. How many non-congruent normal polygons are there such that the square of each side length is a positive integer?

Let $N = 2^{\left(2^2\right)}$ and $x$ be a real number such that $N^{\left(N^N\right)} = 2^{(2^x)}$. Find $x$.

Compute \[\sum_{a_1=0}^\infty\sum_{a_2=0}^\infty\cdots\sum_{a_7=0}^\infty\dfrac{a_1+a_2+\cdots+a_7}{3^{a_1+a_2+\cdots+a_7}}.\]

Reimu and Sanae play a game using $4$ fair coins. Initially both sides of each coin are white. Starting with Reimu, they take turns to color one of the white sides either red or green. After all sides are colored, the four coins are tossed. If there are more red sides showing up, then Reimu wins, and if there are more green sides showing up, then Sanae wins. However, if there is an equal number of red sides and green sides, then [i]neither[/i] of them wins. Given that both of them play optimally to maximize the probability of winning, what is the probability that Reimu wins?

Let $\otimes$ be a binary operation that takes two positive real numbers and returns a positive real number. Suppose further that $\otimes$ is continuous, commutative $(a\otimes b=b\otimes a)$, distributive across multiplication $(a\otimes(bc)=(a\otimes b)(a\otimes c))$, and that $2\otimes 2=4$. Solve the equation $x\otimes y=x$ for $y$ in terms of $x$ for $x>1$.

I have five different pairs of socks. Every day for five days, I pick two socks at random without replacement to wear for the day. Find the probability that I wear matching socks on both the third day and the fifth day.

Let $S$ be the set of integers of the form $2^x+2^y+2^z$, where $x,y,z$ are pairwise distinct non-negative integers. Determine the $100$th smallest element of $S$.

In an election for the Peer Pressure High School student council president, there are 2019 voters and two candidates Alice and Celia (who are voters themselves). At the beginning, Alice and Celia both vote for themselves, and Alice's boyfriend Bob votes for Alice as well. Then one by one, each of the remaining 2016 voters votes for a candidate randomly, with probabilities proportional to the current number of the respective candidate's votes. For example, the first undecided voter David has a $\tfrac{2}{3}$ probability of voting for Alice and a $\tfrac{1}{3}$ probability of voting for Celia. What is the probability that Alice wins the election (by having more votes than Celia)?

Your math friend Steven rolls five fair icosahedral dice (each of which is labelled $1,2, \dots,20$ on its sides). He conceals the results but tells you that at least half the rolls are $20$. Suspicious, you examine the first two dice and find that they show $20$ and $19$ in that order. Assuming that Steven is truthful, what is the probability that all three remaining concealed dice show $20$?

Find all positive integers $n$ for which there do not exist $n$ consecutive composite positive integers less than $n!$.

A convex polygon on the plane is called [i]wide[/i] if the projection of the polygon onto any line in the same plane is a segment with length at least 1. Prove that a circle of radius $\tfrac{1}{3}$ can be placed completely inside any wide polygon.

Let $P_1, P_2, \ldots, P_6$ be points in the complex plane, which are also roots of the equation $x^6+6x^3-216=0$. Given that $P_1P_2P_3P_4P_5P_6$ is a convex hexagon, determine the area of this hexagon.

Find all ordered triples $(a,b,c)$ of positive reals that satisfy: $\lfloor a\rfloor bc=3,a\lfloor b\rfloor c=4$, and $ab\lfloor c\rfloor=5$, where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.

Let $ABCDEF$ be a convex equilateral hexagon such that lines $BC$, $AD$, and $EF$ are parallel. Let $H$ be the orthocenter of triangle $ABD$. If the smallest interior angle of the hexagon is $4$ degrees, determine the smallest angle of the triangle $HAD$ in degrees.

Let $\mathbb{N}$ be the set of positive integers, and let $f: \mathbb{N} \to \mathbb{N}$ be a function satisfying [list] [*] $f(1) = 1$, [*] for $n \in \mathbb{N}$, $f(2n) = 2f(n)$ and $f(2n+1) = 2f(n) - 1$. [/list] Determine the sum of all positive integer solutions to $f(x) = 19$ that do not exceed 2019.

How many distinct permutations of the letters in the word REDDER are there that do not contain a palindromic substring of length at least two? (A [i]substring[/i] is a continuous block of letters that is part of the string. A string is [i]palindromic[/i] if it is the same when read backwards.)

Let $A,B,C,D,E$ be five points on a circle; some segments are drawn between the points so that each of the $5C2 = 10$ pairs of points is connected by either zero or one segments. Determine the number of sets of segments that can be drawn such that: • It is possible to travel from any of the five points to any other of the five points along drawn segments. • It is possible to divide the five points into two nonempty sets $S$ and $T$ such that each segment has one endpoint in $S$ and the other endpoint in $T$.

Let $ABCDEF$ be a regular hexagon of area $1$. Let $M$ be the midpoint of $DE$. Let $X$ be the intersection of $AC$ and $BM$, let $Y$ be the intersection of $BF$ and $AM$, and let $Z$ be the intersection of $AC$ and $BF$. If $[P]$ denotes the area of a polygon $P$ for any polygon $P$ in the plane, evaluate $[BXC] + [AYF] + [ABZ] - [MXZY]$.

Farmer James wishes to cover a circle with circumference $10\pi$ with six different types of colored arcs. Each type of arc has radius $5$, has length either $\pi$ or $2\pi$, and is colored either red, green, or blue. He has an unlimited number of each of the six arc types. He wishes to completely cover his circle without overlap, subject to the following conditions: [list][*] Any two adjacent arcs are of different colors. [*] Any three adjacent arcs where the middle arc has length $\pi$ are of three different colors. [/list] Find the number of distinct ways Farmer James can cover his circle. Here, two coverings are equivalent if and only if they are rotations of one another. In particular, two colorings are considered distinct if they are reflections of one another, but not rotations of one another. [i]Proposed by James Lin.[/i]

Let \[ A = \frac{1}{6}((\log_2(3))^3-(\log_2(6))^3-(\log_2(12))^3+(\log_2(24))^3) \]. Compute $2^A$.

Let $P_1P_2 \ldots P_8$ be a convex octagon. An integer $i$ is chosen uniformly at random from $1$ to $7$, inclusive. For each vertex of the octagon, the line between that vertex and the vertex $i$ vertices to the right is painted red. What is the expected number times two red lines intersect at a point that is not one of the vertices, given that no three diagonals are concurrent?

Compute the number of triples $(f,g,h)$ of permutations on $\{1,2,3,4,5\}$ such that \begin{align*} & f(g(h(x))) = h(g(f(x))) = g(x) \\ & g(h(f(x))) = f(h(g(x))) = h(x), \text{ and } \\ & h(f(g(x))) = g(f(h(x))) = f(x), \\ \end{align*} for all $x\in \{1,2,3,4,5\}$.

Define the sequence of positive integers $\{a_n\}$ as follows. Let $a_1=1$, $a_2=3$, and for each $n>2$, let $a_n$ be the result of expressing $a_{n-1}$ in base $n-1$, then reading the resulting numeral in base $n$, then adding $2$ (in base $n$). For example, $a_2=3_{10}=11_2$, so $a_3=11_3+2_3=6_{10}$. Express $a_{2013}$ in base $10$.

Denote by $\mathbb{N}$ the positive integers. Let $f:\mathbb{N} \rightarrow \mathbb{N}$ be a function such that, for any $w,x,y,z \in \mathbb{N}$, \[ f(f(f(z)))f(wxf(yf(z)))=z^{2}f(xf(y))f(w). \] Show that $f(n!) \ge n!$ for every positive integer $n$. [i]Pakawut Jiradilok[/i]

Let $a$ and $b$ be real numbers, and let $r$, $s$, and $t$ be the roots of $f(x)=x^3+ax^2+bx-1$. Also, $g(x)=x^3+mx^2+nx+p$ has roots $r^2$, $s^2$, and $t^2$. If $g(-1)=-5$, find the maximum possible value of $b$.