Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: A circle with center $O$ has area $156\pi$ . Triangle $ABC$ is equilateral, $\overline{BC}$ is a chord on the circle, $OA = 4\sqrt{3}$ , and point $O$ is outside $\triangle ABC$ . What is the side length of $\triangle ABC$
$\textbf{(A)}\ 2\sqrt{3} \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 4\sqrt{3} \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}\ 18$

Solution: The formula for the area of a circle is $\pi r^2$ so the radius of this circle is $\sqrt{156}.$
Because $OA=4\sqrt{3} < \sqrt{156}, A$ must be in the interior of circle $O.$
Let $s$ be the unknown value, the sidelength of the triangle, and let $X$ be the point on $BC$ where $OX \perp BC.$ Since $\triangle ABC$ is equilateral, $BX=\frac{s}{2}$ and $AX=\frac{s\sqrt{3}}{2}.$ We are given $AO=4\sqrt{3}.$ Use the Pythagorean Theorem and solve for $s.$
\begin{align*} (\sqrt{156})^2 &= \left(\frac{s}{2}\right)^2 + \left( \frac{s\sqrt{3}}{2} + 4\sqrt{3} \right)^2\\ 156 &= \frac14s^2 + \frac34s^2 + 12s + 48\\ 0 &= s^2 + 12s - 108\\ 0 &= (s-6)(s+18)\\ s &= \boxed{6}

Answer: B 6
Problem: A circle with center $O$ has area $156\pi$ . Triangle $ABC$ is equilateral, $\overline{BC}$ is a chord on the circle, $OA = 4\sqrt{3}$ , and point $O$ is outside $\triangle ABC$ . What is the side length of $\triangle ABC$
$\textbf{(A)}\ 2\sqrt{3} \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 4\sqrt{3} \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}\ 18$

Solution: We can use the same diagram as Solution 1 and label the side length of $\triangle ABC$ as $s$ . Using congruent triangles, namely the two triangles $\triangle BOA$ and $\triangle COA$ , we get that $\angle BAO = \angle CAO \implies \angle BAO = \frac{360-60}{2} = 150$ . From this, we can use the Law of Cosines , to get \[s^2 + (4 \sqrt{3})^2 - 2 \times s \times 4 \sqrt{3} \times - \frac{\sqrt{3}}{2} = (2 \sqrt{39})^2\] Simplifying, we get \[s^2 + 12s + 48 = 156 \implies s^2 + 12s - 108 = 0\] We can factor this to get \[(x-6)(x+18)\] Lengths must be non-negative, so the answer is $\boxed{6}$ ~bryan gao

Answer: B 6
Problem: Two circles lie outside regular hexagon $ABCDEF$ . The first is tangent to $\overline{AB}$ , and the second is tangent to $\overline{DE}$ . Both are tangent to lines $BC$ and $FA$ . What is the ratio of the area of the second circle to that of the first circle?
$\textbf{(A)}\ 18 \qquad  \textbf{(B)}\ 27 \qquad \textbf{(C)}\ 36 \qquad \textbf{(D)}\ 81 \qquad \textbf{(E)}\ 108$

Solution: A good diagram is very helpful.
The first circle is in red, the second in blue.
With this diagram, we can see that the first circle is inscribed in equilateral triangle $GBA$ while the second circle is inscribed in $GKJ$ .
From this, it's evident that the ratio of the blue area to the red area is equal to the ratio of the areas $\triangle GKJ$ to $\triangle GBA$
Since the ratio of areas is equal to the square of the ratio of lengths, we know our final answer is $\left(\frac{GK}{GB}\right)^2$ .
From the diagram, we can see that this is $9^2=\boxed{81}$

Answer: D 81
Problem: Two circles lie outside regular hexagon $ABCDEF$ . The first is tangent to $\overline{AB}$ , and the second is tangent to $\overline{DE}$ . Both are tangent to lines $BC$ and $FA$ . What is the ratio of the area of the second circle to that of the first circle?
$\textbf{(A)}\ 18 \qquad  \textbf{(B)}\ 27 \qquad \textbf{(C)}\ 36 \qquad \textbf{(D)}\ 81 \qquad \textbf{(E)}\ 108$

Solution: As above, we note that the first circle is inscribed in an equilateral triangle of sidelength 1 (if we assume, WLOG, that the regular hexagon has sidelength 1). The inradius of an equilateral triangle with sidelength 1 is equal to $\frac{\sqrt{3}}{6}$ . Therefore, the area of the first circle is $(\frac{\sqrt{3}}{6})^2 \cdot \pi =\frac{\pi}{12}$
Call the center of the second circle $O$ . Now we drop a perpendicular from $O$ to Circle O's point of tangency with $GK$ and draw another line connecting O to G. Note that because triangle $BGA$ is equilateral, $\angle BGA=60^{\circ}$ $OG$ bisects $\angle BGA$ , so we have a 30-60-90 triangle.
Call the radius of Circle O $r$ $OG=2r= \text{height of equilateral triangle} + \text{height of regular hexagon} + r$
The height of an equilateral triangle of sidelength 1 is $\frac{\sqrt{3}}{2}$ . The height of a regular hexagon of sidelength 1 is $\sqrt{3}$ . Therefore, $OG=\frac{\sqrt{3}}{2} + \sqrt{3} + r$
We can now set up the following equation:
$\frac{\sqrt{3}}{2} + \sqrt{3} + r=2r$
$\frac{\sqrt{3}}{2} + \sqrt{3}=r$
$\frac{3\sqrt{3}}{2}=r$
The area of Circle O equals $\pi r^2=\frac{27}{4} \pi$
Therefore, the ratio of the areas is $\frac{\frac{27}{4}}{\frac{1}{12}}=\boxed{81}$

Answer: D 81
Problem: Seven distinct pieces of candy are to be distributed among three bags. The red bag and the blue bag must each receive at least one piece of candy; the white bag may remain empty. How many arrangements are possible?
$\textbf{(A)}\ 1930 \qquad \textbf{(B)}\ 1931 \qquad \textbf{(C)}\ 1932 \qquad \textbf{(D)}\ 1933 \qquad \textbf{(E)}\ 1934$

Solution: We can count the total number of ways to distribute the candies (ignoring the restrictions), and then subtract the overcount to get the answer.
Each candy has three choices; it can go in any of the three bags.
Since there are seven candies, that makes the total distribution $3^7=2187$
To find the overcount, we calculate the number of invalid distributions: the red or blue bag is empty.
The number of distributions such that the red bag is empty is equal to $2^7$ , since it's equivalent to distributing the $7$ candies into $2$ bags.
We know that the number of distributions with the blue bag is empty will be the same number because of the symmetry, so it's also $2^7$
The case where both the red and the blue bags are empty (all $7$ candies are in the white bag) are included in both of the above calculations, and this case has only $1$ distribution.
The total overcount is $2^7+2^7-1=2^8-1$
The final answer will be $\text{total}-\text{overcount}=2187-(2^8-1) = 2187-256+1=1931+1=\boxed{1932}$

Answer: C 1932
Problem: Seven distinct pieces of candy are to be distributed among three bags. The red bag and the blue bag must each receive at least one piece of candy; the white bag may remain empty. How many arrangements are possible?
$\textbf{(A)}\ 1930 \qquad \textbf{(B)}\ 1931 \qquad \textbf{(C)}\ 1932 \qquad \textbf{(D)}\ 1933 \qquad \textbf{(E)}\ 1934$

Solution: We can use to our advantage the answer choices $\text{AMC}$ has given us, and eliminate the obvious wrong answer choices.
We can first figure out how many ways there are to take two candies from seven distinct candies to place them into the red/blue bags: $7\cdot 6=42$
Now we can look at the answer choices to find out which ones are divisible by $42$ , since the total number of combinations must be $42$ multiplied by some other number.
Since answers A, B, D, and E are not divisible by 3 (divisor of 42), the answer must be $\boxed{1932}$

Answer: C 1932
Problem: Seven distinct pieces of candy are to be distributed among three bags. The red bag and the blue bag must each receive at least one piece of candy; the white bag may remain empty. How many arrangements are possible?
$\textbf{(A)}\ 1930 \qquad \textbf{(B)}\ 1931 \qquad \textbf{(C)}\ 1932 \qquad \textbf{(D)}\ 1933 \qquad \textbf{(E)}\ 1934$

Solution: Let $r$ be the number of red bag candies. For ${1 \leq r \leq 6}$
So the number of candies left for the blue bag and the red bag is $7-r$ . Based on the problem, 1 candy must be fixed for the blue bag, which can be done $7-r$ ways. Now, before we continue, we need to realize that fixing a candy can lead to some over counting in cases where none in the white bag overlap. So we should try and find an alternative because we'll be over counting more than twice, and that will become extremely difficult to account for each case's over counting.
So, without fixing candies, we can put everything into options and work on the white bag, because once we figure out two bags, the remaining one is decided.
The options for the candies in the white bag are two: In the white bag or out of the white bag(by default, in the blue bag).
Now, for choosing the red bag, we have ${7 \choose r}$
Then, we have for the white bag: $2^{7-r}$ . Because we aren't fixing one for blue, the power is $7-r$ instead of $7-r-1$
We have: $({7 \choose r}) \cdot (2^{7-r})$ Adding them up for ${1 \leq r \leq 6}$ , we get 2058.
Now, for the invalid cases. Because we didn't fix candy for the blue bag, we need to subtract the cases where the blue bag remains empty. We can accomplish this pretty easily.
When $r = 6$ , how many ways can the remaining 1 candy $not$ be placed in the blue bag. This can be done ${7 \choose 1} = 7$ ways.
When $r = 5$ , how many ways can the remaining 2 candies $not$ be placed in the blue bag. This can be done ${7 \choose 2} = 21$ ways.
When $r = 4$ , how many ways can the remaining 3 candies $not$ be placed in the blue bag. This can be done ${7 \choose 3} = 35$ ways.
And because ${7 \choose 4} = {7 \choose 3}, {7 \choose 5} = {7 \choose 2}, and {7 \choose 6} = {7 \choose 1}$ , we just multiply by two.
Finally, we have: $2058 - 2 \cdot (7+21+35) = 2058 - 126 = \boxed{1932}$

Answer: C 1932
Problem: The entries in a $3 \times 3$ array include all the digits from $1$ through $9$ , arranged so that the entries in every row and column are in increasing order. How many such arrays are there?
$\textbf{(A)}\ 18 \qquad \textbf{(B)}\ 24 \qquad \textbf{(C)}\ 36 \qquad \textbf{(D)}\ 42 \qquad \textbf{(E)}\ 60$

Solution: Observe that all tables must have 1s and 9s in the corners, 8s and 2s next to those corner squares, and 4-6 in the middle square. Also note that for each table, there exists a valid table diagonally symmetrical across the diagonal extending from the top left to the bottom right.
\[\begin{tabular}{|c|c|c|} \hline 1&2&\\ \hline 3&4&8\\ \hline &&9\\ \hline \end{tabular} \;\;\; \begin{tabular}{|c|c|c|} \hline 1&2&\\ \hline 3&4&\\ \hline &8&9\\ \hline \end{tabular}\]
3 necessarily must be placed as above. Any number could fill the isolated square, but the other 2 are then invariant. So, there are 3 cases each and 6 overall cases. Given diagonal symmetry, alternate 2 and 8 placements yield symmetrical cases. $2*6=12$
\[\begin{tabular}{|c|c|c|} \hline 1&2&3\\ \hline 4&5&\\ \hline &8&9\\ \hline \end{tabular} \;\;\; \begin{tabular}{|c|c|c|} \hline 1&2&\\ \hline 3&5&\\ \hline &8&9\\ \hline \end{tabular} \;\;\; \begin{tabular}{|c|c|c|} \hline 1&2&\\ \hline 3&5&8\\ \hline &&9\\ \hline \end{tabular} \;\;\; \begin{tabular}{|c|c|c|} \hline 1&2&3\\ \hline 4&5&8\\ \hline &&9\\ \hline \end{tabular}\]
Here, no 3s or 7s are assured, but this is only a teensy bit trickier and messier. WLOG, casework with 3 instead of 7 as above. Remembering that $4<5$ , logically see that the numbers of cases are then 2,3,3,1 respectively. By symmetry, $2*9=18$
By inspection, realize that this is symmetrical to case 1 except that the 7s instead of the 3s are assured. $2*6=12$
\[12+18+12=\boxed{42}\]

Answer: D 42
Problem: The entries in a $3 \times 3$ array include all the digits from $1$ through $9$ , arranged so that the entries in every row and column are in increasing order. How many such arrays are there?
$\textbf{(A)}\ 18 \qquad \textbf{(B)}\ 24 \qquad \textbf{(C)}\ 36 \qquad \textbf{(D)}\ 42 \qquad \textbf{(E)}\ 60$

Solution: This solution is trivial by the hook length theorem. The hooks look like this:
$\begin{tabular}{|c|c|c|} \hline 5 & 4 & 3 \\ \hline 4 & 3 & 2\\ \hline 3 & 2 & 1\\ \hline \end{tabular}$
So, the answer is $\frac{9!}{5 \cdot 4 \cdot 3 \cdot 4 \cdot 3 \cdot 2 \cdot 3 \cdot 2 \cdot 1}$ $\boxed{42}$

Answer: D 42
Problem: A high school basketball game between the Raiders and Wildcats was tied at the end of the first quarter. The number of points scored by the Raiders in each of the four quarters formed an increasing geometric sequence, and the number of points scored by the Wildcats in each of the four quarters formed an increasing arithmetic sequence. At the end of the fourth quarter, the Raiders had won by one point. Neither team scored more than $100$ points. What was the total number of points scored by the two teams in the first half?
$\textbf{(A)}\ 30 \qquad \textbf{(B)}\ 31 \qquad \textbf{(C)}\ 32 \qquad \textbf{(D)}\ 33 \qquad \textbf{(E)}\ 34$

Solution: Let $a,ar,ar^{2},ar^{3}$ be the quarterly scores for the Raiders. We know $r > 1$ because the sequence is said to be increasing. We also know that each of $a, ar, ar^2, ar^3$ is an integer. We start by showing that $r$ must also be an integer.
Suppose not, and say $r = m/n$ where $m>n>1$ , and $\gcd(m,n)=1$ . Then $n, n^2, n^3$ must all divide $a$ so $a=n^3k$ for some integer $k$ . Then $S_R = n^3k + n^2mk + nm^2k + m^3k < 100$ and we see that even if $k=1$ and $n=2$ , we get $m < 4$ , which means that the only option for $r$ is $r=3/2$ . A quick check shows that even this doesn't work. Thus $r$ must be an integer.
Let $a, a+d, a+2d, a+3d$ be the quarterly scores for the Wildcats. Let $S_W = a+(a+d) + (a+2d)+(a+3d) = 4a+6d$ . Let $S_R = a+ar+ar^2+ar^3 = a(1+r)(1+r^2)$ . Then $S_R<100$ implies that $r<5$ , so $r\in \{2, 3, 4\}$ . The Raiders win by one point, so \[a(1+r)(1+r^2) = 4a+6d+1.\]
Then the quarterly scores for the Raiders are $5, 10, 20, 40$ , and those for the Wildcats are $5, 14, 23, 32$ . Also $S_R = 75 = S_W + 1$ . The total number of points scored by the two teams in the first half is $5+10+5+14=\boxed{34}$

Answer: E 34
Problem: A high school basketball game between the Raiders and Wildcats was tied at the end of the first quarter. The number of points scored by the Raiders in each of the four quarters formed an increasing geometric sequence, and the number of points scored by the Wildcats in each of the four quarters formed an increasing arithmetic sequence. At the end of the fourth quarter, the Raiders had won by one point. Neither team scored more than $100$ points. What was the total number of points scored by the two teams in the first half?
$\textbf{(A)}\ 30 \qquad \textbf{(B)}\ 31 \qquad \textbf{(C)}\ 32 \qquad \textbf{(D)}\ 33 \qquad \textbf{(E)}\ 34$

Solution: Let $a,ar,ar^{2},ar^{3}$ be the quarterly scores for the Raiders. We know that the Raiders and Wildcats both scored the same number of points in the first quarter so let $a,a+d,a+2d,a+3d$ be the quarterly scores for the Wildcats. The sum of the Raiders scores is $a(1+r+r^{2}+r^{3})$ and the sum of the Wildcats scores is $4a+6d$ . Now we can narrow our search for the values of $a,d$ , and $r$ . Because points are always measured in positive integers, we can conclude that $a$ and $d$ are positive integers. We can also conclude that $r$ is a positive integer by writing down the equation:
\[a(1+r+r^{2}+r^{3})=4a+6d+1\]
Now we can start trying out some values of $r$ . We try $r=2$ , which gives
\[15a=4a+6d+1\]
\[11a=6d+1\]
We need the smallest multiple of $11$ (to satisfy the <100 condition) that is $\equiv 1 \pmod{6}$ . We see that this is $55$ , and therefore $a=5$ and $d=9$
So the Raiders' first two scores were $5$ and $10$ and the Wildcats' first two scores were $5$ and $14$
\[5+10+5+14=34 \longrightarrow \boxed{34}\]

Answer: E 34
Problem: Let $a > 0$ , and let $P(x)$ be a polynomial with integer coefficients such that
What is the smallest possible value of $a$
$\textbf{(A)}\ 105 \qquad \textbf{(B)}\ 315 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 7! \qquad \textbf{(E)}\ 8!$

Solution: We observe that because $P(1) = P(3) = P(5) = P(7) = a$ , if we define a new polynomial $R(x)$ such that $R(x) = P(x) - a$ $R(x)$ has roots when $P(x) = a$ ; namely, when $x=1,3,5,7$
Thus since $R(x)$ has roots when $x=1,3,5,7$ , we can factor the product $(x-1)(x-3)(x-5)(x-7)$ out of $R(x)$ to obtain a new polynomial $Q(x)$ such that $(x-1)(x-3)(x-5)(x-7)(Q(x)) = R(x) = P(x) - a$
Then, plugging in values of $2,4,6,8,$ we get
\[P(2)-a=(2-1)(2-3)(2-5)(2-7)Q(2) = -15Q(2) = -2a\] \[P(4)-a=(4-1)(4-3)(4-5)(4-7)Q(4) = 9Q(4) = -2a\] \[P(6)-a=(6-1)(6-3)(6-5)(6-7)Q(6) = -15Q(6) = -2a\] \[P(8)-a=(8-1)(8-3)(8-5)(8-7)Q(8) = 105Q(8) = -2a\]
$-2a=-15Q(2)=9Q(4)=-15Q(6)=105Q(8).$ Thus, the least value of $a$ must be the $\text{lcm}(15,9,15,105)$ .
Solving, we receive $315$ , so our answer is $\boxed{315}$

Answer: B 315
Problem: Let $a > 0$ , and let $P(x)$ be a polynomial with integer coefficients such that
What is the smallest possible value of $a$
$\textbf{(A)}\ 105 \qquad \textbf{(B)}\ 315 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 7! \qquad \textbf{(E)}\ 8!$

Solution: The evenly-spaced data suggests using discrete derivatives to tackle this problem.  First, note that any polynomial of degree $n$
can also be written as
Moreover, the coefficients $a_i$ are integers for $i=1, 2, \ldots n$ iff the coefficients $b_i$ are integers for $i=1, 2, \ldots n$ .  This latter form is convenient for calculating discrete derivatives of $P(x)$
The discrete derivative of a function $f(x)$ is the related function $\Delta f(x)$ defined as
With this definition, it's easy to see that for any positive integer $k$ we have
This in turn allows us to use successive discrete derivatives evaluated at $x=1$ to calculate all of the coefficients $b_i$ using
We can also calculate the following table of discrete derivatives based on the data points given in the problem statement:
Thus we can read down the column for $x=1$ to find that $k! b_k = (-2)^k a$ for $k = 0, 1, \ldots, 7$ .  Interestingly, even if we choose $P(x)$ to have degree greater than $7$ , the $8$ coefficients of lowest order always satisfy these conditions.  Moreover, it's straightforward to show that the $P(x)$ of degree $7$ with $b_k$ satisfying these conditions will fit the data given in the problem statement.  Thus, to find minimal necessary and sufficient conditions on the value of $a$ , we need only consider these $8$ equations.  As a result, $P(x)$ with integer coefficients fitting the given data exists iff $k!$ divides $2^k a$ for $k = 0, 1, \ldots, 7$ .  In other words, it's necessary and sufficient that
The last condition holds if $7 \cdot 3 \cdot 5 \cdot 3 = 315$ divides evenly into $a$ .  Since such $a$ will also satisfy the first $7$ conditions, our answer is $\boxed{315}$

Answer: B 315
Problem: One can holds $12$ ounces of soda, what is the minimum number of cans needed to provide a gallon ( $128$ ounces) of soda?
$\textbf{(A)}\ 7\qquad \textbf{(B)}\ 8\qquad \textbf{(C)}\ 9\qquad \textbf{(D)}\ 10\qquad \textbf{(E)}\ 11$

Solution: $10$ cans would hold $120$ ounces, but $128>120$ , so $11$ cans are required. Thus, the answer is $\mathrm{\boxed{11}$

Answer: E 11
Problem: Four coins are picked out of a piggy bank that contains a collection of pennies, nickels, dimes, and quarters. Which of the following could not be the total value of the four coins, in cents?
$\textbf{(A)}\ 15 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 35 \qquad \textbf{(D)}\ 45 \qquad \textbf{(E)}\ 55$

Solution: As all five options are divisible by $5$ , we may not use any pennies. (This is because a penny is the only coin that is not divisible by $5$ , and if we used between $1$ and $4$ pennies, the sum would not be divisible by $5$ .)
Hence the smallest coin we can use is a nickel, and thus the smallest amount we can get is $4\cdot 5 = 20$ . Therefore the option that is not reachable is $\boxed{15}$ $\Rightarrow$ $(A)$

Answer:  15
Problem: What is the sum of the digits of the square of $\text 111111111$
$\mathrm{(A)}\ 18\qquad\mathrm{(B)}\ 27\qquad\mathrm{(C)}\ 45\qquad\mathrm{(D)}\ 63\qquad\mathrm{(E)}\ 81$

Solution: Using the standard multiplication algorithm, $111,111,111^2=12,345,678,987,654,321,$ whose digit sum is $\boxed{81.}$

Answer: E 81.
Problem: What is the sum of the digits of the square of $\text 111111111$
$\mathrm{(A)}\ 18\qquad\mathrm{(B)}\ 27\qquad\mathrm{(C)}\ 45\qquad\mathrm{(D)}\ 63\qquad\mathrm{(E)}\ 81$

Solution: We note that
$1^2 = 1$
$11^2 = 121$
$111^2 = 12321$
and $1,111^2 = 1234321$
We can clearly see the pattern: If $X$ is $111\cdots111$ , with $n$ ones (and for the sake of simplicity, assume that $n<10$ ), then the sum of the digits of $X^2$ is
$1+2+3+4+5\cdots n+(n-1)+(n-2)\cdots+1$
$=(1+2+3\cdots n)+(1+2+3+\cdots n-1)$
$=\dfrac{n(n+1)}{2}+\dfrac{(n-1)n}{2}$
$=\dfrac{n(n+1+n-1)}{2}=\dfrac{2n^2}{2}=n^2.$
Aha! We know that $111,111,111$ has $9$ digits, so its digit sum is $9^2=\boxed{81}$

Answer: E 81
Problem: What is the sum of the digits of the square of $\text 111111111$
$\mathrm{(A)}\ 18\qquad\mathrm{(B)}\ 27\qquad\mathrm{(C)}\ 45\qquad\mathrm{(D)}\ 63\qquad\mathrm{(E)}\ 81$

Solution: We see that $111^2$ can be written as $111(100+10+1)=11100+1110+111=12321$
We can apply this strategy to find $111,111,111^2$ , as seen below.
$111111111^2=111111111(100000000+10000000\cdots+10+1)$
$=11111111100000000+1111111110000000+\cdots+111111111$
$=12,345,678,987,654,321$
The digit sum is thus $1+2+3+4+5+6+7+8+9+8+7+6+5+4+3+2+1=81 \boxed{81}$

Answer: E 81
Problem: One dimension of a cube is increased by $1$ , another is decreased by $1$ , and the third is left unchanged. The volume of the new rectangular solid is $5$ less than that of the cube. What was the volume of the cube?
$\textbf{(A)}\ 8 \qquad \textbf{(B)}\ 27 \qquad \textbf{(C)}\ 64 \qquad \textbf{(D)}\ 125 \qquad \textbf{(E)}\ 216$

Solution: Let the original cube have edge length $a$ . Then its volume is $a^3$ .
The new box has dimensions $a-1$ $a$ , and $a+1$ , hence its volume is $(a-1)a(a+1) = a^3-a$ . 
The difference between the two volumes is $a$ . As we are given that the difference is $5$ , we have $a=5$ , and the volume of the original cube was $5^3 = 125\Rightarrow\boxed{125}$

Answer: D 125
Problem: In quadrilateral $ABCD$ $AB = 5$ $BC = 17$ $CD = 5$ $DA = 9$ , and $BD$ is an integer. What is $BD$
$\textbf{(A)}\ 11 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 15$

Solution: By the triangle inequality we have $BD < DA + AB = 9 + 5 = 14$ , and also $BD + CD > BC$ , hence $BD > BC - CD = 17 - 5 = 12$
We get that $12 < BD < 14$ , and as we know that $BD$ is an integer, we must have $BD=\boxed{13}$

Answer:  13
Problem: Suppose that $P = 2^m$ and $Q = 3^n$ . Which of the following is equal to $12^{mn}$ for every pair of integers $(m,n)$
$\textbf{(A)}\ P^2Q \qquad \textbf{(B)}\ P^nQ^m \qquad \textbf{(C)}\ P^nQ^{2m} \qquad \textbf{(D)}\ P^{2m}Q^n \qquad \textbf{(E)}\ P^{2n}Q^m$

Solution: We have $12^{mn} = (2\cdot 2\cdot 3)^{mn} = 2^{2mn} \cdot 3^{mn} = (2^m)^{2n} \cdot (3^n)^m = \boxed{2}$

Answer: E 2
Problem: Four congruent rectangles are placed as shown. The area of the outer square is $4$ times that of the inner square. What is the ratio of the length of the longer side of each rectangle to the length of its shorter side?
$\textbf{(A)}\ 3 \qquad \textbf{(B)}\ \sqrt {10} \qquad \textbf{(C)}\ 2 + \sqrt2 \qquad \textbf{(D)}\ 2\sqrt3 \qquad \textbf{(E)}\ 4$

Solution: Let the side length of the smaller square be $1$ , and let the smaller side of the rectangles be $y$ . Since the larger square's area is four times larger than the smaller square's, the larger square's side length is $2$ $2$ is equivalent to $2y+1$ , giving $y=1/2$ . Then, the longer side of the rectangles is $3/2$ $\frac{\frac{3}{2}}{\frac{1}{2}}=\boxed{3}$

Answer:  3
Problem: The figures $F_1$ $F_2$ $F_3$ , and $F_4$ shown are the first in a sequence of figures. For $n\ge3$ $F_n$ is constructed from $F_{n - 1}$ by surrounding it with a square and placing one more diamond on each side of the new square than $F_{n - 1}$ had on each side of its outside square. For example, figure $F_3$ has $13$ diamonds. How many diamonds are there in figure $F_{20}$
$\textbf{(A)}\ 401 \qquad \textbf{(B)}\ 485 \qquad \textbf{(C)}\ 585 \qquad \textbf{(D)}\ 626 \qquad \textbf{(E)}\ 761$

Solution: Split $F_n$ into $4$ congruent triangles by its diagonals (like in the pictures in the problem). This shows that the number of diamonds it contains is equal to $4$ times the $(n-2)$ th triangular number (i.e. the diamonds within the triangles or between the diagonals) and $4(n-1)+1$ (the diamonds on sides of the triangles or on the diagonals). The $n$ th triangular number is $\frac{n(n+1)}{2}$ . Putting this together for $F_{20}$ this gives:
$\frac{4(18)(19)}{2}+4(19)+1=\boxed{761}$

Answer:  761