Answer: 409.0

A triangle has vertices $A(0,0)$ $B(12,0)$ , and $C(8,10)$ . The probability that a randomly chosen point inside the triangle is closer to vertex $B$ than to either vertex $A$ or vertex $C$ can be written as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$

Solution: The set of all points closer to point $B$ than to point $A$ lie to the right of the perpendicular bisector of $AB$ (line $PZ$ in the diagram), and the set of all points closer to point $B$ than to point $C$ lie below the perpendicular bisector of $BC$ (line $PX$ in the diagram). Therefore, the set of points inside the triangle that are closer to $B$ than to either vertex $A$ or vertex $C$ is bounded by quadrilateral $BXPZ$ . Because $X$ is the midpoint of $BC$ and $Z$ is the midpoint of $AB$ $X=(10,5)$ and $Z=(6,0)$ . The coordinates of point $P$ is the solution to the system of equations defined by lines $PX$ and $PZ$ . Using the point-slope form of a linear equation and the fact that the slope of the line perpendicular to a line with slope $m$ is $-\frac{1}{m}$ , the equation for line $PX$ is $y=\frac{2}{5}x+1$ and the equation for line $PZ$ is $x=6$ . The solution of this system is $P=\left(6,\frac{17}{5}\right)$ . Using the shoelace formula on quadrilateral $BXPZ$ and triangle $ABC$ , the area of quadrilateral $BXPZ$ is $\frac{109}{5}$ and the area of triangle $ABC$ is $60$ . Finally, the probability that a randomly chosen point inside the triangle is closer to vertex $B$ than to vertex $A$ or vertex $C$ is the ratio of the area of quadrilateral $BXPZ$ to the area of $ABC$ , which is $\frac{\frac{109}{5}}{60}=\frac{109}{300}$ . The answer is $109+300=\boxed{409}$

Solution:
Since we know the coordinates of all three vertices of the triangle, we can find the side lengths: $AB=12$ $AC=2\sqrt{41}$ , and $BC=2\sqrt{29}$ . We notice that the point where the three distances are the same is the circumcenter - so we use one of the triangle area formulas to find the circumradius, since we know what the area is. \[\frac{12 \cdot 2\sqrt{41} \cdot 2\sqrt{29}}{4 \cdot R}=\frac{12 \cdot 10}{2}.\] We rearrange to get \[R=\frac{\sqrt{41} \cdot \sqrt{29}}{5}.\]  We know that $AP=\frac{\sqrt{41} \cdot \sqrt{29}}{5}$ , and $AS=6$ , so using the Pythagorean Theorem gives $SP=\frac{17}{5}$ . This means $[ASP]=[BSP]=\frac{17}{5} \cdot 6 \cdot \frac{1}{2} = \frac{51}{5}$ .
Similarly, we know that $BP=\frac{\sqrt{41} \cdot \sqrt{29}}{5}$ , and $BR=\sqrt{29}$ , so we get that $PR=\frac{4\sqrt{29}}{5}$ , and so $[BRP]=[CRP]=\frac{4\sqrt{29}}{5} \cdot \sqrt{29} \cdot \frac{1}{2} = \frac{58}{5}$ .
Lastly, we know that $CP=\frac{\sqrt{41} \cdot \sqrt{29}}{5}$ , and $CT=\sqrt{41}$ , so we get that $PT=\frac{2\sqrt{41}}{5}$ , and $[ATP]=[CTP]=\frac{2\sqrt{41}}{5} \cdot \sqrt{41} \cdot \frac{1}{2} = \frac{41}{5}$ .
Therefore, our answer is $\frac{51+58}{2(51+58+41)}=\frac{109}{300} \rightarrow \boxed{409}$

Solution:
To start the problem, identify the two midpoints that connect $AB$ and $BC$ . This is because the midpoints of such lines is the mark at which the point will sway closer to vertex $A$ $C$ or vertex $B$ . The midpoint of $AB$ is $(6,0)$ , and the midpoint of $BC$ is $(10,5)$ . Then,  determine the line at which the distance between vertex $B$ and vertex $C$ are the same. Assuming that $x$ is the real value of $x$ and $y$ is the real value of $y$ , we can create a simple equation:
$\sqrt{|x-8|^2 + (10-y)^2}$ $\sqrt{(12-x)^2 + y^2}$
where the left side of the equation is for the distance to vertex $C$ and the right side of the equation is the distance to vertex $B$
Squaring both sides and then distributing, we get
$x^2 - 16x + 64 + y^2 - 20y + 100 = x^2 - 24x + 144 + y^2$
Notice that $(x-8)^2 = (-x+8)^2$ , and thus there is no need to create another equation.
Simplifying, we get $8x + 20 = 20y$
Divide both sides by 20, then simplify, and the line that represents equivalent distance between vertex $B$ and vertex $C$ is $y = \frac{2x}{5} + 1$
This line starts at the midpoint of $BC$ , which is $(10,5)$ , and ends at the line $x=6$ , as $x=6$ represents equivalent distance between vertex $A$ and vertex $B$ . Plug in $x=6$ to the equation $y = \frac{2x}{5} + 1$ , and we get $y = \frac{17}{5}$ . Now that we have our four points that are $(6,0), (6,\frac{17}{5}), (10,5)$ , and $(12,0)$ , we can calculate the area of the quadrilateral in which a point is closer to vertex $B$ as opposed to either vertex $A$ or vertex $C$ . Simply draw a rectangle that has the points $(6,0), (6,5), (12,5)$ and $(12,0)$ , and then subtract the two triangles that appear in between.
Thus, the area of the quadrilateral is $6\cdot5 - (\frac{\frac{8}{5}\cdot4}{2} + \frac{5\cdot2}{2}) \rightarrow 30 - \frac{41}{5} = \frac{109}{5}$ .
Since the problem asks us for the probability that a point chosen inside the triangle is inside the quadrilateral, and because the area of $\triangle ABC$ is $\frac{12\cdot10}{2} = 60$ , the probability is $\frac{\frac{109}{5}}{60}=\frac{109}{300}$ , which means the final answer is $109+300=\boxed{409}$

Solution:
Calculate the area of the triangle using the Shoelace Theorem on $(0,0), (12,0), (8,10)$ \[\frac{1}{2}|(0+120+0)-(0+0+0)|=60\]
Get the four points $(6,0), (6,\frac{17}{5}), (10,5)$ , and $(12,0)$ by any method from the above solutions. Then use the Shoelace Theorem to find the area of the region we want: \[\frac{1}{2}|(0+60+34+0)-(0+0+30+\frac{102}{5})|=\frac{109}{5}\]
Therefore the probability is $\frac{\frac{109}{5}}{60}=\frac{109}{300}$ . Thus giving the final answer of $109+300=\boxed{409}$

Solution: Draw the circumradii from the circumcenter to the three vertices. Drop perpendicular from the circumcenter to the sides. Note that since the triangle is isosceles, the perpendicular are in fact perpendicular bisectors. Therefore the region containing the points closer to B are in $\triangle{OBP_{1}} , \triangle{OBP_{2}}$ where $O$ is the circumcenter and $P_{1}, P_{2}$ points of contact of the perpendiculars and the sides. Therefore our fraction is $\frac{109}{300}$ . Our answer is then $\boxed{409}$

Solution: Using the same graph and methods as Solution 1, find the coordinates of $P$ $X$ $B$ , and $Z$ . Also, note that angles $PXB$ and $PZB$ are right angles, so $PXBZ$ is a cyclic quadrilateral. Then, use Brahmagupta's formula to determine the area of the quadrilateral, which is $\frac{109}{5}$ . Then find the area of triangle $ABC$ , which is $60$ . The probability is $\frac{109}{300}$ . Finally, we get our answer of $\boxed{409}$


Answer: 2.0

A triangle is circumscribed about a circle of radius $r$ inches.  If the perimeter of the triangle is $P$ inches and the area is $K$ square inches, then $\frac{P}{K}$ is:
$\text{(A)}\text{ independent of the value of} \; r\qquad\text{(B)}\ \frac{\sqrt{2}}{r}\qquad\text{(C)}\ \frac{2}{\sqrt{r}}\qquad\text{(D)}\ \frac{2}{r}\qquad\text{(E)}\ \frac{r}{2}$

Solution:
The area $K$ of the triangle can be expressed in terms of its inradius $r$ and its semiperimeter $s$ as: \[K = r \times s = r \times \frac{P}{2}\]
So, $\frac{P}{K} = \boxed{2}$


Answer: 18.0

A triangle is partitioned into three triangles and a quadrilateral by drawing two lines from vertices to their opposite sides. The areas of the three triangles are 3, 7, and 7, as shown. What is the area of the shaded quadrilateral?
[asy] unitsize(1.5cm); defaultpen(.8);  pair A = (0,0), B = (3,0), C = (1.4, 2), D = B + 0.4*(C-B), Ep = A + 0.3*(C-A); pair F = intersectionpoint( A--D, B--Ep );  draw( A -- B -- C -- cycle ); draw( A -- D ); draw( B -- Ep ); filldraw( D -- F -- Ep -- C -- cycle, mediumgray, black );  label("$7$",(1.25,0.2)); label("$7$",(2.2,0.45)); label("$3$",(0.45,0.35)); [/asy]
$\mathrm{(A) \ } 15\qquad \mathrm{(B) \ } 17\qquad \mathrm{(C) \ } \frac{35}{2}\qquad \mathrm{(D) \ } 18\qquad \mathrm{(E) \ } \frac{55}{3}$

Solution:
Label the points in the figure as shown below, and draw the segment $CF$ . This segment divides the quadrilateral into two triangles, let their areas be $x$ and $y$

Since triangles $AFB$ and $DFB$ share an altitude from $B$ and have equal area, their bases must be equal, hence $AF=DF$
Since triangles $AFC$ and $DFC$ share an altitude from $C$ and their respective bases are equal, their areas must be equal, hence $x+3=y$
Since triangles $EFA$ and $BFA$ share an altitude from $A$ and their respective areas are in the ratio $3:7$ , their bases must be in the same ratio, hence $EF:FB = 3:7$
Since triangles $EFC$ and $BFC$ share an altitude from $C$ and their respective bases are in the ratio $3:7$ , their areas must be in the same ratio, hence $x:(y+7) = 3:7$ , which gives us $7x = 3(y+7)$
Substituting $y=x+3$ into the second equation we get $7x = 3(x+10)$ , which solves to $x=\frac{15}{2}$ . Then $y=x+3 = \frac{15}{2}+3 = \frac{21}{2}$ , and the total area of the quadrilateral is $x+y = \frac{15}{2}+\frac{21}{2} = \boxed{18}$

Solution:
Connect points $E$ and $D$ . Triangles $EFA$ and $FAB$ share an altitude and their areas are in the ratio $3:7$ . Their bases, $EF$ and $FB$ , must be in the same $3:7$ ratio.
Triangles $EFD$ and $FBD$ share an altitude and their bases are in a $3:7$ ratio. Therefore, their areas are in a $3:7$ ratio and the area of triangle $EFD$ is $3$
Triangle $CED$ and $DEA$ share an altitude. Therefore, the ratio of their areas is equal to the ratio of bases $CE$ and $EA$ . The ratio is $A:(3+3) \Rightarrow A:6$ where $A$ is the area of triangle $CED$
Triangles $CEB$ and $EAB$ also share an altitude. The ratio of their areas is also equal to the ratio of bases $CE$ and $EA$ . The ratio is $(A+3+7):(3+7) \Rightarrow (A+10):10$
Because the two ratios are equal, we get the equation $\frac{A}{6} = \frac {A+10}{10} \Rightarrow 10A = 6A+60 \Rightarrow A = 15$ . We add the area of triangle $EDF$ to get that the total area of the quadrilateral is $\boxed{18}$

Solution:
We use mass points (similar to above). Let the triangle be $ABC$ with cevians (lines to opposite side) from $B$ and $C$ . Let the points opposite $B$ and $C$ be $D$ and $F$ respectively and the intersection as $P$
Assign masses of 1 at $B$ and $D$ since $[BPC] = [DPC]$ . Then the mass at $P$ is 2. To find masses at $F$ and $C$ , we let the mass at $F$ be x and the mass at $C$ be y. Then $3x = 7y$ and $y = \frac{3}{7}x$ . Then $\frac{10}{7}x = 2$ since we add the masses for the fulcrum mass, and $x = \frac{7}{5}$ and $y = \frac{3}{5}$
To calculate the mass at a, it is merely $\frac{7}{5} - 1 = \frac{2}{5}$ which means $\frac{[BCF]}{[ACF]} = \frac{2}{5}$ or $[ACF] = 25$ . It is easy to see the answer is $\boxed{18}$


Answer: 9.0

A triangular array of $2016$ coins has $1$ coin in the first row, $2$ coins in the second row, $3$ coins in the third row, and so on up to $N$ coins in the $N$ th row. What is the sum of the digits of $N$
$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 9\qquad\textbf{(E)}\ 10$

Solution: We are trying to find the value of $N$ such that \[1+2+3\cdots+(N-1)+N=\frac{N(N+1)}{2}=2016.\] Noticing that $\frac{63\cdot 64}{2}=2016,$ we have $N=63,$ so our answer is $\boxed{9}.$

Solution:
Knowing that each row number can stand for the number of coins there are in the row, we can just add until we get $2016$ .
Notice that $1 + 2 + 3 \cdots + 10 = 55.$ Knowing this, we can say that $11 + 12 \cdots + 20 = 155$ and $21 + \cdots +30 =255$ and so on. This is a quick way to get to the point that N is between 60 and 70. By subtracting from the sum of the number from 1 through 70, we learn that when we subtract $70, 69, 68, 67, 66, 65,$ and $64, N = 63.$ Adding those two digits, we get the answer $\boxed{9}.$ - CorgiARMY


Answer: 9.0

Solution: We are trying to find the value of $N$ such that \[1+2+3\cdots+(N-1)+N=\frac{N(N+1)}{2}=2016.\] Noticing that $\frac{63\cdot 64}{2}=2016,$ we have $N=63,$ so our answer is $\boxed{9}.$

Solution:
Knowing that each row number can stand for the number of coins there are in the row, we can just add until we get $2016$ .
Notice that $1 + 2 + 3 \cdots + 10 = 55.$ Knowing this, we can say that $11 + 12 \cdots + 20 = 155$ and $21 + \cdots +30 =255$ and so on. This is a quick way to get to the point that N is between 60 and 70. By subtracting from the sum of the number from 1 through 70, we learn that when we subtract $70, 69, 68, 67, 66, 65,$ and $64, N = 63.$ Adding those two digits, we get the answer $\boxed{9}.$ - CorgiARMY


Answer: 6.0

A triathlete competes in a triathlon in which the swimming, biking, and running segments are all of the same length. The triathlete swims at a rate of 3 kilometers per hour, bikes at a rate of 20 kilometers per hour, and runs at a rate of 10 kilometers per hour. Which of the following is closest to the triathlete's average speed, in kilometers per hour, for the entire race?
$\mathrm{(A)}\ 3\qquad\mathrm{(B)}\ 4\qquad\mathrm{(C)}\ 5\qquad\mathrm{(D)}\ 6\qquad\mathrm{(E)}\ 7$

Solution: Since the three segments are all the same length, the triathlete's average speed is the harmonic mean of the three given rates. Therefore, the average speed is \[\frac{3}{\frac{1}{3}+\frac{1}{20}+\frac{1}{10}}=\frac{3}{\frac{29}{60}}=\frac{180}{29}\approx6\Rightarrow\boxed{6}\]


Answer: 183.0

A tripod has three legs each of length $5$ feet. When the tripod is set up, the angle between any pair of legs is equal to the angle between any other pair, and the top of the tripod is $4$ feet from the ground. In setting up the tripod, the lower 1 foot of one leg breaks off. Let $h$ be the height in feet of the top of the tripod from the ground when the broken tripod is set up. Then $h$ can be written in the form $\frac m{\sqrt{n}},$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $\lfloor m+\sqrt{n}\rfloor.$ (The notation $\lfloor x\rfloor$ denotes the greatest integer that is less than or equal to $x.$

Solution:
Diagram borrowed from Solution 1
Apply Pythagorean Theorem on $\bigtriangleup TOB$ yields \[BO=\sqrt{TB^2-TO^2}=3\] Since $\bigtriangleup ABC$ is equilateral, we have $\angle MOB=60^{\circ}$ and \[BC=2BM=2(OB\sin MOB)=3\sqrt{3}\] Apply Pythagorean Theorem on $\bigtriangleup TMB$ yields \[TM=\sqrt{TB^2-BM^2}=\sqrt{5^2-(\frac{3\sqrt{3}}{2})^2}=\frac{\sqrt{73}}{2}\] Apply Law of Cosines on $\bigtriangleup TBC$ we have \[BC^2=TB^2+TC^2-2(TB)(TC)\cos BTC\] \[(3\sqrt{3})^2=5^2+5^2-2(5)^2\cos BTC\] \[\cos BTC=\frac{23}{50}\] Apply Law of Cosines on $\bigtriangleup STB$ using the fact that $\angle STB=\angle BTC$ we have \[SB^2=ST^2+BT^2-2(ST)(BT)\cos STB\] \[SB=\sqrt{4^2+5^2-2(4)(5)\cos BTC}=\frac{\sqrt{565}}{5}\] Apply Pythagorean Theorem on $\bigtriangleup BSM$ yields \[SM=\sqrt{SB^2-BM^2}=\frac{\sqrt{1585}}{10}\] Let the perpendicular from $T$ hits $SBC$ at $P$ . Let $SP=x$ and $PM=\frac{\sqrt{1585}}{10}-x$ . Apply Pythagorean Theorem on $TSP$ and $TMP$ we have \[TP^2=TS^2-SP^2=TM^2-PM^2\] \[4^2-x^2=(\frac{\sqrt{73}}{2})^2-(\frac{\sqrt{1585}}{10}-x)^2\] Cancelling out the $x^2$ term and solving gets $x=\frac{181}{2\sqrt{1585}}$
Finally, by Pythagorean Theorem, \[TP=\sqrt{TS^2-SP^2}=\frac{144}{\sqrt{1585}}\] so $\lfloor m+\sqrt{n}\rfloor=\boxed{183}$


Answer: 10.0

A truck travels $\dfrac{b}{6}$ feet every $t$ seconds. There are $3$ feet in a yard. How many yards does the truck travel in $3$ minutes?
$\textbf {(A) } \frac{b}{1080t} \qquad \textbf {(B) } \frac{30t}{b} \qquad \textbf {(C) } \frac{30b}{t}\qquad \textbf {(D) } \frac{10t}{b} \qquad \textbf {(E) } \frac{10b}{t}$

Solution: Converting feet to yards and minutes to second, we see that the truck travels $\dfrac{b}{18}$ yards every $t$ seconds for $180$ seconds. We see that he does $\dfrac{180}{t}$ cycles of $\dfrac{b}{18}$ yards. Multiplying, we get $\dfrac{180b}{18t}$ , or $\dfrac{10b}{t}$ , or $\boxed{10}$

Solution:
We set a proportion by letting the $x$ being the number of feet the truck travels in $3$ minutes.
$\frac{\frac{b}{6}}{t}=\frac{x}{180}$
$\frac{b}{6t}=\frac{x}{180}$
$\frac{180b}{6t}=x$
$x=\frac{30b}{t}$
Remember $x$ is the number of feet the truck travels, so we divide by $3$ to convert to yards.
$\frac{x}{3}=\frac{10b}{t}$ , which corresponds to $\boxed{10}$


Answer: 6.0

A truncated cone has horizontal bases with radii $18$ and $2$ . A sphere is tangent to the top, bottom, and lateral surface of the truncated cone. What is the radius of the sphere?
$\mathrm{(A)}\ 6 \qquad\mathrm{(B)}\ 4\sqrt{5} \qquad\mathrm{(C)}\ 9 \qquad\mathrm{(D)}\ 10 \qquad\mathrm{(E)}\ 6\sqrt{3}$

Solution:
Consider a trapezoid (label it $ABCD$ as follows) cross-section of the truncate cone along a diameter of the bases:
Above, $E,F,$ and $G$ are points of tangency . By the Two Tangent Theorem, $BF = BE = 18$ and $CF = CG = 2$ , so $BC = 20$ . We draw $H$ such that it is the foot of the altitude $\overline{HD}$ to $\overline{AB}$
By the Pythagorean Theorem \[r = \frac{DH}2 = \frac{\sqrt{20^2 - 16^2}}2 = 12\] Therefore, the answer is $\boxed{6}.$

Solution:
Create a trapezoid with inscribed circle $O$ exactly like in Solution #1, and extend lines $\overline{AD}$ and $\overline{BC}$ from the solution above and label the point at where they meet $H$ . Because $\frac{\overline{GC}}{\overline{BE}}$ $\frac{1}{9}$ $\frac{\overline{HG}}{\overline{HE}}$ $\frac{1}{9}$ . Let $\overline{HG} = x$ and $\overline{GE} = 8x$
Because these are radii, $\overline{GO} = \overline{OE} = \overline{OF} = 4x$ $\overline{OF} \perp \overline{BH}$ so $\overline{OF}^2 + \overline{FH}^2 = \overline{OH}^2$ . Plugging in, we get $4x^2 + \overline{FH}^2 = 5x^2$ so $\overline{FH} = 3x$ .Triangles $OFH$ and $BEH$ are similar so $\frac{\overline{OF}}{\overline{BE}}  = \frac{\overline{FH}}{\overline{EH}}$ which gives us $\frac{4x}{18} = \frac{3x}{9x}$ . Solving for x, we get \[x = 1.5\] and \[4x =6\] . Thus, the answer is $\boxed{6}$


Answer: 1.0

A two-digit positive integer is said to be $\emph{cuddly}$ if it is equal to the sum of its nonzero tens digit and the square of its units digit. How many two-digit positive integers are cuddly?
$\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }4$

Solution: Note that the number $\underline{xy} = 10x + y.$ By the problem statement, \[10x + y = x + y^2 \implies 9x = y^2 - y \implies 9x = y(y-1).\] From this we see that $y(y-1)$ must be divisible by $9.$ This only happens when $y=9.$ Then, $x=8.$ Thus, there is only $\boxed{1}$ cuddly number, which is $89.$

Solution: If the tens digit is $a$ and the ones digit is $b$ then the number is $10a+b$ so we have the equation $10a + b = a + b^2$ . We can guess and check after narrowing the possible cuddly numbers down to $13,14,24,25,35,36,46,47,57,68,78,89,$ and $99$ . (We can narrow it down to these by just thinking about how $a$ 's value affects $b$ 's value and then check all the possiblities.) Checking all of these we get that there is only $\boxed{1}$ 2-digit cuddly number, and it is $89$ . Yay!!!


Answer: 675.0

A two-inch cube $(2\times 2\times 2)$ of silver weighs 3 pounds and is worth 200 dollars. How much is a three-inch cube of silver worth?
$\textbf{(A) }\text{300 dollars} \qquad \textbf{(B) }\text{375 dollars} \qquad \textbf{(C) }\text{450 dollars} \qquad \textbf{(D) }\text{560 dollars}\qquad \textbf{(E) }\text{675 dollars}$

Solution: The two-inch cube has a volume of $8$ cubic inches, and the three-inch cube has a volume of $27$ cubic inches. Thus, the three-inch cube has a weight that is $\frac{27}{8}$ times that of the two-inch cube. Then its value is $\frac{27}{8} \cdot 200 = \boxed{675}$


Answer: 813.0

A unicorn is tethered by a $20$ -foot silver rope to the base of a magician's cylindrical tower whose radius is $8$ feet. The rope is attached to the tower at ground level and to the unicorn at a height of $4$ feet. The unicorn has pulled the rope taut, the end of the rope is $4$ feet from the nearest point on the tower, and the length of the rope that is touching the tower is $\frac{a-\sqrt{b}}c$ feet, where $a, b,$ and $c$ are positive integers , and $c$ is prime. Find $a+b+c.$

Solution:
Looking from an overhead view, call the center of the circle $O$ , the tether point to the unicorn $A$ and the last point where the rope touches the tower $B$ $\triangle OAB$ is a right triangle because $OB$ is a radius and $BA$ is a tangent line at point $B$ .  We use the Pythagorean Theorem to find the horizontal component of $AB$ has length $4\sqrt{5}$
Now look at a side view and "unroll" the cylinder to be a flat surface. Let $C$ be the bottom tether of the rope, let $D$ be the point on the ground below $A$ , and let $E$ be the point directly below $B$ Triangles $\triangle CDA$ and $\triangle CEB$ are similar right triangles .  By the Pythagorean Theorem $CD=8\cdot\sqrt{6}$
Let $x$ be the length of $CB$ \[\frac{CA}{CD}=\frac{CB}{CE}\implies \frac{20}{8\sqrt{6}}=\frac{x}{8\sqrt{6}-4\sqrt{5}}\implies x=\frac{60-\sqrt{750}}{3}\]
Therefore $a=60, b=750, c=3, a+b+c=\boxed{813}$

Solution: Note that by Power of a Point, the point the unicorn is at has power $4 \cdot 20 = 80$ which implies that the tangent from that point to the tower is of length $\sqrt{80}=4\sqrt{5},$ however this is length of the rope projected into 2-D. If we let $\theta$ be the angle between the horizontal and the rope, we have that $\cos\theta=\frac{1}{5}$ which implies that $\sin\theta=\frac{2\sqrt{6}}{5}.$ Note that the portion of rope not on the tower is $4\sqrt{5} \cdot \frac{5}{2\sqrt{6}}= \frac{5\sqrt{30}}{3},$ the requested length of rope is $20-\frac{5\sqrt{30}}{3}=\frac{60-\sqrt{750}}{3}$ thus the requested sum is $\boxed{813}.$


Answer: 12.0

A unit of blood expires after $10!=10\cdot 9 \cdot 8 \cdots 1$ seconds. Yasin donates a unit of blood at noon of January 1. On what day does his unit of blood expire?
$\textbf{(A) }\text{January 2}\qquad\textbf{(B) }\text{January 12}\qquad\textbf{(C) }\text{January 22}\qquad\textbf{(D) }\text{February 11}\qquad\textbf{(E) }\text{February 12}$

Solution: There are $60 \cdot 60 \cdot 24 = 86400$ seconds in a day, which means that Yasin's blood expires in $10! \div 86400 = 42$ days. Since there are $31$ days in January (consult a calendar), then $42-31+1$ (Jan 1 doesn't count) is $12$ days into February, so $\boxed{12}$


Answer: 240.0

Solution: The cylinder can be "unwrapped" into a rectangle, and we see that the stripe is a parallelogram with base $3$ and height $80$ . Thus, we get $3\times80=240\Rightarrow\boxed{240}$


Answer: 4.0

A wooden cube $n$ units on a side is painted red on all six faces and then cut into $n^3$ unit cubes. Exactly one-fourth of the total number of faces of the unit cubes are red. What is $n$
$\textbf{(A) } 3\qquad \textbf{(B) } 4\qquad \textbf{(C) } 5\qquad \textbf{(D) } 6\qquad \textbf{(E) } 7$

Solution:
Since there are $n^2$ little faces on each face of the big wooden cube , there are $6n^2$ little faces painted red.
Since each unit cube has $6$ faces, there are $6n^3$ little faces total.
Since one-fourth of the little faces are painted red,
$\frac{6n^2}{6n^3}=\frac{1}{4}$
$\frac{1}{n}=\frac{1}{4}$
$n=\boxed{4}$


Answer: 166.0

A wooden cube , whose edges are one centimeter long, rests on a horizontal surface. Illuminated by a point source of light that is $x$ centimeters directly above an upper vertex , the cube casts a shadow on the horizontal surface. The area of the shadow, which does not include the area beneath the cube is 48 square centimeters. Find the greatest integer that does not exceed $1000x$

Solution: (Figure not to scale) The area of the square shadow base is $48 + 1 = 49$ , and so the sides of the shadow are $7$ . Using the similar triangles in blue, $\frac {x}{1} = \frac {1}{6}$ , and $\left\lfloor 1000x \right\rfloor = \boxed{166}$


Answer: 8.0

A wooden cube with edge length $n$ units (where $n$ is an integer $>2$ ) is painted black all over. By slices parallel to its faces, the cube is cut into $n^3$ smaller cubes each of unit edge length. If the number of smaller cubes with just one face painted black is equal to the number of smaller cubes completely free of paint, what is $n$
$\mathrm{(A)\ } 5 \qquad \mathrm{(B) \ }6 \qquad \mathrm{(C) \  } 7 \qquad \mathrm{(D) \  } 8 \qquad \mathrm{(E) \  }\text{none of these}$

Solution:
Observe that if we remove the outer layer of unit cubes from the entire cube, what remains is a smaller cube of side length $(n-2)$ , which contains all of the unpainted cubes and no others. This shows that there are exactly $(n-2)^3$ unpainted cubes. Similarly, taking one face of the cube and removing the outer edge leaves a square of side length $(n-2)$ containing all of the cubes on that face with exactly one face painted. Making the same argument for the other $5$ faces as well, we deduce that there are a total of $6(n-2)^2$ cubes with only one face painted.
Accordingly, we require \begin{align*}(n-2)^3 = 6(n-2)^2 &\iff n-2 = 6 \qquad \text{(as } n > 2\text{, so } n-2 \neq 0\text{)} \\ &\iff n = \boxed{8}


Answer: 6.0

Aaliyah rolls two standard 6-sided dice. She notices that the product of the two numbers rolled is a multiple of $6$ . Which of the following integers cannot be the sum of the two numbers?
$\textbf{(A) } 5\qquad\textbf{(B) } 6\qquad\textbf{(C) } 7\qquad\textbf{(D) } 8\qquad\textbf{(E) } 9$

Solution:
First, figure out all pairs of numbers whose product is 6. Then, using the process of elimination, we can find the following:
$\textbf{(A)}$ is possible: $2\times 3$
$\textbf{(C)}$ is possible: $1\times 6$
$\textbf{(D)}$ is possible: $2\times 6$
$\textbf{(E)}$ is possible: $3\times 6$
The only integer that cannot be the sum is $\boxed{6}.$


Answer: 334.0

Abe can paint the room in 15 hours, Bea can paint 50 percent faster than Abe, and Coe can paint twice as fast as Abe. Abe begins to paint the room and works alone for the first hour and a half. Then Bea joins Abe, and they work together until half the room is painted. Then Coe joins Abe and Bea, and they work together until the entire room is painted. Find the number of minutes after Abe begins for the three of them to finish painting the room.

Solution: From the given information, we can see that Abe can paint $\frac{1}{15}$ of the room in an hour, Bea can paint $\frac{1}{15}\times\frac{3}{2} = \frac{1}{10}$ of the room in an hour, and Coe can paint the room in $\frac{1}{15}\times 2 = \frac{2}{15}$ of the room in an hour.  After $90$ minutes, Abe has painted $\frac{1}{15}\times\frac{3}{2}=\frac{1}{10}$ of the room.  Working together, Abe and Bea can paint $\frac{1}{15}+\frac{1}{10}=\frac{1}{6}$ of the room in an hour, so it takes then $\frac{2}{5}\div \frac{1}{6}= \frac{12}{5}$ hours to finish the first half of the room.  All three working together can paint $\frac{1}{6}+\frac{2}{15}=\frac{3}{10}$ of the room in an hour, and it takes them $\frac{1}{2}\div \frac{3}{10}=\frac{5}{3}$ hours to finish the room.  The total amount of time they take is \[90+\frac{12}{5}\times 60+\frac{5}{3}\times 60 = 90+ 144 + 100 = \boxed{334}\]


Answer: 38.0

Abe holds 1 green and 1 red jelly bean in his hand. Bob holds 1 green, 1 yellow, and 2 red jelly beans in his hand. Each randomly picks a jelly bean to show the other. What is the probability that the colors match?
$\textbf{(A)}\ \frac14 \qquad \textbf{(B)}\ \frac13 \qquad \textbf{(C)}\ \frac38 \qquad \textbf{(D)}\ \frac12 \qquad \textbf{(E)}\ \frac23$

Solution: The favorable responses are either they both show a green bean or they both show a red bean. The probability that both show a green bean is $\frac{1}{2}\cdot\frac{1}{4}=\frac{1}{8}$ . The probability that both show a red bean is $\frac{1}{2}\cdot\frac{2}{4}=\frac{1}{4}$ . Therefore the probability is $\frac{1}{4}+\frac{1}{8}=\boxed{38}$

Solution: We can list out all the combinations and we get this: $GG, GY, GR_1, GR_2, RG, RY, RR_1, RR_2$ . There is a total of 8 combinations and 3 that are the same. Hence, we yield the answer $\boxed{38}$


Answer: 1.0

According to the standard convention for exponentiation, \[2^{2^{2^{2}}} = 2^{(2^{(2^2)})} = 2^{16} = 65536.\]
If the order in which the exponentiations are performed is changed, how many other values are possible?
$\textbf{(A) } 0\qquad \textbf{(B) } 1\qquad \textbf{(C) } 2\qquad \textbf{(D) } 3\qquad \textbf{(E) } 4$

Solution:
The best way to solve this problem is by simple brute force.
It is convenient to drop the usual way how exponentiation is denoted, and to write the formula as $2\uparrow 2\uparrow 2\uparrow 2$ , where $\uparrow$ denotes exponentiation. We are now examining all ways to add parentheses to this expression. There are 5 ways to do so:
We can note that $2\uparrow (2\uparrow 2) = (2\uparrow 2)\uparrow 2 =16$ . Therefore options 1 and 2 are equal, and options 3 and 4 are equal.
Option 1 is the one given in the problem statement. Thus we only need to evaluate options 3 and 5.
$((2\uparrow 2)\uparrow 2)\uparrow 2 = 16\uparrow 2 = 256$
$(2\uparrow 2)\uparrow (2\uparrow 2) = 4 \uparrow 4 = 256$
Thus the only other result is $256$ , and our answer is $\boxed{1}$


Answer: 1.0

Solution:
The best way to solve this problem is by simple brute force.
It is convenient to drop the usual way how exponentiation is denoted, and to write the formula as $2\uparrow 2\uparrow 2\uparrow 2$ , where $\uparrow$ denotes exponentiation. We are now examining all ways to add parentheses to this expression. There are 5 ways to do so:
We can note that $2\uparrow (2\uparrow 2) = (2\uparrow 2)\uparrow 2 =16$ . Therefore options 1 and 2 are equal, and options 3 and 4 are equal.
Option 1 is the one given in the problem statement. Thus we only need to evaluate options 3 and 5.
$((2\uparrow 2)\uparrow 2)\uparrow 2 = 16\uparrow 2 = 256$
$(2\uparrow 2)\uparrow (2\uparrow 2) = 4 \uparrow 4 = 256$
Thus the only other result is $256$ , and our answer is $\boxed{1}$


Answer: 170.0

Adam, Benin, Chiang, Deshawn, Esther, and Fiona have internet accounts.  Some, but not all, of them are internet friends with each other, and none of them has an internet friend outside this group.  Each of them has the same number of internet friends.  In how many different ways can this happen?
$\text{(A)}\ 60\qquad\text{(B)}\ 170\qquad\text{(C)}\ 290\qquad\text{(D)}\ 320\qquad\text{(E)}\ 660$

Solution:
Note that if $n$ is the number of friends each person has, then $n$ can be any integer from $1$ to $4$ , inclusive.
One person can have at most 4 friends since they cannot be all friends (stated in the problem).
Also note that the cases of $n=1$ and $n=4$ are the same, since a map showing a solution for $n=1$ can correspond one-to-one with a map of a solution for $n=4$ by simply making every pair of friends non-friends and vice versa.  The same can be said of configurations with $n=2$ when compared to configurations of $n=3$ .  Thus, we have two cases to examine, $n=1$ and $n=2$ , and we count each of these combinations twice.
(Note: If you aren’t familiar with one-to-one correspondences, think of it like this: the number of ways to choose 4 friends is equal to number of ways to exclude one friend from your friend group. Hence, since the number of ways to choose 1 friend is the same thing as choosing 1 to not be friends with, $n=1$ and $n=4$ have the same number of ways. Similarly, $n=2$ and $n=3$ have the same number of ways as well. ~peelybonehead)
For $n=1$ , if everyone has exactly one friend, that means there must be $3$ pairs of friends, with no other interconnections.  The first person has $5$ choices for a friend.  There are $4$ people left.  The next person has $3$ choices for a friend.  There are two people left, and these remaining two must be friends.  Thus, there are $15$ configurations with $n=1$
For $n=2$ , there are two possibilities.  The group of $6$ can be split into two groups of $3$ , with each group creating a friendship triangle.  The first person has $\binom{5}{2} = 10$ ways to pick two friends from the other five, while the other three are forced together.  Thus, there are $10$ triangular configurations.
However, the group can also form a friendship hexagon, with each person sitting on a vertex, and each side representing the two friends that person has.  The first person may be seated anywhere on the hexagon without loss of generality .  This person has $\binom{5}{2} = 10$ choices for the two friends on the adjoining vertices.  Each of the three remaining people can be seated "across" from one of the original three people, forming a different configuration.  Thus, there are $10 \cdot 3! = 60$ hexagonal configurations, and in total $70$ configurations for $n=2$
As stated before, $n=3$ has $70$ configurations, and $n=4$ has $15$ configurations.  This gives a total of $(70 + 15)\cdot 2 = 170$ configurations, which is option $\boxed{170}$


Answer: 170.0

Solution:
Note that if $n$ is the number of friends each person has, then $n$ can be any integer from $1$ to $4$ , inclusive.
One person can have at most 4 friends since they cannot be all friends (stated in the problem).
Also note that the cases of $n=1$ and $n=4$ are the same, since a map showing a solution for $n=1$ can correspond one-to-one with a map of a solution for $n=4$ by simply making every pair of friends non-friends and vice versa.  The same can be said of configurations with $n=2$ when compared to configurations of $n=3$ .  Thus, we have two cases to examine, $n=1$ and $n=2$ , and we count each of these combinations twice.
(Note: If you aren’t familiar with one-to-one correspondences, think of it like this: the number of ways to choose 4 friends is equal to number of ways to exclude one friend from your friend group. Hence, since the number of ways to choose 1 friend is the same thing as choosing 1 to not be friends with, $n=1$ and $n=4$ have the same number of ways. Similarly, $n=2$ and $n=3$ have the same number of ways as well. ~peelybonehead)
For $n=1$ , if everyone has exactly one friend, that means there must be $3$ pairs of friends, with no other interconnections.  The first person has $5$ choices for a friend.  There are $4$ people left.  The next person has $3$ choices for a friend.  There are two people left, and these remaining two must be friends.  Thus, there are $15$ configurations with $n=1$
For $n=2$ , there are two possibilities.  The group of $6$ can be split into two groups of $3$ , with each group creating a friendship triangle.  The first person has $\binom{5}{2} = 10$ ways to pick two friends from the other five, while the other three are forced together.  Thus, there are $10$ triangular configurations.
However, the group can also form a friendship hexagon, with each person sitting on a vertex, and each side representing the two friends that person has.  The first person may be seated anywhere on the hexagon without loss of generality .  This person has $\binom{5}{2} = 10$ choices for the two friends on the adjoining vertices.  Each of the three remaining people can be seated "across" from one of the original three people, forming a different configuration.  Thus, there are $10 \cdot 3! = 60$ hexagonal configurations, and in total $70$ configurations for $n=2$
As stated before, $n=3$ has $70$ configurations, and $n=4$ has $15$ configurations.  This gives a total of $(70 + 15)\cdot 2 = 170$ configurations, which is option $\boxed{170}$


Answer: 154.0

Adults made up $\frac5{12}$ of the crowd of people at a concert. After a bus carrying $50$ more people arrived, adults made up $\frac{11}{25}$ of the people at the concert. Find the minimum number of adults who could have been at the concert after the bus arrived.

Solution: Let $x$ be the number of people at the party before the bus arrives. We know that $x\equiv 0\pmod {12}$ , as $\frac{5}{12}$ of people at the party before the bus arrives are adults. Similarly, we know that $x + 50 \equiv 0 \pmod{25}$ , as $\frac{11}{25}$ of the people at the party are adults after the bus arrives. $x + 50 \equiv 0 \pmod{25}$ can be reduced to $x \equiv 0 \pmod{25}$ , and since we are looking for the minimum amount of people, $x$ is $300$ . That means there are $350$ people at the party after the bus arrives, and thus there are $350 \cdot \frac{11}{25} = \boxed{154}$ adults at the party.

Solution:
Since at the beginning, adults make up $\frac{5}{12}$ of the concert, the amount of people must be a multiple of 12.
Call the amount of people in the beginning $x$ .Then $x$ must be divisible by 12, in other words: $x$ must be a multiple of 12.
Since after 50 more people arrived, adults make up $\frac{11}{25}$ of the concert, $x+50$ is a multiple of 25. This means $x+50$ must be a multiple of 5.
Notice that if a number is divisible by 5, it must end with a 0 or 5. Since 5 is impossible (obviously, since multiples of 12 end in 2, 4, 6, 8, 0,...), $x$ must end in 0.
Notice that the multiples of 12 that end in 0 are: 60, 120, 180, etc.. By trying out, you can clearly see that $x=300$ is the minimum number of people at the concert.
So therefore, after 50 more people arrive, there are $300+50=350$ people at the concert, and the number of adults is $350*\frac{11}{25}=154$ . Therefore the answer is $\boxed{154}$

Solution:
Let $a$ be the number of adults before the bus arrived and $x$ be the total number of people at the concert. So, $\frac{a}{x}=\frac{5}{12}$ . Solving for $x$ in terms of $a$ $x = \frac{12}{5}a$ . After the bus arrives, let's say there are an additional $y$ adults out of the 50 more people who enter the concert. From that, we get $\frac{a+y}{x+50}=\frac{11}{25}$ . Replacing $x$ with the value of $a$ , the second equation becomes $\frac{a+y}{\frac{12}{5}a+50}=\frac{11}{25}$
By cross-multiplying and simplifying, we get that $25(y-22)=\frac{7a}{5}$
Observe that we must make sure $y-22$ is positive and divisible by $7$ to have an integer value of $a$ . The smallest possible value of $y$ that satisfies this conditions is $29$ . Plugging this into the equation, $a = 125$ . The question asks for the minimum number of adults that are there after the bus arrives, which is $a+y$ . Thus, the answer is simply $125+29=\boxed{154}$


Answer: 11.0

After Euclid High School's last basketball game, it was determined that $\frac{1}{4}$ of the team's points were scored by Alexa and $\frac{2}{7}$ were scored by Brittany. Chelsea scored $15$ points. None of the other $7$ team members scored more than $2$ points. What was the total number of points scored by the other $7$ team members?
$\textbf{(A) }10\qquad\textbf{(B) }11\qquad\textbf{(C) }12\qquad\textbf{(D) }13\qquad\textbf{(E) }14$

Solution: Given the information above, we start with the equation $\frac{t}{4}+\frac{2t}{7} + 15 + x = t$ ,where $t$ is the total number of points scored and $x\le 14$ is the number of points scored by the remaining 7 team members, we can simplify to obtain the Diophantine equation $x+15 = \frac{13}{28}t$ , or $28x+28\cdot 15=13t$ . Since $t$ is necessarily divisible by 28, let $t=28u$ where $u \ge 0$ and divide by 28 to obtain $x + 15 = 13u$ . Then, it is easy to see $u=2$ $t=56$ ) is the only candidate remaining, giving $x=\boxed{11}$

Solution: We first start by setting the total number of points as $28$ , since $\text{LCM}(4,7) = 28$ . However, we see that this does not work since we surpass the number of points just with the information given ( $28\cdot\frac{1}{4}+28\cdot\frac{2}{7} + 15 = 30$ $(> 28)$ ). Next, we can see that the total number of points scored is $56$ as, if it is more than or equal to $84$ , at least one of the others will score more than 2 points. With this, we have that Alexa, Brittany, and Chelsea score: $56\cdot\frac{1}{4}+56\cdot\frac{2}{7} + 15 = 45$ , and thus, the other seven players would have scored a total of $56-45 = \boxed{11}$ . (We see that this works since we could have $4$ of them score $2$ points, and the other $3$ of them score $1$ point.)

Solution: Adding together Alexa's and Brittany's fractions, we get $\frac{15}{28}$ as the fraction of the total number of points they scored together. However, this is just a ratio, so we can introduce a variable: $\frac{15x}{28x}$ where $x$ is the common ratio. Let $y$ and $z$ and $w$ be the number of people who scored 1, 2, and 0 points, respectively. Writing an equation, we have $\frac{13x}{28x} = 15 + y + 2z + 0w.$ We want all of our variables to be integers. Thus, we want $15 + y + 2z = 0 \pmod {13}.$ Simplifying, $y+2z = 11 \pmod {13}.$ The only possible value, as this integer sum has to be less than $7 \cdot 2 + 1 = 15,$ must be 11. Therefore, $y+2z = 11,$ and the answer is $\boxed{11}$

Solution: We can rewrite the question as an algebraic equation: $\frac{1}{4} x + \frac{2}{7} x + 15 + y$ , where $x$ represents the total amount of points and $y$ the amount of points the $7$ other players scored. From there, we add the two fractions to get $\frac{15}{28} x + 15 = x$ . Subtracting $\frac{15}{28} x$ from both sides, we get $\frac{13}{28} x = y + 15$ . We multiply each side by $28$ to get rid of the denominator, in which we get $13x = 420 + 28y$ . Now let’s think of this logically. This equation is telling us that if you add $420$ and $28$ times the amount of points scored by the extra $7$ players, you get $13$ times the amount of points total. And since we have to have a whole number of points total, this means that $420 + 28y$ must be divisible by $13$ . Plugging in all the answer choices for $y$ , we find that the only answer that makes $420 + 28y$ divisible by $13$ is $\boxed{11}$


Answer: 3.0

After Sally takes $20$ shots, she has made $55\%$ of her shots. After she takes $5$ more shots, she raises her percentage to $56\%$ . How many of the last $5$ shots did she make?
$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$

Solution: Sally made $0.55*20=11$ shots originally. Letting $x$ be the number of shots she made, we have $\frac{11+x}{25}=0.56$ . Solving for $x$ gives us $x=\boxed{3}$


Answer: 24.0

After school, Maya and Naomi headed to the beach, $6$ miles away. Maya decided to bike while Naomi took a bus. The graph below shows their journeys, indicating the time and distance traveled. What was the difference, in miles per hour, between Naomi's and Maya's average speeds?
[asy] unitsize(1.25cm); dotfactor = 10; pen shortdashed=linetype(new real[] {2.7,2.7});  for (int i = 0; i < 6; ++i) {     for (int j = 0; j < 6; ++j) {         draw((i,0)--(i,6), grey);         draw((0,j)--(6,j), grey);     } }  for (int i = 1; i <= 6; ++i) {     draw((-0.1,i)--(0.1,i),linewidth(1.25));     draw((i,-0.1)--(i,0.1),linewidth(1.25));     label(string(5*i), (i,0), 2*S);     label(string(i), (0, i), 2*W);  }  draw((0,0)--(0,6)--(6,6)--(6,0)--(0,0)--cycle,linewidth(1.25));  label(rotate(90) * "Distance (miles)", (-0.5,3), W); label("Time (minutes)", (3,-0.5), S);  dot("Naomi", (2,6), 3*dir(305)); dot((6,6));  label("Maya", (4.45,3.5));  draw((0,0)--(1.15,1.3)--(1.55,1.3)--(3.15,3.2)--(3.65,3.2)--(5.2,5.2)--(5.4,5.2)--(6,6),linewidth(1.35)); draw((0,0)--(0.4,0.1)--(1.15,3.7)--(1.6,3.7)--(2,6),linewidth(1.35)+shortdashed); [/asy]
$\textbf{(A) }6 \qquad \textbf{(B) }12 \qquad \textbf{(C) }18 \qquad \textbf{(D) }20 \qquad \textbf{(E) }24$

Solution: Naomi travels $6$ miles in a time of $10$ minutes, which is equivalent to $\dfrac{1}{6}$ of an hour. Since $\text{speed} = \frac{\text{distance}}{\text{time}}$ , her speed is $\frac{6}{\left(\frac{1}{6}\right)} = 36$ mph. By a similar calculation, Maya's speed is $12$ mph, so the answer is $36-12 = \boxed{24}$

Solution: Naomi's speed of $6$ miles in $10$ minutes is equivalent to $6 \cdot 6 = 36$ miles per hour, while Maya's speed of $6$ miles in $30$ minutes (i.e. half an hour) is equivalent to $6 \cdot 2 = 12$ miles per hour. The difference is consequently $36-12=\boxed{24}$


Answer: 380.0

Ahn chooses a two-digit integer, subtracts it from 200, and doubles the result.  What is the largest number Ahn can get?
$\text{(A)}\ 200 \qquad \text{(B)}\ 202 \qquad \text{(C)}\ 220 \qquad \text{(D)}\ 380 \qquad \text{(E)}\ 398$

Solution:
The smallest two-digit integer he can subtract from $200$ is $10$ .  This will give the largest result for that first operation, and doubling it will keep it as the largest number possible.
\[200-10=190\] \[190\times2=380\]
$\boxed{380}$


Answer: 120.0

Ajay is standing at point $A$ near Pontianak, Indonesia, $0^\circ$ latitude and $110^\circ \text{ E}$ longitude. Billy is standing at point $B$ near Big Baldy Mountain, Idaho, USA, $45^\circ \text{ N}$ latitude and $115^\circ \text{ W}$ longitude. Assume that Earth is a perfect sphere with center $C.$ What is the degree measure of $\angle ACB?$
$\textbf{(A) }105 \qquad \textbf{(B) }112\frac{1}{2} \qquad \textbf{(C) }120 \qquad \textbf{(D) }135 \qquad \textbf{(E) }150 \qquad$

Solution:
This solution refers to the Diagram section.
Let $D$ be the orthogonal projection of $B$ onto the equator. Note that $\angle BDA = \angle BDC = 90^\circ$ and $\angle BCD = 45^\circ.$ Recall that $115^\circ \text{ W}$ longitude is the same as $245^\circ \text{ E}$ longitude, so $\angle ACD=135^\circ.$
Without the loss of generality, let $AC=BC=1.$ As shown below, we place Earth in the $xyz$ -plane with $C=(0,0,0)$ such that the positive $x$ -axis runs through $A,$ the positive $y$ -axis runs through $0^\circ$ latitude and $160^\circ \text{ W}$ longitude, and the positive $z$ -axis runs through the North Pole.  It follows that $A=(1,0,0)$ and $D=(-t,t,0)$ for some positive number $t.$ Since $\triangle BCD$ is an isosceles right triangle, we have $B=\left(-t,t,\sqrt{2}t\right).$ By the Distance Formula, we get $(-t)^2+t^2+\left(\sqrt{2}t\right)^2=1,$ from which $t=\frac12.$
As $\vec{A} = \begin{pmatrix}1 \\ 0 \\ 0 \end{pmatrix}$ and $\vec{B} = \begin{pmatrix}-1/2 \\ 1/2 \\ \sqrt2/2 \end{pmatrix},$ we obtain \[\cos\angle ACB=\frac{\vec{A}\bullet\vec{B}}{\left\lVert\vec{A}\right\rVert\left\lVert\vec{B}\right\rVert}=-\frac12\] by the dot product, so $\angle ACB=\boxed{120}$ degrees.

Solution:
This solution refers to the diagram in Solution 2.
In spherical coordinates $(\rho,\theta,\phi),$ note that $\rho,\theta,$ and $\phi$ represent the radial distance, the polar angle, and the azimuthal angle, respectively.
Without the loss of generality, let $AC=BC=1.$ As shown in Solution 2, we place Earth in the $xyz$ -plane with origin $C$ such that the positive $x$ -axis runs through $A,$ the positive $y$ -axis runs through $0^\circ$ latitude and $160^\circ \text{ W}$ longitude, and the positive $z$ -axis runs through the North Pole.
In spherical coordinates, we have $A=(1,90^\circ,0^\circ)$ and $B=(1,45^\circ,135^\circ).$ Now, we express $\vec{A}$ and $\vec{B}$ in Cartesian coordinates: \[\vec{A} = \begin{pmatrix}\sin90^\circ \cos0^\circ \\ \sin90^\circ \sin0^\circ \\ \cos90^\circ \end{pmatrix} = \begin{pmatrix}1 \\ 0 \\ 0 \end{pmatrix} \text{ and } \vec{B} = \begin{pmatrix}\sin45^\circ \cos135^\circ \\ \sin45^\circ \sin135^\circ \\ \cos45^\circ \end{pmatrix} = \begin{pmatrix}-1/2 \\ 1/2 \\ \sqrt2/2 \end{pmatrix}.\] We continue with the last paragraph of Solution 2 to get the answer $\angle ACB=\boxed{120}$ degrees.


Answer: 20.0

Al gets the disease algebritis and must take one green pill and one pink pill each day for two weeks. A green pill costs $$ $1$ more than a pink pill, and Al's pills cost a total of $\textdollar 546$ for the two weeks. How much does one green pill cost?
$\textbf{(A)}\ \textdollar 7 \qquad\textbf{(B) }\textdollar 14 \qquad\textbf{(C) }\textdollar 19\qquad\textbf{(D) }\textdollar 20\qquad\textbf{(E) }\textdollar 39$

Solution: Because there are $14$ days in two weeks, Al spends $546/14 = 39$ dollars per day for the cost of a green pill and a pink pill. If the green pill costs $x$ dollars and the pink pill $x-1$ dollars, the sum of the two costs $2x-1$ should equal $39$ dollars. Then the cost of the green pill $x$ is $\boxed{20}$


Answer: 20.0

Solution: Because there are $14$ days in two weeks, Al spends $546/14 = 39$ dollars per day for the cost of a green pill and a pink pill. If the green pill costs $x$ dollars and the pink pill $x-1$ dollars, the sum of the two costs $2x-1$ should equal $39$ dollars. Then the cost of the green pill $x$ is $\boxed{20}$


Answer: 120.0

Al walks down to the bottom of an escalator that is moving up and he counts 150 steps. His friend, Bob, walks up to the top of the escalator and counts 75 steps. If Al's speed of walking (in steps per unit time) is three times Bob's walking speed, how many steps are visible on the escalator at a given time? (Assume that this value is constant.)

Solution:
Let the total number of steps be $x$ , the speed of the escalator be $e$ and the speed of Bob be $b$
In the time it took Bob to climb up the escalator he saw 75 steps and also climbed the entire escalator.  Thus the contribution of the escalator must have been an additional $x - 75$ steps.  Since Bob and the escalator were both moving at a constant speed over the time it took Bob to climb, the ratio of their distances covered is the same as the ratio of their speeds, so $\frac{e}{b} = \frac{x - 75}{75}$
Similarly, in the time it took Al to walk down the escalator he saw 150 steps, so the escalator must have moved $150 - x$ steps in that time.  Thus $\frac{e}{3b} = \frac{150 - x}{150}$ or $\frac{e}{b} = \frac{150 - x}{50}$
Equating the two values of $\frac{e}{b}$ we have $\frac{x - 75}{75} = \frac{150 - x}{50}$ and so $2x - 150 = 450 - 3x$ and $5x = 600$ and $x = \boxed{120}$ , the answer.

Solution:
Again, let the total number of steps be $x$ , the speed of the escalator be $e$ and the speed of Bob be $b$ (all "per unit time").
Then this can be interpreted as a classic chasing problem: Bob is "behind" by $x$ steps, and since he moves at a pace of $b+e$ relative to the escalator, it will take $\frac{x}{b+e}=\frac{75}{e}$ time to get to the top.
Similarly, Al will take $\frac{x}{3b-e}=\frac{150}{e}$ time to get to the bottom.
From these two equations, we arrive at $150=\frac{ex}{3b-e}=2\cdot75=\frac{2ex}{b+e}=\frac{6ex}{3b+3e}=\frac{(ex)-(6ex)}{(3b-e)-(3b+3e)}=\frac{5x}{4}$ $\implies600=5x\implies x=\boxed{120}$ (the proportion manipulations are motivated by the desire to isolate $x$ , prompting the isolation of the $150$ on one side, and the fact that if we could cancel out the $b$ 's, then the $e$ 's in the numerator and denominator would cancel out, resulting in an equation with $x$ by itself).

Solution:
Let $e$ and $b$ be the speeds of the escalator and Bob, respectively.
When Al was on his way down, he took $150$ steps with a speed of $3b-e$ per step. When Bob was on his way up, he took $75$ steps with a speed of $b+e$ per step. Since Al and Bob were walking the same distance, we have \[150(3b-e)=75(b+e)\] Solving gets the ratio $\frac{e}{b}=\frac{3}{5}$
Thus while Bob took $75$ steps to go up, the escalator contributed an extra $\frac{3}{5}\cdot75=45$ steps.
Finally, there is a total of $75+45=\boxed{120}$ steps in the length of the escalator.

Solution:
Please understand the machinery of an escalator before proceeding to read this solution.
Let the number of steps that disappear at the top of the escalator equal $x.$ Assume that Al takes $3$ steps per second and that Bob takes $1$ step per second. Since Al counts $150$ steps, it takes him \[\frac{150}{3}=50\] seconds to traverse the distance of the escalator moving downwards. Since Bob counts $75$ steps, it takes him \[\frac{75}{1}=75\] seconds to traverse the distance of the escalator moving downwards.
For the sake of this solution, we activate the emergency stop button on the escalator.
Now, the escalator is not moving, or is simply a staircase. Imagine that Al is taking $3$ steps downwards every second, but we throw hands at him immediately after each second, such that he flinches and moves himself backwards $x$ steps. This is equivalent to Al taking $3-x$ steps downwards every second. Since we discovered that it takes him $50$ seconds to get from the top to the bottom of the escalator, and we are forcing Al to imitate the movement of the escalator, it also takes him $50$ seconds to move from the top to the bottom of the staircase. Thus, Al takes a total of \[(3-x) \cdot 50=150-50x \qquad (\heartsuit)\] steps.
The explanation for Bob is similar except now we pick him up and place him forward $x$ steps immediately after he takes his usual step per second, and since we discovered he does this for $75$ seconds, it takes him \[(1+x) \cdot 75=75+75x \qquad (\clubsuit)\] steps to get from the bottom to the top.
Note that because the escalator is broken and is now a staircase, Al and Bob must have had to take an equal amount of steps to get from the bottom to the top or from the top to the bottom. (Clearly, there are an equal amount of steps from the bottom to the top, and from the top to the bottom.) Therefore, we may equate $\heartsuit$ and $\clubsuit$ to get \[150-50x=75+75x\] \[x=\frac{3}{5}.\] Therefore, substituting $x$ in the expression we discovered in $\heartsuit,$ Al takes a total of \[150-50x=150-50\left(\frac{3}{5}\right)=\boxed{120}\] steps, and we are done.

Solution: WLOG, let Al's speed be $15$ steps per second, so Bob's speed is $5$ steps per second. Then, Al was on the escalator for $\frac{150}{15}\ = 10$ seconds and Bob was on the escalator for $\frac{75}{5}\ = 15$ seconds. Let $r$ be the rate of the escalator, in steps per second. Then, the total amount of steps is $150 - 10r = 75 + 15r$ . Al is getting $10$ seconds of resistance at rate $r$ from the escalator, while Bob is getting $15$ seconds of help at rate $r$ . Solving for $r$ , we have $r = 3$ steps per second. Then, we can plug $r$ into the previous equation or subtract/add it to Al/Bob's rate (respectively) then multiply by their respective time. Either way, we get $\boxed{120}$ and we are done.


Answer: 102.0

Al's age is $16$ more than the sum of Bob's age and Carl's age, and the square of Al's age is $1632$ more than the square of the sum of
Bob's age and Carl's age. What is the sum of the ages of Al, Bob, and Carl?
$\text{(A)}\ 64 \qquad  \text{(B)}\ 94 \qquad  \text{(C)}\ 96 \qquad  \text{(D)}\ 102 \qquad  \text{(E)}\ 140$

Solution:
Solution by e_power_pi_times_i
Denote Al's age, Bob's age, and Carl's age by $a$ $b$ , and $c$ , respectively. Then, $a = 16 + b + c$ and $a^2 = 1632 + b^2 + c^2$ . Substituting the first equation into the second, $(16 + b + c)^2 = b^2 + c^2 + 2bc + 32b + 32c + 256 = b^2 + c^2 + 1632$ . Thus, $bc + 16b + 16c = 688$ , and $(b+16)(c+16) = 944$ . Since $944 = 2^4\cdot59$ $(b,c) = (0,43)$ or $(43,0)$ . Then $a + b + c = 2b + 2c + 16 = \boxed{102}$


Answer: 400.0

Al, Betty, and Clare split $\textdollar 1000$ among them to be invested in different ways. Each begins with a different amount. At the end of one year, they have a total of $\textdollar 1500$ dollars. Betty and Clare have both doubled their money, whereas Al has managed to lose $\textdollar100$ dollars. What was Al's original portion?
$\textbf{(A)}\ \textdollar 250 \qquad \textbf{(B)}\ \textdollar 350 \qquad \textbf{(C)}\ \textdollar 400 \qquad \textbf{(D)}\ \textdollar 450 \qquad \textbf{(E)}\ \textdollar 500$

Solution:
For this problem, we will have to write a three-variable equation, but not necessarily solve it. Let $a, b,$ and $c$ represent the original portions of Al, Betty, and Clare, respectively. At the end of one year, they each have $a-100, 2b,$ and $2c$ . From this, we can write two equations, marked by (1) and (2).
\[a+b+c=1000\] \[(1). \text{ }2a+2b+2c=2000\] \[a-100+2b+2c=1500\] \[(2). \text{ }a+2b+2c=1600\]
(Equations (1) and (2) are derived from each equation above them.)
Since all we need to find is $a,$ subtract the second equation from the first equation to get $a=400.$
Al's original portion was $\boxed{400}$

Solution: Suppose the total amount of money Betty and Clare has is $1000-x$ and Al has $x$ dollars. Then, $(x-100)+2(1000-x)=1500$ , so Al has $\boxed{400}$ dollars.

Solution:
Suppose if Al had not lost $\textdollar 100$ . The total amount would be $\textdollar 1600$ . As he has not gained any amount. So, Betty and Clare have collectively gained $\textdollar 600$ and as they have doubled their collective fortune,
they must have $\textdollar 600$ with them at the beginning. This leaves $\boxed{400}$ for Al.
~Anshulb


Answer: 103.0

Alex has $75$ red tokens and $75$ blue tokens. There is a booth where Alex can give two red tokens and receive in return a silver token and a blue token and another booth where Alex can give three blue tokens and receive in return a silver token and a red token. Alex continues to exchange tokens until no more exchanges are possible. How many silver tokens will Alex have at the end?
$\textbf{(A)}\ 62 \qquad \textbf{(B)}\ 82 \qquad \textbf{(C)}\ 83 \qquad \textbf{(D)}\ 102 \qquad \textbf{(E)}\ 103$

Solution:
If Alex goes to the red booth 3 times, then goes to the blue booth once, Alex can exchange 6 red tokens for 4 silver tokens and one red token. Similarly, if Alex goes to the blue booth 2 times, then goes to the red booth once, Alex can exchange 6 blue tokens for 3 silver tokens and one blue token. Let's call the first combination Combo 1, and the second combination Combo 2.
In other words, Alex can exchange 5 red tokens for 4 silver tokens as long as he has at least 6 red tokens, and Alex can exchange 5 blue tokens for 3 silver tokens as long as he has at least 6 blue tokens. Hence after performing 14 Combo 1's and 14 Combo 2's, we end up with 5 red, 5 blue, and 98 silver tokens.
Finally, Alex can visit the blue booth once, then do Combo 1, then visit the blue booth once more to end up with 1 red token, 2 blue tokens, and $\boxed{103}$ silver tokens, at which point it is clear he cannot use the booths anymore.

Solution: We can approach this problem by assuming he goes to the red booth first. You start with $75 \text{R}$ and $75 \text{B}$ and at the end of the first booth, you will have $1 \text{R}$ and $112 \text{B}$ and $37 \text{S}$ . We now move to the blue booth, and working through each booth until we have none left, we will end up with: $1 \text{R}$ $2 \text{B}$ and $103 \text{S}$ . So, the answer is $\boxed{103}$

Solution: Let $x$ denote the number of visits to the first booth and $y$ denote the number of visits to the second booth. Then we can describe the quantities of his red and blue coins as follows: \[R(x,y)=-2x+y+75\] \[B(x,y)=x-3y+75\] There are no legal exchanges when he has fewer than $2$ red coins and fewer than $3$ blue coins, namely when he has a red coin and $2$ blue coins. We can then create a system of equations: \[1=-2x+y+75\] \[2=x-3y+75\] Solving yields $x=59$ and $y=44$ . Since he gains one silver coin per visit to each booth, he has $x+y=44+59=\boxed{103}$ silver coins in total.


Answer: 103.0

Solution:
If Alex goes to the red booth 3 times, then goes to the blue booth once, Alex can exchange 6 red tokens for 4 silver tokens and one red token. Similarly, if Alex goes to the blue booth 2 times, then goes to the red booth once, Alex can exchange 6 blue tokens for 3 silver tokens and one blue token. Let's call the first combination Combo 1, and the second combination Combo 2.
In other words, Alex can exchange 5 red tokens for 4 silver tokens as long as he has at least 6 red tokens, and Alex can exchange 5 blue tokens for 3 silver tokens as long as he has at least 6 blue tokens. Hence after performing 14 Combo 1's and 14 Combo 2's, we end up with 5 red, 5 blue, and 98 silver tokens.
Finally, Alex can visit the blue booth once, then do Combo 1, then visit the blue booth once more to end up with 1 red token, 2 blue tokens, and $\boxed{103}$ silver tokens, at which point it is clear he cannot use the booths anymore.

Solution: We can approach this problem by assuming he goes to the red booth first. You start with $75 \text{R}$ and $75 \text{B}$ and at the end of the first booth, you will have $1 \text{R}$ and $112 \text{B}$ and $37 \text{S}$ . We now move to the blue booth, and working through each booth until we have none left, we will end up with: $1 \text{R}$ $2 \text{B}$ and $103 \text{S}$ . So, the answer is $\boxed{103}$

Solution: Let $x$ denote the number of visits to the first booth and $y$ denote the number of visits to the second booth. Then we can describe the quantities of his red and blue coins as follows: \[R(x,y)=-2x+y+75\] \[B(x,y)=x-3y+75\] There are no legal exchanges when he has fewer than $2$ red coins and fewer than $3$ blue coins, namely when he has a red coin and $2$ blue coins. We can then create a system of equations: \[1=-2x+y+75\] \[2=x-3y+75\] Solving yields $x=59$ and $y=44$ . Since he gains one silver coin per visit to each booth, he has $x+y=44+59=\boxed{103}$ silver coins in total.


Answer: 93.0

Alfred and Bonnie play a game in which they take turns tossing a fair coin. The winner of a game is the first person to obtain a head. Alfred and Bonnie play this game several times with the stipulation that the loser of a game goes first in the next game. Suppose that Alfred goes first in the first game, and that the probability that he wins the sixth game is $m/n\,$ , where $m\,$ and $n\,$ are relatively prime positive integers. What are the last three digits of $m+n\,$

Solution:
In order to begin this problem, we need to calculate the probability that Alfred will win on the first round.
Because he goes first, Alfred has a $\frac{1}{2}$ chance of winning (getting heads) on his first flip.
Then, Bonnie, who goes second, has a $\frac{1}{2} \times \frac{1}{2} = \frac{1}{4}$ , chance of winning on her first coin toss.
Therefore Alfred’s chance of winning on his second flip is $\frac{1}{4} \times \frac{1}{2} = \frac{1}{8}$
From this, we can see that Alfred’s (who goes first) chance of winning the first round is: $\frac{1}{2} + \frac{1}{8} + \frac{1}{32} + \cdots = \frac{2}{3}$
Bonnie’s (who goes second) chance of winning the first round is then $1 - \frac{2}{3} = \frac{1}{3}$
This means that the person who goes first has a $\frac{2}{3}$ chance of winning the round, while the person who goes second has a $\frac{1}{3}$ chance of winning.
Now, through casework, we can calculate Alfred’s chance of winning the second round.
Case 1: Alfred wins twice; $\frac{2}{3} \times \frac{1}{3}$ (Bonnie goes first this round) $=\frac{2}{9}$
Case 2: Alfred loses the first round, but wins the second; $\frac{1}{3} \times \frac{2}{3} = \frac{2}{9}$
Adding up the cases, we get $\frac{2}{9} + \frac{2}{9} = \frac{4}{9}$
Alfred, therefore, has a $\frac{4}{9}$ of winnning the second round, and Bonnie has a $1-\frac{4}{9} = \frac{5}{9}$ chance of winning this round.
From here, it is not difficult to see that the probabilities alternate in a pattern.
Make $A$ the probability that Alfred wins a round.
The chances of Alfred and Bonnie, respectively, winning the first round are $A$ and $A - \frac{1}{3}$ , which can be written as $2A - \frac{1}{3} = 1$
The second round’s for chances are $A$ and $A + \frac{1}{9}$ , which can also be written as $2A + \frac{1}{9}$
From this, we can conclude that for the $n$ th even round, the probability that Alfred ( $A$ ) wins can be calculated through the equation $2A + \frac{1}{3^n} = 1$
Solving the equation for $n = 6$ , we get $A = \frac{364}{729}$
$364 + 729 = 1093$
So our answer is $\boxed{093}$

Solution:
Rather than categorizing games as wins or losses, we can categorize them as starters (S), where Alfred starts, and non-starters (NS), where Bonnie starts. Game 1 is a starter, and since Alfred must win Game 6, Game 7 is a non-starter.
As shown in Solution 1, if a player starts a certain game, the probability $P(NS)$ that they will not start the next game (i.e. win the current game) is $\frac{2}{3}$ , and the probability $P(S)$ that they will start the next game (i.e. lose the current game) is $\frac{1}{3}$ . Similarly, if a player does not start a certain game, $P(NS) = \frac{1}{3}$ and $P(S) = \frac{2}{3}$ . We conclude that the probability of switching from S to NS or vice versa is always $\frac{2}{3}$ , and the probability of staying the same is always $\frac{1}{3}$
Listing out all the games from Game 1 to Game 7, we get: S, ?, ?, ?, ?, ?, NS. Between the 7 games, there are 6 opportunities to either switch or stay the same. We need to eventually switch from S to NS, so there must be an odd number of switches. Furthermore, this number is less than 6, so it must be 1, 3, or 5.
1 switch: There are ${6 \choose 1} = 6$ ways to place the switch, so $P = 6\left(\frac{1}{3}\right)^5\left(\frac{2}{3}\right) = \frac{12}{729}$
3 switches: There are ${6 \choose 3} = 20$ ways to place the switches, so $P = 20\left(\frac{1}{3}\right)^3\left(\frac{2}{3}\right)^3 = \frac{160}{729}$
5 switches: There are ${6 \choose 5} = 6$ ways to place the switch, so $P = 6\left(\frac{1}{3}\right)\left(\frac{2}{3}\right)^5 = \frac{192}{729}$
Add up all these probabilities to get $\frac{12+160+192}{729} = \frac{364}{729}$ $364+729=1093$ , so the answer is $\boxed{093}$


Answer: 12.0

Ali, Bonnie, Carlo, and Dianna are going to drive together to a nearby theme park. The car they are using has $4$ seats: $1$ Driver seat, $1$ front passenger seat, and $2$ back passenger seat. Bonnie and Carlo are the only ones who know how to drive the car. How many possible seating arrangements are there?
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 12\qquad\textbf{(E)}\ 24$

Solution: There are only $2$ people who can go in the driver's seat--Bonnie and Carlo. Any of the $3$ remaining people can go in the front passenger seat. There are $2$ people who can go in the first back passenger seat, and the remaining person must go in the last seat. Thus, there are $2\cdot3\cdot2$ or $12$ ways. The answer is then $\boxed{12}$

Solution: If there weren't any extra requirements, there would be 24 combinations. However, there are only 2, which is half of 4, ways to put the people. Therefore, half of 24 is $\boxed{12}$


Answer: 5.5

Alice and Bob live $10$ miles apart. One day Alice looks due north from her house and sees an airplane. At the same time Bob looks due west from his house and sees the same airplane. The angle of elevation of the airplane is $30^\circ$ from Alice's position and $60^\circ$ from Bob's position. Which of the following is closest to the airplane's altitude, in miles?
$\textbf{(A)}\ 3.5 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 4.5 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 5.5$

Solution:
We have two 30-60-90 triangles $ABC$ and $DBC$ that are perpendicular and share leg $BC$ (the altitude of the plane $p$ ). $AD=10$ The shared leg is the shortest leg of one triangle and the longest leg of the other. $A$ and $B$ are Bob and Alice respectively.
Find $AC$ and $DC$ in terms of $p$ . Use Pythagorean Theorem on triangle $ADC$ to produce $p=\sqrt{30}\implies\boxed{5.5}$

Solution:
Non-trig solution by e_power_pi_times_i
Set the distance from Alice's and Bob's position to the point directly below the airplane to be $x$ and $y$ , respectively. From the Pythagorean Theorem, $x^2 + y^2 = 100$ . As both are $30-60-90$ triangles, the altitude of the airplane can be expressed as $\dfrac{x\sqrt{3}}{3}$ or $y\sqrt{3}$ . Solving the equation $\dfrac{x\sqrt{3}}{3} = y\sqrt{3}$ , we get $x = 3y$ . Plugging this into the equation $x^2 + y^2 = 100$ , we get $10y^2 = 100$ , or $y = \sqrt{10}$ $y$ cannot be negative), so the altitude is $\sqrt{3*10} = \sqrt{30}$ , which is closest to $\boxed{5.5}$

Solution: Let Alice be at point $A$ , Bob be at point $B$ . Let the plane be at point $P$ and $X$ be the projection of $P$ onto the ground (the plane with contains $A$ and $B$ ). Let the height of the plane, or $PX$ , be $h$ . So, because of the $30-60-90$ triangles, \[AX = \dfrac{h}{\sqrt{3}}, BX = h\sqrt{3}\] By Pythagorean Theorem on $\triangle ABX$ \[\dfrac{h^2}{3} + 3h^2 = 100 \implies \dfrac{10h^2}{3} = 100 \implies h = \sqrt{30},\] which is clossest to $\boxed{5.5}.$


Answer: 6.0

Alice and Bob play a game involving a circle whose circumference is divided by 12 equally-spaced points. The points are numbered clockwise, from 1 to 12. Both start on point 12. Alice moves clockwise and Bob, counterclockwise.
In a turn of the game, Alice moves 5 points clockwise and Bob moves 9 points counterclockwise. The game ends when they stop on the same point. How many turns will this take?
$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ 24$

Solution: Alice moves $5k$ steps and Bob moves $9k$ steps, where $k$ is the turn they are on. Alice and Bob coincide when the number of steps they move collectively, $14k$ , is a multiple of $12$ . Since this number must be a multiple of $12$ , as stated in the previous sentence, $14$ has a factor $2$ $k$ must have a factor of $6$ . The smallest number of turns that is a multiple of $6$ is $\boxed{6}$


Answer: 809.0

Alice and Bob play the following game. A stack of $n$ tokens lies before them. The players take turns with Alice going first. On each turn, the player removes either $1$ token or $4$ tokens from the stack. Whoever removes the last token wins. Find the number of positive integers $n$ less than or equal to $2024$ for which there exists a strategy for Bob that guarantees that Bob will win the game regardless of Alice's play.

Solution:
Let's first try some experimentation. Alice obviously wins if there is one coin. She will just take it and win. If there are 2 remaining, then Alice will take one and then Bob will take one, so Bob wins. If there are $3$ , Alice will take $1$ , Bob will take one, and Alice will take the final one. If there are $4$ , Alice will just remove all $4$ at once. If there are $5$ , no matter what Alice does, Bob can take the final coins in one try. Notice that Alice wins if there are $1$ $3$ , or $4$ coins left. Bob wins if there are $2$ or $5$ coins left.
After some thought, you may realize that there is a strategy for Bob. If there is n is a multiple of $5$ , then Bob will win. The reason for this is the following: Let's say there are a multiple of $5$ coins remaining in the stack. If Alice takes $1$ , Bob will take $4$ , and there will still be a multiple of $5$ . If Alice takes $4$ , Bob will take $1$ , and there will still be a multiple of $5$ . This process will continue until you get $0$ coins left. For example, let's say there are $205$ coins. No matter what Alice does, Bob can simply just do the complement. After each of them make a turn, there will always be a multiple of $5$ left. This will continue until there are $5$ coins left, and Bob will end up winning.
After some more experimentation, you'll realize that any number that is congruent to $2$ mod $5$ will also work. This is because Bob can do the same strategy, and when there are $2$ coins left, Alice is forced to take $1$ and Bob takes the final coin. For example, let's say there are $72$ coins. If Alice takes $1$ , Bob will take $4$ . If Alice takes $4$ , Bob will take $1$ . So after they each make a turn, the number will always be equal to $2$ mod $5$ . Eventually, there will be only $2$ coins remaining, and we've established that Alice will simply take $1$ and Bob will take the final coin.
So we have to find the number of numbers less than or equal to $2024$ that are either congruent to $0$ mod $5$ or $2$ mod $5$ . There are $404$ numbers in the first category: $5, 10, 15, \dots, 2020$ . For the second category, there are $405$ numbers. $2, 7, 12, 17, \dots, 2022$ . So the answer is $404 + 405 = \boxed{809}$

Solution:
We will use winning and losing positions, where a $W$ marks when Alice wins and an $L$ marks when Bob wins.
$1$ coin: $W$
$2$ coins: $L$
$3$ coins: $W$
$4$ coins: $W$
$5$ coins: $L$
$6$ coin: $W$
$7$ coins: $L$
$8$ coins: $W$
$9$ coins: $W$
$10$ coins: $L$
$11$ coin: $W$
$12$ coins: $L$
$13$ coins: $W$
$14$ coins: $W$
$15$ coins: $L$
We can see that losing positions occur when $n$ is congruent to $0, 2 \mod{5}$ and winning positions occur otherwise. In other words, there will be $2$ losing positions out of every $5$ consecutive values of n. As $n$ ranges from $1$ to $2020$ $\frac{2}{5}$ of these values are losing positions where Bob will win. As $n$ ranges from $2021$ to $2024$ $2022$ is the only value where Bob will win. Thus, the answer is $2020\times\frac{2}{5}+1=\boxed{809}$

Solution:
Denote by $A_i$ and $B_i$ Alice's or Bob's $i$ th moves, respectively.
Case 1: $n \equiv 0 \pmod{5}$
Bob can always take the strategy that $B_i = 5 - A_i$ .
This guarantees him to win.
In this case, the number of $n$ is $\left\lfloor \frac{2024}{5} \right\rfloor = 404$
Case 2: $n \equiv 1 \pmod{5}$
In this case, consider Alice's following strategy: $A_1 = 1$ and $A_i = 5 - B_{i-1}$ for $i \geq 2$ .
Thus, under Alice's this strategy, Bob has no way to win.
Case 3: $n \equiv 4 \pmod{5}$
In this case, consider Alice's following strategy: $A_1 = 4$ and $A_i = 5 - B_{i-1}$ for $i \geq 2$ .
Thus, under Alice's this strategy, Bob has no way to win.
Case 4: $n \equiv 2 \pmod{5}$
Bob can always take the strategy that $B_i = 5 - A_i$ .
Therefore, after the $\left\lfloor \frac{n}{5} \right\rfloor$ th turn, there are two tokens leftover.
Therefore, Alice must take 1 in the next turn that leaves the last token on the table.
Therefore, Bob can take the last token to win the game.
This guarantees him to win.
In this case, the number of $n$ is $\left\lfloor \frac{2024 - 2}{5} \right\rfloor +1 = 405$
Case 5: $n \equiv 3 \pmod{5}$
Consider Alice's following strategy: $A_1 = 1$ and $A_i = 5 - B_{i-1}$ for $i \geq 2$ .
By doing so, there will finally be 2 tokens on the table and Bob moves first. Because Bob has the only choice of taking 1 token, Alice can take the last token and win the game.
Therefore, in this case, under Alice's this strategy, Bob has no way to win.
Putting all cases together, the answer is $404 + 405 = \boxed{809}$

Solution:
Since the game Alice and Bob play is impartial (the only difference between player 1 and player 2 is that player 1 goes first (note that games like chess are not impartial because each player can only move their own pieces)), we can use the Sprague-Grundy Theorem to solve this problem. We will use induction to calculate the Grundy Values for this game.
We claim that heaps of size congruent to $0,2 \bmod{5}$ will be in outcome class $\mathcal{P}$ (win for player 2 = Bob), and heaps of size equivalent to $1,3,4 \bmod{5}$ will be in outcome class $\mathcal{N}$ (win for player 1 = Alice). Note that the mex (minimal excludant) of a set of nonnegative integers is the least nonnegative integer not in the set. e.g. mex $(1, 2, 3) = 0$ and mex $(0, 1, 2, 4) = 3$
$\text{heap}(0) = \{\} = *\text{mex}(\emptyset) = 0$
$\text{heap}(1) = \{0\} = *\text{mex}(0) = *$
$\text{heap}(2) = \{*\} = *\text{mex}(1) = 0$
$\text{heap}(3) = \{0\} = *\text{mex}(0) = *$
$\text{heap}(4) = \{0, *\} = *\text{mex}(0, 1) = *2$
$\text{heap}(5) = \{*, *2\} = *\text{mex}(1, 2) = 0$
$\text{heap}(6) = \{0, 0\} = *\text{mex}(0, 0) = *$
$\text{heap}(7) = \{*, *\} = *\text{mex}(1, 1) = 0$
$\text{heap}(8) = \{*2, 0\} = *\text{mex}(0, 2) = *$
$\text{heap}(9) = \{0, *\} = *\text{mex}(0, 1) = *2$
$\text{heap}(10) = \{*, *2\} = *\text{mex}(1, 2) = 0$
We have proven the base case. We will now prove the inductive hypothesis: If $n \equiv 0 \bmod{5}$ $\text{heap}(n) = 0$ $\text{heap}(n+1) = *$ $\text{heap}(n+2) = 0$ $\text{heap}(n+3) = *$ , and $\text{heap}(n+4) = *2$ , then $\text{heap}(n+5) = 0$ $\text{heap}(n+6) = *$ $\text{heap}(n+7) = 0$ $\text{heap}(n+8) = *$ , and $\text{heap}(n+9) = *2$
$\text{heap}(n+5) = \{\text{heap}(n+1), \text{heap}(n+4)\} = \{*, *2\} = *\text{mex}(1, 2) = 0$
$\text{heap}(n+6) = \{\text{heap}(n+2), \text{heap}(n+5)\} = \{0, 0\} = *\text{mex}(0, 0) = *$
$\text{heap}(n+7) = \{\text{heap}(n+3), \text{heap}(n+6)\} = \{*, *\} = *\text{mex}(1, 1) = 0$
$\text{heap}(n+8) = \{\text{heap}(n+4), \text{heap}(n+7)\} = \{*2, 0\} = *\text{mex}(2, 1) = *$
$\text{heap}(n+9) = \{\text{heap}(n+5), \text{heap}(n+8)\} = \{0, *\} = *\text{mex}(0, 1) = *2$
We have proven the inductive hypothesis. QED.
There are $2020*\frac{2}{5}=808$ positive integers congruent to $0,2 \bmod{5}$ between 1 and 2020, and 1 such integer between 2021 and 2024. $808 + 1 = \boxed{809}$


Answer: 55.0

Alice chooses a set $A$ of positive integers. Then Bob lists all finite nonempty sets $B$ of positive integers with the property that the maximum element of $B$ belongs to $A$ . Bob's list has 2024 sets. Find the sum of the elements of A.

Solution: Let $k$ be one of the elements in Alices set $A$ of positive integers. The number of sets that Bob lists with the property that their maximum element is k is $2^{k-1}$ , since every positive integer less than k can be in the set or out. Thus, for the number of sets bob have listed to be 2024, we want to find a sum of unique powers of two that can achieve this. 2024 is equal to $2^{10}+2^9+2^8+2^7+2^6+2^5+2^3$ . We must increase each power by 1 to find the elements in set $A$ , which are $(11,10,9,8,7,6,4)$ . Add these up to get $\boxed{055}$ . -westwoodmonster

Solution:
Let $A = \left\{ a_1, a_2, \cdots, a_n \right\}$ with $a_1 < a_2 < \cdots < a_n$
If the maximum element of $B$ is $a_i$ for some $i \in \left\{ 1, 2, \cdots , n \right\}$ , then each element in $\left\{ 1, 2, \cdots, a_i- 1 \right\}$ can be either in $B$ or not in $B$ .
Therefore, the number of such sets $B$ is $2^{a_i - 1}$
Therefore, the total number of sets $B$ is
\begin{align*}
\sum_{i=1}^n 2^{a_i - 1} & = 2024 .
\end{align*}
Thus
\begin{align*}
\sum_{i=1}^n 2^{a_i} & = 4048 .
\end{align*}
Now, the problem becomes writing 4048 in base 2, say, $4048 = \left( \cdots b_2b_1b_0 \right)_2$ .
We have $A = \left\{ j \geq 1: b_j = 1 \right\}$
We have $4048 = \left( 111,111,010,000 \right)_2$ .
Therefore, $A = \left\{ 4, 6, 7, 8, 9, 10, 11 \right\}$ .
Therefore, the sum of all elements in $A$ is $\boxed{55}$


Answer: 190.0

Alice has $24$ apples. In how many ways can she share them with Becky and Chris so that each of the three people has at least two apples? $\textbf{(A) }105\qquad\textbf{(B) }114\qquad\textbf{(C) }190\qquad\textbf{(D) }210\qquad\textbf{(E) }380$

Solution:
Note: This solution uses the non-negative version for stars and bars. A solution using the positive version of stars is similar (first removing an apple from each person instead of 2).
This method uses the counting method of stars and bars (non-negative version). Since each person must have at least $2$ apples, we can remove $2*3$ apples from the total that need to be sorted. With the remaining $18$ apples, we can use stars and bars to determine the number of possibilities. Assume there are $18$ stars in a row, and $2$ bars, which will be placed to separate the stars into groups of $3$ . In total, there are $18$ spaces for stars $+ 2$ spaces for bars, for a total of $20$ spaces. We can now do $20 \choose 2$ . This is because if we choose distinct $2$ spots for the bars to be placed, each combo of $3$ groups will be different, and all apples will add up to $18$ . We can also do this because the apples are indistinguishable. $20 \choose 2$ is $190$ , therefore the answer is $\boxed{190}$

Solution: Consider an unordered triple $(a,b,c)$ where $a+b+c=24$ and $a,b,c$ are not necessarily distinct. Then, we will either have $1$ $3$ , or $6$ distinguishable ways to assign $a$ $b$ , and $c$ to Alice, Becky, and Chris. Thus, our answer will be $x+3y+6z$ for some nonnegative integers $x,y,z$ . Notice that we only have $1$ way to assign the numbers $a,b,c$ to Alice, Becky, and Chris when $a=b=c$ . As this only happens $1$ way ( $a=b=c=8$ ), our answer is $1+3y+6z$ for some $y,z$ . Finally, notice that this implies the answer is $1$ mod $3$ . The only answer choice that satisfies this is $\boxed{190}$

Solution: Since each person needs to have at least two apples, we can simply give each person two, leaving $24 - 2\times3=18$ apples. For the remaining apples, if Alice is going to have $a$ apples, Becky is going to have $b$ apples, and Chris is going to have $c$ apples, we have indeterminate equation $a+b+c=18$ . Currently, we can see that $0 \leq a\leq 18$ where $a$ is an integer, and when $a$ equals any number in the range, there will be $18-a+1=19-a$ sets of values for $b$ and $c$ . Thus, there are $19 + 18 + 17 + \cdots + 1 = \boxed{190}$ possible sets of values in total.


Answer: 10.0

Alice is making a batch of cookies and needs $2\frac{1}{2}$ cups of sugar.  Unfortunately, her measuring cup holds only $\frac{1}{4}$ cup of sugar.  How many times must she fill that cup to get the correct amount of sugar?
$\textbf{(A)}\ 8 \qquad\textbf{(B)}\ 10  \qquad\textbf{(C)}\ 12 \qquad\textbf{(D)}\ 16 \qquad\textbf{(E)}\ 20$

Solution: To get how many cups we need, we realize that we simply need to divide the number of cups needed by the number of cups collected in her measuring cup each time.  Thus, we need to evaluate the fraction $\frac{2\frac{1}{2}}{\frac{1}{4}}$ .  Simplifying, this is equal to $\frac{5}{2}(4) = \boxed{10}$


Answer: 51.0

Alice knows that $3$ red cards and $3$ black cards will be revealed to her one at a time in random order. Before each card is revealed, Alice must guess its color. If Alice plays optimally, the expected number of cards she will guess correctly is $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Solution:
At any point in the game, Alice should guess whichever color has come up less frequently thus far (although if both colors have come up equally often, she may guess whichever she likes); using this strategy, her probability of guessing correctly is at least $\frac{1}{2}$ on any given card, as desired.
There are ${6 \choose 3} = 20$ possible orderings of cards, all equally likely (since any of the $6! = 720$ permutations of the cards is equally likely, and each ordering covers $3!^2 = 6^2 = 36$ permutations).
Each of the $10$ orderings that start with red cards corresponds with one that starts with a black card; the problem is symmetrical with respect to red and black cards, so we can, without loss of generality, consider only the orderings that start with red cards.
We then generate a tally table showing whether Alice's guesses are correct for each ordering; for a given card, she guesses correctly if fewer than half the previously shown cards were the same color, guesses incorrectly if more than half were the same color, and guesses correctly with probability $\frac{1}{2}$ if exactly half were the same color.
In this table, $\mid$ denotes a correct guess, $\--$ denotes an incorrect guess, and $/$ denotes a guess with $\frac{1}{2}$ probability of being correct.
Now we sum the tallies across orderings, obtaining $41$ , and finally divide by the number of orderings ( $10$ ) to obtain the expected number of correct guesses, $\frac{41}{10}$ , which yields an answer of $41 + 10 = \boxed{051}.$

Solution:
Denote by $N \left( a, b \right)$ the optimal expected number of cards that Alice guesses correctly, where the number of red and black cards are $a$ and $b$ , respectively.
Thus, for $a, b \geq 1$ , we have \begin{align*} N \left( a, b \right) & = \max \left\{ \frac{a}{a+b} \left( 1 + N \left( a - 1 , b \right) \right) + \frac{b}{a+b} N \left( a , b - 1 \right) , \right. \\ & \hspace{1cm} \left. \frac{a}{a+b} N \left( a - 1 , b \right) + \frac{b}{a+b} \left( 1 + N \left( a , b - 1 \right) \right) \right\} . \end{align*}
For $a = 0$ , Alice always guesses black. So $N \left( 0 , b \right) = b$
For $b = 0$ , Alice always guesses red. So $N \left( a , 0 \right) = a$
To solve this dynamic program, we can also exploit its symmetry that $N \left( a , b \right) = N \left( b , a \right)$
By solving this dynamic program, we get $N \left( 1, 1 \right) = \frac{3}{2}$ $N \left( 1, 2 \right) = \frac{7}{3}$ $N \left( 1 , 3 \right) = \frac{13}{4}$ $N \left( 2 , 2 \right) = \frac{17}{6}$ $N \left( 2 , 3 \right) = \frac{18}{5}$ $N \left( 3, 3 \right) = \frac{41}{10}$
Therefore, the answer is $41 + 10 = \boxed{051}$

Solution:
Denote by $N_{i,j}$ the optimal expected number of cards that Alice guesses correctly, where the number of cards are $i$ and $j \ge i.$
If $i = 0$ then Alice guesses correctly all cards, so $N_{0,j} = j.$
If $j = i$ then Alice guesses next card with probability $\frac {1}{2} \implies N_{i,i} = \frac {1}{2} + N_{i-1,i}.$
If $j = i+1$ then Alice guesses next card with probability $\frac {i+1}{2i+1} \implies N_{i,i+1} = \frac {i+1}{2i+1} (1+ N_{i,i}) + \frac{i}{2i+1}  N_{i-1,i+1}.$
If $j = i+2$ then Alice guesses next card with probability $\frac {i+2}{2i+2} \implies N_{i,i+2} = \frac {i+2}{2i+2} (1+ N_{i,i+1}) + \frac{i}{2i+2}  N_{i-1,i+2}.$
One can find consistently: $N_{1,1} = \frac {1}{2} + N_{0,1} = \frac {3}{2},$ \[N_{1,2} = \frac {2}{3} (1 + N_{1,1}) + \frac {1}{3} N_{0,2} = \frac {7}{3}.\] \[N_{2,2} = \frac {1}{2} + N_{1,2} = \frac {17}{6}.\] \[N_{1,3} = \frac {3}{4} (1 + N_{1,2}) + \frac {1}{4} N_{0,3} = \frac {13}{4}.\] \[N_{2,3} = \frac {3}{5} (1 + N_{2,2}) + \frac {2}{5} N_{1,3} = \frac {18}{5}.\] \[N_{3,3} = \frac {1}{2} + N_{2,3} = \frac {41}{10}.\] Therefore, the answer is $41 + 10 = \boxed{051}$

Solution:
Denote $E_n$ the expected number of cards Alice guesses correctly given $n$ red cards and $n$ black cards. We want to find $E_3$
Alice has a $\frac{1}{2}$ chance of guessing the first card. WLOG assume the first card color is red. For the next card, Alice has a $\frac{3}{5}$ chance of guessing the card if she chooses black; if they guess right, there's one less red and black card, so the expected number of cards Alice guesses from here is $E_2$ . If Alice does not guess correctly (which occurs with probability $\frac{2}{5}$ ), this means that there's 3 black cards and 1 red card left, so Alice should guess black next with a $\frac{3}{4}$ chance of being right. If Alice is wrong (with probability $\frac{1}{4}$ ), there are only 3 black cards left, so Alice can guess these with certainty; if Alice is right, there are 2 blacks and 1 red left, so Alice should again guess black. If Alice is right (with probability $\frac{2}{3}$ ), there is now 1 black and red card each, so the expected number of cards guessed is $E_1$ ; if she is wrong (with probability $\frac{1}{3}$ ), there are 2 black cards left, so Alice can guess these with certainty.
Summing this up into a formula: \[E_3 = \frac{1}{2} + \frac{3}{5} \left(1 + E_2 \right) + \frac{2}{5} \left( \frac{1}{4}(3) + \frac{3}{4}\left(1 + \frac{2}{3}\left(1 + E_1 \right) + \frac{1}{3}(2)\right) \right)\]
We can apply similar logic to compute $E_2$ and get \[E_2 = \frac{1}{2} + \frac{2}{3}(1 + E_1) + \frac{1}{3}(2)\]
To compute $E_1$ , we know that Alice can guess the last card with certainty, and there's a $\frac{1}{2}$ chance they get the first card as well, so $E_1 = \frac{3}{2}$
Thus, $E_2 = \frac{17}{6}$ , and after long computation, we get $E_3 = \frac{41}{10}$ . The requested answer is $41 + 10 = \boxed{51}$


Answer: 34.0

Alice needs to replace a light bulb located $10$ centimeters below the ceiling in her kitchen. The ceiling is $2.4$ meters above the floor. Alice is $1.5$ meters tall and can reach $46$ centimeters above the top of her head. Standing on a stool, she can just reach the light bulb. What is the height of the stool, in centimeters?
$\textbf{(A)}\ 32 \qquad\textbf{(B)}\ 34\qquad\textbf{(C)}\ 36\qquad\textbf{(D)}\ 38\qquad\textbf{(E)}\ 40$

Solution:
Convert everything to the same unit. Since the answer is in centimeters, change meters to centimeters by moving the decimal place two places to the right.
The ceiling is $240$ centimeters above the floor. The combined height of Alice and the light bulb when she reaches for it is $10+150+46=206$ centimeters. That means the stool's height needs to be $240-206=\boxed{34}$


Answer: 28.0

Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of $5$ chairs under these conditions?
$\textbf{(A)}\ 12  \qquad \textbf{(B)}\ 16 \qquad\textbf{(C)}\ 28 \qquad\textbf{(D)}\ 32 \qquad\textbf{(E)}\ 40$

Solution:
Alice may sit in the center chair, in an end chair, or in a next-to-end chair. Suppose she sits in the center chair. The 2nd and 4th chairs (next to her) must be occupied by Derek and Eric, in either order, leaving the end chairs for Bob and Carla in either order; this yields $2! * 2! = 4$ ways to seat the group.
Next, suppose Alice sits in one of the end chairs. Then the chair beside her will be occupied by either Derek or Eric. The center chair must be occupied by Bob or Carla, leaving the last two people to fill the last two chairs in either order. $2$ ways to seat Alice times $2$ ways to fill the next chair times $2$ ways to fill the center chair times $2$ ways to fill the last two chairs yields $2 * 2 * 2 * 2 = 16$ ways to fill the chairs.
Finally, suppose Alice sits in the second or fourth chair. Then the chairs next to her must be occupied by Derek and Eric in either order, and the other two chairs must be occupied by Bob and Carla in either order. This yields $2 * 2 * 2 = 8$ ways to fill the chairs.
In total, there are $4 + 8 + 16$ ways to fill the chairs, so the answer is $\boxed{28}$


Answer: 28.0

Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of $5$ chairs under these conditions?
$\textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40$

Solution:
Let Alice be A, Bob be B, Carla be C, Derek be D, and Eric be E.
We can split this problem up into two cases:
$\textbf{Case 1: }$ A sits on an edge seat.
Since B and C can't sit next to A, that must mean either D or E sits next to A. After we pick either D or E, then either B or C must sit next to D/E. Then, we can arrange the two remaining people in two ways. Since there are two different edge seats that A can sit in, there are a total of $2 \cdot 2 \cdot 2 \cdot 2 = 16$
$\textbf{Case 2: }$ A does not sit in an edge seat.
Still, the only two people that can sit next to A are either D or E, and there are two ways to permute them, and this also handles the restriction that D can't sit next to E. Then, there are two ways to arrange B and C, the remaining people. However, there are three initial seats that A can sit in, so there are $3 \cdot 2 \cdot 2 = 12$ seatings in this case.
Adding up all the seatings, we have $16+12 = \boxed{28}$

Solution:
Label the seats (from left to right) $1$ through $5$ . The number of ways to seat Derek and Eric in the five seats with no restrictions is $5 \cdot 4=20$ . The number of ways to seat Derek and Eric such that they sit next to each other is $8$ (we can treat Derek and Eric as a "block". There are four ways to seat this "block", and two ways to permute Derek and Eric, for a total of $4\cdot 2=8$ ), so the number of ways such that Derek and Eric don't sit next to each other is $20-8=12$ . Note that once Derek and Eric are seated, we can divide into three cases.
The first case is that they sit at each end. There are two ways to seat Derek and Eric. But this is impossible because then Alice, Bob, and Carla would have to sit in some order in the middle three seats which would lead to Alice sitting next to Bob or Carla, a contradiction. So this case gives us $0$ ways.
Another possible case is if Derek and Eric sit in seats $2$ and $4$ in some order. There are $2$ possible ways to seat Derek and Eric like this. This leaves Alice, Bob, and Carla to sit in any order in the remaining three seats. Since no two of these three seats are consecutive, there are $3!=6$ ways to do this. So the second case gives us $2 \cdot 6=12$ total ways.
The last case is if once Derek and Eric are seated, exactly one pair of consecutive seats are available. There are $12-2-2=8$ ways to seat Derek and Eric like this. Once they are seated like this, Alice cannot sit in one of the two consecutive available seats without sitting next to Bob or Carla. So Alice has to sit in the other remaining chair. Then, there are two ways to seat Bob and Carla in the remaining two seats (which are consecutive). So this case gives us $8 \cdot 2=16$ ways.
So in total there are $12+16=28$ ways. Our answer is $\boxed{28}$ Minor $\LaTeX$ edits by fasterthanlight

Solution:
We start with complementary counting. After all, it's much easier to count the cases where some of these restraints are true, than when they aren't.
PIE:
Let's count the total number of cases where one of these is true:
When Alice is with Bob: $2\cdot4!=48$
When Alice is with Carla: $2\cdot4!=48$
When Derek is with Eric: $2\cdot4!=48$
Then, we count the cases where two of these are true.
Alice is next to Carla, and Alice is also next to Bob.
There are two ways to rearrange Alice, Bob, and Carla so that this is true:
BAC and CAB. $2\cdot3!=12$
Alice is next to Carla, and Derek is also next to Eric. $2\cdot2\cdot3!=24$
Alice is next to Bob, and Derek is also next to Eric. $2\cdot2\cdot3!=24$
Finally, we count the cases where all three of these are true: $2\cdot2\cdot2=8$
We add up the cases where one of these are true: $48\cdot3=144$
Subtract the cases where two of these are true: $144-60=84$
And finally add back the cases where three of these are true: $84+8=92$
Thus, our answer is $5!-92=28$ , or $\boxed{28}$

Solution:
To find the number of ways, we do casework.
Case 1: Alice sits in the first seat (leftmost)
Since Alice refuses to sit with Bob and Carla, then the seat on her immediate right must be Derek or Eric. The middle seat must be Bob or Carla (because Derek and Eric refuse to sit together). The seat to the right of the middle seat could be whoever is left over from Derek and Eric, or whoever is left together from Bob and Carla. The last seat only has one person left. There are $4$ ways to permute Bob, Carla, Derek, and Eric, and $2$ ways to pick who goes in the seat to the right of the middle seat, for $4\cdot2=8$ seating arrangements here.
Case 2: Alice sits in the second seat
Derek and Eric must be on both sides of Alice because otherwise, we would have to put Bob or Carla next to Alice which is forbidden. Then Bob and Carla take the remaining two seats. There are $4$ ways to permute and $4$ arrangements here.
Case 3: Alice sits in the middle seat
Once again, Derek and Eric must be on both sides of Alice, and Bob and Carla need to take the two remaining seats. There are also $4$ ways to permute and $4$ arrangements here.
Case 4: Alice sits in the fourth seat
By symmetry, this is the same as case 2. There are $4$ arrangements.
Case 5: Alice sits in the last seat (rightmost)
By symmetry, this is the same as case 1. There are $8$ arrangements.
Adding up the cases, there are $8+4+4+4+8=28$ total seating arrangements $\Longrightarrow \boxed{28}$


Answer: 30.0

Alice sells an item at $$10$ less than the list price and receives $10\%$ of her selling price as her commission.
Bob sells the same item at $$20$ less than the list price and receives $20\%$ of his selling price as his commission.
If they both get the same commission, then the list price is
$\textbf{(A) } $20\qquad \textbf{(B) } $30\qquad \textbf{(C) } $50\qquad \textbf{(D) } $70\qquad \textbf{(E) } $100$

Solution: If $x$ is the list price, then $10\%(x-10)=20\%(x-20)$ . Solving this equation gives $x=30$ , so the answer is $\boxed{30}$


Answer: 56.0

Alice, Bob, and Charlie were on a hike and were wondering how far away the nearest town was. When Alice said, "We are at least $6$ miles away," Bob replied, "We are at most $5$ miles away." Charlie then remarked, "Actually the nearest town is at most $4$ miles away." It turned out that none of the three statements were true. Let $d$ be the distance in miles to the nearest town. Which of the following intervals is the set of all possible values of $d$
$\textbf{(A) }   (0,4)   \qquad        \textbf{(B) }   (4,5)   \qquad    \textbf{(C) }   (4,6)   \qquad   \textbf{(D) }  (5,6)  \qquad  \textbf{(E) }   (5,\infty)$

Solution:
For each of the false statements, we identify its corresponding true statement. Note that:
We construct the following table: \[\begin{array}{c||c|c} & &  \\ [-2.5ex] \textbf{Hiker} & \textbf{False Statement} & \textbf{True Statement} \\ [0.5ex] \hline & & \\ [-2ex] \textbf{Alice} & [6,\infty) & [0,6) \\  & & \\ [-2.25ex] \textbf{Bob} & [0,5] & (5,\infty)  \\ & & \\ [-2.25ex] \textbf{Charlie} & [0,4] & (4,\infty) \end{array}\] Taking the intersection of the true statements, we have \[[0,6)\cap(5,\infty)\cap(4,\infty)=(5,6)\cap(4,\infty)=\boxed{5,6}.\] ~MRENTHUSIASM

Solution: Think of the distances as if they are on a number line. Alice claims that $d > 6$ , Bob says $d < 5$ , while Charlie thinks $d < 4$ . This means that all possible numbers less than $5$ and greater than $6$ are included. However, since the three statements are actually false, the distance to the nearest town is one of the numbers not covered. Therefore, the answer is $\boxed{5,6}$


Answer: 56.0

Solution:
For each of the false statements, we identify its corresponding true statement. Note that:
We construct the following table: \[\begin{array}{c||c|c} & &  \\ [-2.5ex] \textbf{Hiker} & \textbf{False Statement} & \textbf{True Statement} \\ [0.5ex] \hline & & \\ [-2ex] \textbf{Alice} & [6,\infty) & [0,6) \\  & & \\ [-2.25ex] \textbf{Bob} & [0,5] & (5,\infty)  \\ & & \\ [-2.25ex] \textbf{Charlie} & [0,4] & (4,\infty) \end{array}\] Taking the intersection of the true statements, we have \[[0,6)\cap(5,\infty)\cap(4,\infty)=(5,6)\cap(4,\infty)=\boxed{5,6}.\] ~MRENTHUSIASM

Solution: Think of the distances as if they are on a number line. Alice claims that $d > 6$ , Bob says $d < 5$ , while Charlie thinks $d < 4$ . This means that all possible numbers less than $5$ and greater than $6$ are included. However, since the three statements are actually false, the distance to the nearest town is one of the numbers not covered. Therefore, the answer is $\boxed{5,6}$


Answer: 29.0

Alicia earns 20 dollars per hour, of which $1.45\%$ is deducted to pay local taxes.  How many cents per hour of Alicia's wages are used to pay local taxes?
$\mathrm{(A) \ } 0.0029 \qquad \mathrm{(B) \ } 0.029 \qquad \mathrm{(C) \ } 0.29 \qquad \mathrm{(D) \ } 2.9 \qquad \mathrm{(E) \ } 29$

Solution: $20$ dollars is the same as $2000$ cents, and $1.45\%$ of $2000$ is $0.0145\times2000=29$ cents. $\Rightarrow\boxed{29}$

Solution: Since there can't be decimal values of cents, the answer must be $\Rightarrow\boxed{29}$


Answer: 29.0

Solution: $20$ dollars is the same as $2000$ cents, and $1.45\%$ of $2000$ is $0.0145\times2000=29$ cents. $\Rightarrow\boxed{29}$

Solution: Since there can't be decimal values of cents, the answer must be $\Rightarrow\boxed{29}$