ChenDRAG/VeRL_math_validation huggingface dataset:
Problem: Let \( G, O, D, I, \) and \( T \) be digits that satisfy the following equation:

\[
\begin{array}{cccc}
 & G & O & G & O \\
+ & D & I & D & I \\
\hline
G & O & D & O & T
\end{array}
\]

(Note that \( G \) and \( D \) cannot be \( 0 \), and that the five variables are not necessarily different.)

Compute the value of GODOT.
Answer: 10908
Problem: A classroom has $30$ students, each of whom is either male or female. For every student $S$, we define their ratio to be the number of students of the opposite gender as $S$ divided by the number of students of the same gender as $S$ (including $S$). Let $\Sigma$ denote the sum of the ratios of all $30$ students. Find the number of possible values of $\Sigma$.
Answer: 2
Problem: There are $100$ people standing in a line from left to right. Half of them are randomly chosen to face right (with all $\binom{100}{50}$ possible choices being equally likely), and the others face left. Then, while there is a pair of people who are facing each other and have no one between them, the leftmost such pair leaves the line. Compute the expected number of people remaining once this process terminates.
Answer: 50
Problem: In equilateral triangle $ABC$, the midpoint of $\overline{BC}$ is $M$. If the circumcircle of triangle $MAB$ has an area of $36\pi$, find the perimeter of the triangle.
Answer: 36
Problem: Consider polynomials $P$ of degree $2015$, all of whose coefficients are in the set \{0,1,\dots,2010\}. Call such a polynomial "good" if for every integer $m$, one of the numbers $P(m)-20$, $P(m)-15$, $P(m)-1234$ is divisible by $2011$, and there exist integers $m_{20}, m_{15}, m_{1234}$ such that $P(m_{20})-20$, $P(m_{15})-15$, $P(m_{1234})-1234$ are all multiples of $2011$. Let $N$ be the number of good polynomials. Find the remainder when $N$ is divided by $1000$.
Answer: 460
Problem: Let $p$ be an odd prime number less than $10^5$. Granite and Pomegranate play a game. First, Granite picks an integer $c \in \{2,3,\dots,p-1\}$. Pomegranate then picks two integers $d$ and $x$, defines $f(t) = ct + d$, and writes $x$ on a sheet of paper. Next, Granite writes $f(x)$ on the paper, Pomegranate writes $f(f(x))$, Granite writes $f(f(f(x)))$, and so on, with the players taking turns writing. The game ends when two numbers appear on the paper whose difference is a multiple of $p$, and the player who wrote the most recent number wins. Find the sum of all $p$ for which Pomegranate has a winning strategy.
Answer: 65819
Problem: A function $f$ has its domain equal to the set of integers $0, 1, \ldots, 11$, and $f(n) \geq 0$ for all such $n$. The function $f$ satisfies the following conditions:
- $f(0) = 0$
- $f(6) = 1$
- If $x \geq 0$, $y \geq 0$, and $x + y \leq 11$, then $f(x + y) = \frac{f(x) + f(y)}{1 - f(x)f(y)}$

Find $f(2)^2 + f(10)^2$.
Answer: 14
Problem: Let $T$ denote the 15-element set $\{10a+b : a,b \in \mathbb{Z}, 1 \le a < b \le 6\}$. Let $S$ be a subset of $T$ in which all six digits $1,2,\ldots ,6$ appear and in which no three elements together use all these six digits. Determine the largest possible size of $S$.
Answer: 9
Problem: Let $f(x) = x^4 + 14x^3 + 52x^2 + 56x + 16$. Let $z_1, z_2, z_3, z_4$ be the four roots of $f$. Find the smallest possible value of $|z_a z_b + z_c z_d|$ where $\{a, b, c, d\} = \{1, 2, 3, 4\}$.
Answer: 8
Problem: Suppose $2015 = a_1 < a_2 < a_3 < \cdots < a_k$ is a finite sequence of positive integers, and for all $m, n \in \mathbb{N}$ and $1 \le m, n \le k$, the inequality $$a_m + a_n \ge a_{m+n} + |m-n|$$ holds. Determine the largest possible value $k$ can obtain.
Answer: 2016
Problem: Let $\{a_n\}$ be a sequence of integers satisfying the recurrence relation:
\[
(n-1)a_{n+1} = (n+1)a_n - 2(n-1) \quad \forall n \ge 1.
\]
Given that $2000 \mid a_{1999}$, determine the smallest integer $n \ge 2$ such that $2000 \mid a_n$.
Answer: 249
Problem: Find the smallest constant $c$ such that for every 4 points in a unit square, there are two points with a distance less than or equal to $c$ apart.
Answer: 1
Problem: For how many integers $1 \leq k \leq 2013$ does the decimal representation of $k^k$ end with a $1$?
Answer: 202
Problem: Sherry starts at the number 1. Whenever she's at 1, she moves one step up (to 2). Whenever she's at a number strictly between 1 and 10, she moves one step up or one step down, each with probability $\frac{1}{2}$. When she reaches 10, she stops. What is the expected number (average number) of steps that Sherry will take?
Answer: 81
Problem: An $80 \times 80$ grid is colored orange and black. A square is black if and only if either the square below it or the square to the left of it is black, but not both. If there is no such square, consider it as if it were orange. The only exception is the bottom left square, which is black. Consider the diagonal from the upper left to the lower right. How many black squares does this diagonal have?
Answer: 40
Problem: The incircle $\Gamma$ of a scalene triangle $ABC$ touches $BC$ at $D$, $CA$ at $E$, and $AB$ at $F$. Let $r_A$ be the radius of the circle inside $\triangle ABC$ which is tangent to $\Gamma$ and the sides $AB$ and $AC$. Define $r_B$ and $r_C$ similarly. If $r_A = 16$, $r_B = 25$, and $r_C = 36$, determine the radius of $\Gamma$.
Answer: 74
Problem: The faces of a cube contain the numbers 1, 2, 3, 4, 5, 6 such that the sum of the numbers on each pair of opposite faces is 7. For each of the cube’s eight corners, multiply the three numbers on the faces incident to that corner, and write down its value. What is the sum of the eight values assigned to the cube’s corners?
Answer: 343
Problem: Find the smallest positive integer $N$ such that $N$ is divisible by $19$, and when the digits of $N$ are read in reverse order, the result (after removing any leading zeroes) is divisible by $36$.
Answer: 2394
Problem: Let $F_k(a,b) = (a+b)^k - a^k - b^k$ and let $S = \{1,2,3,4,5,6,7,8,9,10\}$. For how many ordered pairs $(a,b)$ with $a,b \in S$ and $a \leq b$ is $\frac{F_5(a,b)}{F_3(a,b)}$ an integer?
Answer: 22
Problem: We call $A_1, A_2, \ldots, A_n$ an $n$-division of $A$ if:

1. $A_1 \cap A_2 \cap \cdots \cap A_n = A$,
2. $A_i \cap A_j \neq \emptyset$ for $i \neq j$.

Find the smallest positive integer $m$ such that for any $14$-division $A_1, A_2, \ldots, A_{14}$ of $A = \{1, 2, \ldots, m\}$, there exists a set $A_i$ ($1 \leq i \leq 14$) such that there are two elements $a, b$ of $A_i$ where $b < a \leq \frac{4}{3}b$.
Answer: 56
Problem: Let $f(n)$ be the integer closest to $\sqrt{n}$. Compute the largest $N$ less than or equal to $2018$ such that $\sum_{i=1}^N\frac{1}{f(i)}$ is integral.
Answer: 1980
Problem: Given a $2 \times 2$ tile and seven dominoes ($2 \times 1$ tile), find the number of ways to tile a $2 \times 7$ rectangle using some of these tiles without leaving gaps or overlapping any two tiles.
Answer: 59
Problem: There are infinitely many boxes - initially, one of them contains $n$ balls, and all others are empty. In a single move, we take some balls from a non-empty box and put them into an empty box. On a sheet of paper, we write down the product of the resulting number of balls in the two boxes. After some moves, the sum of all numbers on the sheet of paper became $2023$. What is the smallest possible value of $n$?
Answer: 65
Problem: Let $A(x)=\lfloor\frac{x^2-20x+16}{4}\rfloor$, $B(x)=\sin\left(e^{\cos\sqrt{x^2+2x+2}}\right)$, $C(x)=x^3-6x^2+5x+15$, $H(x)=x^4+2x^3+3x^2+4x+5$, $M(x)=\frac{x}{2}-2\lfloor\frac{x}{2}\rfloor+\frac{x}{2^2}+\frac{x}{2^3}+\frac{x}{2^4}+\ldots$, $N(x)=\text{the number of integers that divide }\left\lfloor x\right\rfloor$, $O(x)=|x|\log |x|\log\log |x|$, $T(x)=\sum_{n=1}^{\infty}\frac{n^x}{\left(n!\right)^3}$, and $Z(x)=\frac{x^{21}}{2016+20x^{16}+16x^{20}}$ for any real number $x$ such that the functions are defined. Determine $$C(C(A(M(A(T(H(B(O(N(A(N(Z(A(2016)))))))))))))).$$
Answer: 3
Problem: Consider all ordered pairs \((m, n)\) of positive integers satisfying the equation \(59m - 68n = mn\). Find the sum of all possible values of \(n\) in these ordered pairs.
Answer: 237
Problem: The familiar $3$-dimensional cube has $6$ $2$-dimensional faces, $12$ $1$-dimensional edges, and $8$ $0$-dimensional vertices. Find the number of $9$-dimensional sub-subfaces in a $12$-dimensional cube.
Answer: 1760
Problem: Let $\triangle ABC$ satisfy $AB = 17$, $AC = \frac{70}{3}$, and $BC = 19$. Let $I$ be the incenter of $\triangle ABC$ and $E$ be the excenter of $\triangle ABC$ opposite $A$. (Note: this means that the circle tangent to ray $AB$ beyond $B$, ray $AC$ beyond $C$, and side $BC$ is centered at $E$.) Suppose the circle with diameter $IE$ intersects $AB$ beyond $B$ at $D$. If $BD = \frac{a}{b}$ where $a$ and $b$ are coprime positive integers, find $a + b$.
Answer: 22
Problem: Let $S$ be a set of $2020$ distinct points in the plane. Define 
\[M=\{P : P \text{ is the midpoint of } XY \text{ for some distinct points } X, Y \text{ in } S\}.\]

Find the least possible value of the number of points in $M$.
Answer: 4037
Problem: Determine the maximum possible value of \[ \frac{\left(x^2+5x+12\right)\left(x^2+5x-12\right)\left(x^2-5x+12\right)\left(-x^2+5x+12\right)}{x^4} \] over all non-zero real numbers $x$.
Answer: 576
Problem: You are playing a game called "Hovse." Initially, you have the number $0$ on a blackboard. At any moment, if the number $x$ is written on the board, you can perform one of the following operations:

- Replace $x$ with $3x + 1$
- Replace $x$ with $9x + 1$
- Replace $x$ with $27x + 3$
- Replace $x$ with $\left \lfloor \frac{x}{3} \right \rfloor$

You are not allowed to write a number greater than $2017$ on the board. How many positive numbers can you make with the game of "Hovse?"
Answer: 127
Problem: Let $a$ and $b$ be positive real numbers such that $(65a^2 + 2ab + b^2)(a^2 + 8ab + 65b^2) = (8a^2 + 39ab + 7b^2)^2$. Then one possible value of $\frac{a}{b}$ satisfies $2 \left(\frac{a}{b}\right) = m + \sqrt{n}$, where $m$ and $n$ are positive integers. Find $m + n$.
Answer: 2636
Problem: Let $T$ be a triangle whose vertices have integer coordinates, such that each side of $T$ contains exactly $m$ points with integer coordinates. If the area of $T$ is less than $2020$, determine the largest possible value of $m$.
Answer: 64
Problem: Let $n$ be a square number with 4 digits, such that all its digits are less than 6. If we add 1 to each digit, the resulting number is another square. Find $n$.
Answer: 2025
Problem: Consider a prism, not necessarily right, whose base is a rhombus $ABCD$ with side $AB = 5$ and diagonal $AC = 8$. A sphere of radius $r$ is tangent to the plane $ABCD$ at $C$ and tangent to the edges $AA_1$, $BB_1$, and $DD_1$ of the prism. Calculate $r$.
Answer: 4
Problem: It is known that $a^{2005} + b^{2005}$ can be expressed as a polynomial of $a + b$ and $ab$. Find the sum of the coefficients of this polynomial.
Answer: 1
Problem: Let $ABC$ be an isosceles triangle with $\angle A = 90^\circ$. Points $D$ and $E$ are selected on sides $AB$ and $AC$, and points $X$ and $Y$ are the feet of the altitudes from $D$ and $E$ to side $BC$. Given that $AD = 48\sqrt{2}$ and $AE = 52\sqrt{2}$, compute $XY$.
Answer: 100
Problem: Using each of the ten digits exactly once, construct two five-digit numbers such that their difference is minimized. Determine this minimal difference.
Answer: 247
Problem: A light pulse starts at a corner of a reflective square. It bounces around inside the square, reflecting off the square's perimeter $n$ times before ending in a different corner. The path of the light pulse, when traced, divides the square into exactly 2021 regions. Compute the smallest possible value of $n$.
Answer: 63
Problem: How many rearrangements of the letters of "HMMTHMMT" do not contain the substring "HMMT"? For instance, one such arrangement is $HMMHMTMT$.
Answer: 361
Problem: Let $p$ be a prime number such that $\frac{28^p-1}{2p^2+2p+1}$ is an integer. Find all possible values of the number of divisors of $2p^2+2p+1$.
Answer: 2
Problem: Consider a triangle $ABC$ with $AB = 13$, $BC = 14$, $CA = 15$. A line perpendicular to $BC$ divides the interior of $\triangle ABC$ into two regions of equal area. Suppose that the aforesaid perpendicular cuts $BC$ at $D$, and cuts $\triangle ABC$ again at $E$. If $L$ is the length of the line segment $DE$, find $L^2$.
Answer: 112
Problem: $ABCDEF GH$ is a regular octagon with a side length of $10$ units. Consider a circle with center $A$ and radius $AC$, which intersects another circle with center $D$ and radius $CD$ at a point $I$, different from $C$. What is the length of the segment $IF$?
Answer: 10
Problem: The roots of the polynomial $f(x) = x^8 + x^7 - x^5 - x^4 - x^3 + x + 1$ are all roots of unity. We say that a real number $r \in [0, 1)$ is nice if $e^{2i \pi r} = \cos 2\pi r + i \sin 2\pi r$ is a root of the polynomial $f$ and if $e^{2i \pi r}$ has a positive imaginary part. Let $S$ be the sum of the values of nice real numbers $r$. If $S = \frac{p}{q}$ for relatively prime positive integers $p, q$, find $p + q$.
Answer: 31
Problem: The sweeties shop called "Olympiad" sells boxes of $6$, $9$, or $20$ chocolates. Groups of students from a nearby school collect money to buy a chocolate for each student; they do this by buying a box and then distributing a chocolate to everyone. For example, students can form groups of $15 = 6 + 9$ students or $38 = 2 \times 9 + 20$ students, etc. 

The seller has promised the students that he can satisfy any group size. If he needs to open a new box of chocolates for any group (such as groups of $4$, $7$, or $10$ students), then he will give all the chocolates for free to this group.

Can there be constructed the largest group that receives free chocolates, and if so, how many students are there in this group?
Answer: 43
Problem: Find the number of ordered triples of positive integers \((a, b, c)\) such that \(abc\) divides \((ab + 1)(bc + 1)(ca + 1)\).
Answer: 16
Problem: On the board, we write a series of $n$ numbers, where $n \geq 40$, and each one of them is equal to either $1$ or $-1$, such that the following conditions both hold:

1. The sum of every $40$ consecutive numbers is equal to $0$.
2. The sum of every $42$ consecutive numbers is not equal to $0$.

We denote by $S_n$ the sum of the $n$ numbers on the board. Find the maximum possible value of $S_n$ for all possible values of $n$.
Answer: 20
Problem: Find the sum of all $x$ from $2$ to $1000$ inclusive such that \( \prod_{n=2}^x \log_{n^n}(n+1)^{n+2} \) is an integer.
Answer: 739
Problem: Find the integer represented by $\left[ \sum_{n=1}^{10^9} n^{-2/3} \right]$. Here $[x]$ denotes the greatest integer less than or equal to $x$.
Answer: 2997
Problem: A bitstring of length $\ell$ is a sequence of $\ell$ $0$'s or $1$'s in a row. How many bitstrings of length $2014$ have at least $2012$ consecutive $0$'s or $1$'s?
Answer: 16
Problem: Let $a, b, c$ be three distinct positive integers such that the sum of any two of them is a perfect square. Find the minimal sum $a + b + c$.
Answer: 55
Problem: If $x$ is a real number such that $3^x = 27x$, compute $\log_3 \left(\frac{3^{3^x}}{x^{3^3}}\right)$.
Answer: 81
Problem: Initially, there are $3^{80}$ particles at the origin $(0,0)$. At each step, the particles are moved to points above the $x$-axis as follows: if there are $n$ particles at any point $(x,y)$, then $\left\lfloor \frac{n}{3} \right\rfloor$ of them are moved to $(x+1,y+1)$, $\left\lfloor \frac{n}{3} \right\rfloor$ are moved to $(x,y+1)$, and the remaining to $(x-1,y+1)$. For example, after the first step, there are $3^{79}$ particles each at $(1,1)$, $(0,1)$, and $(-1,1)$. After the second step, there are $3^{78}$ particles each at $(-2,2)$ and $(2,2)$, $2 \times 3^{78}$ particles each at $(-1,2)$ and $(1,2)$, and $3^{79}$ particles at $(0,2)$. After $80$ steps, the number of particles at $(79,80)$ is:
Answer: 80
Problem: A cross is the figure composed of $6$ unit squares as shown below (and any figure made of it by rotation).

![Cross Image](https://cdn.artofproblemsolving.com/attachments/6/0/6d4e0579d2e4c4fa67fd1219837576189ec9cb.png)

Find the greatest number of crosses that can be cut from a $6 \times 11$ sheet of paper divided into unit squares, ensuring each cross consists of six such squares.
Answer: 8
Problem: Suppose that $a$ and $b$ are distinct positive integers satisfying $20a + 17b = p$ and $17a + 20b = q$ for certain primes $p$ and $q$. Determine the minimum value of $p + q$.
Answer: 296
Problem: Let $ABC$ be a triangle with $\angle BAC = 90^\circ$. Let $D$, $E$, and $F$ be the feet of the altitude, angle bisector, and median from $A$ to $BC$, respectively. If $DE = 3$ and $EF = 5$, compute the length of $BC$.
Answer: 20
Problem: Derek fills a square $10 \times 10$ grid with $50$ $1$s and $50$ $2$s. He takes the product of the numbers in each of the $10$ rows. He takes the product of the numbers in each of the $10$ columns. He then sums these $20$ products up to get an integer $N$. Find the minimum possible value of $N$.
Answer: 640
Problem: Find the smallest positive integer $n$ for which the polynomial \[x^n-x^{n-1}-x^{n-2}-\cdots -x-1\] has a real root greater than $1.999$.
Answer: 10
Problem: Let $f(x)=\frac{9^x}{9^x+3}$. Compute $\sum_{k} f \left( \frac{k}{2002} \right)$, where $k$ goes over all integers $k$ between $0$ and $2002$ which are coprime to $2002$.
Answer: 360
Problem: Let $a$ be a positive real number and $n$ a non-negative integer. Determine $S-T$, where 
$$ S = \sum_{k=-2n}^{2n+1} \frac{(k-1)^2}{a^{| \lfloor \frac{k}{2} \rfloor |}} $$ 
and  
$$ T = \sum_{k=-2n}^{2n+1} \frac{k^2}{a^{| \lfloor \frac{k}{2} \rfloor |}} $$
Answer: 0
Problem: Two integers are called *relatively prime* if they share no common factors other than $1$. Determine the sum of all positive integers less than $162$ that are relatively prime to $162$.
Answer: 4374
Problem: Lil Wayne, the rain god, determines the weather. If Lil Wayne makes it rain on any given day, the probability that he makes it rain the next day is $0.75$. If Lil Wayne doesn't make it rain on one day, the probability that he makes it rain the next day is $0.25$. He decides not to make it rain today. Find the smallest positive integer $n$ such that the probability that Lil Wayne makes it rain $n$ days from today is greater than $0.499$.
Answer: 9
Problem: Let $A=(a_{ij})$ be the $n \times n$ matrix, where $a_{ij}$ is the remainder of the division of $i^j + j^i$ by $3$ for $i,j=1,2,\ldots,n$. Find the greatest $n$ for which $\det A \neq 0$.
Answer: 5
Problem: To each element of the set $S = \{1, 2, \ldots, 1000\}$ a color is assigned. Suppose that for any two elements $a, b$ of $S$, if $15$ divides $a + b$, then they are both assigned the same color. What is the maximum possible number of distinct colors used?
Answer: 8
Problem: Find the largest possible value in the real numbers of the term $$\frac{3x^2 + 16xy + 15y^2}{x^2 + y^2}$$ with $x^2 + y^2 \neq 0$.
Answer: 19
Problem: Twenty-six people gather in a house. Alicia is friends with only one person, Bruno is friends with two people, Carlos is a friend of three, Daniel is friends with four, Elías is friends with five, and so on, with each subsequent person being friends with one more person than the previous person. This pattern continues until reaching Yvonne, the twenty-fifth person, who is friends with everyone. How many people is Zoila, the twenty-sixth person, friends with?

Clarification: If $A$ is a friend of $B$, then $B$ is a friend of $A$.
Answer: 13
Problem: Find the maximum positive integer $k$ such that for any positive integers $m,n$ where $m^3+n^3>(m+n)^2$, we have:
\[
m^3+n^3\geq (m+n)^2+k
\]
Answer: 10
Problem: Al and Bill play a game involving a fair six-sided die. The die is rolled until either a number less than $5$ is rolled on consecutive tosses, or a number greater than $4$ is rolled on consecutive tosses. Al wins if the last roll is a $5$ or $6$. Bill wins if the last roll is a $2$ or lower. Let $m$ and $n$ be relatively prime positive integers such that $\frac{m}{n}$ is the probability that Bill wins. Find the value of $m+n$.
Answer: 29
Problem: Henry rolls a fair die. If the die shows the number $k$, Henry will then roll the die $k$ more times. The probability that Henry will never roll a 3 or a 6 either on his first roll or on one of the $k$ subsequent rolls is given by $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
Answer: 904
Problem: Given a board with size $25 \times 25$. Some $1 \times 1$ squares are marked, so that for each $13 \times 13$ and $4 \times 4$ sub-boards, there are at least $\frac{1}{2}$ of the squares in the sub-board that are marked. Find the least possible number of marked squares in the entire board.
Answer: 313
Problem: Jacob's analog clock has 12 equally spaced tick marks on the perimeter, but all the digits have been erased, so he doesn't know which tick mark corresponds to which hour. Jacob takes an arbitrary tick mark and measures clockwise to the hour hand and minute hand. He measures that the minute hand is 300 degrees clockwise of the tick mark, and that the hour hand is 70 degrees clockwise of the same tick mark. If it is currently morning, how many minutes past midnight is it?
Answer: 500
Problem: Define $\phi^{!}(n)$ as the product of all positive integers less than or equal to $n$ and relatively prime to $n$. Compute the number of integers $2 \le n \le 50$ such that $n$ divides $\phi^{!}(n)+1$.
Answer: 30
Problem: 9. What is the greatest possible perimeter of a right-angled triangle with integer side lengths if one of the sides has length $12$?
Answer: 84
Problem: Let $S = \{1, 2, 3, \ldots, 280\}$. Find the smallest integer $n$ such that each $n$-element subset of $S$ contains five numbers which are pairwise relatively prime.
Answer: 217
Problem: Find the integer closest to 
\[ \frac{1}{\sqrt[4]{5^4+1} - \sqrt[4]{5^4-1}} \]
Answer: 250
Problem: Consider the following one-person game: A player starts with a score $0$ and writes the number $20$ on an empty whiteboard. At each step, she may erase any one integer (call it $a$) and write two positive integers (call them $b$ and $c$) such that $b + c = a$. The player then adds $b \times c$ to her score. She repeats this step several times until she ends up with all $1$'s on the whiteboard. Then the game is over, and the final score is calculated. Let $M$ and $m$ be the maximum and minimum final scores that can be possibly obtained, respectively. Find $M - m$.
Answer: 0
Problem: Define $f(n) = \frac{n^2 + n}{2}$. Compute the number of positive integers $n$ such that $f(n) \leq 1000$ and $f(n)$ is the product of two prime numbers.
Answer: 8
Problem: Find the sum of the positive integer solutions to the equation $\left\lfloor\sqrt[3]{x}\right\rfloor + \left\lfloor\sqrt[4]{x}\right\rfloor = 4.$
Answer: 231
Problem: You roll three fair six-sided dice. Given that the highest number you rolled is $5$, the expected value of the sum of the three dice can be written as $\frac{a}{b}$ in simplest form. Find $a+b$.
Answer: 706
Problem: Let $AC$ be a diameter of a circle $\omega$ with radius $1$. Let $D$ be a point on $AC$ such that $CD = \frac{1}{5}$. Let $B$ be the point on $\omega$ such that $DB$ is perpendicular to $AC$, and let $E$ be the midpoint of $DB$. The line tangent to $\omega$ at $B$ intersects line $CE$ at point $X$. Compute $AX$.
Answer: 3
Problem: $A$ and $B$ play a game where $A$ chooses a positive integer $n \in \{1, 2, \dots, 1001\} = S$. $B$ must guess the value of $n$ by choosing several subsets of $S$. $A$ will then tell $B$ how many of these subsets contain $n$. $B$ will perform this action three times, selecting $k_1$, $k_2$, and $k_3$ subsets of $S$ respectively.

What is the least value of $k_1 + k_2 + k_3$ such that $B$ has a strategy to correctly guess the value of $n$ no matter what $A$ chooses?
Answer: 28
Problem: Let $ABCD$ be a convex cyclic quadrilateral. Suppose $P$ is a point in the plane of the quadrilateral such that the sum of its distances from the vertices of $ABCD$ is the least. If $\{PA, PB, PC, PD\} = \{3, 4, 6, 8\}$, what is the maximum possible area of $ABCD$?
Answer: 54