Answer: 937.0

An equilateral triangle is inscribed in the ellipse whose equation is $x^2+4y^2=4$ . One vertex of the triangle is $(0,1)$ , one altitude is contained in the y-axis, and the square of the length of each side is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution:
Denote the vertices of the triangle $A,B,$ and $C,$ where $B$ is in quadrant 4 and $C$ is in quadrant $3.$
Note that the slope of $\overline{AC}$ is $\tan 60^\circ = \sqrt {3}.$ Hence, the equation of the line containing $\overline{AC}$ is \[y = x\sqrt {3} + 1.\] This will intersect the ellipse when \begin{eqnarray*}4 = x^{2} + 4y^{2} & = & x^{2} + 4(x\sqrt {3} + 1)^{2} \\ & = & x^{2} + 4(3x^{2} + 2x\sqrt {3} + 1) \implies x(13x+8\sqrt 3)=0\implies x = \frac { - 8\sqrt {3}}{13}. \end{eqnarray*} We ignore the $x=0$ solution because it is not in quadrant 3.
Since the triangle is symmetric with respect to the y-axis, the coordinates of $B$ and $C$ are now $\left(\frac {8\sqrt {3}}{13},y_{0}\right)$ and $\left(\frac { - 8\sqrt {3}}{13},y_{0}\right),$ respectively, for some value of $y_{0}.$
It is clear that the value of $y_{0}$ is irrelevant to the length of $BC$ . Our answer is \[BC = 2*\frac {8\sqrt {3}}{13}=\sqrt {4\left(\frac {8\sqrt {3}}{13}\right)^{2}} = \sqrt {\frac {768}{169}}\implies m + n = \boxed{937}.\]

Solution:
Solving for $y$ in terms of $x$ gives $y=\sqrt{4-x^2}/2$ , so the two other points of the triangle are $(x,\sqrt{4-x^2}/2)$ and $(-x,\sqrt{4-x^2}/2)$ , which are a distance of $2x$ apart. Thus $2x$ equals the distance between $(x,\sqrt{4-x^2}/2)$ and $(0,1)$ , so by the distance formula we have
\[2x=\sqrt{x^2+(1-\sqrt{4-x^2}/2)^2}.\]
Squaring both sides and simplifying through algebra yields $x^2=192/169$ , so $2x=\sqrt{768/169}$ and the answer is $\boxed{937}$

Solution:
Since the altitude goes along the $y$ axis, this means that the base is a horizontal line, which means that the endpoints of the base are $(x,y)$ and $(-x,y)$ , and WLOG, we can say that $x$ is positive.
Now, since all sides of an equilateral triangle are the same, we can do this (distance from one of the endpoints of the base to the vertex and the length of the base):
$\sqrt{x^2 + (y-1)^2} = 2x$
Square both sides,
$x^2 + (y-1)^2 = 4x^2\implies (y-1)^2 = 3x^2$
Now, with the equation of the ellipse: $x^2 + 4y^2 = 4$
$x^2 = 4-4y^2$
$3x^2 = 12-12y^2$
Substituting,
$12-12y^2 = y^2 - 2y +1$
Moving stuff around and solving:
$y = \frac{-11}{13}, 1$
The second is found to be extraneous, so, when we go back and figure out $x$ and then $2x$ (which is the side length), we find it to be:
$\sqrt{\frac{768}{169}}$
and so we get the desired answer of $\boxed{937}$

Solution:
Denote $(0,1)$ as vertex $A,$ $B$ as the vertex to the left of the $y$ -axis and $C$ as the vertex to the right of the $y$ -axis. Let $D$ be the intersection of $BC$ and the $y$ -axis.
Let $x_0$ be the $x$ -coordinate of $C.$ This implies \[C=\left(x_0 , \sqrt{\frac{4-x_0^2}{4}}\right)\] and \[B=\left(-x_0 , \sqrt{\frac{4-x_0^2}{4}}\right).\] Note that $BC=2x_0$ and \[\frac{BC}{\sqrt3}=AD=1-\sqrt{\frac{4-x_0^2}{4}}.\] This yields \[\frac{2x_0}{\sqrt3}=1-\sqrt{\frac{4-x_0^2}{4}}.\] Re-arranging and squaring, we have \[\frac{4-x_0^2}{4}=\frac{4x_0^2}{3}-\frac{4x_0}{\sqrt3} +1.\] Simplifying and solving for $x_0$ , we have \[x_0=\frac{48}{13\sqrt 3}.\] As the length of each side is $2x_0,$ our desired length is \[4x_0^2=\frac{768}{169}\] which means our desired answer is \[768+169=\boxed{937}\]

Solution:
Notice that $x^2+4y^2=4$ can be rewritten as $(x)^2+(2y)^2=2^2$ . The points of the triangle are $(0, 1)$ $(-x, 1-x\sqrt{3})$ , and $(x, 1-x\sqrt{3})$ . When plugging the second coordinate into the equation, we get $x^2+4-8x\sqrt{3}+12x^2=4$ , which equals $13x^2-8x\sqrt{3}=0$ .
This yields $x(13x-8\sqrt{3})=0$ . Obviously x can't be 0, so $x=\frac{8\sqrt{3}}{13}$ . The side length of the equilateral triangle is twice of this, so $\frac{16\sqrt{3}}{13}$ .
This can be rewritten as $\sqrt{\frac{256\cdot3}{169}}=\sqrt{\frac{768}{169}}$ $768+169=\boxed{937}$ .
~ MC413551

Solution: Consider the transformation $(x,y)$ to $(x/2, y).$ This sends the ellipse to the unit circle. If we let $n$ be one-fourth of the side length of the triangle, the equilateral triangle is sent to an isosceles triangle with side lengths $2n, n\sqrt{13}, n\sqrt{13}.$ Let the triangle be $ABC$ such that $AB=AC.$ Let the foot of the altitude from A be $X.$ Then $BX=n,$ and $AX=2n\sqrt{3}.$ Let $C$ be a point such that $AC$ is a diameter of the unit circle. Then $XC=2-2n\sqrt{3}.$ Using power of a point on X, \[n^2=2n\sqrt{3}(2-2n\sqrt{3})\] Simplifying gets us to $13n^2=4n\sqrt{3}.$ Then, $n=\dfrac{4\sqrt{3}}{13}$ which means the side length is $\dfrac{16\sqrt{3}}{13}=\sqrt{\dfrac{768}{169}}.$ Thus, the answer is $768+169=\boxed{937}.$


Answer: 100.0

An equilateral triangle of side length $10$ is completely filled in by non-overlapping equilateral triangles of side length $1$ . How many small triangles are required?
$\mathrm{(A)}\ 10\qquad\mathrm{(B)}\ 25\qquad\mathrm{(C)}\ 100\qquad\mathrm{(D)}\ 250\qquad\mathrm{(E)}\ 1000$

Solution: The area of the large triangle is $\frac{10^2\sqrt3}{4}$ , while the area of each small triangle is $\frac{1^2\sqrt3}{4}$ . Dividing these two quantities results in $100$ , therefore $\boxed{100}$ small triangles can fill the large one without overlap.


Answer: 100.0

Solution: The number of triangles is $1+3+\dots+19 = \boxed{100}$


Answer: 64.0

An even number of circles are nested, starting with a radius of $1$ and increasing by $1$ each time, all sharing a common point. The region between every other circle is shaded, starting with the region inside the circle of radius $2$ but outside the circle of radius $1.$ An example showing $8$ circles is displayed below. What is the least number of circles needed to make the total shaded area at least $2023\pi$
[asy] filldraw(circle((0,0),8),gray); filldraw(circle((-1,0),7),white); filldraw(circle((-2,0),6),gray); filldraw(circle((-3,0),5),white); filldraw(circle((-4,0),4),gray); filldraw(circle((-5,0),3),white); filldraw(circle((-6,0),2),gray); filldraw(circle((-7,0),1),white); [/asy]
$\textbf{(A) } 46 \qquad \textbf{(B) } 48 \qquad \textbf{(C) } 56 \qquad \textbf{(D) } 60 \qquad \textbf{(E) } 64$

Solution:
Notice that the area of the shaded region is $(2^2\pi-1^2\pi)+(4^2\pi-3^2\pi)+(6^2\pi-5^2\pi)+ \cdots + (n^2\pi-(n-1)^2 \pi)$ for any even number $n$
Using the difference of squares, this simplifies to $(1+2+3+4+\cdots+n) \pi$ . So, we are basically finding the smallest $n$ such that $\frac{n(n+1)}{2}>2023 \Rightarrow n(n+1) > 4046$ . Since $60(61) > 60^2=3600$ , the only option higher than $60$ is $\boxed{64}$

Solution:
After first observing the problem, we can work out a few of the areas.
1st area = $4\pi-\pi = 3\pi$
2nd area = $16\pi-9\pi = 7\pi$
3rd area = $36\pi-25\pi = 11\pi$
4th area = $64\pi-49\pi = 15\pi$
We can see that the pattern is an arithmetic sequence with first term $3$ and common difference $4$ . From here, we can start from the bottom of the answer choices and work our way up. As the question asks for the least number of circles needed total, we have to divide the number of total circles by 2.
We can find the sum of the first $32$ terms of the arithmetic sequence by using the formula.
The last term is: $3 + 4\cdot(32-1) = 127$
Then, we can find the sum: $(3+127)/2 \cdot 32 = 65\cdot32 = 2080$ . It is clear that $64$ works.
The next answer choice is $60$ , which we have to divide by 2 to get $30$
The last term is: $3 + 4\cdot(30-1) = 119$
The sum is: $(3+119)/2 \cdot 30 = 61\cdot30 = 1830$ . This does not work.
As answer choice $D$ does not work and $E$ does, we can conclude that the answer is $\boxed{64}$

Solution:
We can easily see that all of the answer choices are even, which helps us solve this problem a little.
Lets just not consider the $\pi$ , since it is not that important, so let's just cancel that out.
When we plug in 64, we get $64^2-63^2+62^2-61^2+\cdots +4^2-3^2+2^2-1^2$ . By difference of squares, we get $1+2+3+\cdots+62+63+64$ , which by the sum of an arithmetic sequence, is $\frac{64(64+1)}{2}$ , which is $2080$
Similarly, we can use this for answer choice $D$ , and we have $\frac{60(60+1)}{2}$ which is $1830$
So, we see that answer choice $D$ is too small to satisfy the requirements, so we conclude the answer is $\boxed{64}$

Solution:
We can consider making a table.
If there is 1 circle, the area of the shaded region is 0π. (We can write this as 0π.)
If there are 2 circles, the area of the shaded region is 3π.  (We can write this as (1+2)π).
If there are 3 circles, the area of the shaded region is 3π.  (We can write this as (1+2)π).
If there are 4 circles, the area of the shaded region is 10π.  (We can write this as (1+2+3+4)π).
If there are 5 circles, the area of the shaded region is 10π.  (We can write this as (1+2+3+4)π).
If there are 6 circles, the area of the shaded region is 21π.  (We can write this as (1+2+3+4+5+6)π).
Now the pattern emerges. When $n$ is even, the area of the shaded region is $(1+2+3+\cdots+n)\pi$ , or $\left( \frac{n(n+1)}{2} \right) \pi$ . But remember that the problem stated that there are an even number of circles. So now we are solving the equation \[\left( \frac{n(n+1)}{2} \right) \pi\ge2023\pi.\] Dividing by $\pi$ and multiplying by 2 on both sides, we get $n(n+1)\ge4046$ . Now we can plug in the answer choices, and we start off with $60$ because it is the only answer choice that is a multiple of $10$ . Plugging in we get $60\cdot61=3660$ , and this is not quite yet more than $4046$ . But only option $(\text{E})$ is bigger, so we know that the solution can only be $\boxed{64}$

Solution:
Denote $S$ the area of shaded region and $W$ the area of white region.
$S > W$ and $S \approx W$ if $R$ is big.
Therefore \[\pi R^2 = S + W \approx 2S \ge 4046 \pi \implies R \approx 64.\] So we conclude the answer is $\boxed{64}$


Answer: 802.0

An infinite geometric series has sum 2005. A new series, obtained by squaring each term of the original series, has 10 times the sum of the original series. The common ratio of the original series is $\frac mn$ where $m$ and $n$ are relatively prime integers . Find $m+n.$

Solution: Let's call the first term of the original geometric series $a$ and the common ratio $r$ , so $2005 = a + ar + ar^2 + \ldots$ .  Using the sum formula for infinite geometric series, we have $\;\;\frac a{1 -r} = 2005$ .  Then we form a new series, $a^2 + a^2 r^2 + a^2 r^4 + \ldots$ .  We know this series has sum $20050 = \frac{a^2}{1 - r^2}$ .  Dividing this equation by $\frac{a}{1-r}$ , we get $10 = \frac a{1 + r}$ .  Then $a = 2005 - 2005r$ and $a = 10 + 10r$ so $2005 - 2005r = 10 + 10r$ $1995 = 2015r$ and finally $r = \frac{1995}{2015} = \frac{399}{403}$ , so the answer is $399 + 403 = \boxed{802}$

Solution: We can write the sum of the original series as $a + a\left(\dfrac{m}{n}\right) + a\left(\dfrac{m}{n}\right)^2 + \ldots = 2005$ , where the common ratio is equal to $\dfrac{m}{n}$ . We can also write the sum of the second series as $a^2 + a^2\left(\dfrac{m}{n}\right)^2 + a^2\left(\left(\dfrac{m}{n}\right)^2\right)^2 + \ldots = 20050$ . Using the formula for the sum of an infinite geometric series $S=\dfrac{a}{1-r}$ , where $S$ is the sum of the sequence, $a$ is the first term of the sequence, and $r$ is the ratio of the sequence, the sum of the original series can be written as $\dfrac{a}{1-\frac{m}{n}}=\dfrac{a}{\frac{n-m}{n}}=\dfrac{a \cdot n}{n-m}=2005\;\text{(1)}$ , and the second sequence can be written as $\dfrac{a^2}{1-\frac{m^2}{n^2}}=\dfrac{a^2}{\frac{n^2-m^2}{n^2}}=\dfrac{a^2\cdot n^2}{(n+m)(n-m)}=20050\;\text{(2)}$ . Dividing $\text{(2)}$ by $\text{(1)}$ , we obtain $\dfrac{a\cdot n}{m+n}=10$ , which can also be written as $a\cdot n=10(m+n)$ . Substitute this value for $a\cdot n$ back into $\text{(1)}$ , we obtain $10\cdot \dfrac{n+m}{n-m}=2005$ . Dividing both sides by 10 yields $\dfrac{n+m}{n-m}=\dfrac{401}{2}$ we can now write a system of equations with $n+m=401$ and $n-m=2$ , but this does not output integer solutions. However, we can also write $\dfrac{n+m}{n-m}=\dfrac{401}{2}$ as $\dfrac{n+m}{n-m}=\dfrac{802}{4}$ . This gives the system of equations $m+n=802$ and $n-m=4$ , which does have integer solutions. Our answer is therefore $m+n=\boxed{802}$ (Solving for $m$ and $n$ gives us $399$ and $403$ , respectively, which are co-prime).


Answer: 1.0

An insect lives on the surface of a regular tetrahedron with edges of length 1. It wishes to travel on the surface of the tetrahedron from the midpoint of one edge to the midpoint of the opposite edge. What is the length of the shortest such trip? (Note: Two edges of a tetrahedron are opposite if they have no common endpoint.)
$\text{(A) }\frac {1}{2} \sqrt {3} \qquad \text{(B) }1 \qquad \text{(C) }\sqrt {2} \qquad \text{(D) }\frac {3}{2} \qquad \text{(E) }2$

Solution: Given any path on the surface, we can unfold the surface into a plane to get a path of the same length in the plane. Consider the net of a tetrahedron in the picture below. A pair of opposite points is marked by dots. It is obvious that in the plane the shortest path is just a segment that connects these two points. Its length is the same as the length of the tetrahedron's edge, i.e. $\boxed{1}$


Answer: 45.0

An integer $N$ is selected at random in the range $1\leq N \leq 2020$ . What is the probability that the remainder when $N^{16}$ is divided by $5$ is $1$
$\textbf{(A)}\ \frac{1}{5}\qquad\textbf{(B)}\ \frac{2}{5}\qquad\textbf{(C)}\ \frac{3}{5}\qquad\textbf{(D)}\ \frac{4}{5}\qquad\textbf{(E)}\ 1$

Solution: Notice that we can rewrite $N^{16}$ as $(N^{4})^4$ . By Fermat's Little Theorem , we know that $N^{(5-1)} \equiv 1 \pmod {5}$ if $N \not \equiv 0 \pmod {5}$ . Therefore for all $N \not \equiv 0 \pmod {5}$ we have $N^{16} \equiv (N^{4})^4 \equiv 1^4 \equiv 1 \pmod 5$ . Since $1\leq N \leq 2020$ , and $2020$ is divisible by $5$ $\frac{1}{5}$ of the possible $N$ are divisible by $5$ . Therefore, $N^{16} \equiv 1 \pmod {5}$ with probability $1-\frac{1}{5},$ or $\boxed{45}$

Solution:
Note that the patterns for the units digits repeat, so in a sense we only need to find the patterns for the digits $0-9$ .
The pattern for $0$ is $0$ , no matter what power, so $0$ doesn't work. Likewise, the pattern for $5$ is always $5$ . Doing the same for the rest of the digits, we find that the units digits of $1^{16}$ $2^{16}$ $3^{16}$ $4^{16}$ $6^{16}$ $7^{16}$ $8^{16}$ and $9^{16}$ all have the remainder of $1$ when divided by $5$ , so $\boxed{45}$


Answer: 615.0

An integer between $1000$ and $9999$ , inclusive, is called balanced if the sum of its two leftmost digits equals the sum of its two rightmost digits. How many balanced integers are there?

Solution: If the common sum of the first two and last two digits is $n$ , such that $1 \leq n \leq 9$ , there are $n$ choices for the first two digits and $n + 1$ choices for the second two digits (since zero may not be the first digit).  This gives $\sum_{n = 1}^9 n(n + 1) = 330$ balanced numbers.  If the common sum of the first two and last two digits is $n$ , such that $10 \leq n \leq 18$ , there are $19 - n$ choices for both pairs.  This gives $\sum_{n = 10}^{18} (19 - n)^2 = \sum_{n = 1}^9 n^2 = 285$ balanced numbers.  Thus, there are in total $330 + 285 = \boxed{615}$ balanced numbers.

Solution:
Call the number $\overline{abcd}$ . Then $a+b=c+d$ . Set $a+b=x$
Clearly, $0\le x \le18$
If $x=0$ $0000$ is not acceptable.
If $x=1$ : The only case is $1001$ or $1010$ . 2 choices.
If $x=2$ : then since $a\neq0$ $a=1=b$ or $a=2, b=0$ . There are 3 choices for $(c,d)$ $(2,0), (0, 2), (1, 1)$ $2*3=6$ here.
If $x=3$ : Clearly, $a\neq b$ because if so, the sum will be even, not odd. Counting $(a,b)=(3,0)$ , we have $4$ choices. Subtracting that, we have $3$ choices. Since it doesn't matter whether $c=0$ or $d=0$ , we have 4 choices for $(c,d)$ . So $3*4=12$ here.
If $x=4$ : Continue as above. $4$ choices for $(a,b)$ $5$ choices for $(c,d)$ $4*5=20$ here.
If $x=5$ : You get the point. $5*6=30$
If $x=6$ $6*7=42$
If $x=7$ $7*8=56$
If $x=8$ $8*9=72$
If $x=9$ $9*10=90$
Now we need to be careful because if $x=10$ $(c,d)=(0,10)$ is not valid. However, we don't have to worry about $a\neq0$
If $x=10$ $(a,b)=(1,9), (2, 8), ..., (9, 1)$ . Same thing for $(c,d)$ $9*9=81$
If $x=11$ : We start at $(a,b)= (2,9)$ . So $8*8$
Continue this pattern until $x=18: 1*1=1$ . Add everything up: we have $\boxed{615}$

Solution:
We ignore the requirement that the first digit is non-zero, and do casework on the sum of the sum of the pairs of digits.
If two digits $a$ and $b$ sum to $0$ , we have $1$ possibility: $(a,b) = (0,0)$
If $a+b = 1$ , we have $2$ possibilities: $(a,b) = (0,1)$ and $(a,b) = (1,0)$
$a+b = 2$ $(0,2)$ $(2,0)$ , and $(1,1)$ are the only $3$ possibilities.
We notice a pattern: for all $k \leq 9$ , there are $k+1$ ordered pairs of digits $(a,b)$ such that $a+b = k$ . Then, testing for $10 \leq k \leq 18$ , we notice that there are $(18 - k) + 1$ ordered pairs with a sum of $k$
So the number of ways to pick $4$ digits satisfying the constraint is \[(1)(1) + (2)(2) \dots (10)(10) + (9)(9) + \dots + (1)(1) = \frac{(10)(11)(21)}{6} + \frac{(9)(10)(19)}{6} = 670\]
We have to subtract out the cases where the first digit is $0$ , which is $1+2+\dots+10  = 55$
So our answer is $670-55 = \boxed{615}$


Answer: 126.0

An integer is assigned to each vertex of a cube. The value of an edge is defined to be the sum of the values of the two vertices it touches, and the value of a face is defined to be the sum of the values of the four edges surrounding it. The value of the cube is defined as the sum of the values of its six faces. Suppose the sum of the integers assigned to the vertices is $21$ . What is the value of the cube? $\textbf{(A) } 42 \qquad \textbf{(B) } 63 \qquad \textbf{(C) } 84 \qquad \textbf{(D) } 126 \qquad \textbf{(E) } 252$

Solution:
Each of the vertices is counted $3$ times because each vertex is shared by three different edges.
Each of the edges is counted $2$ times because each edge is shared by two different faces.
Since the sum of the integers assigned to all vertices is $21$ , the final answer is $21\times3\times2=\boxed{126}$

Solution: Note that each vertex is counted $2\times 3=6$ times. Thus, the answer is $21\times6=\boxed{126}$

Solution: Just set one vertice equal to $21$ , it is trivial to see that there are $3$ faces with value $42$ , and $42 \cdot 3=\boxed{126}$

Solution: Since there are 8 vertices in a cube, there are $\dfrac{21}4$ vertices for two edges. There are $4$ edges per face, and $6$ faces in a cube, so the value of the cube is $\dfrac{21}4 \cdot 24 = \boxed{126}$

Solution: Set each vertex to value 1, so the sum of the vertices is 8. We find that the value of the cube, if all vertices are 1, is 48. We conclude that the value of the cube is 6 times the value of the sum of the vertices. Therefore, we choose $21\times6=\boxed{126}$

Solution: The wording of the problem implies that the answer should hold for any valid combination of integers. Thus, we choose the numbers $21, 0, 0, 0, 0, 0, 0, 0$ , which are indeed $8$ integers that add to $21$ . Doing this, we find three edges that have a value of $21$ , and from there, we get three faces with a value of $42$ (while the other three faces have a value of $0$ ). Adding the three faces together, we get $42+42+42 = \boxed{126}$


Answer: 640.0

An integer is called parity-monotonic if its decimal representation $a_{1}a_{2}a_{3}\cdots a_{k}$ satisfies $a_{i}<a_{i+1}$ if $a_{i}$ is odd , and $a_{i}>a_{i+1}$ if $a_{i}$ is even . How many four-digit parity-monotonic integers are there?

Solution: This problem can be solved via recursion since we are "building a string" of numbers with some condition. We want to create a new string by adding a new digit at the front so we avoid complications( $0$ can't be at the front and no digit is less than $9$ ). There are $4$ options to add no matter what(try some examples if you want) so the recursion is $S_n=4S_{n-1}$ where $S_n$ stands for the number of such numbers with $n$ digits. Since $S_1=10$ the answer is $\boxed{640}$


Answer: 882.0

An integer is called snakelike if its decimal representation $a_1a_2a_3\cdots a_k$ satisfies $a_i<a_{i+1}$ if $i$ is odd and $a_i>a_{i+1}$ if $i$ is even . How many snakelike integers between 1000 and 9999 have four distinct digits?

Solution:
We divide the problem into two cases: one in which zero is one of the digits and one in which it is not. In the latter case, suppose we pick digits $x_1,x_2,x_3,x_4$ such that $x_1<x_2<x_3<x_4$ . There are five arrangements of these digits that satisfy the condition of being snakelike: $x_1x_3x_2x_4$ $x_1x_4x_2x_3$ $x_2x_3x_1x_4$ $x_2x_4x_1x_3$ $x_3x_4x_1x_2$ . Thus there are $5\cdot {9\choose 4}=630$ snakelike numbers which do not contain the digit zero.
In the second case we choose zero and three other digits such that $0<x_2<x_3<x_4$ . There are three arrangements of these digits that satisfy the condition of being snakelike: $x_2x_30x_4$ $x_2x_40x_3$ $x_3x_40x_2$ . Because we know that zero is a digit, there are $3\cdot{9\choose 3}=252$ snakelike numbers which contain the digit zero. Thus there are $630+252=\boxed{882}$ snakelike numbers.

Solution: Let's create the snakelike number from digits $a < b < c < d$ , and, if we already picked the digits there are 5 ways to do so, as said in the first solution. And, let's just pick the digits from 0-9. This get's a total count of $5\cdot{10 \choose 4}$ But, this over-counts since it counts numbers like 0213. We can correct for this over-counting. Lock the first digit as 0 and permute 3 other chosen digits $a < b < c$ . There are 2 ways to permute to make the number snakelike, b-a-c, or c-a-b. And, we pick a,b,c from 1 to 9, since 0 has already been chosen as one of the digits. So, the amount we have overcounted by is $2\cdot{9 \choose 3}$ . Thus our answer is $5\cdot{10 \choose 4} - 2\cdot{9 \choose 3} = \boxed{882}$

Solution:
We will first decide the order of the 4 digits, greatest to least. To do this, we will pretend that we have selected the digits 1,2,3,4, and we need to arrange them to create a snakelike number. By testing all permutations, there are only 5 ways to make a snakelike number: (1,3,2,4),(1,4,2,3),(2,3,1,4),(2,4,1,3),(3,4,1,2).
Now we select 4 digits to replace the 1,2,3,4.
In first 2 of cases: (1,3,2,4),(1,4,2,3), the leading digit is a 1, which means it is the smallest of our 4 digits. If we select a 0, the leading digit will be a zero, which is bad because all numbers between 1000 and 9999 have nonzero leading digits. So, we need to select our 4 digits only from the pool of 1-9. There are 9 choose 4 ways and there are 2 cases:
$2 \cdot \dbinom{9}{4} = 252$
Thus, there are 252 ways for those 2 cases.
For the next 3 cases, selecting a 0 is okay, so we can select from the pool of 0-9. There are 10 choose 4 ways to select our 4 digits and there are 3 cases:
$3 \cdot \dbinom{10}{4} = 630$
For those 3 cases there are 630 ways.
Thus, our answer is 630+252 = $\boxed{882}$


Answer: 1.5

An inverted cone with base radius $12  \mathrm{cm}$ and height $18  \mathrm{cm}$ is full of water. The water is poured into a tall cylinder whose horizontal base has radius of $24  \mathrm{cm}$ . What is the height in centimeters of the water in the cylinder?
$\textbf{(A)} ~1.5 \qquad\textbf{(B)} ~3 \qquad\textbf{(C)} ~4 \qquad\textbf{(D)} ~4.5 \qquad\textbf{(E)} ~6$

Solution:
The volume of a cone is $\frac{1}{3} \cdot\pi \cdot r^2 \cdot h$ where $r$ is the base radius and $h$ is the height. The water completely fills up the cone so the volume of the water is $\frac{1}{3}\cdot18\cdot144\pi = 6\cdot144\pi$
The volume of a cylinder is $\pi \cdot r^2 \cdot h$ so the volume of the water in the cylinder would be $24\cdot24\cdot\pi\cdot h$
We can equate these two expressions because the water volume stays the same like this $24\cdot24\cdot\pi\cdot h = 6\cdot144\pi$ . We get $4h = 6$ and $h=\frac{6}{4}$
So the answer is $\boxed{1.5}.$

Solution:
The water completely fills up the cone. For now, assume the radius of both cone and cylinder are the same. Then the cone has $\frac{1}{3}$ of the volume of the cylinder, and so the height is divided by $3$ . Then, from the problem statement, the radius is doubled, meaning the area of the base is quadrupled (since $2^2 = 4$ ).
Therefore, the height is divided by $3$ and divided by $4$ , which is $18 \div 3 \div 4 = \boxed{1.5}.$


Answer: 1.5

Solution:
The volume of a cone is $\frac{1}{3} \cdot\pi \cdot r^2 \cdot h$ where $r$ is the base radius and $h$ is the height. The water completely fills up the cone so the volume of the water is $\frac{1}{3}\cdot18\cdot144\pi = 6\cdot144\pi$
The volume of a cylinder is $\pi \cdot r^2 \cdot h$ so the volume of the water in the cylinder would be $24\cdot24\cdot\pi\cdot h$
We can equate these two expressions because the water volume stays the same like this $24\cdot24\cdot\pi\cdot h = 6\cdot144\pi$ . We get $4h = 6$ and $h=\frac{6}{4}$
So the answer is $\boxed{1.5}.$

Solution:
The water completely fills up the cone. For now, assume the radius of both cone and cylinder are the same. Then the cone has $\frac{1}{3}$ of the volume of the cylinder, and so the height is divided by $3$ . Then, from the problem statement, the radius is doubled, meaning the area of the base is quadrupled (since $2^2 = 4$ ).
Therefore, the height is divided by $3$ and divided by $4$ , which is $18 \div 3 \div 4 = \boxed{1.5}.$


Answer: 20.0

An isosceles right triangle with legs of length $8$ is partitioned into $16$ congruent triangles as shown.  The shaded area is
[asy] for (int a=0; a <= 3; ++a) {     for (int b=0; b <= 3-a; ++b)     {         fill((a,b)--(a,b+1)--(a+1,b)--cycle,grey);     } } for (int c=0; c <= 3; ++c) {     draw((c,0)--(c,4-c),linewidth(1));     draw((0,c)--(4-c,c),linewidth(1));     draw((c+1,0)--(0,c+1),linewidth(1)); }  label("$8$",(2,0),S);  label("$8$",(0,2),W); [/asy]
$\text{(A)}\ 10 \qquad \text{(B)}\ 20 \qquad \text{(C)}\ 32 \qquad \text{(D)}\ 40 \qquad \text{(E)}\ 64$

Solution: Because the smaller triangles are congruent, the shaded area take $\frac{10}{16}$ of the largest triangles area, which is $\frac{8 \times 8}{2}=32$ , so the shaded area is $\frac{10}{16} \times 32= \boxed{20}$

Solution: Each of the triangle has side length of $\frac{1}{4} \times 8=2$ , so the area is $\frac{1}{2} \times 2 \times 2=2$ . Because there are $10$ triangles is the shaded area, its area is $2 \times 10 =\boxed{20}$


Answer: 121.0

An object in the plane moves from one lattice point to another. At each step, the object may move one unit to the right, one unit to the left, one unit up, or one unit down. If the object starts at the origin and takes a ten-step path, how many different points could be the final point?
$\mathrm{(A)}\ 120 \qquad \mathrm{(B)}\ 121 \qquad \mathrm{(C)}\ 221 \qquad \mathrm{(D)}\ 230 \qquad \mathrm{(E)}\ 231$

Solution:
$10$ moves results in a lot of possible endpoints, so we try small cases first.
If the object only makes $1$ move, it is obvious that there are only 4 possible points that the object can move to.
If the object makes $2$ moves, it can move to $(0, 2)$ $(1, 1)$ $(2, 0)$ $(1, -1)$ $(0, -2)$ $(-1, -1)$ $(-2, 0)$ as well as $(0, 0)$ , for a total of $9$ moves.
If the object makes $3$ moves, it can end up at $(0, 3)$ $(2, 1)$ $(1, 2)$ $(3, 0)$ $(2, -1)$ $(1, -2)$ $(0, -3)$ $(-1, -2)$ $(-2, -1)$ $(0, -3)$ etc. for a total of $16$ moves.
At this point we can guess that for n moves, there are $(n + 1)^2$ different endpoints. Thus, for 10 moves, there are $11^2 = 121$ endpoints, and the answer is $\boxed{121}$


Answer: 121.0

Solution:
Let the starting point be $(0,0)$ . After $10$ steps we can only be in locations $(x,y)$ where $|x|+|y|\leq 10$ . Additionally, each step changes the parity of exactly one coordinate. Hence after $10$ steps we can only be in locations $(x,y)$ where $x+y$ is even. It can easily be shown that each location that satisfies these two conditions is indeed reachable.
Once we pick $x\in\{-10,\dots,10\}$ , we have $11-|x|$ valid choices for $y$ , giving a total of $\boxed{121}$ possible positions.


Answer: 13.0

An object moves $8$ cm in a straight line from $A$ to $B$ , turns at an angle $\alpha$ , measured in radians and chosen at random from the interval $(0,\pi)$ , and moves $5$ cm in a straight line to $C$ . What is the probability that $AC < 7$
$\mathrm{(A)}\ \frac{1}{6} \qquad\mathrm{(B)}\ \frac{1}{5} \qquad\mathrm{(C)}\ \frac{1}{4} \qquad\mathrm{(D)}\ \frac{1}{3} \qquad\mathrm{(E)}\ \frac{1}{2}$

Solution:
$WLOG$ , let the object turn clockwise.
Let $B = (0, 0)$ $A = (0, -8)$
Note that the possible points of $C$ create a semi-circle of radius $5$ and center $B$ . The area where $AC < 7$ is enclosed by a circle of radius $7$ and center $A$ . The probability that $AC < 7$ is $\frac{\angle ABO}{180 ^\circ}$
The function of $\odot B$ is $x^2 + y^2 = 25$ , the function of $\odot A$ is $x^2 + (y+8)^2 = 49$
$O$ is the point that satisfies the system of equations: $\begin{cases} x^2 + y^2 = 25 \\ x^2 + (y+8)^2 = 49 \end{cases}$
$x^2 + (y+8)^2 - x^2 - y^2 = 49 - 25$ $64 + 16y =24$ $y = - \frac52$ $x = \frac{5 \sqrt{3}}{2}$ $O = (\frac{5 \sqrt{3}}{2}, - \frac52)$
Note that $\triangle BDO$ is a $30-60-90$ triangle, as $BO = 5$ $BD = \frac{5 \sqrt{3}}{2}$ $DO = \frac52$ . As a result $\angle CBO = 30 ^\circ$ $\angle ABO = 60 ^\circ$
Therefore the probability that $AC < 7$ is $\frac{\angle ABO}{180 ^\circ} = \frac{60 ^\circ}{180 ^\circ} = \boxed{13}$


Answer: 300.0

An ordered pair $(m,n)$ of non-negative integers is called "simple" if the addition $m+n$ in base $10$ requires no carrying. Find the number of simple ordered pairs of non-negative integers that sum to $1492$

Solution: Since no carrying over is allowed, the range of possible values of any digit of $m$ is from $0$ to the respective digit in $1492$ (the values of $n$ are then fixed). Thus, the number of ordered pairs will be $(1 + 1)(4 + 1)(9 + 1)(2 + 1) = 2\cdot 5\cdot 10\cdot 3 = \boxed{300}$


Answer: 191.0

An organization has $30$ employees, $20$ of whom have a brand A computer while the other $10$ have a brand B computer. For security, the computers can only be connected to each other and only by cables. The cables can only connect a brand A computer to a brand B computer. Employees can communicate with each other if their computers are directly connected by a cable or by relaying messages through a series of connected computers. Initially, no computer is connected to any other. A technician arbitrarily selects one computer of each brand and installs a cable between them, provided there is not already a cable between that pair. The technician stops once every employee can communicate with each other. What is the maximum possible number of cables used?
$\textbf{(A)}\ 190  \qquad\textbf{(B)}\  191 \qquad\textbf{(C)}\  192 \qquad\textbf{(D)}\  195 \qquad\textbf{(E)}\ 196$

Solution:
We claim that to maximize the number of cables used, we isolate one computer and connect all cables for the remaining $29$ computers, then connect one more cable for the isolated computer.
If a brand A computer is isolated, then the technician can use at most $19\cdot10+1=191$ cables. If a brand B computer is isolated instead, then the technician can use at most $20\cdot9+1=181$ cables. Therefore, the answer is $\boxed{191}.$


Answer: 144.0

An urn contains $4$ green balls and $6$ blue balls. A second urn contains $16$ green balls and $N$ blue balls. A single ball is drawn at random from each urn. The probability that both balls are of the same color is $0.58$ . Find $N$

Solution:
First, we find the probability both are green, then the probability both are blue, and add the two probabilities. The sum should be equal to $0.58$
The probability both are green is $\frac{4}{10}\cdot\frac{16}{16+N}$ , and the probability both are blue is $\frac{6}{10}\cdot\frac{N}{16+N}$ , so \[\frac{4}{10}\cdot\frac{16}{16+N}+\frac{6}{10}\cdot\frac{N}{16+N}=\frac{29}{50}\] Solving this equation, \[20\left(\frac{16}{16+N}\right)+30\left(\frac{N}{16+N}\right)=29\] Multiplying both sides by $16+N$ , we get
\begin{align*} 20\cdot16+30\cdot N&=29(16+N)\\ 320+30N&=464+29N\\ N&=\boxed{144}


Answer: 21.0

An urn contains marbles of four colors: red, white, blue, and green. When four marbles are drawn without replacement, the following events are equally likely:
(a) the selection of four red marbles;
(b) the selection of one white and three red marbles;
(c) the selection of one white, one blue, and two red marbles; and
(d) the selection of one marble of each color.
What is the smallest number of marbles satisfying the given condition?
$\text{(A)}\ 19\qquad\text{(B)}\ 21\qquad\text{(C)}\ 46\qquad\text{(D)}\ 69\qquad\text{(E)}\ \text{more than 69}$

Solution:
Let the bag contain $n$ marbles total, with $r, w, b, g$ representing the number of red, white, blue, and green marbles, respectively.  Note that $r + w + b + g = n$
The number of ways to select four red marbles out of the set of marbles without replacement is:
\[\binom{r}{4} = \frac{r!}{24\cdot (r -4)!}\]
The number of ways to select one white and three red marbles is:
\[\binom{w}{1}\binom{r}{3} = \frac{w\cdot r!}{6\cdot (r - 3)!}\]
The number of ways to select one white, one blue, and two red marbles is:
\[\binom{w}{1}\binom{b}{1} \binom{r}{2} = \frac{wb\cdot r!}{2(r-2)!}\]
The number of ways to select one marble of each colors is:
\[\binom{w}{1}\binom{b}{1} \binom{g}{1}\binom{r}{1} = wbgr\] Setting the first and second statements equal, we find:
\[\frac{r!}{24\cdot (r -4)!}  = \frac{w\cdot r!}{6\cdot (r - 3)!}\]
\[r - 3  = 4w\]
Setting the first and third statements equal, we find:
\[\frac{r!}{24\cdot (r -4)!} = \frac{wb\cdot r!}{2(r-2)!}\]
\[(r-3)(r-2) = 12wb\]
Setting the last two statements equal, we find:
\[\frac{wb\cdot r!}{2(r-2)!} = wbgr\]
\[r - 1 = 2g\]
These are all the "linking equations" that are needed; the transitive property of equality makes the other three equalities unnecessary.
From the first equation, we know that $r$ must be $3$ more than a multiple of $4$ , or that $r \equiv 3 \mod 4$
Putting the first equation into the second equation, we find $r-2 = 3b$ .  Therefore, $r \equiv 2 \mod 3$ .  Using the Chinese Remainder Theorem , we find that $r \equiv 11 \mod 12$
The third equation gives no new restrictions on $r$ ; it is already odd by the first equation.
Thus, the minimal positive value of $r$ is $11$ .  This requires $g=\frac{r - 1}{2} = 5$ by the third equation, and $w = \frac{r-3}{4} = 2$ by the first equation.  Finally, the second equation gives $b = \frac{(r-3)(r-2)}{12w} = 3$
The minimal total number of marbles is $11 + 5 + 2 + 3 = \boxed{21}$


Answer: 15.0

An urn contains one red ball and one blue ball. A box of extra red and blue balls lies nearby. George performs the following operation four times: he draws a ball from the urn at random and then takes a ball of the same color from the box and returns those two matching balls to the urn. After the four iterations the urn contains six balls. What is the probability that the urn contains three balls of each color?
$\textbf{(A) } \frac16 \qquad \textbf{(B) }\frac15 \qquad \textbf{(C) } \frac14 \qquad \textbf{(D) } \frac13 \qquad \textbf{(E) } \frac12$

Solution:
Suppose that we have a deck, currently containing just one black card. We then insert $n$ red cards one-by-one into the deck at random positions. It is easy to see using induction, that the black card is randomly situated in the deck.
Now, suppose that we have this deck again, with only one black card. Each time we pick a red ball, we place a card above the black card, and each time we pick a blue ball, we place a card below the black card. It is easy to see that the probability that the card is inserted into the top part of the deck is simply equal to the number of red balls divided by the total number of balls, and the probability that the card is inserted into the bottom part of the deck is equal to the number of blue balls divided by the total number of balls. Therefore, this is equivalent to inserting the card randomly into the deck.
Finally, four more red cards will be inserted into the deck, and so the black card can be in five possible positions. Only one corresponds to having three balls of each type. Our probability is thus $\frac{1}{5}$ , and so the answer is $\boxed{15}$

Solution:
Let $R$ denote the action where George selects a red ball and $B$ denote the action where he selects a blue one. Now, in order to get $3$ balls of each color, he needs $2$ more of both $R$ and $B$
There are 6 cases: $RRBB, RBRB, RBBR, BBRR, BRBR, BRRB$ (we can confirm that there are only $6$ since $\binom{4}{2}=6$ ). However we can clump $RRBB + BBRR$ $RBRB + BRBR$ , and $RBBR + BRRB$ together since they are equivalent by symmetry.
$\textbf{CASE 1: }$ $RRBB$ and $BBRR$
Let's find the probability that he picks the balls in the order of $RRBB$
The probability that the first ball he picks is red is $\frac{1}{2}$
Now there are $2$ reds and $1$ blue in the urn. The probability that he picks red again is now $\frac{2}{3}$
There are $3$ reds and $1$ blue now. The probability that he picks a blue is $\frac{1}{4}$
Finally, there are $3$ reds and $2$ blues. The probability that he picks a blue is $\frac{2}{5}$
So the probability that the $RRBB$ case happens is $\frac{1}{2} \cdot \frac{2}{3} \cdot \frac{1}{4} \cdot \frac{2}{5} = \frac{1}{30}$ . However, since the $BBRR$ case is the exact same by symmetry, case 1 has a probability of $\frac{1}{30} \cdot 2 = \frac{1}{15}$ chance of happening.
$\textbf{CASE 2: }$ $RBRB$ and $BRBR$
Let's find the probability that he picks the balls in the order of $RBRB$
The probability that the first ball he picks is red is $\frac{1}{2}$
Now there are $2$ reds and $1$ blue in the urn. The probability that he picks blue is $\frac{1}{3}$
There are $2$ reds and $2$ blues now. The probability that he picks a red is $\frac{1}{2}$
Finally, there are $3$ reds and $2$ blues. The probability that he picks a blue is $\frac{2}{5}$
So the probability that the $RBRB$ case happens is $\frac{1}{2} \cdot \frac{1}{3} \cdot \frac{1}{2} \cdot \frac{2}{5} = \frac{1}{30}$ . However, since the $BRBR$ case is the exact same by symmetry, case 2 has a probability of $\frac{1}{30} \cdot 2 = \frac{1}{15}$ chance of happening.
$\textbf{CASE 3: }$ $RBBR$ and $BRRB$
Let's find the probability that he picks the balls in the order of $RBBR$
The probability that the first ball he picks is red is $\frac{1}{2}$
Now there are $2$ reds and $1$ blue in the urn. The probability that he picks blue is $\frac{1}{3}$
There are $2$ reds and $2$ blues now. The probability that he picks a blue is $\frac{1}{2}$
Finally, there are $2$ reds and $3$ blues. The probability that he picks a red is $\frac{2}{5}$
So the probability that the $RBBR$ case happens is $\frac{1}{2} \cdot \frac{1}{3} \cdot \frac{1}{2} \cdot \frac{2}{5} = \frac{1}{30}$ . However, since the $BRRB$ case is the exact same by symmetry, case 3 has a probability of $\frac{1}{30} \cdot 2 = \frac{1}{15}$ chance of happening.
Adding up the cases, we have $\frac{1}{15}+\frac{1}{15}+\frac{1}{15}=\boxed{15}$ ~quacker88

Solution:
We know that we need to find the probability of adding 2 red and 2 blue balls in some order.
There are 6 ways to do this, since there are $\binom{4}{2}=6$ ways to arrange $RRBB$ in some order.
We will show that the probability for each of these 6 ways is the same.
We first note that the denominators should be counted by the same number. This number is $2 \cdot 3 \cdot 4 \cdot 5=120$ . This is because 2, 3, 4, and 5 represent how many choices there are for the four steps. No matter what the $k-th$ step involves $k+1$ numbers to choose from.
The numerators are the number of successful operations. No matter the order, the first time a red is added will come from 1 choice and the second time will come from 2 choices, since that is how many reds are in the urn originally.
The same goes for the blue ones. The numerator must equal $(1 \cdot 2)^2$
Therefore, the probability for each of the orderings of $RRBB$ is $\frac{4}{120}=\frac{1}{30}$ . There are 6 of these, so the total probability is $\boxed{15}$

Solution: First, notice that when George chooses a ball he just adds another ball of the same color. On George's first move, he either chooses the red or the blue with a $\frac{1}{2}$ chance each. We can assume he chooses Red(chance $\frac{1}{2}$ ), and then multiply the final answer by two for symmetry. Now, there are two red balls and one blue ball in the urn. Then, he can either choose another Red(chance $\frac{2}{3}$ ), in which case he must choose two blues to get three of each, with probability $\frac{1}{4}\cdot\frac{2}{5}=\frac{1}{10}$ or a blue for two blue and two red in the urn, with chance $\frac{1}{3}$ . If he chooses blue next, he can either choose a red then a blue, or a blue then a red. Each of these has a $\frac{1}{2}\cdot\frac{2}{5}$ for total of $2\cdot\frac{1}{5}=\frac{2}{5}$ . The total probability that he ends up with three red and three blue is $2\cdot\frac{1}{2}(\frac{2}{3}\cdot\frac{1}{10}+\frac{1}{3}\cdot\frac{2}{5})=\frac{1}{15}+\frac{2}{15}=\boxed{15}$

Solution:
Let the probability that the urn ends up with more red balls be denoted $P(R)$ . Since this is equal to the probability there are more blue balls, the probability there are equal amounts is $1-2P(R)$ $P(R) =$ the probability no more blues are chosen plus the probability only 1 more blue is chosen. The first case, $P(\text{no more blues}) = \frac{1}{2}\cdot\frac{2}{3}\cdot\frac{3}{4}\cdot\frac{4}{5}=\frac{1}{5}$
The second case, $P(\text{1 more blue}) = 4\cdot\frac{1\cdot1\cdot2\cdot3}{2\cdot3\cdot4\cdot5} = \frac{1}{5}$ . Thus, the answer is $1-2\left(\frac{1}{5}+\frac{1}{5}\right)=1-\frac{4}{5}=\boxed{15}$

Solution:
Here $X$ stands for R or B, and $Y$ for the remaining color.
After 3 rounds one can either have a $4+1$ configuration ( $XXXXY$ ), or $3+2$ configuration ( $XXXYY$ ). The probability of getting to $XXXYYY$ from $XXXYY$ is $\frac{2}{5}$ . Observe that the probability of arriving to $4+1$ configuration is \[\frac{2}{3} \cdot \frac{3}{4} = \frac{1}{2}\] $\frac{2}{3}$ to get from $XXY$ to $XXXY$ $\frac{3}{4}$ to get from $XXXY$ to $XXXXY$ ). Thus the probability of arriving to $3+2$ configuration is also $\frac{1}{2}$ , and the answer is \[\frac{1}{2} \cdot \frac{2}{5} = \boxed{15}.\]

Solution:
We can use dynamic programming to solve this problem.
We let $dp[i][j]$ be the probability that we end up with $i$ red balls and $j$ blue balls.
Notice that there are only two ways that we can end up with $i$ red balls and $j$ blue balls: one is by fetching a red ball from the urn when we have $i - 1$ red balls and $j$ blue balls and the other is by fetching a blue ball from the urn when we have $i$ red balls and $j - 1$ blue balls.
Then we have $dp[i][j] = \frac{i - 1}{i - 1 + j} dp[i - 1][j] + \frac{j - 1}{i - 1 + j} dp[i][j - 1]$
Then we start can with $dp[1][1] = 1$ and try to compute $dp[3][3]$
\[\begin{array}{|c || c | c | c | c | c |} \hline i \text{\ \textbackslash\ } j & 1 & 2 & 3\\ \hline\hline 1 & 1 & 1/2 & 1/3\\ \hline 2 & 1/2 & 1/3 & 1/4\\ \hline 3 & 1/3 & 1/4 & 1/5\\ \hline \end{array}\] The answer is $\boxed{15}$


Answer: 15.0

Solution:
Suppose that we have a deck, currently containing just one black card. We then insert $n$ red cards one-by-one into the deck at random positions. It is easy to see using induction, that the black card is randomly situated in the deck.
Now, suppose that we have this deck again, with only one black card. Each time we pick a red ball, we place a card above the black card, and each time we pick a blue ball, we place a card below the black card. It is easy to see that the probability that the card is inserted into the top part of the deck is simply equal to the number of red balls divided by the total number of balls, and the probability that the card is inserted into the bottom part of the deck is equal to the number of blue balls divided by the total number of balls. Therefore, this is equivalent to inserting the card randomly into the deck.
Finally, four more red cards will be inserted into the deck, and so the black card can be in five possible positions. Only one corresponds to having three balls of each type. Our probability is thus $\frac{1}{5}$ , and so the answer is $\boxed{15}$

Solution:
Let $R$ denote the action where George selects a red ball and $B$ denote the action where he selects a blue one. Now, in order to get $3$ balls of each color, he needs $2$ more of both $R$ and $B$
There are 6 cases: $RRBB, RBRB, RBBR, BBRR, BRBR, BRRB$ (we can confirm that there are only $6$ since $\binom{4}{2}=6$ ). However we can clump $RRBB + BBRR$ $RBRB + BRBR$ , and $RBBR + BRRB$ together since they are equivalent by symmetry.
$\textbf{CASE 1: }$ $RRBB$ and $BBRR$
Let's find the probability that he picks the balls in the order of $RRBB$
The probability that the first ball he picks is red is $\frac{1}{2}$
Now there are $2$ reds and $1$ blue in the urn. The probability that he picks red again is now $\frac{2}{3}$
There are $3$ reds and $1$ blue now. The probability that he picks a blue is $\frac{1}{4}$
Finally, there are $3$ reds and $2$ blues. The probability that he picks a blue is $\frac{2}{5}$
So the probability that the $RRBB$ case happens is $\frac{1}{2} \cdot \frac{2}{3} \cdot \frac{1}{4} \cdot \frac{2}{5} = \frac{1}{30}$ . However, since the $BBRR$ case is the exact same by symmetry, case 1 has a probability of $\frac{1}{30} \cdot 2 = \frac{1}{15}$ chance of happening.
$\textbf{CASE 2: }$ $RBRB$ and $BRBR$
Let's find the probability that he picks the balls in the order of $RBRB$
The probability that the first ball he picks is red is $\frac{1}{2}$
Now there are $2$ reds and $1$ blue in the urn. The probability that he picks blue is $\frac{1}{3}$
There are $2$ reds and $2$ blues now. The probability that he picks a red is $\frac{1}{2}$
Finally, there are $3$ reds and $2$ blues. The probability that he picks a blue is $\frac{2}{5}$
So the probability that the $RBRB$ case happens is $\frac{1}{2} \cdot \frac{1}{3} \cdot \frac{1}{2} \cdot \frac{2}{5} = \frac{1}{30}$ . However, since the $BRBR$ case is the exact same by symmetry, case 2 has a probability of $\frac{1}{30} \cdot 2 = \frac{1}{15}$ chance of happening.
$\textbf{CASE 3: }$ $RBBR$ and $BRRB$
Let's find the probability that he picks the balls in the order of $RBBR$
The probability that the first ball he picks is red is $\frac{1}{2}$
Now there are $2$ reds and $1$ blue in the urn. The probability that he picks blue is $\frac{1}{3}$
There are $2$ reds and $2$ blues now. The probability that he picks a blue is $\frac{1}{2}$
Finally, there are $2$ reds and $3$ blues. The probability that he picks a red is $\frac{2}{5}$
So the probability that the $RBBR$ case happens is $\frac{1}{2} \cdot \frac{1}{3} \cdot \frac{1}{2} \cdot \frac{2}{5} = \frac{1}{30}$ . However, since the $BRRB$ case is the exact same by symmetry, case 3 has a probability of $\frac{1}{30} \cdot 2 = \frac{1}{15}$ chance of happening.
Adding up the cases, we have $\frac{1}{15}+\frac{1}{15}+\frac{1}{15}=\boxed{15}$ ~quacker88

Solution:
We know that we need to find the probability of adding 2 red and 2 blue balls in some order.
There are 6 ways to do this, since there are $\binom{4}{2}=6$ ways to arrange $RRBB$ in some order.
We will show that the probability for each of these 6 ways is the same.
We first note that the denominators should be counted by the same number. This number is $2 \cdot 3 \cdot 4 \cdot 5=120$ . This is because 2, 3, 4, and 5 represent how many choices there are for the four steps. No matter what the $k-th$ step involves $k+1$ numbers to choose from.
The numerators are the number of successful operations. No matter the order, the first time a red is added will come from 1 choice and the second time will come from 2 choices, since that is how many reds are in the urn originally.
The same goes for the blue ones. The numerator must equal $(1 \cdot 2)^2$
Therefore, the probability for each of the orderings of $RRBB$ is $\frac{4}{120}=\frac{1}{30}$ . There are 6 of these, so the total probability is $\boxed{15}$

Solution: First, notice that when George chooses a ball he just adds another ball of the same color. On George's first move, he either chooses the red or the blue with a $\frac{1}{2}$ chance each. We can assume he chooses Red(chance $\frac{1}{2}$ ), and then multiply the final answer by two for symmetry. Now, there are two red balls and one blue ball in the urn. Then, he can either choose another Red(chance $\frac{2}{3}$ ), in which case he must choose two blues to get three of each, with probability $\frac{1}{4}\cdot\frac{2}{5}=\frac{1}{10}$ or a blue for two blue and two red in the urn, with chance $\frac{1}{3}$ . If he chooses blue next, he can either choose a red then a blue, or a blue then a red. Each of these has a $\frac{1}{2}\cdot\frac{2}{5}$ for total of $2\cdot\frac{1}{5}=\frac{2}{5}$ . The total probability that he ends up with three red and three blue is $2\cdot\frac{1}{2}(\frac{2}{3}\cdot\frac{1}{10}+\frac{1}{3}\cdot\frac{2}{5})=\frac{1}{15}+\frac{2}{15}=\boxed{15}$

Solution:
Let the probability that the urn ends up with more red balls be denoted $P(R)$ . Since this is equal to the probability there are more blue balls, the probability there are equal amounts is $1-2P(R)$ $P(R) =$ the probability no more blues are chosen plus the probability only 1 more blue is chosen. The first case, $P(\text{no more blues}) = \frac{1}{2}\cdot\frac{2}{3}\cdot\frac{3}{4}\cdot\frac{4}{5}=\frac{1}{5}$
The second case, $P(\text{1 more blue}) = 4\cdot\frac{1\cdot1\cdot2\cdot3}{2\cdot3\cdot4\cdot5} = \frac{1}{5}$ . Thus, the answer is $1-2\left(\frac{1}{5}+\frac{1}{5}\right)=1-\frac{4}{5}=\boxed{15}$

Solution:
Here $X$ stands for R or B, and $Y$ for the remaining color.
After 3 rounds one can either have a $4+1$ configuration ( $XXXXY$ ), or $3+2$ configuration ( $XXXYY$ ). The probability of getting to $XXXYYY$ from $XXXYY$ is $\frac{2}{5}$ . Observe that the probability of arriving to $4+1$ configuration is \[\frac{2}{3} \cdot \frac{3}{4} = \frac{1}{2}\] $\frac{2}{3}$ to get from $XXY$ to $XXXY$ $\frac{3}{4}$ to get from $XXXY$ to $XXXXY$ ). Thus the probability of arriving to $3+2$ configuration is also $\frac{1}{2}$ , and the answer is \[\frac{1}{2} \cdot \frac{2}{5} = \boxed{15}.\]

Solution:
We can use dynamic programming to solve this problem.
We let $dp[i][j]$ be the probability that we end up with $i$ red balls and $j$ blue balls.
Notice that there are only two ways that we can end up with $i$ red balls and $j$ blue balls: one is by fetching a red ball from the urn when we have $i - 1$ red balls and $j$ blue balls and the other is by fetching a blue ball from the urn when we have $i$ red balls and $j - 1$ blue balls.
Then we have $dp[i][j] = \frac{i - 1}{i - 1 + j} dp[i - 1][j] + \frac{j - 1}{i - 1 + j} dp[i][j - 1]$
Then we start can with $dp[1][1] = 1$ and try to compute $dp[3][3]$
\[\begin{array}{|c || c | c | c | c | c |} \hline i \text{\ \textbackslash\ } j & 1 & 2 & 3\\ \hline\hline 1 & 1 & 1/2 & 1/3\\ \hline 2 & 1/2 & 1/3 & 1/4\\ \hline 3 & 1/3 & 1/4 & 1/5\\ \hline \end{array}\] The answer is $\boxed{15}$


Answer: 12.0

Ana and Bonita were born on the same date in different years, $n$ years apart. Last year Ana was $5$ times as old as Bonita. This year Ana's age is the square of Bonita's age. What is $n?$
$\textbf{(A) } 3 \qquad\textbf{(B) } 5 \qquad\textbf{(C) } 9 \qquad\textbf{(D) } 12 \qquad\textbf{(E) } 15$

Solution:
Let $A$ be the age of Ana and $B$ be the age of Bonita. Then,
\[A-1 = 5(B-1)\] and \[A = B^2.\]
Substituting the second equation into the first gives us
\[B^2-1 = 5(B-1).\]
By using difference of squares and dividing, $B=4.$ Moreover, $A=B^2=16.$
The answer is $16-4 = 12 \implies \boxed{12}$

Solution: Simple guess and check works. Start with all the square numbers - $1$ $4$ $9$ $16$ $25$ $36$ , etc. (probably stop at around $100$ since at that point it wouldn't make sense). If Ana is $9$ , then Bonita is $3$ , so in the previous year, Ana's age was $4$ times greater than Bonita's. If Ana is $16$ , then Bonita is $4$ , and Ana's age was $5$ times greater than Bonita's in the previous year, as required. The difference in the ages is $16 - 4 = 12. \boxed{12}$

Solution: The second sentence of the problem says that Ana's age was once $5$ times Bonita's age. Therefore, the difference of the ages $n$ must be divisible by $4.$ The only answer choice which is divisible by $4$ is $12 \rightarrow \boxed{12}.$


Answer: 1920.0

Ana's monthly salary was $$2000$ in May.  In June she received a 20% raise.  In July she received a 20% pay cut.  After the two changes in June and July, Ana's monthly salary was
$\text{(A)}\ 1920\text{ dollars} \qquad \text{(B)}\ 1980\text{ dollars} \qquad \text{(C)}\ 2000\text{ dollars} \qquad \text{(D)}\ 2020\text{ dollars} \qquad \text{(E)}\ 2040\text{ dollars}$

Solution:
Notice that a 20% raise translates to Ana's monthly salary multiplied by $(100 + 10)\% = 120\%$ , and a 20% pay cut translates to her salary multiplied by $100\% - 20\% = 80\%$ , so
\[2000 \cdot 120\% = 2400\] \[2400 \cdot 80\% = 1920 \rightarrow \boxed{1920}\]


Answer: 61.0

Ana, Bob, and CAO bike at constant rates of $8.6$ meters per second, $6.2$ meters per second, and $5$ meters per second, respectively. They all begin biking at the same time from the northeast corner of a rectangular field whose longer side runs due west. Ana starts biking along the edge of the field, initially heading west, Bob starts biking along the edge of the field, initially heading south, and Cao bikes in a straight line across the field to a point $D$ on the south edge of the field. Cao arrives at point $D$ at the same time that Ana and Bob arrive at $D$ for the first time. The ratio of the field's length to the field's width to the distance from point $D$ to the southeast corner of the field can be represented as $p : q : r$ , where $p$ $q$ , and $r$ are positive integers with $p$ and $q$ relatively prime. Find $p+q+r$

Solution:
Let $a,b,c$ be the labeled lengths as shown in the diagram. Also, assume WLOG the time taken is $1$ second.
Observe that $\dfrac{2a+b+c}{8.6}=1$ or $2a+b+c=8.6$ , and $\dfrac{b+c}{6.2}=1$ or $b+c=6.2$ . Subtracting the second equation from the first gives $2a=2.4$ , or $a=1.2$
Now, let us solve $b$ and $c$ . Note that $\dfrac{\sqrt{b^2+c^2}}{5}=1$ , or $b^2+c^2=25$ . We also have $b+c=6.2$
We have a system of equations: \[\left\{\begin{array}{l}b+c=6.2\\ b^2+c^2=25\end{array}\right.\]
Squaring the first equation gives $b^2+2bc+c^2=38.44$ , and subtracting the second from this gives $2bc=13.44$ . Now subtracting this from $b^2+c^2=25$ gives $b^2-2bc+c^2=(b-c)^2=11.56$ , or $b-c=3.4$ . Now we have the following two equations:
\[\left\{\begin{array}{l}b+c=6.2\\ b-c=3.4\end{array}\right.\]
Adding the equations and dividing by two gives $b=4.8$ , and it follows that $c=1.4$
The ratios we desire are therefore $1.4:6:4.8=7:30:24$ , and our answer is $7+30+24=\boxed{061}$


Answer: 65.0

Andrea and Lauren are $20$ kilometers apart. They bike toward one another with Andrea traveling three times as fast as Lauren, and the distance between them decreasing at a rate of $1$ kilometer per minute. After $5$ minutes, Andrea stops biking because of a flat tire and waits for Lauren. After how many minutes from the time they started to bike does Lauren reach Andrea?
$\mathrm{(A)}\ 20 \qquad \mathrm{(B)}\ 30 \qquad \mathrm{(C)}\ 55 \qquad \mathrm{(D)}\ 65 \qquad \mathrm{(E)}\ 80$

Solution:
Since the distance between them decreases at a rate of $1$ kilometer per minute when they are both biking, their combined speed is $1$ kilometer per minute. Andrea travels three times as fast as Lauren, so they travel at speeds of $\frac{3}{4}$ kilometers per minute and $\frac{1}{4}$ kilometers per minute, respectively.
After $5$ minutes, the distance between them will have decreased by $5$ kilometers, so they will be $20-5 = 15$ kilometers apart when Andrea stops. Then, Lauren will take $\frac{15}{\frac{1}{4}} = 15*4=60$ more minutes to reach Andrea.
They started to bike $5$ minutes before Andrea stopped, so the total time Lauren passed from the time they started biking to the time Lauren reached Andrea is $60+5=65$ minutes. Hence, the answer is $\boxed{65}$ . ~azc1027


Answer: 65.0

Solution:
Because the speed of Andrea is 3 times as fast as Lauren and the distance between them is decreasing at a rate of 1 kilometer per minute, Andrea's speed is $\frac{3}{4} \textbf{km/min}$ , and Lauren's $\frac{1}{4} \textbf{km/min}$ . Therefore, after 5 minutes, Andrea will have biked $\frac{3}{4} \cdot 5 = \frac{15}{4}km$
In all, Lauren will have to bike $20 - \frac{15}{4} = \frac{80}{4} - \frac{15}{4} = \frac{65}{4}km$ . Because her speed is $\frac{1}{4} \textbf{km/min}$ , the time elapsed will be $\frac{\frac{65}{4}}{\frac{1}{4}} = \boxed{65}$


Answer: 65.0

Solution:
Let their speeds in kilometers per hour be $v_A$ and $v_L$ . We know that $v_A=3v_L$ and that $v_A+v_L=60$ . (The second equation follows from the fact that $1\mathrm km/min = 60\mathrm km/h$ .) This solves to $v_A=45$ and $v_L=15$
As the distance decreases at a rate of $1$ kilometer per minute, after $5$ minutes the distance between them will be $20-5=15$ kilometers.
From this point on, only Lauren will be riding her bike. As there are $15$ kilometers remaining and $v_L=15$ , she will need exactly an hour to get to Andrea. Therefore the total time in minutes is $5+60 = \boxed{65}$


Answer: 471.0

Ang, Ben, and Jasmin each have $5$ blocks, colored red, blue, yellow, white, and green; and there are $5$ empty boxes. Each of the people randomly and independently of the other two people places one of their blocks into each box. The probability that at least one box receives $3$ blocks all of the same color is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. What is $m + n ?$
$\textbf{(A)} ~47 \qquad\textbf{(B)} ~94 \qquad\textbf{(C)} ~227 \qquad\textbf{(D)} ~471 \qquad\textbf{(E)} ~542$

Solution:
Let our denominator be $(5!)^3$ , so we consider all possible distributions.
We use PIE (Principle of Inclusion and Exclusion) to count the successful ones.
When we have at $1$ box with all $3$ balls the same color in that box, there are $_{5} C _{1} \cdot _{5} P _{1} \cdot (4!)^3$ ways for the distributions to occur ( $_{5} C _{1}$ for selecting one of the five boxes for a uniform color, $_{5} P _{1}$ for choosing the color for that box, $4!$ for each of the three people to place their remaining items).
However, we overcounted those distributions where two boxes had uniform color, and there are $_{5} C _{2} \cdot _{5} P _{2} \cdot (3!)^3$ ways for the distributions to occur ( $_{5} C _{2}$ for selecting two of the five boxes for a uniform color, $_{5} P _{2}$ for choosing the color for those boxes, $3!$ for each of the three people to place their remaining items).
Again, we need to re-add back in the distributions with three boxes of uniform color... and so on so forth.
Our success by PIE is \[_{5} C _{1} \cdot _{5} P _{1} \cdot (4!)^3 - _{5} C _{2} \cdot _{5} P _{2} \cdot (3!)^3 + _{5} C _{3} \cdot _{5} P _{3} \cdot (2!)^3 - _{5} C _{4} \cdot _{5} P _{4} \cdot (1!)^3 + _{5} C _{5} \cdot _{5} P _{5} \cdot (0!)^3 = 120 \cdot 2556.\] \[\frac{120 \cdot 2556}{120^3}=\frac{71}{400},\] yielding an answer of $\boxed{471}$

Solution: As In Solution 1, the probability is \[\frac{\binom{5}{1}\cdot 5\cdot (4!)^3 - \binom{5}{2}\cdot 5\cdot 4\cdot (3!)^3 + \binom{5}{3}\cdot 5\cdot 4\cdot 3\cdot (2!)^3 - \binom{5}{4}\cdot 5\cdot 4\cdot 3\cdot 2\cdot (1!)^3 + \binom{5}{5}\cdot 5\cdot 4\cdot 3\cdot 2\cdot 1}{(5!)^3}\] \[= \frac{5\cdot 5\cdot (4!)^3 - 10\cdot 5\cdot 4\cdot (3!)^3 + 10\cdot 5\cdot 4\cdot 3\cdot (2!)^3 - 5\cdot 5! + 5!}{(5!)^3}.\] Dividing by $5!$ , we get \[\frac{5\cdot (4!)^2 - 10\cdot (3!)^2 + 10\cdot (2!)^2 - 5 + 1}{(5!)^2}.\] Dividing by $4$ , we get \[\frac{5\cdot 6\cdot 24 - 10\cdot 9 + 10 - 1}{30\cdot 120}.\] Dividing by $9$ , we get \[\frac{5\cdot 2\cdot 8 - 10 + 1}{10\cdot 40} = \frac{71}{400} \implies \boxed{471}\]

Solution:
Use complementary counting.
Denote $T_n$ as the total number of ways to put $n$ colors to $n$ boxes by 3 people out of which $f_n$ ways are such that no box has uniform color. Notice $T_n = (n!)^3$ . From this setup we see the question is asking for $1-\frac{f_5}{(5!)^3}$ . To find $f_5$ we want to exclude the cases of a) one box of the same color, b) 2 boxes of the same color, c) 3 boxes of same color, d) 4 boxes of the same color, and e) 5 boxes of the same color. Cases d) and e) coincide. From this, we have
\[f_5=T_5 -{\binom{5}{1}\binom{5}{1}\cdot f_4 - \binom{5}{2}\binom{5}{2}\cdot 2!\cdot f_3 - \binom{5}{3}\binom{5}{3}\cdot 3!\cdot f_2 - 5!}\]
In case b), there are $\binom{5}{2}$ ways to choose 2 boxes that have the same color, $\binom{5}{2}$ ways to choose the two colors, 2! ways to permute the 2 chosen colors, and $f_3$ ways so that the remaining 3 boxes don’t have the same color. The same goes for cases a) and c). In case e), the total number of ways to permute 5 colors is $5!$ . Now, we just need to calculate $f_2$ $f_3$ and $f_4$
We have $f_2=T_2-2 = (2!)^3 - 2 = 6$ , since we subtract the number of cases where the boxes contain uniform colors, which is 2.
In the same way, $f_3=T_3-\Big[3!+ \binom{3}{1}\binom{3}{1}\cdot f_2 \Big] = 156$ - again, we must subtract the number of ways at least 1 box has uniform color. There are $3!$ ways if 3 boxes each contains uniform color. Two boxes each contains uniform color is the same as previous. If one box has the same color, there are $\binom{3}{1}$ ways to pick a box, and $\binom{3}{1}$ ways to pick a color for that box, 1! ways to permute the chosen color, and $f_2$ ways for the remaining 2 boxes to have non-uniform colors. Similarly, $f_4=(4!)^3-\Big[ 4!+ \binom{4}{2}\binom{4}{2}\cdot 2! \cdot f_2+ \binom{4}{1}\binom{4}{1}\cdot f_3\Big] = 10,872$
Thus, $f_5 = f_5=(5!)^3-\Big[\binom{5}{1}\binom{5}{1}\cdot f_4+ \binom{5}{2}\binom{5}{2}\cdot 2!\cdot f_3+\binom{5}{3}\binom{5}{3}\cdot 3!\cdot f_2 + 5!\Big] = (5!)^3 - 306,720$
Thus, the probability is $\frac{306,720}{(5!)^3} = 71/400$ and the answer is $\boxed{471}$

Solution:
WLOG fix which block Ang places into each box. (This can also be thought of as labeling each box by the color of Ang's block.) There are then $(5!)^2$ total possibilities.
As in Solution 1 , we use PIE. With $1$ box of uniform color, there are ${}_{5} C _{1} \cdot (4!)^2$ possibilities ( ${}_{5} C _{1}$ for selecting one of the five boxes (whose color is fixed by Ang), $4!$ for each of Ben and Jasmin to place their remaining items). We overcounted cases with $2$ boxes, of which there are ${}_{5} C _{2} \cdot (3!)^2$ possibilities, and so on.
The probability is thus \[\frac{{}_{5} C _{1} \cdot (4!)^2 - {}_{5} C _{2} \cdot (3!)^2 + {}_{5} C _{3} \cdot (2!)^2 - {}_{5} C _{4} \cdot (1!)^2 + {}_{5} C _{5} \cdot (0!)^2}{(5!)^2}\] \[= \frac{5 \cdot (4!)^2 - 10 \cdot (3!)^2 + 10 \cdot (2!)^2 - 5 + 1}{(5!)^2}\] at which point we can proceed as in #Alternate simplification to simplify to $\frac{71}{400} \implies \boxed{471}$

Solution:
$!n$ denotes the number of derangements of $n$ elements, i.e. the number of permutations where no element appears in its original position. Recall the recursive formula $!0 = 1, !1 = 0, !n = (n-1)(!(n-1)+{!}(n-2))$
We will consider the number of candidate boxes (ones that currently remain uniform-color) after each person places their blocks.
After Ang, all $5$ boxes are candidates, and each has a fixed color its blocks must be to remain uniform-color.
Ben has $5!$ total ways to place blocks. There are $\tbinom{5}{k}\cdot{!}k$ ways to disqualify $k$ candidates, $0 \le k \le 5$ . (There are $\tbinom{5}{k}$ ways to choose the candidates to disqualify, and $!k$ ways to arrange the disqualified candidates' same-color blocks.)
Jasmin has $5!$ total ways to place blocks. Currently, $k$ boxes are no longer candidates. Consider the number of ways for Jasmin to place blocks such that no box remains a candidate, where $n$ is the number of boxes and $k$ is the number of non-candidates, and call it $D(n,k)$ (not to be confused with partial derangements). We wish to find $5!-D(5,k)$ for each $k$ $0 \le k \le 5$
Notice that $D(n,0) = {!}n$ , since all boxes are candidates and no block can be placed in the same-colored box. Also notice the recursive formula $D(n,k) = D(n-1,k-1)+D(n,k-1)$ , since the first non-candidate box can either contain its same-color block (in which case it can be ignored), or a different-color block (in which case it can be treated as a candidate).
We can make a table ( $n$ horizontal, $k$ vertical): \[\begin{array}{r|rrrrrr} D(n,k) & 0 & 1 & 2 & 3 & 4 & 5 \\ \hline 0 & 1 & 0 & 1 & 2 & 9 & 44 \\ 1 & & 1 & 1 & 3 & 11 & 53 \\ 2 & & & 2 & 4 & 14 & 64 \\ 3 & & & & 6 & 18 & 78 \\ 4 & & & & & 24 & 96 \\ 5 & & & & & & 120 \\ \end{array}\] (Note that $D(n,n) = n!$ since there are no candidates to begin with, which checks out with the diagonal.)
The desired values of $D(5,k)$ are in the rightmost column.
The probability that at least one box is of uniform color is thus \begin{align*} & \frac{\sum_{k=0}^{5}{\left(\binom{5}{k}\cdot{!}k\right)(5!-D(5,k))}}{(5!)^2} \\ ={}& \frac{(1\cdot1)(120-44)+(5\cdot0)(120-53)+(10\cdot1)(120-64)+(10\cdot2)(120-78)+(5\cdot9)(120-96)+(1\cdot44)(120-120)}{(5!)^2} \\ ={}& \frac{76+0+560+840+1080+0}{(5!)^2} \\ ={}& \frac{19+140+210+270}{(5!)(5\cdot3\cdot2)} \\ ={}& \frac{639}{(5!)(5\cdot3\cdot2)} \\ ={}& \frac{71}{(5\cdot4\cdot2)(5\cdot2)} \\ ={}& \frac{71}{400} \implies \boxed{471}


Answer: 13.0

Angie, Bridget, Carlos, and Diego are seated at random around a square table, one person to a side. What is the probability that Angie and Carlos are seated opposite each other?
$\textbf{(A) } \frac14 \qquad\textbf{(B) } \frac13 \qquad\textbf{(C) } \frac12 \qquad\textbf{(D) } \frac23 \qquad\textbf{(E) } \frac34$

Solution: If we designate a person to be on a certain side, then all placements of the other people can be considered unique. WLOG, assign Angie to be on the side. There are then $3!=6$ total seating arrangements. If Carlos is across from Angie, there are only $2!=2$ ways to fill the remaining two seats. Then the probability Angie and Carlos are seated opposite each other is $\frac26=\boxed{13}$

Solution: If we seat Angie first, there would be only one out of three ways Carlos can sit across from Angie. So the final answer is $\boxed{13}$


Answer: 53.0

Anh read a book. On the first day she read $n$ pages in $t$ minutes, where $n$ and $t$ are positive integers. On the second day Anh read $n + 1$ pages in $t + 1$ minutes. Each day thereafter Anh read one more page than she read on the previous day, and it took her one more minute than on the previous day until she completely read the $374$ page book. It took her a total of $319$ minutes to read the book. Find $n + t$

Solution: We could see that both $374$ and $319$ are divisible by $11$ in the outset, and that $34$ and $29$ , the quotients, are relatively prime. Both are the $average$ number of minutes across the $11$ days, so we need to subtract $\left \lfloor{\frac{11}{2}}\right \rfloor=5$ from each to get $(n,t)=(29,24)$ and $29+24=\boxed{053}$

Solution: If we let $k$ be equal to the number of days it took to read the book, the sum of $n$ through $n+k$ is equal to $(2n+k)(k+1)=748$ Similarly, $(2t+k)(k+1)=638$ We know that both factors must be integers and we see that the only common multiple of $748$ and $638$ not equal to $1$ that will get us positive integer solutions for $n$ and $t$ is $11$ . We set $k+1=11$ so $k=10$ . We then solve for $n$ and $t$ in their respective equations, getting $2n+10=68$ $n=29$ We also get $2t+10=58$ $t=24$ . Our final answer is $29+24=\boxed{053}$

Solution: Notice $374=34\cdot 11$ and $319=29\cdot 11$ . Also, note the sum of an arithmetic series is $\frac{2n+k}{2} \cdot b$ , where $n$ is our first term, $n+k$ is our final term, and $b$ is the number of terms. Since we know both sequences of $n$ and $t$ have the same length, and since $11$ is prime and shared by both $319$ and $374$ , we deduce that $b=11$ . Thus from here we know $2n+k=68$ and $2t+k=58$ by using our other factors $34$ and $29$ . Finally, we add the two systems up and we get $2t+2k+2n=126$ . But, notice that $k=b-1$ , since the first term has $k=0$ , and our last term has $k=b-1$ . Plugging this back into our equation we get $2n+2t=106 \implies n+t=\boxed{053}$

Solution:
We list two equations:
\begin{align*}
n+(n+1)+...+(n+k)&=374\\
t+(t+1)+...+(t+k)&=319.
\end{align*}
Subtracting the two, we get: \[(n-t)(k+1)=374-319=55.\] Manipulating the first and second equation, we get:
\begin{align*}
n(k+1)+\frac{k(k+1)}{2}&=374 \\
t(k+1)+\frac{k(k+1)}{2}&=319.
\end{align*}
We factor out the common factor $k+1$ :
\begin{align*}
(k+1)\left(n+\frac{k}{2}\right)&=374 \\
(k+1)\left(t+\frac{k}{2}\right)&=319.
\end{align*}
Note that $374$ and $319$ have a GCD of $11,$ now combining this with our equation that $(n-t)(k+1)=55,$ we see that $k+1$ has to equal $11.$ Thus, we get: \[(n,t)=(29,24) \Rightarrow n+t=29+24=\boxed{053}.\] Note: We see that because n-t=5, it becomes impossible for n+k/2 and t+k/2 to both be multiples of 11. Thus, this satisfies our condition. Thus k+1 must be 11 to satisfy the common factor 11 constraint. mathboy282


Answer: 24.0

Ann and Barbara were comparing their ages and found that Barbara is as old as Ann was when Barbara was as old as
Ann had been when Barbara was half as old as Ann is. If the sum of their present ages is $44$ years, then Ann's age is
$\textbf{(A) }22\qquad \textbf{(B) }24\qquad \textbf{(C) }25\qquad \textbf{(D) }26\qquad  \textbf{(E) }28$

Solution:
This problem is very wordy. Nonetheless, let $a$ and $b$ be Ann and Barbara's current ages, respectively. We are given that $a+b=44$ . Let $y$ equal the difference between their ages, so $y=a-b$ . Know that $y$ is constant because the difference between their ages will always be the same.
Now, let's tackle the equation: $b=$ Ann's age when Barbara was Ann's age when Barbara was $\frac{a}{2}$ . When Barbara was $\frac{a}{2}$ years old, Ann was $\frac{a}{2}+y$ years old. So the equation becomes $b=$ Ann's age when Barbara was $\frac{a}{2}+y$ . Adding on their age difference again, we get $b = \frac{a}{2} + y + y \Rightarrow b = \frac{a}{2} + 2y$ . Substitute $a-b$ back in for $y$ to get $b = \frac{a}{2} + 2(a-b)$ . Simplify: $2b = a + 4(a-b) \Rightarrow 6b = 5a$ . Solving $b$ in terms of $a$ , we have $b = \frac{5a}{6}$ . Substitute that back into the first equation of $a+b=44$ to get $\frac{11a}{6}=44$ . Solve for $a$ , and the answer is $\boxed{24}$ . ~ jiang147369


Answer: 22.0

Ann made a $3$ -step staircase using $18$ toothpicks as shown in the figure. How many toothpicks does she need to add to complete a $5$ -step staircase?
$\textbf{(A)}\ 9\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 22\qquad\textbf{(E)}\ 24$
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } }[/asy]

Solution: We can see that a $1$ -step staircase requires $4$ toothpicks and a $2$ -step staircase requires $10$ toothpicks. Thus, to go from a $1$ -step to $2$ -step staircase, $6$ additional toothpicks are needed and to go from a $2$ -step to $3$ -step staircase, $8$ additional toothpicks are needed. Applying this pattern, to go from a $3$ -step to $4$ -step staircase, $10$ additional toothpicks are needed and to go from a $4$ -step to $5$ -step staircase, $12$ additional toothpicks are needed. Our answer is $10+12=\boxed{22}$


Answer: 3.0

Anna and Bella are celebrating their birthdays together. Five years ago, when Bella turned $6$ years old, she received a newborn kitten as a birthday present. Today the sum of the ages of the two children and the kitten is $30$ years. How many years older than Bella is Anna?
$\textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 3 \qquad \textbf{(D) } 4 \qquad \textbf{(E) } ~5$

Solution:
Five years ago, Bella was $6$ years old, and the kitten was $0$ years old.
Today, Bella is $11$ years old, and the kitten is $5$ years old. It follows that Anna is $30-11-5=14$ years old.
Therefore, Anna is $14-11=\boxed{3}$ years older than Bella.


Answer: 22.0

Anna enjoys dinner at a restaurant in Washington, D.C., where the sales tax on meals is 10%. She leaves a 15% tip on the price of her meal before the sales tax is added, and the tax is calculated on the pre-tip amount. She spends a total of 27.50 dollars for dinner. What is the cost of her dinner without tax or tip in dollars?
$\textbf{(A)}\ 18\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 21\qquad\textbf{(D)}\ 22\qquad\textbf{(E)}\ 24$

Solution:
Let $x$ be the cost of her dinner.
$27.50=x+\frac{1}{10}*x+\frac{3}{20}*x$
$27+\frac{1}{2}=\frac{5}{4}*x$
$\frac{55}{2}=\frac{5}{4}x$
$\frac{55}{2}*\frac{4}{5}=x$
$x=22$
$\boxed{22}$


Answer: 5.0

Annie and Bonnie are running laps around a $400$ -meter oval track. They started together, but Annie has pulled ahead, because she runs $25\%$ faster than Bonnie. How many laps will Annie have run when she first passes Bonnie?
$\textbf{(A) }1\dfrac{1}{4}\qquad\textbf{(B) }3\dfrac{1}{3}\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad \textbf{(E) }25$

Solution: Each lap Bonnie runs, Annie runs another quarter lap, so Bonnie will run four laps before she is overtaken.  This means that Annie and Bonnie are equal so that Annie needs to run another lap to overtake Bonnie. That means Annie will have run $\boxed{5}$ laps.

Solution: Call $x$ the distance Annie runs. If Annie is $25\%$ faster than Bonnie, then Bonnie will run a distance of $\frac{4}{5}x$ . For Annie to meet Bonnie, she must run an extra $400$ meters, the length of the track. So $x-\left(\frac{4}{5}\right)x=400 \implies x=2000$ , which is $\boxed{5}$ laps.


Answer: 83.0

Antonette gets $70 \%$ on a 10-problem test, $80 \%$ on a 20-problem test and $90 \%$ on a 30-problem test. If the three tests are combined into one 60-problem test, which percent is closest to her overall score?
$\textbf{(A)}\ 40\qquad\textbf{(B)}\ 77\qquad\textbf{(C)}\ 80\qquad\textbf{(D)}\ 83\qquad\textbf{(E)}\ 87$

Solution:
$70 \% \cdot 10=7$
$80 \% \cdot 20=16$
$90 \% \cdot 30=27$
Adding them up gets $7+16+27=50$ . The overall percentage correct would be $\frac{50}{60}=\frac{5}{6}=5 \cdot 16.\overline{6}=83.\overline{3} \approx \boxed{83}$


Answer: 3.0

Any three vertices of the cube $PQRSTUVW$ , shown in the figure below, can be connected to form a triangle. (For example, vertices $P$ $Q$ , and $R$ can be connected to form isosceles $\triangle PQR$ .) How many of these triangles are equilateral and contain $P$ as a vertex?
[asy] unitsize(4); pair P,Q,R,S,T,U,V,W; P=(0,30); Q=(30,30); R=(40,40); S=(10,40); T=(10,10); U=(40,10); V=(30,0); W=(0,0); draw(W--V); draw(V--Q); draw(Q--P); draw(P--W); draw(T--U); draw(U--R); draw(R--S); draw(S--T); draw(W--T); draw(P--S); draw(V--U); draw(Q--R); dot(P); dot(Q); dot(R); dot(S); dot(T); dot(U); dot(V); dot(W); label("$P$",P,NW); label("$Q$",Q,NW); label("$R$",R,NE); label("$S$",S,N); label("$T$",T,NE); label("$U$",U,NE); label("$V$",V,SE); label("$W$",W,SW); [/asy]
$\textbf{(A)}0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }6$

Solution:
The only equilateral triangles that can be formed are through the diagonals of the faces of the square. From P you have $3$ possible vertices that are possible to form a diagonal through one of the faces. Therefore, there are $3$ possible triangles. So the answer is $\boxed{3}$ ~Math645
~andliu766
~e___

Solution: Each other compatible point must be an even number of edges away from P, so the compatible points are R, V, and T. Therefore, we must choose two of the three points, because P must be a point in the triangle. So, the answer is ${3 \choose 2} = \boxed{3}$

Solution: List them out- you get $PRV$ $PRT$ , and $PVT$ . Therefore, the answer is $\boxed{3}$


Answer: 144.0

Applied to a bill for $\textdollar{10,000}$ the difference between a discount of $40$ % and two successive discounts of $36$ % and $4$ %,
expressed in dollars, is:
$\textbf{(A)}0\qquad \textbf{(B)}144\qquad \textbf{(C)}256\qquad \textbf{(D)}400\qquad \textbf{(E)}416$

Solution:
Taking the discount of $40$ % means you're only paying $60$ % of the bill.  That results in $10,000\cdot0.6=\textdollar{6,000}$
Likewise, taking two discounts of $36$ % and $4$ % means taking $64$ % of the original amount and then $96$ % of the result.  That results in $10,000\cdot0.64\cdot0.96=\textdollar{6,144}$
Taking the difference results in $6,144-6,000=\textdollar{144}$ , or answer choice $\boxed{144}$


Answer: 55.0

Ara and Shea were once the same height. Since then Shea has grown 20% while Ara has grown half as many inches as Shea. Shea is now 60 inches tall. How tall, in inches, is Ara now?
$\text{(A)}\ 48 \qquad \text{(B)}\ 51 \qquad \text{(C)}\ 52 \qquad \text{(D)}\ 54 \qquad \text{(E)}\ 55$

Solution: Shea has grown $20\%$ , if x was her original height, then $1.2x = 60$ , so she was originally $\frac{60}{1.2}=50$ inches tall which is a $60 - 50 = 10$ inch increase.  Ara also started off at $50$ inches.  Since Ara grew half as much as Shea, Ara grew $\frac{10}{2} = 5$ inches.  Therefore, Ara is now $50+5=55$ inches tall which is choice $\boxed{55}.$


Answer: 8.0

Arithmetic sequences $\left(a_n\right)$ and $\left(b_n\right)$ have integer terms with $a_1=b_1=1<a_2 \le b_2$ and $a_n b_n = 2010$ for some $n$ . What is the largest possible value of $n$
$\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 8 \qquad \textbf{(D)}\ 288 \qquad \textbf{(E)}\ 2009$

Solution:
Since $\left(a_n\right)$ and $\left(b_n\right)$ have integer terms with $a_1=b_1=1$ , we can write the terms of each sequence as
\begin{align*}&\left(a_n\right) \Rightarrow \{1, x+1, 2x+1, 3x+1, ...\}\\ &\left(b_n\right) \Rightarrow \{1, y+1, 2y+1, 3y+1, ...\}\end{align*}
where $x$ and $y$ $x\leq y$ ) are the common differences of each, respectively.
Since
\begin{align*}a_n &= (n-1)x+1\\ b_n &= (n-1)y+1\end{align*}
it is easy to see that
$a_n \equiv b_n \equiv 1 \mod{(n-1)}$
Hence, we have to find the largest $n$ such that $\frac{a_n-1}{n-1}$ and $\frac{b_n-1}{n-1}$ are both integers; equivalently, we want to maximize $\gcd(a_n-1, b_n-1)$
The prime factorization of $2010$ is $2\cdot{3}\cdot{5}\cdot{67}$ . We list out all the possible pairs that have a product of $2010$ , noting that these are the possible values of $(a_n, b_n)$ and we need $a_n \leq b_n$
\[(2,1005), (3, 670), (5,402), (6,335), (10,201),(15,134),(30,67)\]
and soon find that the largest $n-1$ value is $7$ for the pair $(15, 134)$ , and so the largest $n$ value is $\boxed{8}$

Solution:
Since
$a_n*b_n = 2010,$
and
$a_n \le b_n$ ,
blue+yellow=green
it follows that
$a_n \le \sqrt{2010} \Rightarrow a_n \le 44$
But $a_n$ and $b_n$ are also integers, so $a_n$ must be a factor of $2010$ smaller than $44$ . Notice that $2010 = 2*3*5*67$ . Therefore $a_n = 2, 3, 5, 6, 112, 15,$ or $30$ and $b_n = 1005, 670, 402, 335, 201, 134,$ or $67$ ; respectively.
Notice that the term $a_m$ is equivalent to the first term $a_1 = 1$ plus $(m-1)$ times the common difference for that particular arithmetic sequence. Let the common difference of $(a_n)$ be $k$ and the common difference of $(b_n)$ be $i$ (not $\sqrt{-1}$ ). Then
$a_n$ (the $n$ th term, not the sequence itself) $=1 + k(n-1)$
and
$b_n = 1 + i(n-1)$
Subtracting one from all the possible values listed above for $a_n$ and $b_n$ , we get
$k(n-1) = 1, 2, 4, 5, 9, 14, 29$
and
$i(n-1) = 1004, 669, 401, 334, 200, 133, 66$
In order to maximize $n$ , we must maximize $n-1$ . Therefore $k$ and $i$ are coprime and $n-1$ is the GCF of any corresponding pair. Inspecting all of the pairs, we see that the GCF is always $1$ except for the pair $(14, 133),$ which has a GCF of $7$ . Therefore the maximum value of $n$ is $8 \Rightarrow \boxed{8}$


Answer: 621.0

Arjun and Beth play a game in which they take turns removing one brick or two adjacent bricks from one "wall" among a set of several walls of bricks, with gaps possibly creating new walls. The walls are one brick tall. For example, a set of walls of sizes $4$ and $2$ can be changed into any of the following by one move: $(3,2),(2,1,2),(4),(4,1),(2,2),$ or $(1,1,2).$
[asy] unitsize(4mm); real[] boxes = {0,1,2,3,5,6,13,14,15,17,18,21,22,24,26,27,30,31,32,33}; for(real i:boxes){ 	draw(box((i,0),(i+1,3))); } draw((8,1.5)--(12,1.5),Arrow()); defaultpen(fontsize(20pt)); label(",",(20,0)); label(",",(29,0)); label(",...",(35.5,0)); [/asy]
Arjun plays first, and the player who removes the last brick wins. For which starting configuration is there a strategy that guarantees a win for Beth?
$\textbf{(A) }(6,1,1) \qquad \textbf{(B) }(6,2,1) \qquad \textbf{(C) }(6,2,2)\qquad \textbf{(D) }(6,3,1) \qquad \textbf{(E) }(6,3,2)$

Solution:
We say that a game state is an N-position if it is winning for the next player (the player to move), and a P-position if it is winning for the other player. We are trying to find which of the given states is a P-position.
First we note that symmetrical positions are P-positions, as the second player can win by mirroring the first player's moves. It follows that $(6, 1, 1)$ is an N-position, since we can win by moving to $(2, 2, 1, 1)$ ; this rules out $\textbf{(A)}$ . We next look at $(6, 2, 1)$ . The possible next states are \[(6, 2), \enskip (6, 1, 1), \enskip (6, 1), \enskip (5, 2, 1), \enskip (4, 2, 1, 1), \enskip (4, 2, 1), \enskip (3, 2, 2, 1), \enskip (3, 2, 1, 1), \enskip (2, 2, 2, 1).\] None of these are symmetrical, so we might reasonably suspect that they are all N-positions. Indeed, it just so happens that for all of these states except $(6, 2)$ and $(6, 1)$ , we can win by moving to $(2, 2, 1, 1)$ ; it remains to check that $(6, 2)$ and $(6, 1)$ are N-positions.
To save ourselves work, it would be nice if we could find a single P-position directly reachable from both $(6, 2)$ and $(6, 1)$ . We notice that $(3, 2, 1)$ is directly reachable from both states, so it would suffice to show that $(3, 2, 1)$ is a P-position. Indeed, the possible next states are \[(3, 2), \enskip (3, 1, 1), \enskip (3, 1), \enskip (2, 2, 1), \enskip (2, 1, 1, 1), \enskip (2, 1, 1),\] which allow for the following refutations:
\begin{align*} &(3, 2) \to (2, 2), && &&(3, 1, 1) \to (1, 1, 1, 1), && &&(3, 1) \to (1, 1), \\ &(2, 2, 1) \to (2, 2), && &&(2, 1, 1, 1) \to (1, 1, 1, 1), && &&(2, 1, 1) \to (1, 1). \end{align*}
Hence, $(3, 2, 1)$ is a P-position, so $(6, 2)$ and $(6, 1)$ are both N-positions, along with all other possible next states from $(6, 2, 1)$ as noted before. Thus, $(6, 2, 1)$ is a P-position, so our answer is $\boxed{6,2,1}$ as in Solution 2.)

Solution:
$(6,1,1)$ can be turned into $(2,2,1,1)$ by Arjun, which is symmetric, so Beth will lose.
$(6,3,1)$ can be turned into $(3,1,3,1)$ by Arjun, which is symmetric, so Beth will lose.
$(6,2,2)$ can be turned into $(2,2,2,2)$ by Arjun, which is symmetric, so Beth will lose.
$(6,3,2)$ can be turned into $(3,2,3,2)$ by Arjun, which is symmetric, so Beth will lose.
That leaves $(6,2,1)$ or $\boxed{6,2,1}$

Solution:
Consider the following, much simpler game.
Arjun and Beth can each either take 1 or 2 bricks from the right-hand-side of a continuous row of initially $n$ bricks.
It is easy to see that for $n$ a multiple of 3, Beth can "mirror" whatever Arjun plays: if he takes 1, she takes 2, and if he takes 2, she takes 1. With this strategy, Beth always takes the last brick. If $n$ is not a multiple of 3, then Arjun takes whichever amount puts Beth in the losing position.
The total number of bricks in the initial states given by the answer choices is $8, 9, 10, 10, 11$ . Thus, answer choice $\textbf{(B)}$ appears promising as a winning position for Beth. The difference between this game and the simplified game is that in certain positions, namely those consisting of fragments of size only 1, taking 2 bricks is not allowed. We can assume that for the starting position $(6, 2, 1)$ , Beth always has a move to ensure that she can continue to mirror Arjun throughout the game. (This could be proven rigorously with lots of casework. In particular, she must avoid providing Arjun with a position of 3 continuous bricks, because then he could take the middle block and force a win.) The assumption seems reasonable, so the answer is $\boxed{6,2,1}$

Solution:
We can start by guessing and checking our solutions. Let's start with $A$ $(6,1,1)$ . Arjun goes first, and he has a winning strategy. His strategy is to cut the 6 block in half, so whatever Beth does, Arjun will copy. If we see this in practice, Arjun has made the block in to $(2,2,1,1)$ . If Beth takes 1, he will take one. If Beth takes 2, he will take 2 as well.
Then, we can guess solution $B$ $(6,2,1)$ . If Arjun starts by taking 1 of the blocks, he will either have $(6,1,1)$ $(6,2)$ $(x,y,2,1)$ (Where $x+y = 5$ ). If he has $(6,1,1)$ , Beth can take 2 out of the middle of $(6,1,1)$ to get $(2,2,1,1)$ which we know Arjun will lose because we know by symmetry from answer choice $A$ . If he has $(6,2)$ , Beth will take out one from the edge, and we get $(5,2)$ . Beth can now copy whatever Arjun does, so she will win.
Next, if he takes one out to get $(x,y,2,1)$ , we can either have $(4,1,2,1)$ or $(3,2,2,1)$ . If it is the first case, Beth can take the edge 2 out of the 4, which gives us $(2,1,2,1)$ and whatever Arjun does, Beth can do, so she has established a win. If it is the 2nd case, Beth can take out 2 from the 3 to get $(1,2,2,1)$ , in which, Beth can copy whatever Arjun does, so Beth will win. So in all 4 cases, Beth wins. So our answer is $\boxed{6,2,1}$


Answer: 621.0

Solution:
We say that a game state is an N-position if it is winning for the next player (the player to move), and a P-position if it is winning for the other player. We are trying to find which of the given states is a P-position.
First we note that symmetrical positions are P-positions, as the second player can win by mirroring the first player's moves. It follows that $(6, 1, 1)$ is an N-position, since we can win by moving to $(2, 2, 1, 1)$ ; this rules out $\textbf{(A)}$ . We next look at $(6, 2, 1)$ . The possible next states are \[(6, 2), \enskip (6, 1, 1), \enskip (6, 1), \enskip (5, 2, 1), \enskip (4, 2, 1, 1), \enskip (4, 2, 1), \enskip (3, 2, 2, 1), \enskip (3, 2, 1, 1), \enskip (2, 2, 2, 1).\] None of these are symmetrical, so we might reasonably suspect that they are all N-positions. Indeed, it just so happens that for all of these states except $(6, 2)$ and $(6, 1)$ , we can win by moving to $(2, 2, 1, 1)$ ; it remains to check that $(6, 2)$ and $(6, 1)$ are N-positions.
To save ourselves work, it would be nice if we could find a single P-position directly reachable from both $(6, 2)$ and $(6, 1)$ . We notice that $(3, 2, 1)$ is directly reachable from both states, so it would suffice to show that $(3, 2, 1)$ is a P-position. Indeed, the possible next states are \[(3, 2), \enskip (3, 1, 1), \enskip (3, 1), \enskip (2, 2, 1), \enskip (2, 1, 1, 1), \enskip (2, 1, 1),\] which allow for the following refutations:
\begin{align*} &(3, 2) \to (2, 2), && &&(3, 1, 1) \to (1, 1, 1, 1), && &&(3, 1) \to (1, 1), \\ &(2, 2, 1) \to (2, 2), && &&(2, 1, 1, 1) \to (1, 1, 1, 1), && &&(2, 1, 1) \to (1, 1). \end{align*}
Hence, $(3, 2, 1)$ is a P-position, so $(6, 2)$ and $(6, 1)$ are both N-positions, along with all other possible next states from $(6, 2, 1)$ as noted before. Thus, $(6, 2, 1)$ is a P-position, so our answer is $\boxed{6,2,1}$ as in Solution 2.)

Solution:
$(6,1,1)$ can be turned into $(2,2,1,1)$ by Arjun, which is symmetric, so Beth will lose.
$(6,3,1)$ can be turned into $(3,1,3,1)$ by Arjun, which is symmetric, so Beth will lose.
$(6,2,2)$ can be turned into $(2,2,2,2)$ by Arjun, which is symmetric, so Beth will lose.
$(6,3,2)$ can be turned into $(3,2,3,2)$ by Arjun, which is symmetric, so Beth will lose.
That leaves $(6,2,1)$ or $\boxed{6,2,1}$

Solution:
Consider the following, much simpler game.
Arjun and Beth can each either take 1 or 2 bricks from the right-hand-side of a continuous row of initially $n$ bricks.
It is easy to see that for $n$ a multiple of 3, Beth can "mirror" whatever Arjun plays: if he takes 1, she takes 2, and if he takes 2, she takes 1. With this strategy, Beth always takes the last brick. If $n$ is not a multiple of 3, then Arjun takes whichever amount puts Beth in the losing position.
The total number of bricks in the initial states given by the answer choices is $8, 9, 10, 10, 11$ . Thus, answer choice $\textbf{(B)}$ appears promising as a winning position for Beth. The difference between this game and the simplified game is that in certain positions, namely those consisting of fragments of size only 1, taking 2 bricks is not allowed. We can assume that for the starting position $(6, 2, 1)$ , Beth always has a move to ensure that she can continue to mirror Arjun throughout the game. (This could be proven rigorously with lots of casework. In particular, she must avoid providing Arjun with a position of 3 continuous bricks, because then he could take the middle block and force a win.) The assumption seems reasonable, so the answer is $\boxed{6,2,1}$

Solution:
We can start by guessing and checking our solutions. Let's start with $A$ $(6,1,1)$ . Arjun goes first, and he has a winning strategy. His strategy is to cut the 6 block in half, so whatever Beth does, Arjun will copy. If we see this in practice, Arjun has made the block in to $(2,2,1,1)$ . If Beth takes 1, he will take one. If Beth takes 2, he will take 2 as well.
Then, we can guess solution $B$ $(6,2,1)$ . If Arjun starts by taking 1 of the blocks, he will either have $(6,1,1)$ $(6,2)$ $(x,y,2,1)$ (Where $x+y = 5$ ). If he has $(6,1,1)$ , Beth can take 2 out of the middle of $(6,1,1)$ to get $(2,2,1,1)$ which we know Arjun will lose because we know by symmetry from answer choice $A$ . If he has $(6,2)$ , Beth will take out one from the edge, and we get $(5,2)$ . Beth can now copy whatever Arjun does, so she will win.
Next, if he takes one out to get $(x,y,2,1)$ , we can either have $(4,1,2,1)$ or $(3,2,2,1)$ . If it is the first case, Beth can take the edge 2 out of the 4, which gives us $(2,1,2,1)$ and whatever Arjun does, Beth can do, so she has established a win. If it is the 2nd case, Beth can take out 2 from the 3 to get $(1,2,2,1)$ , in which, Beth can copy whatever Arjun does, so Beth will win. So in all 4 cases, Beth wins. So our answer is $\boxed{6,2,1}$


Answer: 76.0

Arnold is studying the prevalence of three health risk factors, denoted by A, B, and C, within a population of men. For each of the three factors, the probability that a randomly selected man in the population has only this risk factor (and none of the others) is 0.1. For any two of the three factors, the probability that a randomly selected man has exactly these two risk factors (but not the third) is 0.14. The probability that a randomly selected man has all three risk factors, given that he has A and B is $\frac{1}{3}$ . The probability that a man has none of the three risk factors given that he does not have risk factor A is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$

Solution:
We first assume a population of $100$ to facilitate solving. Then we simply organize the statistics given into a Venn diagram.

Let $x$ be the number of men with all three risk factors.  Since "the probability that a randomly selected man has all three risk factors, given that he has A and B is $\frac{1}{3}$ ," we can tell that $x = \frac{1}{3}(x+14)$ , since there are $x$ people with all three factors and 14 with only A and B.  Thus $x=7$
Let $y$ be the number of men with no risk factors.  It now follows that \[y= 100 - 3 \cdot 10 - 3 \cdot 14 - 7 = 21.\] The number of men with risk factor A is $10+2 \cdot 14+7 = 45$ (10 with only A, 28 with A and one of the others, and 7 with all three).  Thus the number of men without risk factor $A$ is 55, so the desired conditional probability is $21/55$ .  So the answer is $21+55=\boxed{076}$


Answer: 64.0

Around the outside of a $4$ by $4$ square, construct four semicircles (as shown in the figure) with the four sides of the square as their diameters.  Another square, $ABCD$ , has its sides parallel to the corresponding sides of the original square, and each side of $ABCD$ is tangent to one of the semicircles.  The area of the square $ABCD$ is
[asy] pair A,B,C,D; A = origin; B = (4,0); C = (4,4); D = (0,4); draw(A--B--C--D--cycle); draw(arc((2,1),(1,1),(3,1),CCW)--arc((3,2),(3,1),(3,3),CCW)--arc((2,3),(3,3),(1,3),CCW)--arc((1,2),(1,3),(1,1),CCW)); draw((1,1)--(3,1)--(3,3)--(1,3)--cycle); dot(A); dot(B); dot(C); dot(D); dot((1,1)); dot((3,1)); dot((1,3)); dot((3,3)); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,NE); label("$D$",D,NW); [/asy]
$\text{(A)}\ 16 \qquad \text{(B)}\ 32 \qquad \text{(C)}\ 36 \qquad \text{(D)}\ 48 \qquad \text{(E)}\ 64$

Solution: The radius of each semicircle is $2$ , half the sidelength of the square. The line straight down the middle of square $ABCD$ is the sum of two radii and the length of the smaller square, which is equivalent to its side length. The area of $ABCD$ is $(4+2+2)^2 = \boxed{64}$


Answer: 15.0

As Emily is riding her bicycle on a long straight road, she spots Emerson skating in the same direction $1/2$ mile in front of her. After she passes him, she can see him in her rear mirror until he is $1/2$ mile behind her. Emily rides at a constant rate of $12$ miles per hour, and Emerson skates at a constant rate of $8$ miles per hour. For how many minutes can Emily see Emerson?
$\textbf{(A)}\ 6 \qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 15\qquad\textbf{(E)}\ 16$

Solution:
Because they are both moving in the same direction, Emily is riding relative to Emerson $12-8=4$ mph. Now we can look at it as if Emerson is not moving at all [on his skateboard] and Emily is riding at $4$ mph. It takes her
\[\frac12 \ \text{mile} \cdot \frac{1\ \text{hour}}{4\ \text{miles}} = \frac18\ \text{hour}\]
to ride the $1/2$ mile to reach him, and then the same amount of time to be $1/2$ mile ahead of him. This totals to
\[2 \cdot \frac18 \ \text{hour} \cdot \frac{60\ \text{minutes}}{1\ \text{hour}} = \boxed{15}\]


Answer: 20090.0

As shown below, convex pentagon $ABCDE$ has sides $AB=3$ $BC=4$ $CD=6$ $DE=3$ , and $EA=7$ . The pentagon is originally positioned in the plane with vertex $A$ at the origin and vertex $B$ on the positive $x$ -axis. The pentagon is then rolled clockwise to the right along the $x$ -axis. Which side will touch the point $x=2009$ on the $x$ -axis?
[asy] unitsize(3mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); dotfactor=4;  pair A=(0,0), Ep=7*dir(105), B=3*dir(0); pair D=Ep+B; pair C=intersectionpoints(Circle(D,6),Circle(B,4))[1]; pair[] ds={A,B,C,D,Ep};  dot(ds); draw(B--C--D--Ep--A); draw((6,6)..(8,4)..(8,3),EndArrow(3)); xaxis("$x$",-8,14,EndArrow(3));  label("$E$",Ep,NW); label("$D$",D,NE); label("$C$",C,E); label("$B$",B,SE); label("$(0,0)=A$",A,SW);  label("$3$",midpoint(A--B),N); label("$4$",midpoint(B--C),NW); label("$6$",midpoint(C--D),NE); label("$3$",midpoint(D--Ep),S); label("$7$",midpoint(Ep--A),W); [/asy]
$\text{(A) } \overline{AB} \qquad \text{(B) } \overline{BC} \qquad \text{(C) } \overline{CD} \qquad \text{(D) } \overline{DE} \qquad \text{(E) } \overline{EA}$

Solution:
The perimeter of the polygon is $3+4+6+3+7 = 23$ . Hence as we roll the polygon to the right, every $23$ units the side $\overline{AB}$ will be the bottom side.
We have $2009 = 23 \times 87 + 8$ . Thus at some point in time we will get the situation when $A=(2001,0)$ and $\overline{AB}$ is the bottom side. Obviously, at this moment $B=(2004,0)$
After that, the polygon rotates around $B$ until point $C$ hits the $x$ axis at $(2008,0)$
And finally, the polygon rotates around $C$ until point $D$ hits the $x$ axis at $(2014,0)$ .
At this point the side $\boxed{2009,0}$


Answer: 90.0

As shown in the figure below, a regular dodecahedron (the polyhedron consisting of $12$ congruent regular pentagonal faces) floats in space with two horizontal faces. Note that there is a ring of five slanted faces adjacent to the top face, and a ring of five slanted faces adjacent to the bottom face. How many ways are there to move from the top face to the bottom face via a sequence of adjacent faces so that each face is visited at most once and moves are not permitted from the bottom ring to the top ring? [asy] import graph; unitsize(5cm); pair A = (0.082, 0.378); pair B = (0.091, 0.649); pair C = (0.249, 0.899); pair D = (0.479, 0.939); pair E = (0.758, 0.893); pair F = (0.862, 0.658); pair G = (0.924, 0.403); pair H = (0.747, 0.194); pair I = (0.526, 0.075); pair J = (0.251, 0.170); pair K = (0.568, 0.234); pair L = (0.262, 0.449); pair M = (0.373, 0.813); pair N = (0.731, 0.813); pair O = (0.851, 0.461); path[] f; f[0] = A--B--C--M--L--cycle; f[1] = C--D--E--N--M--cycle; f[2] = E--F--G--O--N--cycle; f[3] = G--H--I--K--O--cycle; f[4] = I--J--A--L--K--cycle; f[5] = K--L--M--N--O--cycle; draw(f[0]); axialshade(f[1], white, M, gray(0.5), (C+2*D)/3); draw(f[1]); filldraw(f[2], gray); filldraw(f[3], gray); axialshade(f[4], white, L, gray(0.7), J); draw(f[4]); draw(f[5]); [/asy] $\textbf{(A) } 125 \qquad \textbf{(B) } 250 \qquad \textbf{(C) } 405 \qquad \textbf{(D) } 640 \qquad \textbf{(E) } 810$

Solution: From the top, we can go down in five different ways to the five faces underneath the first face. From here we can go down or go to the adjacent faces. From the face you went down from the top face, you can either go clockwise or counterclockwise $1$ $2$ $3$ ,or $4$ times, or you can go straight down. Then from there, you go down into the lower row, which you have two choices, left or right down. From here we have $5 \cdot 9 \cdot 2$ ways multiplied by the ways you can move from the bottom ring to the bottom face, but we don't need to know that since from here we can see that $\boxed{90}$ . ~Terribleteeth