ChenDRAG/VeRL_math_validation huggingface dataset:
Problem: Point $P$ is located inside a square $ABCD$ of side length $10$. Let $O_1$, $O_2$, $O_3$, $O_4$ be the circumcenters of $P AB$, $P BC$, $P CD$, and $P DA$, respectively. Given that $P A+P B +P C +P D = 23\sqrt2$ and the area of $O_1O_2O_3O_4$ is $50$, the second largest of the lengths $O_1O_2$, $O_2O_3$, $O_3O_4$, $O_4O_1$ can be written as $\sqrt{\frac{a}{b}}$, where $a$ and $b$ are relatively prime positive integers. Compute $100a + b$.
Answer: 16902
Problem: Michel starts with the string HMMT. An operation consists of either replacing an occurrence of H with HM, replacing an occurrence of MM with MOM, or replacing an occurrence of T with MT. For example, the two strings that can be reached after one operation are HMMMT and HMOMT. Compute the number of distinct strings Michel can obtain after exactly $10$ operations.
Answer: 144
Problem: Suppose $\omega$ is a circle centered at $O$ with radius $8$. Let $AC$ and $BD$ be perpendicular chords of $\omega$. Let $P$ be a point inside quadrilateral $ABCD$ such that the circumcircles of triangles $ABP$ and $CDP$ are tangent, and the circumcircles of triangles $ADP$ and $BCP$ are tangent. If $AC = 2\sqrt{61}$ and $BD = 6\sqrt7$,then $OP$ can be expressed as $\sqrt{a}-\sqrt{b}$ for positive integers $a$ and $b$. Compute $100a + b$.
Answer: 103360
Problem: Suppose $P(x)$ is a monic polynomial of degree $2023$ such that $P(k) = k^{2023}P(1-\frac{1}{k})$ for every positive integer $1 \leq k \leq 2023$. Then $P(-1) = \frac{a}{b}$ where $a$ and $b$ are relatively prime integers. Compute the unique integer $0 \leq n < 2027$ such that $bn-a$ is divisible by the prime $2027$.
Answer: 406
Problem: Svitlana writes the number $147$ on a blackboard. Then, at any point, if the number on the blackboard is $n$, she can perform one of the following three operations:
$\bullet$ if $n$ is even, she can replace $n$ with $\frac{n}{2}$ 
$\bullet$ if $n$ is odd, she can replace $n$ with $\frac{n+255}{2}$  and
$\bullet$ if $n \ge 64$, she can replace $n$ with $n - 64$.
Compute the number of possible values that Svitlana can obtain by doing zero or more operations.
Answer: 163
Problem: Richard starts with the string $HHMMMMTT$. A move consists of replacing an instance of $HM$ with $MH$, replacing an instance of $MT$ with $TM$, or replacing an instance of $TH$ with $HT$. Compute the number of possible strings he can end up with after performing zero or more moves.
Answer: 70
Problem: If $a, b, c$, and $d$ are pairwise distinct positive integers that satisfy $lcm (a, b, c, d) < 1000$ and $a+b = c+d$, compute the largest possible value of $a + b$.
Answer: 581
Problem: The cells of a $5\times5$ grid are each colored red, white, or blue. Sam starts at the bottom-left cell of the grid and walks to the top-right cell by taking steps one cell either up or to the right. Thus, he passes through $9$ cells on his path, including the start and end cells. Compute the number of colorings for which Sam is guaranteed to pass through a total of exactly $3$ red cells, exactly $3$ white cells, and exactly $3$ blue cells no matter which route he takes.
Answer: 1680
Problem: Suppose $E$, $I$, $L$, $V$ are (not necessarily distinct) nonzero digits in base ten for which
[list]
[*] the four-digit number $\underline{E}\ \underline{V}\ \underline{I}\ \underline{L}$ is divisible by $73$, and

[*] the four-digit number $\underline{V}\ \underline{I}\ \underline{L}\ \underline{E}$ is divisible by $74$.
[/list]
Compute the four-digit number $\underline{L}\ \underline{I}\ \underline{V}\ \underline{E}$.
Answer: 9954
Problem: Convex quadrilateral $ABCD$ satisfies $\angle{CAB} = \angle{ADB} = 30^{\circ}, \angle{ABD} = 77^{\circ}, BC = CD$ and $\angle{BCD} =n^{\circ}$ for some positive integer $n$. Compute $n$.
Answer: 68
Problem: Suppose $a_1, a_2, ... , a_{100}$ are positive real numbers such that $$a_k =\frac{ka_{k-1}}{a_{k-1} - (k - 1)}$$ for $k = 2, 3, ... , 100$. Given that $a_{20} = a_{23}$, compute $a_{100}$.
Answer: 215
Problem: Compute the number of positive integers $n\le1000$ such that $\text{lcm}(n,9)$ is a perfect square. (Recall that $\text{lcm}$ denotes the least common multiple.)
Answer: 43
Problem: Compute the number of ways to tile a $3\times5$ rectangle with one $1\times1$ tile, one $1\times2$ tile, one $1\times3$ tile, one $1\times4$, and one $1\times5$ tile. (The tiles can be rotated, and tilings that differ by rotation or reflection are considered distinct.)
Answer: 40
Problem: Philena and Nathan are playing a game. First, Nathan secretly chooses an ordered pair $(x, y)$ of positive integers such that $x \leq 20$ and $y \leq 23$. (Philena knows that Nathan’s pair must satisfy $x \leq 20$ and $y \leq 23$.) The game then proceeds in rounds; in every round, Philena chooses an ordered pair $(a, b)$ of positive integers and tells it to Nathan; Nathan says YES if $x \leq a$ and $y \leq b$, and NO otherwise. Find, with proof, the smallest positive integer $N$ for which Philena has a strategy that guarantees she can be certain of Nathan’s pair after at most $N$ rounds.
Answer: 9
Problem: For any positive integers $a$ and $b$ with $b > 1$, let $s_b(a)$ be the sum of the digits of $a$ when it is written in base $b$. Suppose $n$ is a positive integer such that $$\sum^{\lfloor \log_{23} n\rfloor}_{i=1}
s_{20} \left( \left\lfloor \frac{n}{23^i} \right\rfloor \right)= 103 \,\,\, \text{and} \,\,\,
\sum^{\lfloor \log_{20} n\rfloor}_{i=1} s_{23} \left( \left\lfloor \frac{n}{20^i} \right\rfloor \right)= 115$$
Compute $s_{20}(n) - s_{23}(n)$.
Answer: 81
Problem: Let $S$ be the set of ordered pairs $(a, b)$ of positive integers such that $\gcd(a, b) = 1$. Compute \[ \sum_{(a, b) \in S} \left\lfloor \frac{300}{2a+3b} \right\rfloor. \]
Answer: 7400
Problem: For any positive integer $a$, let $\tau(a)$ be the number of positive divisors of $a$. Find, with proof, the largest possible value of $4\tau(n)-n$ over all positive integers $n$.
Answer: 12
Problem: Let $S$ be the set of all points in the plane whose coordinates are positive integers less than or equal to $100$ (so $S$ has $100^2$ elements), and let $L$ be the set of all lines $\ell$ such that $\ell$ passes through at least two points in $S$. Find, with proof, the largest integer $N \geq 2$ for which it is possible to choose $N$ distinct lines in $L$ such that every two of the chosen lines are parallel.
Answer: 4950
Problem: Elbert and Yaiza each draw $10$ cards from a $20$-card deck with cards numbered $1,2,3,\dots,20$. Then, starting with the player with the card numbered $1$, the players take turns placing down the lowest-numbered card from their hand that is greater than every card previously placed. When a player cannot place a card, they lose and the game ends.

Given that Yaiza lost and $5$ cards were placed in total, compute the number of ways the cards could have been initially distributed. (The order of cards in a player’s hand does not matter.)
Answer: 324
Problem: Each cell of a $3 \times 3$ grid is labeled with a digit in the set $\{1, 2, 3, 4, 5\}$ Then, the maximum entry in each row and each column is recorded. Compute the number of labelings for which every digit from $1$ to $5$ is recorded at least once.
Answer: 2664
Problem: Let $a_1, a_2, \ldots, a_{100}$ be positive integers, satisfying $$\frac{a_1^2+a_2^2+\ldots+a_{100}^2} {a_1+a_2+\ldots+a_{100}}=100.$$ What is the maximal value of $a_1$?
Answer: 550
Problem: Compute the number of ways to divide a $20 \times 24 $ rectangle into $4 \times  5$ rectangles. (Rotations and reflections are considered distinct.)
Answer: 6
Problem: Sally the snail sits on the $3 \times  24$ lattice of points $(i, j)$ for all $1 \le  i  \le  3$ and $1 \le  j \le 24$. She wants to visit every point in the lattice exactly once. In a move, Sally can move to a point in the lattice exactly one unit away. Given that Sally starts at $(2, 1)$, compute the number of possible paths Sally can take.
Answer: 4096
Problem: Let $P(n)=(n-1^3)(n-2^3)\ldots (n-40^3)$ for positive integers $n$. Let $d$ be the largest positive integer such that $d \mid P(n)$ for any $n>2023$. If $d$ is product of $m$ not necessarily distinct primes, find $m$.
Answer: 48
Problem: A [i]lame king[/i] is a chess piece that can move from a cell to any cell that shares at least one vertex with it, except for the cells in the same column as the current cell.

A lame king is placed in the top-left cell of a $7\times 7$ grid. Compute the maximum number of cells it can visit without visiting the same cell twice (including its starting cell).
Answer: 43
Problem: Compute the number of ways there are to assemble $2$ red unit cubes and $25$ white unit cubes into a $3 \times 3 \times 3$ cube such that red is visible on exactly $4$ faces of the larger cube. (Rotations and reflections are considered distinct.)
Answer: 114
Problem: Compute the sum of all two-digit positive integers $x$ such that for all three-digit (base $10$) positive integers $\underline{a}\, \underline{b} \, \underline{c}$, if $\underline{a} \, \underline{b} \, \underline{c}$ is a multiple of $x$, then the three-digit (base $10$) number $\underline{b} \, \underline{c} \, \underline{a}$ is also a multiple of $x$.
Answer: 64
Problem: A [i]peacock [/i] is a ten-digit positive integer that uses each digit exactly once. Compute the number of peacocks that are exactly twice another peacock.
Answer: 184320
Problem: 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\}$.
Answer: 146
Problem: Suppose $a$ and $b$ are positive integers. Isabella and Vidur both fill up an $a \times b$ table. Isabella fills it up with numbers $1, 2, . . . , ab$, putting the numbers $1, 2, . . . , b$ in the first row, $b + 1, b + 2, . . . , 2b$ in the second row, and so on. Vidur fills it up like a multiplication table, putting $ij$ in the cell in row $i$ and column $j$.

 (Examples are shown for a $3 \times 4$ table below.)
[img]https://cdn.artofproblemsolving.com/attachments/6/8/a0855d790069ecd2cd709fbc5e70f21f1fa423.png[/img]

Isabella sums up the numbers in her grid, and Vidur sums up the numbers in his grid; the difference between these two quantities is $1200$. Compute $a + b$.
Answer: 21
Problem: A polynomial $f(x)$ with integer coefficients is called $\textit{splitty}$ if and only if for every prime $p$, there exists polynomials $g_p, h_p$ with integer coefficients with degrees strictly smaller than the the degree of $f$, such that all coefficients of $f-g_ph_p$ are divisible by $p$. Compute the sum of all positive integers $n \leq 100$ such that $x^4+16x^2+n$ is $\textit{splitty}$.
Answer: 693
Problem: Nine distinct positive integers summing to $74$ are put into a $3 \times 3$ grid. Simultaneously, the number in each cell is replaced with the sum of the numbers in its adjacent cells. (Two cells are adjacent if they share an edge.) After this, exactly four of the numbers in the grid are $23$. Determine, with proof, all possible numbers that could have been originally in the center of the grid.
Answer: 18
Problem: The country of HMMTLand has $8$ cities. Its government decides to construct several two-way roads between pairs of distinct cities. After they finish construction, it turns out that each city can reach exactly $3$ other cities via a single road, and from any pair of distinct cities, either exactly $0$ or $2$ other cities can be reached from both cities by a single road. Compute the number of ways HMMTLand could have constructed the roads.
Answer: 875
Problem: On each cell of a $200 \times 200$ grid, we place a car, which faces in one of the four cardinal directions.In a move, one chooses a car that does not have a car immediately in front of it, and slides it one cellforward. If a move would cause a car to exit the grid, the car is removed instead. The cars are placedso that there exists a sequence of moves that eventually removes all the cars from the grid. Across all
such starting configurations, determine the maximum possible number of moves to do so.
Answer: 6014950
Problem: Let $\zeta = \cos \frac {2pi}{13} + i \sin  \frac {2pi}{13}$ . Suppose $a > b > c > d$ are positive integers satisfying
$$|\zeta^a + \zeta^b + \zeta^c +\zeta^d| =\sqrt3.$$
Compute the smallest possible value of $1000a + 100b + 10c + d$.
Answer: 7521
Problem: Compute the sum of all positive integers $50 \leq n \leq 100$ such that $2n+3 \nmid 2^{n!}-1$.
Answer: 222
Problem: Let $\Omega$ and $\omega$ be circles with radii $123$ and $61$, respectively, such that the center of $\Omega$ lies on $\omega$. A chord of $\Omega$ is cut by $\omega$ into three segments, whose lengths are in the ratio $1 : 2 : 3$ in that order. Given that this chord is not a diameter of $\Omega$, compute the length of this chord.
Answer: 42
Problem: Let $ABC$ be a triangle with $\angle BAC = 90^o$. Let $D$, $E$, and $F$ be the feet of altitude, angle bisector, and median from $A$ to $BC$, respectively. If $DE = 3$ and $EF = 5$, compute the length of $BC$.
Answer: 20
Problem: What is the polynomial of smallest degree that passes through $(-2, 2), (-1, 1), (0, 2),(1,-1)$, and $(2, 10)$?
Answer: 9
Problem: The graphs of the following equations divide the $xy$ plane into some number of regions.
$4 + (x + 2)y =x^2$
$(x + 2)^2 + y^2 =16$
Find the area of the second smallest region.
Answer: 9
Problem: Find the sum of all integer values of $n$ such that the equation $\frac{x}{(yz)^2} + \frac{y}{(zx)^2} + \frac{z}{(xy)^2} = n$ has a solution in positive integers.
Answer: 4
Problem: Let $f(n) = 9n^5- 5n^3 - 4n$. Find the greatest common divisor of $f(17), f(18),... ,f(2009)$.
Answer: 120
Problem: What's the greatest integer $n$ for which the system $k < x^k < k + 1$ for $k = 1,2,..., n$ has a solution?
Answer: 4
Problem: What is the largest integer which cannot be expressed as $2008x + 2009y + 2010z$ for some positive integers $x, y$, and $z$?
Answer: 2016031
Problem: How many ordered pairs of real numbers $(x, y)$ are there such that $x^2+y^2 = 200$ and
\[\sqrt{(x-5)^2+(y-5)^2}+\sqrt{(x+5)^2+(y+5)^2}\]
is an integer?
Answer: 12
Problem: In four-dimensional space, the $24$-cell of sidelength $\sqrt{2}$ is the convex hull of (smallest convex set containing) the $24$ points $(\pm 1, \pm 1, 0, 0)$ and its permutations. Find the four-dimensional volume of this region.
Answer: 8
Problem: If $p(x)$ is a polynomial with integer coeffcients, let $q(x) = \frac{p(x)}{x(1-x)}$ . If $q(x) = q\left(\frac{1}{1-x}\right)$ for every $x \ne 0$, and $p(2) = -7, p(3) = -11$, find $p(10)$.
Answer: 521
Problem: How many real roots do $x^5 +3x^4 -4x^3 -8x^2 +6x-1$ and $x^5-3x^4 -2x^3 -3x^2 -6x+1$ share?
Answer: 3
Problem: How many spanning trees does the following graph (with $6$ vertices and $9$ edges) have? 
(A spanning tree is a subset of edges that spans all of the vertices of the original graph, but does not contain any cycles.)
[img]https://cdn.artofproblemsolving.com/attachments/0/4/0e53e0fbb141b66a7b1c08696be2c5dfe68067.png[/img]
Answer: 75
Problem: If $f(x) = x^{x^{x^x}}$ , find the last two digits of $f(17) + f(18) + f(19) + f(20)$.
Answer: 32
Problem: In this problem, we consider only polynomials with integer coeffients. Call two polynomials $p$ and $q$ [i]really close[/i] if $p(2k + 1) \equiv q(2k + 1)$ (mod $210$) for all $k \in Z^+$. Call a polynomial $p$ [i]partial credit[/i] if no polynomial of lesser degree is [i]really close[/i] to it. What is the maximum possible degree of [i]partial credit[/i]?
Answer: 5
Problem: Let $x$ be the largest root of $x^4 - 2009x + 1$. Find the nearest integer to $\frac{1}{x^3-2009}$ .
Answer: -13
Problem: Find the sum of the values of $x$ for which $\binom{x}{0}-\binom{x}{1}+\binom{x}{2}-...+\binom{x}{2008}=0$
Answer: 2017036
Problem: Find the number of positive integer solutions of $(x^2 + 2)(y^2 + 3)(z^2 + 4) = 60xyz$.
Answer: 8
Problem: Find the smallest positive integer $n$ such that $32^n = 167x + 2$ for some integer $x$
Answer: 50
Problem: Find the largest integer $n$, where $2009^n$ divides $2008^{2009^{2010}} + 2010^{2009^{2008}}$
.
Answer: 2009
Problem: How many integers $n$ are there such that $0  \le n \le 720$ and $n^2 \equiv 1$ (mod $720$)?
Answer: 16
Problem: How many zeros are there at the end of $792!$ when written in base $10$?
Answer: 3
Problem: Find the smallest positive $\alpha$ (in degrees) for which all the numbers \[\cos{\alpha},\cos{2\alpha},\ldots,\cos{2^n\alpha},\ldots\] are negative.
Answer: 120
Problem: Consider the solid with 4 triangles and 4 regular hexagons as faces, where each triangle borders 3 hexagons, and all the sides are of length 1. Compute the [i]square[/i] of the volume of the solid. Express your result in reduced fraction and concatenate the numerator with the denominator (e.g., if you think that the square is $\frac{1734}{274}$, then you would submit 1734274).
Answer: 52972
Problem: Let $s(m)$ denote the sum of the digits of the positive integer $m$. Find the largest positive integer that has no digits equal to zero and satisfies the equation \[2^{s(n)} = s(n^2).\]
Answer: 1111
Problem: Find the number of ordered pairs $(a, b)$ of positive integers that are solutions of the following equation: \[a^2 + b^2 = ab(a+b).\]
Answer: 1
Problem: There are $n$ players in a round-robin ping-pong tournament (i.e. every two persons will play exactly one game). After some matches have been played, it is known that the total number of matches that have been played among any $n-2$ people is equal to $3^k$ (where $k$ is a fixed integer). Find the sum of all possible values of $n$.
Answer: 9
Problem: Find the sum of all integers $x$ for which there is an integer $y$, such that $x^3-y^3=xy+61$.
Answer: 6
Problem: Find the sum of all prime numbers $p$ which satisfy \[p = a^4 + b^4 + c^4 - 3\] for some primes (not necessarily distinct) $a$, $b$ and $c$.
Answer: 719
Problem: If $\phi$ is the Golden Ratio, we know that $\frac1\phi = \phi - 1$.  Define a new positive real number, called $\phi_d$, where $\frac1{\phi_d} = \phi_d - d$ (so $\phi = \phi_1$).  Given that $\phi_{2009} = \frac{a + \sqrt{b}}{c}$, $a, b, c$ positive integers, and the greatest common divisor of $a$ and $c$ is 1, find $a + b + c$.
Answer: 4038096
Problem: You are given that \[17! = 355687ab8096000\] for some digits $a$ and $b$. Find the two-digit number $\overline{ab}$ that is missing above.
Answer: 42
Problem: Lines $l$ and $m$ are perpendicular. Line $l$ partitions a convex polygon into two parts of equal area, and partitions the projection of the polygon onto $m$ into two line segments of length $a$ and $b$ respectively. Determine the maximum value of $\left\lfloor \frac{1000a}{b} \right\rfloor$. (The floor notation $\lfloor x \rfloor$ denotes largest integer not exceeding $x$)
Answer: 2141
Problem: Given that $P(x)$ is the least degree polynomial with rational coefficients such that 
\[P(\sqrt{2} + \sqrt{3}) = \sqrt{2},\] find $P(10)$.
Answer: 455
Problem: How many strings of ones and zeroes of length 10 are there such that there is an even number of ones, and no zero follows another zero?
Answer: 72
Problem: Consider $\triangle ABC$ and a point $M$ in its interior so that $\angle MAB = 10^\circ$, $\angle MBA = 20^\circ$, $\angle MCA = 30^\circ$ and $\angle MAC = 40^\circ$. What is $\angle MBC$?
Answer: 60
Problem: The real numbers $x$, $y$, $z$, and $t$ satisfy the following equation:
\[2x^2 + 4xy + 3y^2 - 2xz -2 yz + z^2 + 1 = t + \sqrt{y + z - t} \]
Find 100 times the maximum possible value for $t$.
Answer: 125
Problem: Taotao wants to buy a bracelet.  The bracelets have 7 different beads on them, arranged in a circle.  Two bracelets are the same if one can be rotated or flipped to get the other. If she can choose the colors and placement of the beads, and the beads come in orange, white, and black, how many possible bracelets can she buy?
Answer: 198
Problem: Let $S$ be the sum of all real $x$ such that $4^x = x^4$.  Find the nearest integer to $S$.
Answer: 5
Problem: Matt is asked to write the numbers from 1 to 10 in order, but he forgets how to count.  He writes a permutation of the numbers $\{1, 2, 3\ldots , 10\}$ across his paper such that:
[list]
[*]The leftmost number is 1.
[*]The rightmost number is 10.
[*]Exactly one number (not including 1 or 10) is less than both the number to its immediate left and the number to its immediate right.[/list]
How many such permutations are there?
Answer: 1636
Problem: $3n$ people take part in a chess tournament: $n$ girls and $2n$ boys. Each participant plays with each of the others exactly once. There were no ties and the number of games won by the girls is $\displaystyle\frac75$ the number of games won by the boys. How many people took part in the tournament?
Answer: 9
Problem: Let $N$ be the number of (positive) divisors of $2010^{2010}$ ending in the digit $2$. What is the remainder when $N$ is divided by 2010?
Answer: 503
Problem: A regular pentagon is drawn in the plane, along with all its diagonals.  All its sides and diagonals are extended infinitely in both directions, dividing the plane into regions, some of which are unbounded.  An ant starts in the center of the pentagon, and every second, the ant randomly chooses one of the edges of the region it's in, with an equal probability of choosing each edge, and crosses that edge into another region.  If the ant enters an unbounded region, it explodes.  After first leaving the central region of the pentagon, let $x$ be the expected number of times the ant re-enters the central region before it explodes.  Find the closest integer to $100x$.
Answer: 200
Problem: Let $p$ be a polynomial with integer coefficients such that $p(15)=6$, $p(22)=1196$, and $p(35)=26$. Find an integer $n$ such that $p(n)=n+82$.
Answer: 28
Problem: In a rectangular plot of land, a man walks in a very peculiar fashion. Labeling the corners $ABCD$, he starts at $A$ and walks to $C$. Then, he walks to the midpoint of side $AD$, say $A_1$. Then, he walks to the midpoint of side $CD$ say $C_1$, and then the midpoint of $A_1D$ which is $A_2$. He continues in this fashion, indefinitely. The total length of his path if $AB=5$ and $BC=12$ is of the form $a + b\sqrt{c}$. Find $\displaystyle\frac{abc}{4}$.
Answer: 793
Problem: Let $N$ be the sum of all binomial coefficients $\binom{a}{b}$ such that $a$ and $b$ are nonnegative integers and $a+b$ is an even integer less than 100.  Find the remainder when $N$ is divided by 144.  (Note: $\binom{a}{b} = 0$ if $a<b$, and $\binom{0}{0} = 1$.)
Answer: 3
Problem: A cuboctahedron is a solid with 6 square faces and 8 equilateral triangle faces, with each edge adjacent to both a square and a triangle (see picture).  Suppose the ratio of the volume of an octahedron to a cuboctahedron with the same side length is $r$. Find $100r^2$.
[asy] 
// dragon96, replacing
// [img]http://i.imgur.com/08FbQs.png[/img]
size(140); defaultpen(linewidth(.7));
real alpha=10, x=-0.12, y=0.025, r=1/sqrt(3);
path hex=rotate(alpha)*polygon(6);
pair A = shift(x,y)*(r*dir(330+alpha)), B = shift(x,y)*(r*dir(90+alpha)), C = shift(x,y)*(r*dir(210+alpha));
pair X = (-A.x, -A.y), Y = (-B.x, -B.y), Z = (-C.x, -C.y);
int i;
pair[] H;
for(i=0; i<6; i=i+1) {
H[i] = dir(alpha+60*i);}
fill(X--Y--Z--cycle, rgb(204,255,255));
fill(H[5]--Y--Z--H[0]--cycle^^H[2]--H[3]--X--cycle, rgb(203,153,255));
fill(H[1]--Z--X--H[2]--cycle^^H[4]--H[5]--Y--cycle, rgb(255,203,153));
fill(H[3]--X--Y--H[4]--cycle^^H[0]--H[1]--Z--cycle, rgb(153,203,255));
draw(hex^^X--Y--Z--cycle);
draw(H[1]--B--H[2]^^H[3]--C--H[4]^^H[5]--A--H[0]^^A--B--C--cycle, linewidth(0.6)+linetype("5 5"));
draw(H[0]--Z--H[1]^^H[2]--X--H[3]^^H[4]--Y--H[5]);[/asy]
Answer: 4
Problem: Define $\displaystyle{f(x) = x + \sqrt{x + \sqrt{x + \sqrt{x + \sqrt{x + \ldots}}}}}$.  Find the smallest integer $x$ such that $f(x)\ge50\sqrt{x}$.

(Edit: The official question asked for the "smallest integer"; the intended question was the "smallest positive integer".)
Answer: 2400
Problem: PUMaCDonalds, a newly-opened fast food restaurant, has 5 menu items.  If the first 4 customers each choose one menu item at random, the probability that the 4th customer orders a previously unordered item is $m/n$, where $m$ and $n$ are relatively prime positive integers.  Find $m+n$.
Answer: 189