Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: When $n$ standard six-sided dice are rolled, the product of the numbers rolled can be any of $936$ possible values. What is $n$
$\textbf{(A)}~11\qquad\textbf{(B)}~6\qquad\textbf{(C)}~8\qquad\textbf{(D)}~10\qquad\textbf{(E)}~9$

Solution: The product can be written as \begin{align*} 2^x 3^y 5^z \end{align*}
Letting $n=1$ , we get $(x,y,z)=(0,0,0),(0,0,1),(0,1,0),(1,0,0),(1,1,0),(2,0,0)$ , 6 possible values. But if the only restriction of the product if that $2x\le n,y\le n,z\le n$ , we can get $(2+1)(1+1)(1+1)=12$ possible values. We calculate the ratio \[r = \frac{\text{possible values of real situation}}{\text{possible values of ideal situation}} = \frac{6}{12}=0.5.\]
Letting $n=2$ , we get $(x,y,z)=(0,0,0),(0,0,1),(0,0,2),(0,1,0),(0,1,1),(1,0,0),(1,0,1),(1,1,0),(1,1,1),(1,2,0),$ $(2,0,0),(2,0,1),(2,1,0),(2,2,0),(3,0,0),(3,1,0),(4,0,0)$ , 17 possible values.
The number of possibilities in the ideal situation is $5*3*3=45$ , making $r = 17/45 \approx 0.378$
Now we can predict the trend of $r$ : as $n$ increases, $r$ decreases.
Letting $n=3$ , you get possible values of ideal situation= $7*4*4=112$ $n=4$ , the number= $9*5*5=225$ $n=5$ , the number= $11*6*6=396$ $n=6$ , the number= $13*7*7=637,637<936$ so 6 is not the answer. $n=7$ , the number= $15*8*8=960$ $n=8$ , the number= $17*9*9=1377$ ,but $1377*0.378$ $521$ still much smaller than 936. $n=9$ , the number= $19*10*10=1900$ ,but $1900*0.378$ $718$ still smaller than 936. $n=10$ , the number= $21*11*11=2541$ $2541*0.378$ $960$ is a little bigger 936, but the quotient of (possible values of real situation)/(possible values of ideal situation) is much smaller than 0.378 now, so 10 is probably not the answer,so the answer is $\boxed{11}$

Answer: A 11
Problem: Suppose that $a$ $b$ $c$ and $d$ are positive integers satisfying all of the following relations.
\[abcd=2^6\cdot 3^9\cdot 5^7\] \[\text{lcm}(a,b)=2^3\cdot 3^2\cdot 5^3\] \[\text{lcm}(a,c)=2^3\cdot 3^3\cdot 5^3\] \[\text{lcm}(a,d)=2^3\cdot 3^3\cdot 5^3\] \[\text{lcm}(b,c)=2^1\cdot 3^3\cdot 5^2\] \[\text{lcm}(b,d)=2^2\cdot 3^3\cdot 5^2\] \[\text{lcm}(c,d)=2^2\cdot 3^3\cdot 5^2\]
What is $\text{gcd}(a,b,c,d)$
$\textbf{(A)}~30\qquad\textbf{(B)}~45\qquad\textbf{(C)}~3\qquad\textbf{(D)}~15\qquad\textbf{(E)}~6$

Solution: Denote by $\nu_p (x)$ the number of prime factor $p$ in number $x$
We index Equations given in this problem from (1) to (7).
First, we compute $\nu_2 (x)$ for $x \in \left\{ a, b, c, d \right\}$
Equation (5) implies $\max \left\{ \nu_2 (b), \nu_2 (c) \right\} = 1$ .
Equation (2) implies $\max \left\{ \nu_2 (a), \nu_2 (b) \right\} = 3$ .
Equation (6) implies $\max \left\{ \nu_2 (b), \nu_2 (d) \right\} = 2$ .
Equation (1) implies $\nu_2 (a) + \nu_2 (b) + \nu_2 (c) + \nu_2 (d) = 6$
Therefore, all above jointly imply $\nu_2 (a) = 3$ $\nu_2 (d) = 2$ , and $\left( \nu_2 (b), \nu_2 (c) \right) = \left( 0 , 1 \right)$ or $\left( 1, 0 \right)$
Second, we compute $\nu_3 (x)$ for $x \in \left\{ a, b, c, d \right\}$
Equation (2) implies $\max \left\{ \nu_3 (a), \nu_3 (b) \right\} = 2$ .
Equation (3) implies $\max \left\{ \nu_3 (a), \nu_3 (c) \right\} = 3$ .
Equation (4) implies $\max \left\{ \nu_3 (a), \nu_3 (d) \right\} = 3$ .
Equation (1) implies $\nu_3 (a) + \nu_3 (b) + \nu_3 (c) + \nu_3 (d) = 9$
Therefore, all above jointly imply $\nu_3 (c) = 3$ $\nu_3 (d) = 3$ , and $\left( \nu_3 (a), \nu_3 (b) \right) = \left( 1 , 2 \right)$ or $\left( 2, 1 \right)$
Third, we compute $\nu_5 (x)$ for $x \in \left\{ a, b, c, d \right\}$
Equation (5) implies $\max \left\{ \nu_5 (b), \nu_5 (c) \right\} = 2$ .
Equation (2) implies $\max \left\{ \nu_5 (a), \nu_5 (b) \right\} = 3$ .
Thus, $\nu_5 (a) = 3$
From Equations (5)-(7), we have either $\nu_5 (b) \leq 1$ and $\nu_5 (c) = \nu_5 (d) = 2$ , or $\nu_5 (b) = 2$ and $\max \left\{ \nu_5 (c), \nu_5 (d) \right\} = 2$
Equation (1) implies $\nu_5 (a) + \nu_5 (b) + \nu_5 (c) + \nu_5 (d) = 7$ .
Thus, for $\nu_5 (b)$ $\nu_5 (c)$ $\nu_5 (d)$ , there must be two 2s and one 0.
Therefore, \begin{align*} {\rm gcd} (a,b,c,d) & = \Pi_{p \in \{ 2, 3, 5\}} p^{\min\{ \nu_p (a), \nu_p(b) , \nu_p (c), \nu_p(d) \}} \\ & = 2^0 \cdot 3^1 \cdot 5^0 \\ & = \boxed{3}

Answer: C 3
Problem: The $\textit{taxicab distance}$ between points $(x_1, y_1)$ and $(x_2, y_2)$ in the coordinate plane is given by \[|x_1 - x_2| + |y_1 - y_2|.\] For how many points $P$ with integer coordinates is the taxicab distance between $P$ and the origin less than or equal to $20$
$\textbf{(A)} \, 441 \qquad\textbf{(B)} \, 761 \qquad\textbf{(C)} \, 841 \qquad\textbf{(D)} \, 921  \qquad\textbf{(E)} \, 924$

Solution: Let us consider the number of points for a certain $x$ -coordinate. For any $x$ , the viable points are in the range $[-20 + |x|, 20 - |x|]$ . This means that our total sum is equal to \begin{align*} 1 + 3 + 5 + \cdots + 41 + 39 + 37 + \cdots + 1 &= (1 + 3 + 5 + \cdots + 39) + (1 + 3 + 5 + \cdots + 41) \\ & = 20^2 + 21^2 \\ & = 29^2 \\ &= \boxed{841} ~mathboy100

Answer: C 841
Problem: The $\textit{taxicab distance}$ between points $(x_1, y_1)$ and $(x_2, y_2)$ in the coordinate plane is given by \[|x_1 - x_2| + |y_1 - y_2|.\] For how many points $P$ with integer coordinates is the taxicab distance between $P$ and the origin less than or equal to $20$
$\textbf{(A)} \, 441 \qquad\textbf{(B)} \, 761 \qquad\textbf{(C)} \, 841 \qquad\textbf{(D)} \, 921  \qquad\textbf{(E)} \, 924$

Solution: Since the second point is the origin, this is equivalent to finding all points $(x, y)$ such that $|x| + |y| \leq 20$ . Due to the absolute values, the set of all such points will be symmetric about the origin meaning we can focus on the first quadrant and multiply by $4$
To avoid overcounts, ignore points on the axes. This means $x, y > 0$ . If $x = 1$ , there are $19$ solutions for $y$ $y = 1, 2, 3, \ldots, 19$ ). If $x = 2$ , there are $18$ solutions. This pattern repeats until $x = 19$ , at which point there is $1$ solution for $y$
So we get $19 + 18 + 17 + \cdots + 1 = \frac{19(20)}{2} = 190$ points in the first quadrant. Multiplying by $4$ gives $760$ . Now, the $x$ axis has $y = 0$ which gives $|x| \leq 20$ , meaning there are $41$ solutions. This is the same with the $y$ axis, but we overcounted the origin by $1$
Our final answer is $760 + 41 + 41 - 1 = \boxed{841}$

Answer: C 841
Problem: The $\textit{taxicab distance}$ between points $(x_1, y_1)$ and $(x_2, y_2)$ in the coordinate plane is given by \[|x_1 - x_2| + |y_1 - y_2|.\] For how many points $P$ with integer coordinates is the taxicab distance between $P$ and the origin less than or equal to $20$
$\textbf{(A)} \, 441 \qquad\textbf{(B)} \, 761 \qquad\textbf{(C)} \, 841 \qquad\textbf{(D)} \, 921  \qquad\textbf{(E)} \, 924$

Solution: This solution refers to the Diagram section. [asy] /* Made by MRENTHUSIASM */ size(350);   for (int y = 20; y >= 1; --y) { 	for (int x = 0; x <= 20-y; ++x) {     	dot((x,y),green+linewidth(4));     } }  for (int y = 0; y >= -20; --y) { 	for (int x = 1; x <= y+20; ++x) {     	dot((x,y),blue+linewidth(4));     } }  for (int y = 20; y >= 0; --y) { 	for (int x = y-20; x <= -1; ++x) {     	dot((x,y),purple+linewidth(4));     } }  for (int y = -1; y >= -20; --y) { 	for (int x = -y-20; x <= 0; ++x) {     	dot((x,y),red+linewidth(4));     } }  dot(origin,black+linewidth(4)); [/asy] The problem can be visualized as depicted on the right split equally into four "triangular" parts excluding the origin. The "triangular" parts are identical the ones that would be used in a visual proof of the formula for triangular numbers. Becuase of this the number of points in each part is equal to $\frac{n(n+1)}{2}$ where $n$ is the length of a "leg" of the "triangle" which is $20$ for this problem. Substituting and computing, we get $210.$ Multiplying by $4$ and adding $1$ to account for all parts and the origin, we get $210\cdot4 + 1 = \boxed{841}.$

Answer: C 841
Problem: The $\textit{taxicab distance}$ between points $(x_1, y_1)$ and $(x_2, y_2)$ in the coordinate plane is given by \[|x_1 - x_2| + |y_1 - y_2|.\] For how many points $P$ with integer coordinates is the taxicab distance between $P$ and the origin less than or equal to $20$
$\textbf{(A)} \, 441 \qquad\textbf{(B)} \, 761 \qquad\textbf{(C)} \, 841 \qquad\textbf{(D)} \, 921  \qquad\textbf{(E)} \, 924$

Solution: This solution refers to the Diagram section.
As shown below, the taxicab distance between each red point and the origin is even, and the taxicab distance between each blue point and the origin is odd. [asy] /* Made by MRENTHUSIASM */ size(350);   for (int y = 20; y >= 0; --y) { 	for (int x = y-20; x <= 20-y; x+=2) {     	dot((x,y),red+linewidth(4));     } }  for (int y = -1; y >= -20; --y) { 	for (int x = -y-20; x <= y+20; x+=2) {     	dot((x,y),red+linewidth(4));     } }  for (int y = 19; y >= 0; --y) { 	for (int x = y-19; x <= 19-y; x+=2) {     	dot((x,y),blue+linewidth(4));     } }  for (int y = -1; y >= -19; --y) { 	for (int x = -y-19; x <= y+19; x+=2) {     	dot((x,y),blue+linewidth(4));     } }  draw((20,0)--(0,20)--(-20,0)--(0,-20)--cycle,red+linewidth(1.25)); draw((19,0)--(0,19)--(-19,0)--(0,-19)--cycle,blue+linewidth(1.25)); [/asy] Note that the red array consists of $21^2=441$ points, and the blue array consists of $20^2=400$ points.
Together, the answer is $441+400=\boxed{841}.$

Answer: C 841
Problem: The $\textit{taxicab distance}$ between points $(x_1, y_1)$ and $(x_2, y_2)$ in the coordinate plane is given by \[|x_1 - x_2| + |y_1 - y_2|.\] For how many points $P$ with integer coordinates is the taxicab distance between $P$ and the origin less than or equal to $20$
$\textbf{(A)} \, 441 \qquad\textbf{(B)} \, 761 \qquad\textbf{(C)} \, 841 \qquad\textbf{(D)} \, 921  \qquad\textbf{(E)} \, 924$

Solution: Let $P = (x, y)$ . Since the problem asks for taxicab distances from the origin, we want $|x| + |y| \le 20$ . The graph of all solutions to this equation on the $xy$ -plane is a square with vertices at $(0, \pm 20)$ and $(\pm 20, 0)$ (In order to prove this, one can divide the sections of this graph into casework on the four quadrants, and tie together the resulting branches.) We want the number of lattice points on the border of the square and inside the square. 
Each side of the square goes through an equal number of lattice points, so if we focus on one side going from $(0,20)$ to $(20, 0)$ , we can see that it goes through $21$ points in total. In addition, each of the vertices gets counted twice, so the total number of border points is $21\cdot4 - 4 = 80$ . Also, the area of the square is $800$ , so when we plug this information inside Pick's theorem, we get $800 = i + \frac{80}{2} - 1 \implies i = 761$ . Then our answer is $761+80 = \boxed{841}.$

Answer: C 841
Problem: The $\textit{taxicab distance}$ between points $(x_1, y_1)$ and $(x_2, y_2)$ in the coordinate plane is given by \[|x_1 - x_2| + |y_1 - y_2|.\] For how many points $P$ with integer coordinates is the taxicab distance between $P$ and the origin less than or equal to $20$
$\textbf{(A)} \, 441 \qquad\textbf{(B)} \, 761 \qquad\textbf{(C)} \, 841 \qquad\textbf{(D)} \, 921  \qquad\textbf{(E)} \, 924$

Solution: Instead of considering all points with integer coordinates, first consider points with nonnegative coordinates only. Then, we want $x + y \le 20$ where $x$ and $y$ are nonnegative integers. We can introduce a third variable, say $z$ , such that $z = 20 - (x + y)$ . Note that counting the number of ways to have $x + y + z = 20$ is the same as counting the number of ways to have $x + y \le 20$ . Therefore, by stars and bars, there are $\dbinom{20 + 3 - 1}{3 - 1} = 231$ solutions with nonnegative integer coordinates.
Then, we can copy our solutions over to the other four quadrants. First, so as not to overcount, we remove all points on the axes. There are $20 + 20 + 1 = 41$ such points with nonnegative integer coordinates. We multiply the $190$ remaining points by $4$ to get $760$ points that are not on the axes. Then, we can add back the $41$ nonnegative points on the axes, as well as the $40$ other points on the negative axes to get $760 + 41 + 40 = \boxed{841}.$

Answer: C 841
Problem: The infinite product \[\sqrt[3]{10} \cdot \sqrt[3]{\sqrt[3]{10}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{10}}} \cdots\] evaluates to a real number. What is that number?
$\textbf{(A) }\sqrt{10}\qquad\textbf{(B) }\sqrt[3]{100}\qquad\textbf{(C) }\sqrt[4]{1000}\qquad\textbf{(D) }10\qquad\textbf{(E) }10\sqrt[3]{10}$

Solution: We can write $\sqrt[3]{10}$ as $10 ^ \frac{1}{3}$ . Similarly, $\sqrt[3]{\sqrt[3]{10}} = (10 ^ \frac{1}{3}) ^ \frac{1}{3} = 10 ^ \frac{1}{3^2}$
By continuing this, we get the form \[10 ^ \frac{1}{3} \cdot 10 ^ \frac{1}{3^2} \cdot 10 ^ \frac{1}{3^3} \cdots,\] which is \[10 ^ {\frac{1}{3} + \frac{1}{3^2} + \frac{1}{3^3} + \cdots}.\] Using the formula for an infinite geometric series $S = \frac{a}{1-r}$ , we get \[\frac{1}{3} + \frac{1}{3^2} + \frac{1}{3^3} + \cdots = \frac{\frac{1}{3}}{1-\frac{1}{3}} = \frac{1}{2}.\] Thus, our answer is $10 ^ \frac{1}{2} = \boxed{10}$

Answer: A 10
Problem: The infinite product \[\sqrt[3]{10} \cdot \sqrt[3]{\sqrt[3]{10}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{10}}} \cdots\] evaluates to a real number. What is that number?
$\textbf{(A) }\sqrt{10}\qquad\textbf{(B) }\sqrt[3]{100}\qquad\textbf{(C) }\sqrt[4]{1000}\qquad\textbf{(D) }10\qquad\textbf{(E) }10\sqrt[3]{10}$

Solution: We can write this infinite product as $L$ (we know from the answer choices that the product must converge): \[L = \sqrt[3]{10} \cdot \sqrt[3]{\sqrt[3]{10}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{10}}} \cdots.\] If we raise everything to the third power, we get: \[L^3 =  10 \, \cdot \, \sqrt[3]{10} \, \cdot \, \sqrt[3]{\sqrt[3]{10}} \cdots = 10L \implies L^3 - 10L = 0 \implies L \in \left\{0, \pm \sqrt{10}\right\}.\] Since $L$ is positive (as it is an infinite product of positive numbers), it must be that $L = \boxed{10}.$

Answer: A 10
Problem: The infinite product \[\sqrt[3]{10} \cdot \sqrt[3]{\sqrt[3]{10}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{10}}} \cdots\] evaluates to a real number. What is that number?
$\textbf{(A) }\sqrt{10}\qquad\textbf{(B) }\sqrt[3]{100}\qquad\textbf{(C) }\sqrt[4]{1000}\qquad\textbf{(D) }10\qquad\textbf{(E) }10\sqrt[3]{10}$

Solution: Move the first term inside the second radical. We get \[\sqrt[3]{10} \cdot \sqrt[3]{\sqrt[3]{10}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{10}}} \cdots = \sqrt[3]{10\sqrt[3]{10}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{10}}} \cdots.\] Do this for the third radical as well: \[\sqrt[3]{10\sqrt[3]{10}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{10}}} \cdots = \sqrt[3]{10\sqrt[3]{10}\sqrt[3]{\sqrt[3]{10}}} \cdots = \sqrt[3]{10\sqrt[3]{10\sqrt[3]{10\cdots}}}.\] It is clear what the pattern is. Setting the answer as $P,$ we have \[P = \sqrt[3]{10P},\] from which $P = \boxed{10}.$

Answer:  10
Problem: What is the product of all real numbers $x$ such that the distance on the number line between $\log_6x$ and $\log_69$ is twice the distance on the number line between $\log_610$ and $1$
$\textbf{(A) } 10 \qquad \textbf{(B) } 18 \qquad \textbf{(C) } 25 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 81$

Solution: Let $a = 2 \cdot |\log_6 10 - 1| = |\log_6 9 - \log_6 x|  =  |\log_6 \frac{9}{x}|$
$\pm a = \log_6 \frac{9}{x} \implies 6^{\pm a} = b^{\pm 1} = \frac{9}{x}  \implies x = 9 \cdot b^{\pm 1}$
$9b^1 \cdot 9b^{-1} = \boxed{81}$

Answer:  81
Problem: What is the product of all real numbers $x$ such that the distance on the number line between $\log_6x$ and $\log_69$ is twice the distance on the number line between $\log_610$ and $1$
$\textbf{(A) } 10 \qquad \textbf{(B) } 18 \qquad \textbf{(C) } 25 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 81$

Solution: First, notice that there must be two such numbers: one greater than $\log_69$ and one less than it. Furthermore, they both have to be the same distance away, namely $2(\log_610 - 1)$ . Let these two numbers be $\log_6a$ and $\log_6b$ . Because they are equidistant from $\log_69$ , we have $\frac{\log_6a + \log_6b}{2} = \log_69$ . Using log properties, this simplifies to $\log_6{\sqrt{ab}} = \log_69$ . We then have $\sqrt{ab} = 9$ , so $ab = \boxed{81}$

Answer: E 81
Problem: What is the product of all real numbers $x$ such that the distance on the number line between $\log_6x$ and $\log_69$ is twice the distance on the number line between $\log_610$ and $1$
$\textbf{(A) } 10 \qquad \textbf{(B) } 18 \qquad \textbf{(C) } 25 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 81$

Solution: \[\log_6 9 - \log_6 x_2 = -2d\] Subbing in for $-2d$ and using log rules, \[\log_6 \frac{9}{x_2} = \log_6 \frac{9}{25}\] From this we conclude that \[\frac{9}{x_2} = \frac{9}{25} \implies x_2 = 25\]
Finding the product of the distinct values, $x_1x_2 = \boxed{81}$

Answer: E 81
Problem: Let $M$ be the midpoint of $\overline{AB}$ in regular tetrahedron $ABCD$ . What is $\cos(\angle CMD)$
$\textbf{(A) } \frac14 \qquad \textbf{(B) } \frac13 \qquad \textbf{(C) } \frac25 \qquad \textbf{(D) } \frac12 \qquad \textbf{(E) } \frac{\sqrt{3}}{2}$

Solution: Without loss of generality, let the edge-length of $ABCD$ be $2.$ It follows that $MC=MD=\sqrt3.$
Let $O$ be the center of $\triangle ABD,$ so $\overline{CO}\perp\overline{MOD}.$ Note that $MO=\frac13 MD=\frac{\sqrt{3}}{3}.$
In right $\triangle CMO,$ we have \[\cos(\angle CMD)=\frac{MO}{MC}=\boxed{13}.\] ~MRENTHUSIASM

Answer: B 13
Problem: Let $M$ be the midpoint of $\overline{AB}$ in regular tetrahedron $ABCD$ . What is $\cos(\angle CMD)$
$\textbf{(A) } \frac14 \qquad \textbf{(B) } \frac13 \qquad \textbf{(C) } \frac25 \qquad \textbf{(D) } \frac12 \qquad \textbf{(E) } \frac{\sqrt{3}}{2}$

Solution: Without loss of generality, let the edge-length of $ABCD$ be $2.$ It follows that $CM=DM=\sqrt3.$
By the Law of Cosines, \[\cos(\angle CMD) = \frac{CM^2 + DM^2 - CD^2}{2(CM)(DM)} = \boxed{13}.\] ~jamesl123456

Answer: B 13
Problem: Let $M$ be the midpoint of $\overline{AB}$ in regular tetrahedron $ABCD$ . What is $\cos(\angle CMD)$
$\textbf{(A) } \frac14 \qquad \textbf{(B) } \frac13 \qquad \textbf{(C) } \frac25 \qquad \textbf{(D) } \frac12 \qquad \textbf{(E) } \frac{\sqrt{3}}{2}$

Solution: As done above, let the edge-length equal $2$ (usually better than $1$ because we can avoid fractions when dropping altitudes). Notice that the triangle stated in the question has two side-lengths that are the altitudes of two equilateral triangles. By dropping the equilateral triangles' altitude and using $30^{\circ}$ $60^{\circ}$ $90^{\circ}$ properties, we find that the other two sides are equal to $\sqrt{3}$ . Now by dropping the main triangle's altitude, we see it equals $\sqrt{2}$ from the Pythagorean Theorem. we can use the Double Angle Identities for Cosine. Doing this, we obtain \[\cos(\angle CMD) = \frac{2}{3} - \frac13 = \boxed{13}.\] ~Misclicked

Answer: B 13
Problem: Let $\mathcal{R}$ be the region in the complex plane consisting of all complex numbers $z$ that can be written as the sum of complex numbers $z_1$ and $z_2$ , where $z_1$ lies on the segment with endpoints $3$ and $4i$ , and $z_2$ has magnitude at most $1$ . What integer is closest to the area of $\mathcal{R}$
$\textbf{(A) } 13 \qquad \textbf{(B) } 14 \qquad \textbf{(C) } 15 \qquad \textbf{(D) } 16 \qquad \textbf{(E) } 17$

Solution: [asy] size(250); import TrigMacros; rr_cartesian_axes(-2,6,-2,6,complexplane=true, usegrid = true); Label f; f.p=fontsize(6);  xaxis(-1,5,Ticks(f, 1.0));  yaxis(-1,5,Ticks(f, 1.0)); dot((3,0)); dot((0,4)); draw((0,4)--(3,0), blue); draw((0.8, 4.6)..(-.6,4.8)..(-.8, 3.4),red); draw((-.8, 3.4)--(2.2, -0.6), red); draw((2.2, -0.6)..(3.6,-0.8)..(3.8,0.6), red); draw((0.8, 4.6)--(3.8,0.6),red); draw((0.8, 4.6)--(-.8, 3.4),red+dashed); draw((2.2, -0.6)--(3.8,0.6),red+ dashed);  draw((3,0)--(3,-1),Arrow); label("1",(3,0)--(3,-1),E); draw((0,4)--(-.6,4.8),Arrow); label("1",(0,4)--(-.6,4.8),SW); draw((1.5,2)--(2.3,2.6),Arrow); label("1",(1.5,2)--(2.3,2.6),SE); [/asy]
If $z$ is a complex number and $z = a + bi$ , then the magnitude (length) of $z$ is $\sqrt{a^2 + b^2}$ . Therefore, $z_1$ has a magnitude of 5. If $z_2$ has a magnitude of at most one, that means for each point on the segment given by $z_1$ , the bounds of the region $\mathcal{R}$ could be at most 1 away. Alone the line, excluding the endpoints, a rectangle with a width of 2 and a length of 5, the magnitude, would be formed. At the endpoints, two semicircles will be formed with a radius of 1 for a total area of $\pi \approx 3$ .
Therefore, the total area is $5(2) + \pi \approx 10 + 3 = \boxed{13}$

Answer: A 13
Problem: What is the value of \[(\log 5)^{3}+(\log 20)^{3}+(\log 8)(\log 0.25)\] where $\log$ denotes the base-ten logarithm?
$\textbf{(A)}~\frac{3}{2}\qquad\textbf{(B)}~\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\frac{9}{4}\qquad\textbf{(E)}~3$

Solution: Let $\text{log } 2 = x$ . The expression then becomes \[(1+x)^3+(1-x)^3+(3x)(-2x)=\boxed{2}.\]

Answer:  2
Problem: What is the value of \[(\log 5)^{3}+(\log 20)^{3}+(\log 8)(\log 0.25)\] where $\log$ denotes the base-ten logarithm?
$\textbf{(A)}~\frac{3}{2}\qquad\textbf{(B)}~\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\frac{9}{4}\qquad\textbf{(E)}~3$

Solution: Using sum of cubes \[(\log 5)^{3}+(\log 20)^{3}\] \[= (\log 5 + \log 20)((\log 5)^{2}-(\log 5)(\log 20) + (\log 20)^{2})\] \[= 2((\log 5)^{2}-(\log 5)(2\log 2 + \log 5) + (2\log 2 + \log 5)^{2})\] Let x = $\log 5$ and y = $\log 2$ , so $x+y=1$
The entire expression becomes \[2(x^2-x(2y+x)+(2y+x)^2)-6y^2\] \[=2(x^2+2xy+4y^2-3y^2)\] \[=2(x+y)^2 = \boxed{2}\]

Answer:  2
Problem: What is the value of \[(\log 5)^{3}+(\log 20)^{3}+(\log 8)(\log 0.25)\] where $\log$ denotes the base-ten logarithm?
$\textbf{(A)}~\frac{3}{2}\qquad\textbf{(B)}~\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\frac{9}{4}\qquad\textbf{(E)}~3$

Solution: We can estimate the solution. Using $\log(2) \approx 0.3, \log(20) = \log(10)+\log(2) = 1 + 0.3 \approx 1.3, \log(8) \approx 0.9$ and $\log(.25) = \log(1)-\log(4)= 0 - 0.6\approx -0.6,$ we have
\[0.7^3 + 1.7^3 + .9\cdot(-0.6) = \boxed{2}\] ~kxiang

Answer:  2
Problem: What is the value of \[(\log 5)^{3}+(\log 20)^{3}+(\log 8)(\log 0.25)\] where $\log$ denotes the base-ten logarithm?
$\textbf{(A)}~\frac{3}{2}\qquad\textbf{(B)}~\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\frac{9}{4}\qquad\textbf{(E)}~3$

Solution: Using log properties, we combine the terms to make our expression equal to $\log {( (5^{\log^2{5}}) \cdot (20^{\log^2{20}}) \cdot 8 ^ {\log{\frac{1}{4}}} ) }$ . 
By exponent properties, we separate the part with base $20$ to become $20^{\log^2{5}} \cdot 20^{\log^2{20}-\log^2{5}}$ . Then, we substitute this into the original expression to get $\log {( (5^{\log^2{5}}) \cdot 20^{\log^2{5}} \cdot 20^{\log^2{20}-\log^2{5}} \cdot 8 ^ {\log{\frac{1}{4}}} ) } = \log {( (100^{\log^2{5}}) \cdot 20^{\log^2{20}-\log^2{5}} \cdot 8 ^ {\log{\frac{1}{4}}} ) }$ . 
Because $100^{\log^2{5}} = 25^{\log{5}}$ , and $\log^2{20}-\log^2{5} = (\log{20}+\log{5})(\log{20}-\log{5}) = \log{100}\cdot\log{4} = 2\log{4}$ , this expression is equal to $\log {( 25 ^ {\log{5}} \cdot 400^{\log{4}} \cdot 8 ^ {\log{\frac{1}{4}}} ) }$ . 
We perform the step with the base combining on $25$ and $400$ to get $25 ^ {\log{5}} \cdot 400^{\log{4}}  = 25 ^ {\log{5}-\log{4}} \cdot 10000^{\log{4}} = 25^{\log{\frac{5}{4}}}\cdot 256$ . Putting this back into the whole equation gives $\log{( 25^{\log{\frac{5}{4}}}\cdot 256 \cdot 8^{\log{\frac{1}{4}}})}$ . 
One last base merge remains - but $25\cdot 8$ isn't a power of 10. We can rectify this by converting $8^{\log{\frac{1}{4}}}$ to $(4^\frac{3}{2})^{\log{\frac{1}{4}}} = 4^{\log{ \frac{1}{8} }}$ . 
Finally, we complete this arduous process by performing the base merge on $\log{( 25^{\log{\frac{5}{4}}}\cdot 256 \cdot 4^{\log{\frac{1}{8}}})}$ . 
We get $25^{\log{\frac{5}{4}}} \cdot 4^{\log{\frac{1}{8}}} = 25^{\log{\frac{5}{4}}-\log{\frac{1}{8}}} \cdot 100^{\log{\frac{1}{8}}} = 25^{\log{10}} \cdot \frac{1}{64} = \frac{25}{64}$ . 
Putting this back into that original equation one last time, we get $\log(256 \cdot \frac{25}{64}) = \log{100} = \boxed{2}$ .
~aop2014

Answer:  2