Answer: 109.0

Solution: We see that $a \, \diamondsuit \, a = 1$ , and think of division. Testing, we see that the first condition $a \, \diamondsuit \, (b \, \diamondsuit \, c) = (a \, \diamondsuit \, b) \cdot c$ is satisfied, because $\frac{a}{\frac{b}{c}} = \frac{a}{b} \cdot c$ . Therefore, division can be the operation $\diamondsuit$ . Solving the equation, \[\frac{2016}{\frac{6}{x}} = \frac{2016}{6} \cdot x = 336x = 100\implies x=\frac{100}{336} = \frac{25}{84},\] so the answer is $25 + 84 = \boxed{109}$

Solution:
If the given conditions hold for all nonzero numbers $a, b,$ and $c$
Let $a=b=c.$ From the first two givens, this implies that
\[a\diamondsuit\, (a\diamondsuit\, {a})=(a\diamondsuit\, a)\cdot{a}.\]
From $a\diamondsuit\,{a}=1,$ this equation simply becomes $a\diamondsuit\,{1}=a.$
Let $c=b.$ Substituting this into the first two conditions, we see that
\[a\diamondsuit\, (b\diamondsuit\, {c})=(a\diamondsuit\, {b})\cdot{c} \implies a\diamondsuit\, (b\diamondsuit\, {b})=(a\diamondsuit\, {b})\cdot{b}.\]
Substituting $b\diamondsuit\, {b} =1$ , the second equation becomes
\[a\diamondsuit\, {1}=(a\diamondsuit\, {b})\cdot{b} \implies a=(a\diamondsuit\,{b})\cdot{b}.\]
Since $a, b$ and $c$ are nonzero, we can divide by $b$ which yields,
\[\frac{a}{b}=(a\diamondsuit\, {b}).\]
Now we can find the value of $x$ straightforwardly:
\[\frac{2016}{(\frac{6}{x})}=100 \implies 2016=\frac{600}{x} \implies x=\frac{600}{2016} = \frac{25}{84}.\]
Therefore, $a+b=25+84=\boxed{109}$

Solution:
One way to eliminate the $\diamondsuit$ in this equation is to make $a = b$ so that $a\,\diamondsuit\, (b\,\diamondsuit \,c) = c$ . In this case, we can make $b = 2016$
\[2016 \,\diamondsuit\, (6\,\diamondsuit\, x)=100\implies  (2016\, \diamondsuit\, 6) \cdot x = 100\]
By multiplying both sides by $\frac{6}{x}$ , we get:
\[(2016\, \diamondsuit\, 6) \cdot 6 = \frac{600}{x}\implies  2016 \, \diamondsuit\, (6\, \diamondsuit\, 6) = \frac{600}{x}\]
Because $6\, \diamondsuit\, 6 = 2016\, \diamondsuit\, 2016 = 1:$
\[2016 \, \diamondsuit\, (2016\, \diamondsuit\, 2016) = \frac{600}{x}\implies  (2016\, \diamondsuit\, 2016) \cdot 2016 = \frac{600}{x}\implies  2016 = \frac{600}{x}\]
Therefore, $x = \frac{600}{2016} = \frac{25}{84}$ , so the answer is $25 + 84 = \boxed{109.}$

Solution:
We can manipulate the given identities to arrive at a conclusion about the binary operator $\diamondsuit$ .  Substituting $b = c$ into the first identity yields \[( a\ \diamondsuit\ b) \cdot b = a\ \diamondsuit\ (b\ \diamondsuit\  b) = a\ \diamondsuit\  1 = a\ \diamondsuit\ ( a\ \diamondsuit\ a) = ( a\ \diamondsuit\ a) \cdot a = a.\] Hence, $( a\ \diamondsuit\ b) \cdot b = a,$ or, dividing both sides of the equation by $b,$ $( a\ \diamondsuit\ b) = \frac{a}{b}.$
Hence, the given equation becomes $\frac{2016}{\frac{6}{x}} = 100$ .  Solving yields $x=\frac{100}{336} = \frac{25}{84},$ so the answer is $25 + 84 = \boxed{109.}$

Solution:
$2016 \diamondsuit (6 \diamondsuit x) = (2016 \diamondsuit 6) \cdot x = 100$
$2016 \diamondsuit (2016 \diamondsuit 1) = (2016 \diamondsuit 2016) \cdot 1 = 1 \cdot 1 = 1$
$2016 \diamondsuit 2016 = 1$ $2016 \diamondsuit (2016 \diamondsuit 1) = 1$ , so $2016 \diamondsuit 1 = 2016$
$2016  \diamondsuit 1 = (2016  \diamondsuit 6) \cdot 6$ $2016 \diamondsuit 6 = \frac{2016  \diamondsuit 1}{6} = 336$
$x = \frac{100}{2016 \diamondsuit 6} = \frac{100}{336} = \frac{25}{84}$ $24 + 85 = \boxed{109}$

Solution: Notice that $2016 \diamondsuit (6 \diamondsuit 6)=(2016 \diamondsuit 6) \cdot 6 = 2016$ . Hence, $2016 \diamondsuit 6 = 336$ . Thus, $2016 \diamondsuit (6 \diamondsuit x)=100 \implies (2016 \diamondsuit 6) \cdot x = 100 \implies 336x=100 \implies x=\frac{25}{84}$ . Therefore, the answer is $\boxed{109}$


Answer: 840.0

A biologist wants to calculate the number of fish in a lake. On May 1 she catches a random sample of 60 fish, tags them, and releases them. On September 1 she catches a random sample of 70 fish and finds that 3 of them are tagged. To calculate the number of fish in the lake on May 1, she assumes that 25% of these fish are no longer in the lake on September 1 (because of death and emigrations), that 40% of the fish were not in the lake May 1 (because of births and immigrations), and that the number of untagged fish and tagged fish in the September 1 sample are representative of the total population. What does the biologist calculate for the number of fish in the lake on May 1?

Solution: Of the $70$ fish caught in September, $40\%$ were not there in May, so $42$ fish were there in May. Since the percentage of tagged fish in September is proportional to the percentage of tagged fish in May, $\frac{3}{42} = \frac{60}{x} \Longrightarrow \boxed{840}$

Solution:
First, we notice that there are 45 tags left, after 25% of the original fish have went away/died. Then, some $x$ percent of fish have been added such that $\frac{x}{x+75} = 40 \%$ , or $\frac{2}{5}$ . Solving for $x$ , we get that $x = 50$ , so the total number of fish in September is $125 \%$ , or $\frac{5}{4}$ times the total number of fish in May.
Since $\frac{3}{70}$ of the fish in September were tagged, $\frac{45}{5n/4} = \frac{3}{70}$ , where $n$ is the number of fish in May. Solving for $n$ , we see that $n = \boxed{840}$


Answer: 729.0

A block of cheese in the shape of a rectangular solid measures $10$ cm by $13$ cm by $14$ cm. Ten slices are cut from the cheese. Each slice has a width of $1$ cm and is cut parallel to one face of the cheese. The individual slices are not necessarily parallel to each other. What is the maximum possible volume in cubic cm of the remaining block of cheese after ten slices have been cut off?

Solution: Let the lengths of the three sides of the rectangular solid after the cutting be $a,b,c$ , so that the desired volume is $abc$ . Note that each cut reduces one of the dimensions by one, so that after ten cuts, $a+b+c = 10 + 13 + 14 - 10 = 27$ . By AM-GM $\frac{a+b+c}{3} = 9 \ge \sqrt[3]{abc} \Longrightarrow abc \le \boxed{729}$ . Equality is achieved when $a=b=c=9$ , which is possible if we make one slice perpendicular to the $10$ cm edge, four slices perpendicular to the $13$ cm edge, and five slices perpendicular to the $14$ cm edge.

Solution:
A more intuitive way to solve it is by seeing that to keep the volume of the rectangular cheese the greatest, we must slice the cheese off to decrease the greatest length of the cheese (this is easy to check). Here are the ten slices:
${10, 13, 14} \rightarrow {10, 13, 13} \rightarrow {10, 12, 13} \rightarrow {10, 12, 12} \rightarrow {10, 11, 12} \rightarrow {10, 11, 11} \rightarrow {10, 10, 11} \rightarrow {10, 10, 10} \rightarrow {9, 10, 10} \rightarrow {9, 9, 10} \rightarrow {9, 9, 9}.$
So the greatest possible volume is thus $9 \times 9 \times 9 = \boxed{729}$


Answer: 53.0

A block of wood has the shape of a right circular cylinder with radius $6$ and height $8$ , and its entire surface has been painted blue.  Points $A$ and $B$ are chosen on the edge of one of the circular faces of the cylinder so that $\overarc{AB}$ on that face measures $120^\circ$ .  The block is then sliced in half along the plane that passes through point $A$ , point $B$ , and the center of the cylinder, revealing a flat, unpainted face on each half.  The area of one of these unpainted faces is $a\cdot\pi + b\sqrt{c}$ , where $a$ $b$ , and $c$ are integers and $c$ is not divisible by the square of any prime.  Find $a+b+c$
[asy] import three; import solids; size(8cm); currentprojection=orthographic(-1,-5,3);  picture lpic, rpic;  size(lpic,5cm); draw(lpic,surface(revolution((0,0,0),(-3,3*sqrt(3),0)..(0,6,4)..(3,3*sqrt(3),8),Z,0,120)),gray(0.7),nolight); draw(lpic,surface(revolution((0,0,0),(-3*sqrt(3),-3,8)..(-6,0,4)..(-3*sqrt(3),3,0),Z,0,90)),gray(0.7),nolight); draw(lpic,surface((3,3*sqrt(3),8)..(-6,0,8)..(3,-3*sqrt(3),8)--cycle),gray(0.7),nolight); draw(lpic,(3,-3*sqrt(3),8)..(-6,0,8)..(3,3*sqrt(3),8)); draw(lpic,(-3,3*sqrt(3),0)--(-3,-3*sqrt(3),0),dashed); draw(lpic,(3,3*sqrt(3),8)..(0,6,4)..(-3,3*sqrt(3),0)--(-3,3*sqrt(3),0)..(-3*sqrt(3),3,0)..(-6,0,0),dashed); draw(lpic,(3,3*sqrt(3),8)--(3,-3*sqrt(3),8)..(0,-6,4)..(-3,-3*sqrt(3),0)--(-3,-3*sqrt(3),0)..(-3*sqrt(3),-3,0)..(-6,0,0)); draw(lpic,(6*cos(atan(-1/5)+3.14159),6*sin(atan(-1/5)+3.14159),0)--(6*cos(atan(-1/5)+3.14159),6*sin(atan(-1/5)+3.14159),8));  size(rpic,5cm); draw(rpic,surface(revolution((0,0,0),(3,3*sqrt(3),8)..(0,6,4)..(-3,3*sqrt(3),0),Z,230,360)),gray(0.7),nolight); draw(rpic,surface((-3,3*sqrt(3),0)..(6,0,0)..(-3,-3*sqrt(3),0)--cycle),gray(0.7),nolight); draw(rpic,surface((-3,3*sqrt(3),0)..(0,6,4)..(3,3*sqrt(3),8)--(3,3*sqrt(3),8)--(3,-3*sqrt(3),8)--(3,-3*sqrt(3),8)..(0,-6,4)..(-3,-3*sqrt(3),0)--cycle),white,nolight); draw(rpic,(-3,-3*sqrt(3),0)..(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),0)..(6,0,0)); draw(rpic,(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),0)..(6,0,0)..(-3,3*sqrt(3),0),dashed); draw(rpic,(3,3*sqrt(3),8)--(3,-3*sqrt(3),8)); draw(rpic,(-3,3*sqrt(3),0)..(0,6,4)..(3,3*sqrt(3),8)--(3,3*sqrt(3),8)..(3*sqrt(3),3,8)..(6,0,8)); draw(rpic,(-3,3*sqrt(3),0)--(-3,-3*sqrt(3),0)..(0,-6,4)..(3,-3*sqrt(3),8)--(3,-3*sqrt(3),8)..(3*sqrt(3),-3,8)..(6,0,8)); draw(rpic,(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),0)--(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),8)); label(rpic,"$A$",(-3,3*sqrt(3),0),W); label(rpic,"$B$",(-3,-3*sqrt(3),0),W);  add(lpic.fit(),(0,0)); add(rpic.fit(),(1,0)); [/asy]

Solution:
Label the points where the plane intersects the top face of the cylinder as $C$ and $D$ , and the center of the cylinder as $O$ , such that $C,O,$ and $A$ are collinear. Let $N$ be the center of the bottom face, and $M$ the midpoint of $\overline{AB}$ . Then $ON=4$ $MN=3$ (because of the 120 degree angle), and so $OM=5$
Project $C$ and $D$ onto the bottom face to get $X$ and $Y$ , respectively. Then the section $ABCD$ (whose area we need to find), is a stretching of the section $ABXY$ on the bottom face. The ratio of stretching is $\frac{OM}{MN}=\frac{5}{3}$ , and we do not square this value when finding the area because it is only stretching in one direction. Using 30-60-90 triangles and circular sectors, we find that the area of the section $ABXY$ is $18\sqrt{3}\ + 12 \pi$ . Thus, the area of section $ABCD$ is $20\pi + 30\sqrt{3}$ , and so our answer is $20+30+3=\boxed{053}$

Solution:
Label the points same as in the first sentence above. Consider a view of the cylinder such that height is disregarded, i.e. a top view. From this view, note that Cylinder $O$ has become a circle with $\overarc{AB}$ $\overarc{CD}$ $120^\text{o}$ . Using 30-60-90 triangles, we get rectangle $ABCD$ to have a horizontal component of $6$ . Now, consider a side view, such that $A$ and $B$ coincide at the bottom of the diagram. From this view, consider the right triangle composed of hypotenuse $AD$ and a point along the base of the viewpoint, which will be labeled as $E$ . From the top view, $AE = 6$ . Because of the height of the cylinder, $DE$ is equal to $8$ . This makes $AD$ equal to $10$
Now, the use of simple calculus is required. Conceptualize an infinite number of lines perpendicular to $AE$ intersecting both $AE$ and $AD$ . Consider the area between point $A$ and the first vertical line. Label the point where the line intersects AE as E', and the point where the line intersects AD as D'. The area of the part of the initial unpainted face within these two positions approaches a rectangle with length AD' and width $w$ . The area of the base within these two positions approaches a rectangle with length AE' and width $w$ . The ratio of AD':AE' is 10:6, since the ratio of AD:AE is 10:6. This means that the area of the initial unpainted surface within these two positions to the area of the base within these two positions is equal to 10 $w$ :6 $w$ = 10:6. Through a similar argument, the areas between each set of vertical lines also maintains a ratio of 10:6. Therefore, the ratio of the area we wish to find to the area of the base between AB and CD (from the top perspective) is 10:6. Using 30-60-90 triangles and partial circles, the area of the base between AB and CD is calculated to be $18\sqrt{3}\ + 12 \pi$ . The area of the unpainted surface therefore becomes $20\pi + 30\sqrt{3}$ , and so our answer is $\boxed{053}$

Solution:
This problem can be calculus-bashed (for those like me who never noticed the surface was merely a stretch of its projection). Label points as in the first paragraph of Solution 1 ( $A$ and $B$ as given, $M$ the midpoint of $AB$ $O$ the center of the cylinder, $T$ the center of the bottom face of the cylinder). Because of the 120 degrees and right triangle calculations, we find $MT$ = 3, $OT$ = 4, $OM$ = 5). We will be integrating with respect to the y-coordinate which we define as distance downwards from $O$ (in this system, the $y$ -coordinate of the bottom face would be 4).
We note that by similar triangles, we have that the length from $O$ to the point on the unpainted surface of coordinate $y$ is $\ell = \frac{5}{4} y$ , and therefore $d\ell = \frac{5}{4} dy$ . Define the segment $A'B'$ to be the intersection of the painted surface with the circular cross section of the cylinder of coordinate $y$ , with endpoints $A'$ and $B'$ and midpoint $M'$ , with $T'$ the center of this circular cross section. Then, by similar triangles, $T'M' = \frac{3}{4} y$ and thus \[A'B' = 2A' M' = 2 \sqrt{ 6^2 - \left( \frac{3}{4}y\right)^2 } = \frac{3}{2} \sqrt{ 64 - y^2 }\] . We know that $A'B'$ is perpendicular to $OM$
Now we can set up our integral: we will integrate $y$ from 0 to 4 and multiply by two because the total height is 8. \[A = 2\int_0^4 \left(\frac{3}{2}\sqrt{ 64 - y^2 }\right) \left( \frac{5}{4} dy\right)\] \[A = \frac{15}{4} \int_0^4 \sqrt{ 64 - y^2 }dy\]
Then we substitute $y = 8\sin \theta$ with $dy = 8 \cos \theta d \theta$ , changing the bounds to 0 to $\frac{\pi}{6}$ as appropriate. \[A = \frac{15}{4} \int_0^\frac{\pi}{6} \sqrt{ 64 - 64\sin^2 \theta }\cdot 8\cos\theta d\theta\] \[A = 240 \int_0^\frac{\pi}{6} \cos^2 \theta d\theta\] \[A = 240 \left[ \frac{\theta}{2} + \frac{\sin 2\theta}{4} \right]_0^\frac{\pi}{6}  = 240 \left[ \frac{\pi}{12} + \frac{\sqrt{3}}{8} \right] = 20{\pi} + 30\sqrt{3}\]
Therefore, $a + b + c = 20 + 30 + 3 = \boxed{053}$


Answer: 353.0

A block wall 100 feet long and 7 feet high will be constructed using blocks that are 1 foot high and either 2 feet long or 1 foot long (no blocks may be cut). The vertical joins in the blocks must be staggered as shown, and the wall must be even on the ends. What is the smallest number of blocks needed to build this wall?
[asy] draw((0,0)--(6,0)--(6,1)--(5,1)--(5,2)--(0,2)--cycle); draw((0,1)--(5,1)); draw((1,1)--(1,2)); draw((3,1)--(3,2)); draw((2,0)--(2,1)); draw((4,0)--(4,1));  [/asy]
$\text{(A)}\ 344\qquad\text{(B)}\ 347\qquad\text{(C)}\ 350\qquad\text{(D)}\ 353\qquad\text{(E)}\ 356$

Solution:
Since the bricks are $1$ foot high, there will be $7$ rows.  To minimize the number of blocks used, rows $1, 3, 5,$ and $7$ will look like the bottom row of the picture, which takes $\frac{100}{2} = 50$ bricks to construct.  Rows $2, 4,$ and $6$ will look like the upper row pictured, which has $49$ 2-foot bricks in the middle, and $2$ 1-foot bricks on each end for a total of $51$ bricks.
Four rows of $50$ bricks and three rows of $51$ bricks totals $4\cdot 50 + 3\cdot 51 = 200 + 153 = 353$ bricks, giving the answer $\boxed{353}.$


Answer: 16.0

A board game spinner is divided into three regions labeled $A$ $B$ and $C$ . The probability of the arrow stopping on region $A$ is $\frac{1}{3}$ and on region $B$ is $\frac{1}{2}$ . The probability of the arrow stopping on region $C$ is:
$\text{(A)}\ \frac{1}{12}\qquad\text{(B)}\ \frac{1}{6}\qquad\text{(C)}\ \frac{1}{5}\qquad\text{(D)}\ \frac{1}{3}\qquad\text{(E)}\ \frac{2}{5}$

Solution: Since the arrow must land in one of the three regions, the sum of the probabilities must be 1. Thus the answer is $1-\frac{1}{2}-\frac{1}{3}=\boxed{16}$


Answer: 51.5

A book that is to be recorded onto compact discs takes $412$ minutes to read aloud. Each disc can hold up to $56$ minutes of reading. Assume that the smallest possible number of discs is used and that each disc contains the same length of reading. How many minutes of reading will each disc contain?
$\mathrm{(A)}\ 50.2 \qquad \mathrm{(B)}\ 51.5 \qquad \mathrm{(C)}\ 52.4 \qquad \mathrm{(D)}\ 53.8 \qquad \mathrm{(E)}\ 55.2$

Solution: Assuming that there are fractions of compact discs, it would take $412/56 ~= 7.357$ CDs to have equal reading time. However, since the number of discs must be a whole number, there are at least 8 CDs, in which case there would be $412/8 = 51.5$ minutes of reading on each of the 8 discs. The answer is $\boxed{51.5}$

Solution: We look at the options, and see which one is divisible by 412. We try A, and see that you don't get a whole number. Next, we try B. We see that the B is divisible by 412 and find that $\boxed{51.5}$ is our answer.


Answer: 342.0

A bored student walks down a hall that contains a row of closed lockers, numbered $1$ to $1024$ . He opens the locker numbered 1, and then alternates between skipping and opening each locker thereafter. When he reaches the end of the hall, the student turns around and starts back. He opens the first closed locker he encounters, and then alternates between skipping and opening each closed locker thereafter. The student continues wandering back and forth in this manner until every locker is open. What is the number of the last locker he opens?

Solution: On his first pass, he opens all of the odd lockers. So there are only even lockers closed. Then he opens the lockers that are multiples of $4$ , leaving only lockers $2 \pmod{8}$ and $6 \pmod{8}$ . Then he goes ahead and opens all lockers $2 \pmod {8}$ , leaving lockers either $6 \pmod {16}$ or $14 \pmod {16}$ . He then goes ahead and opens all lockers $14 \pmod {16}$ , leaving the lockers either $6 \pmod {32}$ or $22 \pmod {32}$ . He then goes ahead and opens all lockers $6 \pmod {32}$ , leaving $22 \pmod {64}$ or $54 \pmod {64}$ . He then opens $54 \pmod {64}$ , leaving $22 \pmod {128}$ or $86 \pmod {128}$ . He then opens $22 \pmod {128}$ and leaves $86 \pmod {256}$ and $214 \pmod {256}$ . He then opens all $214 \pmod {256}$ , so we have $86 \pmod {512}$ and $342 \pmod {512}$ , leaving lockers $86, 342, 598$ , and $854$ , and he is at where he started again. He then opens $86$ and $598$ , and then goes back and opens locker number $854$ , leaving locker number $\boxed{342}$ untouched. He opens that locker.

Solution: We can also solve this with recursion. Let $L_n$ be the last locker he opens given that he started with $2^n$ lockers. Let there be $2^n$ lockers. After he first reaches the end of the hallway, there are $2^{n-1}$ lockers remaining. There is a correspondence between these unopened lockers and if he began with $2^{n-1}$ lockers. The locker $y$ (if he started with $2^{n-1}$ lockers) corresponds to the locker $2^n+2-2y$ (if he started with $2^n$ lockers). It follows that $L_{n} = 2^{n} +2 -2L_{n-1}$ as they are corresponding lockers. We can compute $L_1=2$ and use the recursion to find $L_{10}=\boxed{342}$

Solution: List all the numbers from $1$ through $1024$ , then do the process yourself!!! It will take about 25 minutes (if you don't start to see the pattern), but that's okay, eventually, you will get $\boxed{342}$


Answer: 7.0

A bowl is formed by attaching four regular hexagons of side $1$ to a square of side $1$ . The edges of the adjacent hexagons coincide, as shown in the figure. What is the area of the octagon obtained by joining the top eight vertices of the four hexagons, situated on the rim of the bowl? [asy] import three; size(225); currentprojection=   orthographic(camera=(-5.52541796301147,-2.61548797564715,1.6545450372312),                up=(0.00247902062334861,0.000877141782387748,0.00966536329192992),                target=(0,0,0),                zoom=0.570588560870951); currentpen = black+1.5bp; triple A = O; triple M = (X+Y)/2; triple B = (-1/2,-1/2,1/sqrt(2)); triple C = (-1,0,sqrt(2)); triple D = (0,-1,sqrt(2)); transform3 rho = rotate(90,M,M+Z);  //arrays of vertices for the lower level (the square), the middle level, //and the interleaves vertices of the upper level (the octagon) triple[] lVs = {A}; triple[] mVs = {B}; triple[] uVsl = {C}; triple[] uVsr = {D};  for(int i = 0; i < 3; ++i){   lVs.push(rho*lVs[i]);   mVs.push(rho*mVs[i]);   uVsl.push(rho*uVsl[i]);   uVsr.push(rho*uVsr[i]); }  lVs.cyclic = true; uVsl.cyclic = true;  for(int i : new int[] {0,1,2,3}){   draw(uVsl[i]--uVsr[i]);   draw(uVsr[i]--uVsl[i+1]); } draw(lVs[0]--lVs[1]^^lVs[0]--lVs[3]); for(int i : new int[] {0,1,3}){   draw(lVs[0]--lVs[i]);   draw(lVs[i]--mVs[i]);   draw(mVs[i]--uVsl[i]); } for(int i : new int[] {0,3}){   draw(mVs[i]--uVsr[i]); }  for(int i : new int[] {1,3}) draw(lVs[2]--lVs[i],dashed); draw(lVs[2]--mVs[2],dashed); draw(mVs[2]--uVsl[2]^^mVs[2]--uVsr[2],dashed); draw(mVs[1]--uVsr[1],dashed);  //Comment two lines below to remove red edges //draw(lVs[1]--lVs[3],red+2bp); //draw(uVsl[0]--uVsr[0],red+2bp); [/asy] $\textbf{(A) }6\qquad\textbf{(B) }7\qquad\textbf{(C) }5+2\sqrt{2}\qquad\textbf{(D) }8\qquad\textbf{(E) }9$

Solution:
We extend line segments $\ell,m,$ and $n$ to their point of concurrency, as shown below:  We claim that lines $\ell,m,$ and $n$ are concurrent: In the lateral faces of the bowl, we know that lines $\ell$ and $m$ must intersect, and lines $\ell$ and $n$ must intersect. In addition, line $\ell$ intersects the top plane of the bowl at exactly one point. Since lines $m$ and $n$ are both in the top plane of the bowl, we conclude that lines $\ell,m,$ and $n$ are concurrent.
In the lateral faces of the bowl, the dashed red line segments create equilateral triangles. So, the dashed red line segments all have length $1.$ In the top plane of the bowl, we know that $\overleftrightarrow{m}\perp\overleftrightarrow{n}.$ So, the dashed red line segments create an isosceles triangle with leg-length $1.$
Note that octagon has four pairs of parallel sides, and the successive side-lengths are $1,\sqrt2,1,\sqrt2,1,\sqrt2,1,\sqrt2,$ as shown below:  The area of the octagon is \[3^2-4\cdot\left(\frac12\cdot1^2\right)=\boxed{7}.\]

Solution:
(This is an alternate way of analyzing the red  extension line segments drawn in Solution 1.)
The perimeter of the square bottom of the bowl is $4$ .
Halfway up the bowl, the boundary is still a square, with perimeter $4$ times the hexagon circumradius, aka $4 \times 2 = 8$ times the hexagon (also square) side length (1), an increase of $4$
Extending the bottom half of the bowl to twice its height (full height of the bowl) would increase the perimeter by the same amount again, forming a square with perimeter $4 + (8-4)\times 2= 12$ . Thus the top octagon is cut out of a square of side length $12\div4=3$ and thus area $9$
The difference  between the above-constructed square and the octagon is four right triangles, and (by rotational and reflection symmetry), each is isosceles with equal-length perpendicular bases of length $(3-1)/2 = 1$ , and thus having area $\frac12$ . Therefore the area of the octagon is $9-(4\times 1/2) = \boxed{7}$

Solution:
Note that the octagon is equiangular by symmetry, but it is not equilateral. $4$ of its sides are shared with the hexagon's sides, so each of those sides have side length $1$ . However, the other $4$ sides are touching the triangles, so we wish to find the length of these sides.
Notice that when two adjacent hexagons meet at a side, their planes make the same dihedral angle at the bottom-most point of intersection and at the top-most point of intersection by symmetry. Therefore, the triangle that is wedged between the two hexagons has the same angle as the square at the bottom wedged between the hexagons. Thus, the triangle is a $45-45-90$ isosceles triangle.
This conclusion can also be reached by cutting the bottom square across a diagonal and noticing that each resulting triangle is congruent to each triangle wedged between the hexagons by symmetry.
Furthermore, notice that if you take a copy of this bowl and invert it and place it on top of this bowl, you will get a polyhedron with faces of hexagons and squares, a truncated octahedron, and therefore this triangle has a $90^\circ$ -angle:
Now that we have come to this conclusion, by simple Pythagorean theorem, we have that the other $4$ sides of the octagon are $\sqrt{2}$
We can draw a square around the octagon so that the area of the octagon is the area of the square minus each corner triangle. The hypotenuse of these corner triangles are $1$ and they are $45-45-90$ triangles because the octagon is equiangular, so each has dimensions $\frac{\sqrt{2}}{2},\frac{\sqrt{2}}{2},1$ .
The side length of the square is $\sqrt{2}$ for the larger sides of the octagon, and adding $2$ of $\frac{\sqrt{2}}{2}$ for each width of the triangle. Therefore, the area of the square is: \[\left(\sqrt{2} + 2 \cdot \frac{\sqrt{2}}{2}\right)^2 \implies \left(2\sqrt{2}\right)^2 = 8\] The area of each triangle is $\frac{1}{2} \cdot \frac{\sqrt{2}}{2} \cdot \frac{\sqrt{2}}{2} = \frac{1}{4}$ and there are $4$ of them, so we subtract $1$ from the area of the square. The area of the octagon is thus $\boxed{7}$

Solution:
Denote a square $ABCD, AB = 1,\pi$ is the plane $ABC,$ regular hexagons $ABFKSE, BCHMLF, CDGPNH, ADGQRE,$ triangles $FKL, ESR, GPQ, HMN.$
The main diagonal of each regular hexagon $EF = 2 \implies EFGH$ is square with side $2$ parallel to $\pi.$
The area of this square $[EFGH] = 4 \implies [EFGH] - [ABCD] = 3.$
The difference $3$ is the area of the projection of $4$ half of hexagons on the plane $\pi.$
So the area of the projections of another $4$ half of hexagons is $3.$
It is evident (may be not only for me) that projections of the coincide sides of hexagons  are along diagonals of $ABCD$ (for example $A, E, C,$ and $H$ are collinear.)
So the projections on $\pi$ of the coincide sides of hexagons and triangles are perpendicular to this lines $(SE \perp AE).$
Therefore in plane $\pi$ projections of points $S, E,$ and $R$ are collinear and plane of $\triangle ESR$ is perpendicular to $\pi.$
We get $1 +3 +3 = \boxed{7}.$

Solution:
Through observation, we can reasonably assume that each of the triangles on this shape is a right triangle. Since each side length of the hexagons is $1$ , the hypotenuse of the triangles would be $\sqrt2$ . Now we know the side lengths of the octagon whose area we are solving for. The octagon can be broken into nine pieces. We have four triangles whose side lengths are 1, and their hypotenuse is a side whose length is $\sqrt2$ . Next, we have $5$ $1$ by $1$ squares. The triangles each have an area of $\frac{1}{2}$ , and the squares each have an area of $1$
Then, we add these up, so we get $\boxed{7}.$


Answer: 240.0

A box $2$ centimeters high, $3$ centimeters wide, and $5$ centimeters long can hold $40$ grams of clay.  A second box with twice the height, three times the width, and the same length as the first box can hold $n$ grams of clay.  What is $n$
$\textbf{(A)}\ 120\qquad\textbf{(B)}\ 160\qquad\textbf{(C)}\ 200\qquad\textbf{(D)}\ 240\qquad\textbf{(E)}\ 280$

Solution: The first box has volume $2\times3\times5=30\text{ cm}^3$ , and the second has volume $(2\times2)\times(3\times3)\times(5)=180\text{ cm}^3$ .  The second has a volume that is $6$ times greater, so it holds $6\times40=\boxed{240}$ grams.


Answer: 76.0

A box contains $28$ red balls, $20$ green balls, $19$ yellow balls, $13$ blue balls, $11$ white balls, and $9$ black balls. What is the minimum number of balls that must be drawn from the box without replacement to guarantee that at least $15$ balls of a single color will be drawn?
$\textbf{(A) } 75 \qquad\textbf{(B) } 76 \qquad\textbf{(C) } 79 \qquad\textbf{(D) } 84 \qquad\textbf{(E) } 91$

Solution:
We try to find the worst case scenario where we can find the maximum number of balls that can be drawn while getting $<15$ of each color by applying the pigeonhole principle and through this we get a perfect guarantee.
Namely, we can draw up to $14$ red balls, $14$ green balls, $14$ yellow balls, $13$ blue balls, $11$ white balls, and $9$ black balls, for a total of $75$ balls, without drawing $15$ balls of any one color. Drawing one more ball guarantees that we will get $15$ balls of one color — either red, green, or yellow. Thus, the answer is $75 + 1 = \boxed{76}$


Answer: 76.0

Solution:
We try to find the worst case scenario where we can find the maximum number of balls that can be drawn while getting $<15$ of each color by applying the pigeonhole principle and through this we get a perfect guarantee.
Namely, we can draw up to $14$ red balls, $14$ green balls, $14$ yellow balls, $13$ blue balls, $11$ white balls, and $9$ black balls, for a total of $75$ balls, without drawing $15$ balls of any one color. Drawing one more ball guarantees that we will get $15$ balls of one color — either red, green, or yellow. Thus, the answer is $75 + 1 = \boxed{76}$


Answer: 9.0

A box contains a collection of triangular and square tiles. There are $25$ tiles in the box, containing $84$ edges total. How many square tiles are there in the box?
$\textbf{(A)}\ 3\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 7\qquad\textbf{(D)}\ 9\qquad\textbf{(E)}\ 11$

Solution:
Let $a$ be the amount of triangular tiles and $b$ be the amount of square tiles.
Triangles have $3$ edges and squares have $4$ edges, so we have a system of equations.
We have $a + b$ tiles total, so $a + b = 25$
We have $3a + 4b$ edges total, so $3a + 4b = 84$
Multiplying the first equation by $3$ on both sides gives $3a + 3b = 3(25) = 75$
Second equation minus the first equation gives $b = 9$ , so the answer is $\boxed{9}$

Solution: If all of the tiles were triangles, there would be $75$ edges. This is not enough, so there needs to be some squares. Trading a triangle for a square results in one additional edge each time, so we must trade out $9$ triangles for squares. Answer: $\boxed{9}$

Solution: Let $x$ be the number of square tiles. A square has $4$ edges, so the total number of edges from the square tiles is $4x$ . There are $25$ total tiles, which means that there are $25-x$ triangle tiles. A triangle has $3$ edges, so the total number of edges from the triangle tiles is $3(25-x)$ . Together, the total number of edges is $4x+3(25-x)=84$ . Solving our equation, we get that $x=9$ which means that our answer is $\boxed{9}$


Answer: 57.0

A box contains chips, each of which is red, white, or blue. The number of blue chips is at least half the number of white chips, and at most one third the number of red chips. The number which are white or blue is at least $55$ . The minimum number of red chips is
$\textbf{(A) }24\qquad \textbf{(B) }33\qquad \textbf{(C) }45\qquad \textbf{(D) }54\qquad  \textbf{(E) }57$

Solution: Let the number of white be $2x$ . The number of blue is then $x-y$ for some constant $y$ . So we want $2x+x-y=55\rightarrow 3x-y=55$ . We take mod 3 to find y. $55=1\pmod{3}$ , so blue is 1 more than half white. The number of whites is then 36, and the number of blues is 19. So $19*3=\boxed{57}$


Answer: 0.0

A box contains gold coins. If the coins are equally divided among six people, four coins are left over. If the coins are equally divided among five people, three coins are left over. If the box holds the smallest number of coins that meets these two conditions, how many coins are left when equally divided among seven people?
$\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 5$

Solution:
The counting numbers that leave a remainder of $4$ when divided by $6$ are $4, 10, 16, 22, 28, 34, \cdots$ The counting numbers that leave a remainder of $3$ when
divided by $5$ are $3,8,13,18,23,28,33, \cdots$ So $28$ is the smallest possible number
of coins that meets both conditions. Because 28 is divisible by 7, there are $\boxed{0}$ coins left
when they are divided among seven people.

Solution:
If there were two more coins in the box, the number of coins would be divisible
by both $6$ and $5$ . The smallest number that is divisible by $6$ and $5$ is $30$ , so the
smallest possible number of coins in the box is $28$ and the remainder when divided by $7$ is $\boxed{0}$

Solution: We can set up a system of modular congruencies: \[g\equiv 4 \pmod{6}\] \[g\equiv 3 \pmod{5}\] We can use the division algorithm to say $g=6n+4$ $\Rightarrow$ $6n\equiv 4 \pmod{5}$ $\Rightarrow$ $n\equiv 4 \pmod{5}$ . If we plug the division algorithm in again, we get $n=5q+4$ . This means that $g=30q+28$ , which means that $g\equiv 28 \pmod{30}$ . From this, we can see that $28$ is our smallest possible integer satisfying $g\equiv 28 \pmod{30}$ $28$ $\div$ $7=4$ , making our remainder $0$ . This means that there are $\boxed{0}$ coins left over when equally divided amongst $7$ people.


Answer: 150.0

A boy buys oranges at $3$ for $10$ cents. He will sell them at $5$ for $20$ cents. In order to make a profit of $$1.00$ , he must sell:
$\textbf{(A)}\ 67 \text{ oranges} \qquad \textbf{(B)}\ 150 \text{ oranges} \qquad \textbf{(C)}\ 200\text{ oranges}\\  \textbf{(D)}\ \text{an infinite number of oranges}\qquad \textbf{(E)}\ \text{none of these}$

Solution:
The boy buys $3$ oranges for $10$ cents or $1$ orange for $\frac{10}{3}$ cents.  He sells them at $\frac{20}{5}=4$ cents each.
That means for every orange he sells, he makes a profit of $4-\frac{10}{3}=\frac{2}{3}$ cents.
To make a profit of $100$ cents, he needs to sell $\frac{100}{\frac{2}{3}}=\boxed{150}$


Answer: 150.0

Solution: The boy buys $3$ oranges for $10$ cents. He sells them at $5$ for $20$ cents. So, he buys $15$ for $50$ cents and sells them at $15$ for $60$ cents, so he makes $10$ cents of profit on every $15$ oranges. To make $100$ cents of profit, he needs to sell $15 \cdot \frac{100}{10} = \boxed{150}$ oranges.


Answer: 15.0

A bug crawls along a number line, starting at $-2$ . It crawls to $-6$ , then turns around and crawls to $5$ . How many units does the bug crawl altogether?
$\textbf{(A)}\ 9\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 13\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ 15$

Solution: Crawling from $-2$ to $-6$ takes it a distance of $4$ units. Crawling from $-6$ to $5$ takes it a distance of $11$ units. Add $4$ and $11$ to get $\boxed{15}$


Answer: 15.0

Solution: Crawling from $-2$ to $-6$ takes it a distance of $4$ units. Crawling from $-6$ to $5$ takes it a distance of $11$ units. Add $4$ and $11$ to get $\boxed{15}$


Answer: 683.0

A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m + n.$

Solution:
Let $P_n$ represent the probability that the bug is at its starting vertex after $n$ moves. If the bug is on its starting vertex after $n$ moves, then it must be not on its starting vertex after $n-1$ moves. At this point it has $\frac{1}{2}$ chance of reaching the starting vertex in the next move. Thus $P_n=\frac{1}{2}(1-P_{n-1})$ $P_0=1$ , so now we can build it up:
$P_1=0$ $P_2=\frac{1}{2}$ $P_3=\frac{1}{4}$ $P_4=\frac{3}{8}$ $P_5=\frac{5}{16}$ $P_6=\frac{11}{32}$ $P_7=\frac{21}{64}$ $P_8=\frac{43}{128}$ $P_9=\frac{85}{256}$ $P_{10}=\frac{171}{512}$
Thus the answer is $171+512=$ $\boxed{683}$

Solution:
Consider there to be a clockwise and a counterclockwise direction around the triangle.  Then, in order for the ant to return to the original vertex, the net number of clockwise steps must be a multiple of 3, i.e., $\#CW - \#CCW \equiv 0 \pmod{3}$ .  Since $\#CW + \#CCW = 10$ , it is only possible that $(\#CW,\, \#CCW) = (5,5), (8,2), (2,8)$
In the first case, we pick $5$ out of the ant's $10$ steps to be clockwise, for a total of ${10 \choose 5}$ paths.  In the second case, we choose $8$ of the steps to be clockwise, and in the third case we choose $2$ to be clockwise.  Hence the total number of ways to return to the original vertex is ${10 \choose 5} + {10 \choose 8} + {10 \choose 2} = 252 + 45 + 45 = 342$ .  Since the ant has two possible steps at each point, there are $2^{10}$ routes the ant can take, and the probability we seek is $\frac{342}{2^{10}} = \frac{171}{512}$ , and the answer is $\boxed{683}$

Solution:
Label the vertices of the triangle $A,B,C$ with the ant starting at $A$ . We will make a table of the number of ways to get to $A,B,C$ in $n$ moves $n\leq10$ . The values of the table are calculated from the fact that the number of ways from a vertex say $A$ in $n$ steps equals the number of ways to get to $B$ in $n-1$ steps plus the number of ways to get to $C$ in $n-1$ steps.
\[\begin{array}{|l|ccc|} \multicolumn{4}{c}{\text{Table}}\\\hline \text{Step}&A&B&C \\\hline 1 &0 &1 &1 \\ 2 &2 &1 &1 \\ 3 &2 &3 &3\\ \vdots &\vdots&\vdots&\vdots \\ 10 &342 &341 &341 \\\hline \end{array}\] Therefore, our answer is $512+171=\boxed{683}.$

Solution:
As a note, do NOT do this on the exam as it will eat up your time, but feel free to experiment around with this if you have a good enough understanding of linear algebra. This writeup will be extremely lengthy because I am assuming just very basic concepts of linear algebra. The concepts here extend to higher levels of mathematics, so feel free to explore more in depth so that you can end up solving almost any variation of this classic problem.
There are a possible of 3 states for this problem, so we can model the problem as a stochastic process. The resulting process has a transition matrix of:
\[\hat{T} = \begin{bmatrix} 0 & 0.5 & 0.5\\ 0.5 & 0 & 0.5\\ 0.5 & 0.5 & 0 \end{bmatrix}\]
We aim to diagonalize this transition matrix to make it easier to exponentiate by converting it into what's known as it's Jordan Canonical Form.
In order to do this, we must extract the eigenvalues and eigenvectors of the matrix. The eigenpolynomial for this matrix is obtained by calculating this matrix's determinant with $0-\lambda$ about it's main diagonal like so: \[\hat{T}_{\lambda} = \begin{bmatrix} 0-\lambda & 0.5 & 0.5\\ 0.5 & 0-\lambda & 0.5\\ 0.5 & 0.5 & 0-\lambda \end{bmatrix}\]
We have the matrix's eigenpolynomial to be $\lambda^3 - \frac{3\lambda}{4} + \frac{1}{4}$ , and extracting eigenvalues by setting the polynomial equal to $0$ , we have 2 eigenvalues: $\lambda_1 = 1$ of multiplicity 1, and $\lambda_2 = -\frac{1}{2}$ of multiplicity 2. To extract the eigenvectors, we must assess the kernel of this matrix (also known as the null space), or the linear subspace of the domain of $\hat{T}$ where everything gets mapped to the null vector.
We first do this for $\lambda_1$ . Taking $-\lambda_1$ across the diagonals to get $\hat{T}_{\lambda_1} = \begin{bmatrix} -1 & 0.5 & 0.5\\ 0.5 & -1 & 0.5\\ 0.5 & 0.5 & -1 \end{bmatrix}$ , we first reduce it to reduced row echelon form, which is $\begin{bmatrix} 1 & 0 & -1\\ 0 & 1 & -1\\ 0 & 0 & 0 \end{bmatrix}$ . From here, we compute the kernel by setting \[\begin{bmatrix} 1 & 0 & -1\\ 0 & 1 & -1\\ 0 & 0 & 0 \end{bmatrix} \begin{bmatrix} x_1\\ x_2\\ x_3  \end{bmatrix} = 0\] . So if we take our free variable $x_3 = 0 = t$ , then that means that in the same fashion, $x_1 - x_1 = x_2 - x_2 = 0 = t$ , so hence, the kernel of $\hat{T}_{\lambda} = \begin{bmatrix} t\\ t\\ t \end{bmatrix}$ , or more simply, $t\begin{bmatrix} 1\\ 1\\ 1 \end{bmatrix}$ $\begin{bmatrix} 1\\ 1\\ 1 \end{bmatrix}$ is the eigenvector corresponding to $\lambda_1$ . We do the same computations for our second unique eigenvalue, but I will save the computation to you. There are actually 2 eigenvectors for $\lambda_2$ , because the reduced row echelon form for $\hat{T}_{\lambda_2}$ has 2 free variables instead of 1, so our eigenvectors for $\lambda_2$ are $\begin{bmatrix} -1\\ 1\\ 0 \end{bmatrix}, \begin{bmatrix} -1\\ 0\\ 1 \end{bmatrix}$ . We are now ready to begin finding the Jordan canonical form
In linear algebra, the JCF (which also goes by the name of Jordan Normal Form) is an upper triangular matrix representing a linear transformation over a finite-dimensional complex vector space. Any square matrix that has a Jordan Canonical Form has its field of coefficients extended into a field containing all it's eigenvalues. You can find more information about them on google, as well as exactly how to find them but for now let's get on with the problem. I will skip the computation in this step, largley because this writeup is already gargantuan for a simple AIME problem, and because there are countless resources explaining how to do so.
We aim to decompose $\hat{T}$ into the form $\hat{T} = SJS^{-1}$ , where $S$ is a matrix whose columns consist of the eigenvectors of $\hat{T}$ $J$ is the Jordan matrix, and $S^{-1}$ is, well, the inverse of $S$ . We have 1 eigenvalue of multiplicity 1, and 1 of multiplicity 2, so based on this info, we set our eigenvalues along the diagonals like so.
We have: \[J = \begin{bmatrix} -\frac{1}{2} & 0 & 0\\ 0 & -\frac{1}{2} & 0\\ 0 & 0 & 1 \end{bmatrix}, S = \begin{bmatrix} -1 & -1 & 1\\ 0 & 1 & 1\\ 1 & 0 & 1 \end{bmatrix}, S^{-1} = \frac{1}{3}\begin{bmatrix} -1 & -1 & 2\\ -1 & 2 & -1\\ 1 & 1 & 1 \end{bmatrix}\] and so: \[\hat{T} = \begin{bmatrix} 0 & 0.5 & 0.5\\ 0.5 & 0 & 0.5\\ 0.5 & 0.5 & 0 \end{bmatrix} = SJS^{-1} = \begin{bmatrix} -1 & -1 & 1\\ 0 & 1 & 1\\ 1 & 0 & 1 \end{bmatrix}\begin{bmatrix} -\frac{1}{2} & 0 & 0\\ 0 & -\frac{1}{2} & 0\\ 0 & 0 & 1 \end{bmatrix}\begin{bmatrix} -\frac{1}{3} & -\frac{1}{3} & \frac{2}{3}\\ -\frac{1}{3} & \frac{2}{3} & -\frac{1}{3}\\ \frac{1}{3} & \frac{1}{3} & \frac{1}{3} \end{bmatrix}\] Now that we have converted to Jordan Canonical Form, it is extremely easy to compute $\hat{T}^n$
It is an important fact that for any matrix $K$ with Jordan decomposition $SJ_kS^{-1}$ , we have that $K^n = S(J_k)^nS^{-1}$ Using this fact, we aim to find the general solution for the problem. $J^n = \begin{bmatrix} \left(-\frac{1}{2}\right)^n & 0 & 0\\ 0 & \left(-\frac{1}{2}\right)^n & 0\\ 0 & 0 & 1 \end{bmatrix}$ , and using the laws of matrix multiplication, \[SJ^n = \begin{bmatrix} (-1)^{n+1}\left(\frac{1}{2}\right)^n & (-1)^{n+1}\left(\frac{1}{2}\right)^n & 1\\ 0 & \left(-\frac{1}{2}\right)^n & 1\\ \left(-\frac{1}{2}\right)^n & 0 & 1 \end{bmatrix}\] So finally, our final, generalized transition matrix after any number of steps $n$ is: \[\hat{T}^n = \begin{bmatrix} \frac{1}{3} - \frac{1}{3}(-1)^{1+n}(2)^{1-n} & \frac{1}{3} + \frac{1}{3}(-1)^{n+1}(2)^{1-(1+n)} & \frac{1}{3} + \frac{1}{3}(-1)^{n+1}(2)^{1-(1+n)}\\ \frac{1}{3} + \frac{1}{3}(-1)^{n+1}(2)^{1-(1+n)} & \frac{1}{3} - \frac{1}{3}(-1)^{1+n}(2)^{1-n} & \frac{1}{3} + \frac{1}{3}(-1)^{n+1}(2)^{1-(1+n)}\\ \frac{1}{3} + \frac{1}{3}(-1)^{n+1}(2)^{1-(1+n)} & \frac{1}{3} + \frac{1}{3}(-1)^{n+1}(2)^{1-(1+n)} & \frac{1}{3} - \frac{1}{3}(-1)^{1+n}(2)^{1-n} \end{bmatrix}\]
For the sake of this problem, we seek the top left element, which is $\frac{1}{3} - \frac{1}{3}(-1)^{1+n}(2)^{1-n}$ . Substituting $n=10$ readily gives the probability of the bug reaching it's starting position within 10 moves to be $\frac{171}{512} \implies m+n = \boxed{683}$

Solution: This method does not rigorously get the answer, but it works. As the bug makes more and more moves, the probability of it going back to the origin approaches closer and closer to 1/3. Therefore, after 10 moves, the probability gets close to $341.33/1024$ . We can either round up or down. If we round down, we see $341/1024$ cannot be reduced any further and because the only answers on the AIME are below 1000, this cannot be the right answer. However, if we round up, $342/1024$ can be reduced to $171/512$ where the sum 171+512= $\boxed{683}$ is an accepted answer.

Solution:
Start of with any vertex, say $A$ . Denote $a_n$ the number of paths ending where it started. Then notice that for a path to end in the vertex you started on, you must have for the $(n-1)$ case that of the $2^{n-1}$ total paths, we must take away the paths that end in the $(n-1)$ -st term where it started off. (Because imagine on the $(n-1)$ move that it landed on vertex $A$ . Then if we wanted to find the number of length $n$ paths that end at $A$ , we would be able to find that path, because on the $(n-1)$ -st move it landed at $A$ . You can't go from $A$ to $A$ ). Hence we have the recursion $a_n=2^{n-1}-a_{n-1}$ , with $a_3 = 2$ . Now reiterating gives us $a_{10} = 342$ , so that the probability is $\frac{342}{2^{10}} = \frac{171}{512}$ . So we have $171 + 512 = \boxed{683}$ .
~th1nq3r


Answer: 2400.0

Solution:
There is $1$ way to get to any of the red arrows. From the first (top) red arrow, there are $2$ ways to get to each of the first and the second (top 2) blue arrows; from the second (bottom) red arrow, there are $3$ ways to get to each of the first and the second blue arrows. So there are in total $5$ ways to get to each of the blue arrows.
From each of the first and second blue arrows, there are respectively $4$ ways to get to each of the first and the second green arrows; from each of the third and the fourth blue arrows, there are respectively $8$ ways to get to each of the first and the second green arrows. Therefore there are in total $5 \cdot (4+4+8+8) = 120$ ways to get to each of the green arrows.
Finally, from each of the first and second green arrows, there are respectively $2$ ways to get to the first orange arrow; from each of the third and the fourth green arrows, there are $3$ ways to get to the first orange arrow. Therefore there are $120 \cdot (2+2+3+3) = 1200$ ways to get to each of the orange arrows, hence $2400$ ways to get to the point $B$ $\boxed{2400}$

Solution: For every blue arrow, there are $2\cdot 2=4$ ways to reach it without using the reverse arrow since the bug can choose any of $2$ red arrows to pass through and $2$ black arrows to pass through.  If the bug passes through the white arrow, the red arrow that the bug travels through must be the closest to the first black arrow. Otherwise, the bug will have to travel through both red segments, which is impossible because now there is no path to take after the bug emerges from the reverse arrow.  Similarly, with the blue segments, the second black arrow taken must be the one that is closest to the blue arrow that was taken.  Also, it is trivial that the two black arrows taken must be different.  Therefore, if the reverse arrow is taken, the blue arrow taken determines the entire path and there is $1$ path for every arrow.  Since the bug cannot return once it takes a blue arrow, the answer must be divisible by $5$ $\boxed{2400}$ is the only answer that is.


Answer: 2400.0

Solution:
We use casework.
The main thing to notice is that, if the bug does not go backwards, then every vertical set of arrows can be used, as the bug could travel straight downwards and then use any arrow to continue right.
Note: The motivation is quite weird so follow my numbers as they start from the left (point A) and go right (point B).
Case 1: Bug does not go backwards.
The number of cases for this is just each vertical set of arrows multiplied to each other (if you don't understand where I'm coming from, try to understand where these numbers come from!)
And so we have $2*2*4*4*4*2*2 = 2^{10}$ cases.
Case 2: The bug goes backwards once, either at the first arrow or third arrow.
Here, we have to count the fact that there is a horizontal midline that the bug could not cross, or otherwise it would be stepping on the same edge twice.
Back on first arrow: $2*1*2*4*4*2*2 = 2^{8}$ cases.
Back on third arrow: $2*2*4*4*4*1 = 2^{8}$ cases.
Case 3: The bug goes backwards once, at the second arrow.
Same thing as above, except since there are 4 arrows in the vertical set (plus one for the backwards arrow), then the calculations are a bit different.
We have $2*2*4*1*2*4*2*2 = 2^{9}$ cases.
Notice that the first and third back arrows decrease the number of cases by a factor of $2^2$ and the second back arrow decreases the number of cases by $2^1$ . Hence,
1st + 2nd = $2^7$
2nd + 3rd = $2^7$
1st + 3rd = $2^6$
1st + 2nd + 3rd = $2^5$
And so the number of cases in total is $2^{10} + 2^9 + 2^8 + 2^8 + 2^7 + 2^7 + 2^6 + 2^5 \Rightarrow 1024 + 512 + 256 + 256 + 128 + 128 + 64 + 32 = \boxed{2400}$


Answer: 2400.0

Solution:
There is $1$ way to get to any of the red arrows. From the first (top) red arrow, there are $2$ ways to get to each of the first and the second (top 2) blue arrows; from the second (bottom) red arrow, there are $3$ ways to get to each of the first and the second blue arrows. So there are in total $5$ ways to get to each of the blue arrows.
From each of the first and second blue arrows, there are respectively $4$ ways to get to each of the first and the second green arrows; from each of the third and the fourth blue arrows, there are respectively $8$ ways to get to each of the first and the second green arrows. Therefore there are in total $5 \cdot (4+4+8+8) = 120$ ways to get to each of the green arrows.
Finally, from each of the first and second green arrows, there are respectively $2$ ways to get to the first orange arrow; from each of the third and the fourth green arrows, there are $3$ ways to get to the first orange arrow. Therefore there are $120 \cdot (2+2+3+3) = 1200$ ways to get to each of the orange arrows, hence $2400$ ways to get to the point $B$ $\boxed{2400}$

Solution: For every blue arrow, there are $2\cdot 2=4$ ways to reach it without using the reverse arrow since the bug can choose any of $2$ red arrows to pass through and $2$ black arrows to pass through.  If the bug passes through the white arrow, the red arrow that the bug travels through must be the closest to the first black arrow. Otherwise, the bug will have to travel through both red segments, which is impossible because now there is no path to take after the bug emerges from the reverse arrow.  Similarly, with the blue segments, the second black arrow taken must be the one that is closest to the blue arrow that was taken.  Also, it is trivial that the two black arrows taken must be different.  Therefore, if the reverse arrow is taken, the blue arrow taken determines the entire path and there is $1$ path for every arrow.  Since the bug cannot return once it takes a blue arrow, the answer must be divisible by $5$ $\boxed{2400}$ is the only answer that is.


Answer: 2400.0

Solution:
We use casework.
The main thing to notice is that, if the bug does not go backwards, then every vertical set of arrows can be used, as the bug could travel straight downwards and then use any arrow to continue right.
Note: The motivation is quite weird so follow my numbers as they start from the left (point A) and go right (point B).
Case 1: Bug does not go backwards.
The number of cases for this is just each vertical set of arrows multiplied to each other (if you don't understand where I'm coming from, try to understand where these numbers come from!)
And so we have $2*2*4*4*4*2*2 = 2^{10}$ cases.
Case 2: The bug goes backwards once, either at the first arrow or third arrow.
Here, we have to count the fact that there is a horizontal midline that the bug could not cross, or otherwise it would be stepping on the same edge twice.
Back on first arrow: $2*1*2*4*4*2*2 = 2^{8}$ cases.
Back on third arrow: $2*2*4*4*4*1 = 2^{8}$ cases.
Case 3: The bug goes backwards once, at the second arrow.
Same thing as above, except since there are 4 arrows in the vertical set (plus one for the backwards arrow), then the calculations are a bit different.
We have $2*2*4*1*2*4*2*2 = 2^{9}$ cases.
Notice that the first and third back arrows decrease the number of cases by a factor of $2^2$ and the second back arrow decreases the number of cases by $2^1$ . Hence,
1st + 2nd = $2^7$
2nd + 3rd = $2^7$
1st + 3rd = $2^6$
1st + 2nd + 3rd = $2^5$
And so the number of cases in total is $2^{10} + 2^9 + 2^8 + 2^8 + 2^7 + 2^7 + 2^6 + 2^5 \Rightarrow 1024 + 512 + 256 + 256 + 128 + 128 + 64 + 32 = \boxed{2400}$


Answer: 195.0

A bug travels in the coordinate plane, moving only along the lines that are parallel to the $x$ -axis or $y$ -axis. Let $A = (-3, 2)$ and $B = (3, -2)$ . Consider all possible paths of the bug from $A$ to $B$ of length at most $20$ . How many points with integer coordinates lie on at least one of these paths?
$\textbf{(A)}\ 161 \qquad \textbf{(B)}\ 185 \qquad \textbf{(C)}\  195 \qquad \textbf{(D)}\  227 \qquad \textbf{(E)}\  255$

Solution:
We declare a point $(x, y)$ to make up for the extra steps that the bug has to move. If the point $(x, y)$ satisfies the property that $|x - 3| + |y + 2| + |x + 3| + |y - 2| \le 20$ , then it is in the desirable range because $|x - 3| + |y + 2|$ is the length of the shortest path from $(x,y)$ to $(3, -2)$ and $|x + 3| + |y - 2|$ is the length of the shortest path from $(x,y)$ to $(-3, 2)$
If $-3\le x \le 3$ , then $-7\le y \le 7$ satisfy the property. there are $15 \times 7 = 105$ lattice points here.
else let $3< x \le 8$ (and for $-8 \le x < -3$ because it is symmetrical) We set 8 as the upper bound for x because the shortest distance from $(-3, 2)$ to $(x, y)$ added to the shortest distance from $(x, y)$ to $(3, -2)$ is $|x - 3| + |y + 2| + |x + 3| + |y - 2|$ . Since the minimum value for the difference between the y-coordinates is at $y = 0$ , we get $2x + 4 = 20$ or $-2x + 4 = 20$ . Thus, the upper and lower bounds for $x$ are $8$ and $-8$ , respectively.
Now we test each value for x satisfying $3< x \le 8$ and double the result because of symmetry.
For $x = 4$ , the possibles values of y are such that $|2y| \le 12$ for a total of $13$ lattice points,
for $x = 5$ , the possibles values of y are such that $|2y| \le 10$ for a total of $11$ lattice points,
for $x = 6$ , the possibles values of y are such that $|2y| \le 8$ for a total of $9$ lattice points,
for $x = 7$ , the possibles values of y are such that $|2y| \le 6$ for a total of $7$ lattice points,
for $x = 8$ , the possibles values of y are such that $|2y| \le 4$ for a total of $5$ lattice points,
Hence, there are a total of $105 + 2 ( 13 + 11 + 9 + 7 + 5) = \boxed{195}$ lattice points.

Solution:
(Anyone mind making a diagram for this)
Notice that the bug is basically moving from A to B (length 10) but going on a detour in the middle.
Specifically the detour would be of length 5 to some point and then going back by retracing its path (also length 5). Just to simplify things we can observe that the coordinates don't matter here and all we need to remember is that A and B are the diagonally opposite vertices of a 4 by 6 rectangle. The bug can start the "detour" from any point on or inside the rectangle. Notice that the bug can go 5 steps in the y direction, 5 steps in the x direction, or anything in between, so the points covered by possible detours from any point would look like a rhombus or square rotated 45 degrees (with centre at a point on or inside the rectangle). Drawing this out we would get an octagon.
Finding the final answer is then easy, for this solution I will slice the octagon into 4 rectangles (2 of which are squares) and 4 isosceles triangles. There are $(4+1)\cdot (6+1) = 35$ points on or inside the original triangle, $5\cdot 7$ points covered by the rectangles above and below the original one and $5\cdot 5$ points for the squares to the right and left of the original triangle. Lastly each of the four isosceles triangles cover $4+3+2+1 = 10$ points. (Notice that although the length of the detour is 5, the points on the edge of the triangles were already counted).
Adding these up, we get $3\cdot 35 + 2\cdot 25 + 4\cdot 10 = 195 => \boxed{195}$


Answer: 103.0

A bug walks all day and sleeps all night. On the first day, it starts at point $O$ , faces east, and walks a distance of $5$ units due east. Each night the bug rotates $60^\circ$ counterclockwise. Each day it walks in this new direction half as far as it walked the previous day. The bug gets arbitrarily close to the point $P$ . Then $OP^2=\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution:
We notice that the moves cycle every 6 moves, so we plot out the first 6 moves on the coordinate grid with point $O$ as the origin. We will keep a tally of the x-coordinate and y-coordinate separately. Then, we will combine them and account for the cycling using the formula for an infinite geometric series.
First move: The ant moves right $5$ .
Second move: We use properties of a $30-60-90$ triangle to get $\frac{5}{4}$ right, $\frac{5\sqrt{3}}{4}$ up.
Third move: $\frac{5}{8}$ left, $\frac{5\sqrt{3}}{8}$ up.
Fourth move: $\frac{5}{8}$ left.
Fifth move: $\frac{5}{32}$ left, $\frac{5\sqrt{3}}{32}$ down.
Sixth move: $\frac{5}{64}$ right, $\frac{5\sqrt{3}}{64}$ down.
Total of x-coordinate: $5 + \frac{5}{4} - \frac{5}{8} - \frac{5}{8}  - \frac{5}{32} + \frac{5}{64} = \frac{315}{64}$ .
Total of y-coordinate: $0 + \frac{5\sqrt{3}}{4} + \frac{5\sqrt{3}}{8} + 0 - \frac{5\sqrt{3}}{32} - \frac{5\sqrt{3}}{64} = \frac{105\sqrt{3}}{64}$
After this cycle of six moves, all moves repeat with a factor of $(\frac{1}{2})^6 = \frac{1}{64}$ . Using the formula for a geometric series, multiplying each sequence by $\frac{1}{1-\frac{1}{64}} = \frac{64}{63}$ will give us the point $P$
Now, knowing the initial $x$ and $y,$ we plug this into the geometric series formula ( $\frac{a}{1-r}$ ), and we get $\frac{315}{64} \cdot \frac{64}{63} = 5$ $\frac{105\sqrt{3}}{64} \cdot \frac{64}{63} = \frac{5\sqrt{3}}{3}$ .
Therefore, the coordinates of point $P$ are $(5,\frac{5\sqrt{3}}{3})$ , so using the Pythagorean Theorem, $OP^2 = \frac{100}{3}$ , for an answer of $\boxed{103}$

Solution: We place the ant at the origin of the complex plane with its first move being in the positive real direction.  Then the ant's journey can be represented as the infinite series \[5\left(1 + \frac{e^{\frac{i\pi}{3}}}{2} + \left(\frac{e^{\frac{i\pi}{3}}}{2}\right)^2 + \cdots\right)\] Using the formula for an infinite geometric series, this is equal to \[\frac{5}{1 - \frac12e^{\frac{i\pi}{3}}} = \frac{5}{1 - \frac{1 + i\sqrt{3}}{4}} = \frac{20}{3 - i\sqrt{3}} = 5 + \frac{5i\sqrt{3}}{3}\] We are looking for the square of the modulus of this value: \[\left|\frac{5 + 5i\sqrt{3}}{3}\right|^2 = 25 + \frac{25}{3} = \frac{100}{3}\] so the answer is $100 + 3 = \boxed{103}$

Solution: The ant goes in the opposite direction every $3$ moves, going $(1/2)^3=1/8$ the distance backwards. Using geometric series, he travels $1-1/8+1/64-1/512...=(7/8)(1+1/64+1/4096...)=(7/8)(64/63)=8/9$ the distance of the first three moves over infinity moves. Now, we use coordinates meaning $(5+5/4-5/8, 0+5\sqrt3/4+5\sqrt3/8)$ or $(45/8, 15\sqrt3/8)$ . Multiplying these by $8/9$ , we get $(5, 5\sqrt3/3)$ $\implies$ $\boxed{103}$

Solution: The bug goes forward and backward in three directions: straight east, northeast, and northwest. It travels $5-\frac{5}{8}+\frac{5}{64}-\cdots=\frac{40}{9}$ units east. Thus, it goes northeast $\frac{\frac{40}{9}}{2}=\frac{20}{9}$ units northeast and $\frac{10}{9}$ units northwest. Now, the bug travels a total of $\frac{40}{9}+\frac{10}{9}-\frac{5}{9}=\frac{45}{9}=5$ units east and a total of $\frac{10\sqrt{3}}{9}+\frac{5\sqrt{3}}{9}=\frac{15\sqrt{3}}{9}=\frac{5\sqrt{3}}{3}$ units north because of the 30-60-90 right triangles formed. Now, $OP^2=5^2+\frac{5^2}{3}=\frac{100}{3}$ by the Pythagorean Theorem, and the answer is $\boxed{103}$

Solution:
The bug's bearings on each traversal are $0^\circ, 60^\circ, 120^\circ,$ and so on; in general, the $n-$ th traversal has length $5\cdot (1/2)^{n-1}$ and bearing $60(n-1).$ This means that the $x$ and $y$ displacements for the $n-$ th traversal are
\[(\Delta x_n, \Delta y_n)=(5\cdot (1/2)^{n-1}\cos (60(n-1))^\circ,5\cdot (1/2)^{n-1}\sin (60(n-1))^\circ).\]
Summing this over all the displacements, we get
\[x_P=\sum_{n=1}^{\infty} 5\cdot (1/2)^{n-1}\cos (60(n-1))^\circ, y_P=\sum_{n=1}^{\infty} 5\cdot (1/2)^{n-1}\sin (60(n-1))^\circ.\]
We then have
\begin{align} OP^2 &= x_P^2+y_P^2 \\ &=\sum_{n=1}^{\infty} (5\cdot (1/2)^{n-1}\cos ^2(60(n-1))^\circ) + (5\cdot (1/2)^{n-1}\sin ^2(60(n-1))^\circ) \\ &= \sum_{n=1}^{\infty} (5\cdot (1/2)^{n-1})^2(\cos ^2 (60(n-1))^\circ+\sin ^2 (60(n-1))^\circ) \\ &= \sum_{n=1}^{\infty} (25\cdot (1/4)^{n-1}) \\ &= \dfrac{25}{1-1/4} \\ &= 100/3. \end{align}
Thus, the answer is $100+3=\boxed{103}.$ --MenuThreeOne


Answer: 75.0

A burger at Ricky C's weighs $120$ grams, of which $30$ grams are filler.
What percent of the burger is not filler?
$\mathrm{(A)}\ 60\% \qquad\mathrm{(B)}\ 65\% \qquad\mathrm{(C)}\ 70\% \qquad\mathrm{(D)}\ 75\% \qquad\mathrm{(E)}\ 90\%$

Solution: There are $30$ grams of filler, so there are $120-30= 90$ grams that aren't filler. $\frac{90}{120}=\frac{3}{4}=\boxed{75}$


Answer: 17.0

A bus takes $2$ minutes to drive from one stop to the next, and waits $1$ minute at each stop to let passengers board. Zia takes $5$ minutes to walk from one bus stop to the next. As Zia reaches a bus stop, if the bus is at the previous stop or has already left the previous stop, then she will wait for the bus. Otherwise she will start walking toward the next stop. Suppose the bus and Zia start at the same time toward the library, with the bus $3$ stops behind. After how many minutes will Zia board the bus?
$\textbf{(A) } 17 \qquad \textbf{(B) } 19 \qquad \textbf{(C) } 20 \qquad \textbf{(D) } 21 \qquad \textbf{(E) } 23$

Solution:
Initially, suppose that the bus is at Stop $0$ (starting point) and Zia is at Stop $3.$
We construct the following table of $5$ -minute intervals: \[\begin{array}{c||c|c} & & \\ [-2.5ex] \textbf{Time} & \textbf{Bus's Location} & \textbf{Zia's Location} \\ [0.5ex] \hline & & \\ [-2ex] \boldsymbol{5} \ \textbf{Minutes} & \text{Stop} \ 2 \ \text{(Waiting)} & \text{Stop} \ 4 \\ \boldsymbol{10} \ \textbf{Minutes} & \text{Midpoint of Stops} \ 3 \ \text{and} \ 4 & \text{Stop} \ 5 \\ \boldsymbol{15} \ \textbf{Minutes} & \text{Stop} \ 5 \ \text{(Leaving)} & \text{Stop} \ 6 \end{array}\] Note that Zia will wait for the bus after $15$ minutes, and the bus will arrive $2$ minutes later.
Therefore, the answer is $15+2=\boxed{17}.$

Solution: Since Zia will wait for the bus if the bus is at the previous stop, we can create an equation to solve for when the bus is at the previous stop. The bus travels $\frac{1}{3}$ of a stop per minute, and Zia travels $\frac{1}{5}$ of a stop per minute. Now we create the equation, $\frac{1}{3}m = \frac{1}{5}m + 3 - 1$ (the $-1$ accounts for us wanting to find when the bus reaches the stop before Zia's). Solving, we find that $m=15.$ Now Zia has to wait $2$ minutes for the bus to reach her, so our answer is $15+2=\boxed{17}.$


Answer: 6.0

A can of soup can feed $3$ adults or $5$ children.  If there are $5$ cans of soup and $15$ children are fed, then how many adults would the remaining soup feed?
$\text{(A)}\ 5 \qquad \text{(B)}\ 6 \qquad \text{(C)}\ 7 \qquad \text{(D)}\ 8 \qquad \text{(E)}\ 10$

Solution: A can of soup will feed $5$ children so $15$ children are feed by $3$ cans of soup. Therefore, there are $5-3=2$ cans for adults, so $3 \times 2 =\boxed{6}$ adults are fed.


Answer: 34.0

A car travels $120$ miles from $A$ to $B$ at $30$ miles per hour but returns the same distance at $40$ miles per hour. The average speed for the round trip is closest to:
$\textbf{(A)}\ 33\text{ mph}\qquad\textbf{(B)}\ 34\text{ mph}\qquad\textbf{(C)}\ 35\text{ mph}\qquad\textbf{(D)}\ 36\text{ mph}\qquad\textbf{(E)}\ 37\text{ mph}$

Solution: The car takes $120 \text{ miles }\cdot\dfrac{1 \text{ hr }}{30 \text{ miles }}=4 \text{ hr}$ to get from $A$ to $B$ . Also, it takes $120 \text{ miles }\cdot\dfrac{1 \text{ hr }}{40 \text{ miles }}=3 \text{ hr}$ to get from $B$ to $A$ . Therefore, the average speed is $\dfrac{240\text{ miles }}{7 \text{ hr}}=34\dfrac{2}{7}\text{ mph}$ , which is closest to $\boxed{34}$


Answer: 198.0

A car travels due east at $\frac 23$ mile per minute on a long, straight road. At the same time, a circular storm, whose radius is $51$ miles, moves southeast at $\frac 12\sqrt{2}$ mile per minute. At time $t=0$ , the center of the storm is $110$ miles due north of the car. At time $t=t_1$ minutes, the car enters the storm circle, and at time $t=t_2$ minutes, the car leaves the storm circle. Find $\frac 12(t_1+t_2)$

Solution:
We set up a coordinate system, with the starting point of the car at the origin . At time $t$ , the car is at $\left(\frac 23t,0\right)$ and the center of the storm is at $\left(\frac{t}{2}, 110 - \frac{t}{2}\right)$ . Using the distance formula,
\begin{eqnarray*} \sqrt{\left(\frac{2}{3}t - \frac 12t\right)^2 + \left(110-\frac{t}{2}\right)^2} &\le& 51\\ \frac{t^2}{36} + \frac{t^2}{4} - 110t + 110^2 &\le& 51^2\\ \frac{5}{18}t^2 - 110t + 110^2 - 51^2 &\le& 0\\ \end{eqnarray*}
Noting that $\frac 12 \left(t_1+t_2 \right)$ is at the maximum point of the parabola, we can use $-\frac{b}{2a} = \frac{110}{2 \cdot \frac{5}{18}} = \boxed{198}$

Solution:
First do the same process for assigning coordinates to the car. The car moves $\frac{2}{3}$ miles per minute to the right, so the position starting from $(0,0)$ is $\left(\frac{2}{3}t, 0\right)$
Take the storm as circle. Given southeast movement, split the vector into component, getting position $\left(\frac{1}{2}t, 110 - \frac{1}{2}t\right)$ for the storm's center. This circle with radius 51 yields $\left(x - \frac{1}{2}t\right)^2 + \left(y -110 + \frac{1}{2}t\right)^2 = 51^2$
Now substitute the car's coordinates into the circle's:
$\left(\frac{2}{3}t - \frac{1}{2}t\right)^2 + \left(-110 + \frac{1}{2}t\right)^2 = 51^2$
Simplifying and then squaring:
$\left(\frac{1}{6}t\right)^2 + \left(-110 + \frac{1}{2}t\right)^2 = 51^2$
$\frac{1}{36}t^2 + \frac{1}{4}t^2 - 110t + 110^2$
Forming into a quadratic we get the following, then set equal to 0, since the first time the car hits the circumference of the storm is $t_{1}$ and the second is $t_{2}$
$\frac{5}{18}t^2 - 110t + 110^2 - 51^2 = 0$
The problem asks for sum of solutions divided by 2 so sum is equal to:
$-\frac{b}{a} = -\frac{-110}{\frac{5}{18}} = 110\cdot{\frac{18}{5}} = 396\cdot{\frac{1}{2}} = \boxed{198}$

Solution:
We only need to know how the storm and car move relative to each other, so we can find this by subtracting the storm's movement vector from the car's.  This gives the car's movement vector as $\left(\frac{1}{6}, \frac{1}{2}\right)$ .  Labeling the car's starting position A, the storm center B, and the right triangle formed by AB with a right angle at B and the car's path, we get the following diagram, with AD as our desired length since D is the average of the points where the car enters and exits the storm.

$AB = 110$ , so $CB = \frac{110}{3}$ .  The Pythagorean Theorem then gives $AC = \frac{110\sqrt{10}}{3}$ , and since $\bigtriangleup ABC \sim \bigtriangleup ADB$ $AD = (AB)\frac{AB}{AC} = 33\sqrt{10}$ .  The Pythagorean Theorem now gives the car's speed as $\sqrt{\frac{5}{18}}$ , and finally $\frac{33\sqrt{10}}{\sqrt{\frac{5}{18}}} = \boxed{198}$


Answer: 3195.0

A cart rolls down a hill, travelling $5$ inches the first second and accelerating so that during each successive $1$ -second time interval, it travels $7$ inches more than during the previous $1$ -second interval. The cart takes $30$ seconds to reach the bottom of the hill. How far, in inches, does it travel?
$\textbf{(A)} ~215 \qquad\textbf{(B)} ~360\qquad\textbf{(C)} ~2992\qquad\textbf{(D)} ~3195\qquad\textbf{(E)} ~3242$

Solution:
Since \[\mathrm{Distance}=\mathrm{Speed}\cdot\mathrm{Time},\] we seek the sum \[5\cdot1+12\cdot1+19\cdot1+26\cdot1+\cdots=5+12+19+26+\cdots,\] in which there are $30$ terms.
The last term is $5+7\cdot(30-1)=208.$ Therefore, the requested sum is \[5+12+19+26+\cdots+208=\frac{5+208}{2}\cdot30=\boxed{3195}.\] ~MRENTHUSIASM

Solution: The distance (in inches) traveled within each $1$ -second interval is: \[5,5+1(7),5+2(7), \dots , 5+29(7).\] This is an arithmetic sequence so the total distance travelled, found by summing them up is: \[\text{number of terms} \cdot \text{average of terms} = \text{number of terms} \cdot \dfrac{\text{first term}+\text{last term}}{2}.\] Or, \[30 \cdot \dfrac{5+5+29(7)}{2} = 15 \cdot 213 = \boxed{3195}.\] ~BakedPotato66

Solution: From the $30$ -term sum \[5+12+19+26+\cdots\] in Solution 1, taking modulo $10$ gives \[5+12+19+26+\cdots \equiv 3\cdot(5+2+9+6+3+0+7+4+1+8) = 3\cdot45\equiv5 \pmod{10}.\] The only answer choices congruent to $5$ modulo $10$ are $\textbf{(A)}$ and $\textbf{(D)}.$ By a quick estimation, $\textbf{(A)}$ is too small, leaving us with $\boxed{3195}.$

Solution: This problem can be solved by physics method. This method is perhaps the quickest too and shows the beauty of the problem. The average speed increases $7 \ \text{in/s}$ per second. So, the acceleration $a=7 \ \text{in/s\textsuperscript{2}}.$ The average speed of the first second is $5 \ \text{in/s}.$ We can know the initial velocity $v_0=5-0.5\cdot7=1.5.$ The displacement at $t=30$ is \[s=\frac{1}{2}at^2+v_0t=\frac{1}{2}\cdot7\cdot30^2+1.5\cdot30= \boxed{3195}.\] ~Bran_Qin


Answer: 28.0

A cell phone plan costs $20$ dollars each month, plus $5$ cents per text message sent, plus $10$ cents for each minute used over $30$ hours. In January Michelle sent $100$ text messages and talked for $30.5$ hours. How much did she have to pay?
$\textbf{(A)}\ 24.00 \qquad \textbf{(B)}\ 24.50 \qquad \textbf{(C)}\ 25.50 \qquad \textbf{(D)}\ 28.00 \qquad \textbf{(E)}\ 30.00$

Solution:
The base price of Michelle's cell phone plan is $20$ dollars.
If she sent $100$ text messages and it costs $5$ cents per text, then she must have spent $500$ cents for texting, or $5$ dollars. She talked for $30.5$ hours, but $30.5-30$ will give us the amount of time exceeded past 30 hours. $30.5-30=.5$ hours $=30$ minutes.
Since the price for phone calls is $10$ cents per minute, the additional amount Michelle has to pay for phone calls is $30*10=300$ cents, or $3$ dollars.
Adding $20+5+3$ dollars $\boxed{28}$


Answer: 28.0

Solution:
The base price of Michelle's cell phone plan is $20$ dollars.
If she sent $100$ text messages and it costs $5$ cents per text, then she must have spent $500$ cents for texting, or $5$ dollars. She talked for $30.5$ hours, but $30.5-30$ will give us the amount of time exceeded past 30 hours. $30.5-30=.5$ hours $=30$ minutes.
Since the price for phone calls is $10$ cents per minute, the additional amount Michelle has to pay for phone calls is $30*10=300$ cents, or $3$ dollars.
Adding $20+5+3$ dollars $\boxed{28}$


Answer: 9.0

A certain calculator has only two keys [+1] and [x2]. When you press one of the keys, the calculator automatically  displays the result. For instance, if the calculator originally displayed "9" and you pressed [+1], it would display "10." If you then pressed [x2], it would display "20." Starting with the display "1," what is the fewest number of keystrokes you would need to reach "200"?
$\textbf{(A)}\ 8\qquad\textbf{(B)}\ 9\qquad\textbf{(C)}\ 10\qquad\textbf{(D)}\ 11\qquad\textbf{(E)}\ 12$

Solution:
We can start at $200$ and work our way down to $1$ . We want to press the button that multiplies by $2$ the most, but since we are going down instead of up, we divide by $2$ instead. If we come across an odd number, then we will subtract that number by $1$ . Notice
Since we've reached $1$ , it's clear that the answer should be $\boxed{9}$ . Because we only subtracted $1$ when we had to, this is optimal. ~Roy2020


Answer: 429.0

A certain function $f$ has the properties that $f(3x) = 3f(x)$ for all positive real values of $x$ , and that $f(x) = 1-|x-2|$ for $1\le x \le 3$ . Find the smallest $x$ for which $f(x) = f(2001)$

Solution:
Iterating the condition $f(3x) = 3f(x)$ , we find that $f(x) = 3^kf\left(\frac{x}{3^k}\right)$ for positive integers $k$ . We know the definition of $f(x)$ from $1 \le x \le 3$ , so we would like to express $f(2001) = 3^kf\left(\frac{2001}{3^k}\right),\ 1 \le \frac{2001}{3^k} \le 3 \Longrightarrow k = 6$ . Indeed,
\[f(2001) = 729\left[1 - \left| \frac{2001}{729} - 2\right|\right] = 186.\]
We now need the smallest $x$ such that $f(x) = 3^kf\left(\frac{x}{3^k}\right) = 186$ . The range of $f(x),\ 1 \le x \le 3$ , is $0 \le f(x) \le 1$ . So when $1 \le \frac{x}{3^k} \le 3$ , we have $0 \le f\left(\frac{x}{3^k}\right) = \frac{186}{3^k} \le 1$ . Multiplying by $3^k$ $0 \le 186 \le 3^k$ , so the smallest value of $k$ is $k = 5$ . Then,
\[186 = {3^5}f\left(\frac{x}{3^5}\right).\]
Because we forced $1 \le \frac{x}{3^5} \le 3$ , so
\[186 = {3^5}f\left(\frac{x}{3^5}\right) = 243\left[1 - \left| \frac{x}{243} - 2\right|\right] \Longrightarrow x = \pm 57 + 2  \cdot 243.\]
We want the smaller value of $x = \boxed{429}$

Solution:
First, we start by graphing the function when $1\leq{x}\leq3$ , which consists of the lines $y=x-1$ and $y=3-x$ that intersect at $(2,1)$ . Similarly, using $f(3x)=3f(x)$ , we get a dilation of our initial figure by a factor of 3 for the next interval and so on.
Observe that the intersection of two lines always has coordinates $(2y,y)$ where $y=3^a$ for some $a$ . First, we compute $f(2001)$ . The nearest intersection point is $(1458,729)$ when $a=7$ . Therefore, we can safely assume that $f(2001)$ is somewhere on the line with a slope of $-1$ that intersects at that nearest point. Using the fact that the slope of the line is $-1$ , we compute $f(2001)=729-543=186$ . However, we want the minimum value such that $f(x)=186$ and we see that there is another intersection point on the left which has a $y>186$ , namely $(486,243)$ . Therefore, we want the point that lies on the line with slope $1$ that intersects this point. Once again, since the slope of the line is $1$ , we get $x=486-57=\boxed{429}$


Answer: 12.0

A checkerboard consists of one-inch squares.  A square card, $1.5$ inches on a side, is placed on the board so that it covers part or all of the area of each of $n$ squares.  The maximum possible value of $n$ is
$\text{(A)}\ 4\text{ or }5 \qquad \text{(B)}\ 6\text{ or }7\qquad \text{(C)}\ 8\text{ or }9 \qquad \text{(D)}\ 10\text{ or }11 \qquad \text{(E)}\ 12\text{ or more}$

Solution: Using the Pythagorean Theorem , the diagonal of the square $\sqrt{(1.5)^2+(1.5)^2}=\sqrt{4.5}>2$ . Because this is longer than $2$ ( length of the sides of two adjacent squares), the card can be placed like so, covering $12$ squares. $\rightarrow \boxed{12}$


Answer: 555.0

A checkerboard of $13$ rows and $17$ columns has a number written in each square, beginning in the upper left corner, so that the first row is numbered $1,2,\ldots,17$ , the second row $18,19,\ldots,34$ , and so on down the board. If the board is renumbered so that the left column, top to bottom, is $1,2,\ldots,13,$ , the second column $14,15,\ldots,26$ and so on across the board, some squares have the same numbers in both numbering systems. Find the sum of the numbers in these squares (under either system).
$\text {(A)}\ 222 \qquad \text {(B)}\ 333\qquad \text {(C)}\ 444 \qquad \text {(D)}\ 555 \qquad \text {(E)}\ 666$

Solution:
Index the rows with $i = 1, 2, 3, ..., 13$ Index the columns with $j = 1, 2, 3, ..., 17$
For the first row number the cells $1, 2, 3, ..., 17$ For the second, $18, 19, ..., 34$ and so on
So the number in row = $i$ and column = $j$ is $f(i, j) = 17(i-1) + j = 17i + j - 17$
Similarly, numbering the same cells columnwise we
find the number in row = $i$ and column = $j$ is $g(i, j) = i + 13j - 13$
So we need to solve
$f(i, j) = g(i, j)$
$17i + j - 17 = i + 13j - 13$
$16i = 4 + 12j$
$4i = 1 + 3j$
$i = (1 + 3j)/4$
We get $(i, j) = (1, 1), f(i, j) = g(i, j) = 1$
$(i, j) = (4, 5), f(i, j) = g(i, j) = 56$
$(i, j) = (7, 9), f(i, j) = g(i, j) = 111$
$(i, j) = (10, 13), f(i, j) = g(i, j) = 166$
$(i, j) = (13, 17), f(i, j) = g(i, j) = 221$
$\boxed{555}$ $555$


Answer: 32.0

A chess king is said to attack all the squares one step away from it, horizontally, vertically, or diagonally. For instance, a king on the center square of a $3$ $3$ grid attacks all $8$ other squares, as shown below. Suppose a white king and a black king are placed on different squares of a $3$ $3$ grid so that they do not attack each other. In how many ways can this be done?
[asy] /* AMC8 P17 2024, revised by Teacher David */ unitsize(29pt); import math; add(grid(3,3));  pair [] a = {(0.5,0.5), (0.5, 1.5), (0.5, 2.5), (1.5, 2.5), (2.5,2.5), (2.5,1.5), (2.5,0.5), (1.5,0.5)};  for (int i=0; i<a.length; ++i) {     pair x = (1.5,1.5) + 0.4*dir(225-45*i);     draw(x -- a[i], arrow=EndArrow()); }  label("$K$", (1.5,1.5)); [/asy]
$\textbf{(A)}\ 20 \qquad \textbf{(B)}\ 24 \qquad \textbf{(C)}\ 27 \qquad \textbf{(D)}\ 28 \qquad \textbf{(E)}\ 32$
~Diagram by Andrei.martynau

Solution:
Corners have $5$ spots to go and there are $4$ corners, so $5 \times 4=20$ .
Edges have $3$ spots to go and there are $4$ sides so, $3 \times 4=12$ .
That gives us $20+12=32$ spots to go into totally.
So $\boxed{32}$ is the answer.
~andliu766


Answer: 1260.0

A child builds towers using identically shaped cubes of different colors. How many different towers with a height $8$ cubes can the child build with $2$ red cubes, $3$ blue cubes, and $4$ green cubes? (One cube will be left out.)
$\textbf{(A) } 24 \qquad\textbf{(B) } 288 \qquad\textbf{(C) } 312 \qquad\textbf{(D) } 1,260 \qquad\textbf{(E) } 40,320$

Solution: Arranging eight cubes is the same as arranging the nine cubes first, and then removing the last cube. In other words, there is a one-to-one correspondence between every arrangement of nine cubes, and every actual valid arrangement. Thus, we initially get $9!$ . However, we have overcounted, because the red cubes can be permuted to have the same overall arrangement, and the same applies with the blue and green cubes. Thus, we have to divide by the $2!$ ways to arrange the red cubes, the $3!$ ways to arrange the blue cubes, and the $4!$ ways to arrange the green cubes. Thus we have $\frac {9!} {2! \cdot 3! \cdot  4!} = \boxed{1,260}$ different possible towers.

Solution:
We can divide the problem into three cases, each representing one cube to be excluded:
Case 1 : The red cube is excluded. This gives us the problem of arranging one red cube, three blue cubes, and four green cubes. The number of possible arrangements is $\frac{8!}{4!\cdot3!}=280$ . Note that we do not need to multiply by the number of red cubes because there is no way to distinguish between the first red cube and the second.
Case 2 : The blue cube is excluded. This gives us the problem of arranging two red cubes, two blue cubes, and four green cubes. The number of possible arrangements is $\frac{8!}{2!\cdot2!\cdot4!}=420$
Case 3 : The green cube is excluded. This gives us the problem of arranging two red cubes, three blue cubes, and three green cubes. The number of possible arrangements is $\frac{8!}{2!\cdot3!\cdot3!}=560$
Adding up the individual cases from above gives the answer as $280+420+560=\boxed{1,260}$


Answer: 29.0

A child has a set of $96$ distinct blocks. Each block is one of $2$ materials (plastic, wood), $3$ sizes (small, medium, large), $4$ colors (blue, green, red, yellow), and $4$ shapes (circle, hexagon, square, triangle). How many blocks in the set differ from the 'plastic medium red circle' in exactly $2$ ways? (The 'wood medium red square' is such a block)
(A) 29 (B) 39 (C) 48 (D) 56 (E) 62

Solution: The process of choosing a block can be represented by a generating function. Each choice we make can match the 'plastic medium red circle' in one of its qualities $(1)$ or differ from it in $k$ different ways $(kx)$ . Choosing the material is represented by the factor $(1+1x)$ , choosing the size by the factor $(1+2x)$ , etc: \[(1+x)(1+2x)(1+3x)^2\] Expanding out the first two factors and the square: \[(1+3x+2x^2)(1+6x+9x^2)\] By expanding further we can find the coefficient of $x^2$ , which represents the number of blocks differing from the original block in exactly two ways. We don't have to expand it completely, but choose the terms which will be multiplied together to result in a constant multiple of $x^2$ \[1\cdot9+3\cdot6+2\cdot1=\boxed{29}\]

Solution: The amount of ways we can differ in the material, sizes, colors, and shapes category is 1, 2, 3, and 3 respectively (we take away one because we cannot choose the characteristic already chosen). We can choose to differ two of these characteristics, so our answer is $1\cdot2 + 1\cdot3 + 1\cdot3 + 2\cdot3 + 2\cdot3 + 3\cdot3 = \boxed{29}$


Answer: 185.0

A child's wading pool contains 200 gallons of water.  If water evaporates at the rate of 0.5 gallons per day and no other water is added or removed, how many gallons of water will be in the pool after 30 days?
$\text{(A)}\ 140 \qquad \text{(B)}\ 170 \qquad \text{(C)}\ 185 \qquad \text{(D)}\ 198.5 \qquad \text{(E)}\ 199.85$

Solution:
$30$ days multiplied by $0.5$ gallons a day results in $15$ gallons of water loss.
The remaining water is $200-15=185=\boxed{185}$


Answer: 49.0

A circle centered at $A$ with a radius of 1 and a circle centered at $B$ with a radius of 4 are externally tangent. A third circle is tangent to the first two and to one of their common external tangents as shown. What is the radius of the third circle?
[asy] unitsize(0.75cm); pair A=(0,1), B=(4,4); dot(A); dot(B); draw( circle(A,1) ); draw( circle(B,4) ); draw( (-1.5,0)--(8.5,0) ); draw( A -- (A+(-1,0)) ); label("$1$", A -- (A+(-1,0)), N ); draw( B -- (B+(4,0)) ); label("$4$", B -- (B+(4,0)), N ); label("$A$",A,E); label("$B$",B,W);  filldraw( circle( (12/9,4/9), 4/9 ), lightgray, black ); dot( (12/9,4/9) ); [/asy]
$\text{(A) }\frac {1}{3} \qquad \text{(B) }\frac {2}{5} \qquad \text{(C) }\frac {5}{12} \qquad \text{(D) }\frac {4}{9} \qquad \text{(E) }\frac {1}{2}$

Solution:
In the triangle $ABC$ we have $AB = 1+4 = 5$ and $BC=4-1 = 3$ , thus by the Pythagorean theorem we have $AC=4$
Let $r$ be the radius of the small circle, and let $s$ be the perpendicular distance from $S$ to $\overline{AC}$ . Moreover, the small circle is tangent to both other circles, hence we have $SA=1+r$ and $SB=4+r$
We have $SA = \sqrt{s^2 + (1-r)^2}$ and $SB=\sqrt{(4-s)^2 + (4-r)^2}$ . Hence we get the following two equations:
\begin{align*} s^2 + (1-r)^2 & = (1+r)^2 \\ (4-s)^2 + (4-r)^2 & = (4+r)^2 \end{align*}
Simplifying both, we get
\begin{align*} s^2 & = 4r \\ (4-s)^2 & = 16r \end{align*}
As in our case both $r$ and $s$ are positive, we can divide the second one by the first one to get $\left( \frac{4-s}s \right)^2 = 4$
Now there are two possibilities: either $\frac{4-s}s=-2$ , or $\frac{4-s}s=2$
In the first case clearly $s<0$ , which puts the center on the wrong side of $A$ , so this is not the correct case.
(Note: This case corresponds to the other circle that is tangent to both given circles and the common tangent line. By coincidence, due to the $4:1$ ratio between radii of $A$ and $B$ , this circle turns out to have the same radius as circle $B$ , with center directly left of center $B$ , and tangent to $B$ directly above center $A$ .)
The second case solves to $s=\frac 43$ . We then have $4r = s^2 = \frac {16}9$ , hence $r = \boxed{49}$

Solution:
The horizontal line is the equivalent of a circle of curvature $0$ , thus we can apply Descartes' Circle Formula
The four circles have curvatures $0, 1, \frac 14$ , and $\frac 1r$
We have $2\left(0^2+1^2+\frac {1}{4^2}+\frac{1}{r^2}\right)=\left(0+1+\frac 14+\frac 1r\right)^2$
Simplifying, we get $\frac{34}{16}+\frac{2}{r^2}=\frac{25}{16}+\frac{5}{2r}+\frac{1}{r^2}$
\[\frac{1}{r^2}-\frac{5}{2r}+\frac{9}{16}=0\] \[\frac{16}{r^2}-\frac{40}{r}+9=0\] \[\left(\frac{4}{r}-9\right)\left(\frac{4}{r}-1\right)=0\]
Obviously $r$ cannot equal $4$ , therefore $r = \boxed{49}$


Answer: 50.0

A circle has a chord of length $10$ , and the distance from the center of the circle to the chord is $5$ . What is the area of the circle?
$\textbf{(A) }25\pi \qquad \textbf{(B) }50\pi \qquad \textbf{(C) }75\pi \qquad \textbf{(D) }100\pi \qquad \textbf{(E) }125\pi \qquad$

Solution: Let $O$ be the center of the circle, $\overline{AB}$ be the chord, and $M$ be the midpoint of $\overline{AB},$ as shown below.  Note that $\overline{OM}\perp\overline{AB}.$ Since $OM=AM=BM=5,$ we conclude that $\triangle OMA$ and $\triangle OMB$ are congruent isosceles right triangles. It follows that $r=5\sqrt2,$ so the area of $\odot O$ is $\pi r^2=\boxed{50}$


Answer: 3.0

A circle has center $(-10, -4)$ and has radius $13$ . Another circle has center $(3, 9)$ and radius $\sqrt{65}$ . The line passing through the two points of intersection of the two circles has equation $x+y=c$ . What is $c$
$\textbf{(A)}\ 3\qquad\textbf{(B)}\ 3\sqrt{3}\qquad\textbf{(C)}\ 4\sqrt{2}\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ \frac{13}{2}$

Solution: The equations of the two circles are $(x+10)^2+(y+4)^2=169$ and $(x-3)^2+(y-9)^2=65$ . Rearrange them to $(x+10)^2+(y+4)^2-169=0$ and $(x-3)^2+(y-9)^2-65=0$ , respectively. Their intersection points are where these two equations gain equality. The two points lie on the line with the equation $(x+10)^2+(y+4)^2-169=(x-3)^2+(y-9)^2-65$ . We can simplify this like the following. $(x+10)^2+(y+4)^2-169=(x-3)^2+(y-9)^2-65 \rightarrow (x^2+20x+100)+(y^2+8y+16)-(x^2-6x+9)-(y^2-18y+81)=104 \rightarrow 26x+26y+26=104 \rightarrow 26x+26y=78 \rightarrow x+y=3$ . Thus, $c = \boxed{3}$

Solution:
Note the specificity of the radii, $13$ and $\sqrt{65}$ , and that specificity is often deliberately added to simplify the solution to a problem.
One may recognize $13$ as the hypotenuse of the $\text{5-12-13}$ right triangle and $\sqrt{65}$ as the hypotenuse of the right triangle with legs $1$ and $8$ . We can suppose that the legs of these triangles connect the circles' centers to their intersection along the gridlines of the plane.
If we suspect that one of the intersections lies $12$ units to the right of and $5$ units above the center of the first circle, we find the point $(-10 + 12,-4 + 5) = (2,1)$ , which is in fact $1$ unit to the left of and $8$ units below the center of the second circle at $(3,9)$
Plugging $(2,1)$ into $x + y$ gives us $c = 2 + 1 = \boxed{3}$


Answer: 25.0

A circle is centered at $O$ $\overline{AB}$ is a diameter and $C$ is a point on the circle with $\angle COB = 50^\circ$ . What is the degree measure of $\angle CAB$
$\textbf{(A)}\ 20 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 45 \qquad \textbf{(D)}\ 50 \qquad \textbf{(E)}\ 65$

Solution: Assuming we do not already know an inscribed angle is always half of its central angle, we will try a different approach. Since $O$ is the center, $OC$ and $OA$ are radii and they are congruent. Thus, $\triangle COA$ is an isosceles triangle. Also, note that $\angle COB$ and $\angle COA$ are supplementary, then $\angle COA = 180 - 50 = 130^{\circ}$ . Since $\triangle COA$ is isosceles, then $\angle OCA \cong \angle OAC$ . They also sum to $50^{\circ}$ , so each angle is $\boxed{25}$


Answer: 25.0

Solution: Note that $\angle AOC = 180^\circ - 50^\circ = 130^\circ$ . Because triangle $AOC$ is isosceles, $\angle CAB = (180^\circ - 130^\circ)/2 = \boxed{25}$


Answer: 48.0

A circle is circumscribed around an isosceles triangle whose two congruent angles have degree measure $x$ . Two points are chosen independently and uniformly at random on the circle, and a chord is drawn between them. The probability that the chord intersects the triangle is $\frac{14}{25}$ . Find the difference between the largest and smallest possible values of $x$

Solution:
The probability that the chord doesn't intersect the triangle is $\frac{11}{25}$ . The only way this can happen is if the two points are chosen on the same arc between two of the triangle vertices. The probability that a point is chosen on one of the arcs opposite one of the base angles is $\frac{2x}{360}=\frac{x}{180}$ (this comes from the Central Angle Theorem, which states that the central angle from two points on a circle is always twice the inscribed angle from those two points), and the probability that a point is chosen on the arc between the two base angles is $\frac{180-2x}{180}$ . Therefore, we can write \[2\left(\frac{x}{180}\right)^2+\left(\frac{180-2x}{180}\right)^2=\frac{11}{25}\] This simplifies to \[x^2-120x+3024=0\]
(Note that the simplification is quite tedious)
Which factors as \[(x-84)(x-36)=0\] So $x=84, 36$ . The difference between these is $\boxed{048}$

Solution:
Because we know that we have an isosceles triangle with angles of $x$ (and we know that x is an inscribed angle), that means that the arc that is intercepted by this angle is $2x$ . We form this same conclusion for the other angle $x$ , and $180-2x$ . Therefore we get $3$ arcs, namely, $2x$ $2x$ , and $360-4x$ . To have the chords intersect the triangle, we need the two points selected (to make a chord) to be on completely different arcs. An important idea to understand is that order matters in this case, so we have the equation $2$ $\frac{2x}{360}$ $\frac{2x}{360}$ $2$ $2$ $\frac{2x}{360}$ $\frac{360-4x}{360}$ $\frac{14}{25}$ which using trivial algebra gives you $x^2-120x+3024$ and factoring gives you $(x-84)(x-36)$ and so your answer is $\boxed{048}$ .
~jske25

Solution:
After constructing the circumscribed circle, realize that the only time when the chord does not intersect the circle is when our $2$ points fall on only one arc formed by the sides of the triangle. Thus, lets call our isosceles triangle $ABC$ , where $AB=BC$ . Thus, the arcs formed by $BC$ and $AB$ can be called $a$ , and the arc formed by $AC$ is called $b$ . So, we can create the following system
\[2a+b=1\] \[2a^2+4ab=\frac{14}{25}\] \[2a^2+b^2=\frac{11}{25}\]
Notice we are denoting $a$ and $b$ as our probabilities, which we will be converting to degrees later. The 2 remaining systems can be calculated by using our rule about intersecting arcs and chords. So, after some hairy algebra we get:
\[a=\frac{1}{5}\] if \[b=\frac{3}{5}\] \[a=\frac{7}{15}\] if \[b=\frac{1}{15}\]
From here we find the absolute difference by doing $\frac{7}{15}-\frac{1}{5} = \frac{4}{15}$ . Converting to degrees, since the angles of a triangle add up to $180^o$ , we find that $\frac{4}{15} \cdot 180 =\boxed{048}$ , which is our answer.


Answer: 8.0

A circle is inscribed in a square, then a square is inscribed in this circle, and finally, a circle is inscribed in this square. What is the ratio of the area of the smallest circle to the area of the largest square?
$\textbf{(A) } \frac{\pi}{16} \qquad \textbf{(B) } \frac{\pi}{8} \qquad \textbf{(C) } \frac{3\pi}{16} \qquad \textbf{(D) } \frac{\pi}{4} \qquad \textbf{(E) } \frac{\pi}{2}$

Solution: Let the side of the largest square be $x$ . It follows that the diameter of the inscribed circle is also $x$ . Therefore, the diagonal of the square inscribed inscribed in the circle is $x$ . The side length of the smaller square is $\dfrac{x}{\sqrt{2}}=\dfrac{x\sqrt{2}}{2}$ . Similarly, the diameter of the smaller inscribed circle is $\dfrac{x\sqrt{2}}{2}$ . Hence, its radius is $\dfrac{x\sqrt{2}}{4}$ . The area of this circle is $\left(\dfrac{x\sqrt{2}}{4}\right)^2\pi=\dfrac{2\pi x^2}{16}=\dfrac{x^2\pi}{8}$ , and the area of the largest square is $x^2$ . The ratio of the areas is $\dfrac{\dfrac{x^2\pi}{8}}{x^2}=\frac{\cancel{x^2}\pi}{8}\cdot\frac{1}{\cancel{x^2}}=\boxed{8}$

Solution: Let the radius of the smallest circle be $r$ . Then the side length of the smaller square is $2r$ . The radius of the larger circle is half the length of the diagonal of the smaller square, so it is $\sqrt{2}r$ . Hence the largest square has sides of length $2\sqrt{2}r$ . The ratio of the area of the smallest circle to the area of the largest square is therefore $\frac{\pi r^2}{\left(2\sqrt{2}r\right)^2} =\boxed{8}.$


Answer: 3.0

A circle is inscribed in a triangle with sides $8, 15$ , and $17$ . The radius of the circle is:
$\textbf{(A)}\ 6 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 7$

Solution: We know that $A = sr$ , where $A$ is the triangle's area, $s$ its semiperimeter, and $r$ its inradius. Since this particular triangle is a right triangle (which we can verify by the Pythagorean theorem), the area is half of $8*15 = 120$ , and the semiperimeter is half of $8 + 15 + 17 = 40$ . Therefore, the inradius is $\frac{120}{40} = 3$ , so our answer is $\boxed{3}$ and we are done.


Answer: 5.0

A circle of diameter $1$ is removed from a $2\times 3$ rectangle, as shown.  Which whole number is closest to the area of the shaded region?
[asy] fill((0,0)--(0,2)--(3,2)--(3,0)--cycle,gray); draw((0,0)--(0,2)--(3,2)--(3,0)--cycle,linewidth(1)); fill(circle((1,5/4),1/2),white); draw(circle((1,5/4),1/2),linewidth(1)); [/asy]
$\text{(A)}\ 1 \qquad \text{(B)}\ 2 \qquad \text{(C)}\ 3 \qquad \text{(D)}\ 4 \qquad \text{(E)}\ 5$

Solution:
The area of the shaded region is the area of the circle subtracted from the area of the rectangle.
The diameter of the circle is $1$ , so the radius is $1/2$ and the area is \[(1/2)^2\pi = \pi /4.\]
The rectangle obviously has area $2\times 3= 6$ , so the area of the shaded region is $6-\pi / 4$ .
This is closest to $5\rightarrow \boxed{5}$


Answer: 4.0

A circle of radius $2$ is cut into four congruent arcs. The four arcs are joined to form the star figure shown. What is the ratio of the area of the star figure to the area of the original circle?
[asy] size(0,50); draw((-1,1)..(-2,2)..(-3,1)..(-2,0)..cycle); dot((-1,1)); dot((-2,2)); dot((-3,1)); dot((-2,0)); draw((1,0){up}..{left}(0,1)); dot((1,0)); dot((0,1)); draw((0,1){right}..{up}(1,2)); dot((1,2)); draw((1,2){down}..{right}(2,1)); dot((2,1)); draw((2,1){left}..{down}(1,0));[/asy]
$\textbf{(A)}\hspace{.05in}\frac{4-\pi}{\pi}\qquad\textbf{(B)}\hspace{.05in}\frac{1}\pi\qquad\textbf{(C)}\hspace{.05in}\frac{\sqrt2}{\pi}\qquad\textbf{(D)}\hspace{.05in}\frac{\pi-1}{\pi}\qquad\textbf{(E)}\hspace{.05in}\frac{3}\pi$

Solution: Draw a square around the star figure. The side length of this square is $4$ , because the side length is the diameter of the circle. The square forms $4$ -quarter circles around the star figure. This is the equivalent of one large circle with radius $2$ , meaning that the total area of the quarter circles is $4\pi$ . The area of the square is $16$ . Thus, the area of the star figure is $16 - 4\pi$ . The area of the circle is $4\pi$ . Taking the ratio of the two areas, we find the answer is $\boxed{4}$


Answer: 200.0

A circle of radius 5 is inscribed in a rectangle as shown.  The ratio of the length of the rectangle to its width is 2:1. What is the area of the rectangle?
[asy] draw((0,0)--(0,10)--(20,10)--(20,0)--cycle);  draw(circle((10,5),5));[/asy]
$\textbf{(A)}\ 50\qquad\textbf{(B)}\ 100\qquad\textbf{(C)}\  125\qquad\textbf{(D)}\ 150\qquad\textbf{(E)}\ 200$

Solution:
Note that the diameter of the circle is equal to the shorter side of the rectangle. Since the radius is $5$ , the diameter is $2\cdot 5 = 10$ .
Since the sides of the rectangle are in a $2:1$ ratio, the longer side has length $2\cdot 10 = 20$ .
Therefore the area is $20\cdot 10 = 200$ or $\boxed{200}$


Answer: 200.0

A circle of radius 5 is inscribed in a rectangle as shown. The ratio of the length of the rectangle to its width is 2:1. What is the area of the rectangle?
[asy] draw((0,0)--(0,10)--(20,10)--(20,0)--cycle);  draw(circle((10,5),5)); [/asy]
$\textbf{(A)}\ 50\qquad\textbf{(B)}\ 100\qquad\textbf{(C)}\ 125\qquad\textbf{(D)}\ 150\qquad\textbf{(E)}\ 200$

Solution: If the radius is $5$ , then the width is $10$ , hence the length is $20$ $10\times20= \boxed{200}.$


Answer: 3.0

A circle with area $A_1$ is contained in the interior of a larger circle with area $A_1+A_2$ . If the radius of the larger circle is $3$ ,
and if $A_1 , A_2, A_1 + A_2$ is an arithmetic progression, then the radius of the smaller circle is
$\textbf{(A) }\frac{\sqrt{3}}{2}\qquad \textbf{(B) }1\qquad \textbf{(C) }\frac{2}{\sqrt{3}}\qquad \textbf{(D) }\frac{3}{2}\qquad \textbf{(E) }\sqrt{3}$

Solution:
Solution by e_power_pi_times_i
The area of the larger circle is $A_1 + A_2 = 9\pi$ . Then $A_1 , 9\pi-A_1 , 9\pi$ are in an arithmetic progression. Thus $9\pi-(9\pi-A_1) = 9\pi-A_1-A_1$ . This simplifies to $3A_1 = 9\pi$ , or $A_1 = 3\pi$ . The radius of the smaller circle is $\boxed{3}$


Answer: 8.0

A circle with center $C$ is tangent to the positive $x$ and $y$ -axes and externally tangent to the circle centered at $(3,0)$ with radius $1$ . What is the sum of all possible radii of the circle with center $C$
$\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$

Solution:
Let $r$ be the radius of our circle. For it to be tangent to the positive $x$ and $y$ axes, we must have $C=(r,r)$ . For the circle to be externally tangent to the circle centered at $(3,0)$ with radius $1$ , the distance between $C$ and $(3,0)$ must be exactly $r+1$
By the Pythagorean theorem the distance between $(r,r)$ and $(3,0)$ is $\sqrt{ (r-3)^2 + r^2 }$ , hence we get the equation $(r-3)^2 + r^2 = (r+1)^2$
Simplifying, we obtain $r^2 - 8r + 8 = 0$ . By Vieta's formulas the sum of the two roots of this equation is $\boxed{8}$


Answer: 6.0

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

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

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