Answer: 201.0

Set $A$ consists of $m$ consecutive integers whose sum is $2m$ , and set $B$ consists of $2m$ consecutive integers whose sum is $m.$ The absolute value of the difference between the greatest element of $A$ and the greatest element of $B$ is $99$ . Find $m.$

Solution:
Note that since set $A$ has $m$ consecutive integers that sum to $2m$ , the middle integer (i.e., the median) must be $2$ .  Therefore, the largest element in $A$ is $2 + \frac{m-1}{2}$
Further, we see that the median of set $B$ is $0.5$ , which means that the "middle two" integers of set $B$ are $0$ and $1$ .  Therefore, the largest element in $B$ is $1 + \frac{2m-2}{2} = m$ $2 + \frac{m-1}{2} > m$ if $m < 3$ , which is clearly not possible, thus $2 + \frac{m-1}{2} < m$
Solving, we get \begin{align*} m - 2 - \frac{m-1}{2} &= 99\\ m-\frac{m}{2}+\frac{1}{2}&=101\\ \frac{m}{2}&=100\frac{1}{2}.\\ m &= \boxed{201}

Solution:
Let us give the elements of our sets names: $A = \{x, x + 1, x + 2, \ldots, x + m - 1\}$ and $B = \{y, y + 1, \ldots, y + 2m - 1\}$ .  So we are given that \[2m = x + (x + 1) + \ldots + (x + m - 1) = mx + (1 + 2 + \ldots + (m - 1)) = mx + \frac{m(m -1)}2,\] so $2 = x + \frac{m - 1}2$ and $x + (m - 1) = \frac{m + 3}2$ (this is because $x = 2 - \frac{m-1}{2}$ so plugging this into $x+(m-1)$ yields $\frac{m+3}{2}$ ). Also, \[m = y + (y + 1) + \ldots + (y + 2m - 1) = 2my + \frac{2m(2m - 1)}2,\] so $1 = 2y + (2m - 1)$ so $2m = 2(y + 2m - 1)$ and $m = y + 2m - 1$
Then by the given, $99 = |(x + m - 1) - (y + 2m - 1)| = \left|\frac{m + 3}2 - m\right| = \left|\frac{m - 3}2\right|$ $m$ is a positive integer so we must have $99 = \frac{m - 3}2$ and so $m = \boxed{201}$

Solution:
The thing about this problem is, you have some "choices" that you can make freely when you get to a certain point, and these choices won't affect the accuracy of the solution, but will make things a lot easier for us.
First, we note that for set $A$
\[\frac{m(f + l)}{2} = 2m\]
Where $f$ and $l$ represent the first and last terms of $A$ .  This comes from the sum of an arithmetic sequence.
Solving for $f+l$ , we find the sum of the two terms is $4$
Doing the same for set B, and setting up the equation with $b$ and $e$ being the first and last terms of set $B$
\[m(b+e) = m\]
and so $b+e = 1$
Now we know, assume that both sequences are increasing sequences, for the sake of simplicity.  Based on the fact that set $A$ has half the number of elements as set $B$ , and the difference between the greatest terms of the two two sequences is $99$ (forget about absolute value, it's insignificant here since we can just assume both sets end with positive last terms), you can set up an equation where $x$ is the last term of set A:
\[2(x-(-x+4)+1) = 1+(x+99)-(-x-99+1)\]
Note how i basically just counted the number of terms in each sequence here.  It's made a lot simpler because we just assumed that the first term is negative and last is positive for each set, it has absolutely no effect on the end result!  This is a great strategy that can help significantly simplify problems.  Also note how exactly i used the fact that the first and last terms of each sequence sum to $4$ and $1$ respectively (add $x$ and $(-x+4)$ to see what i mean).
Solving this equation we find $x = 102$ .  We know the first and last terms have to sum to $4$ so we find the first term of the sequence is $-98$ .  Now, the solution is in clear sight, we just find the number of integers between $-98$ and $102$ , inclusive, and it is $m = \boxed{201}$

Solution:
First, calculate the average of set $A$ and set $B$ . It's obvious that they are $2$ and $1/2$ respectively.
Let's look at both sets. Obviously, there is an odd number of integers in the set with $2$ being in the middle, which means that $m$ is an odd number and that the number of consecutive integers on each side of $2$ are equal. In set $B$ , it is clear that it contains an even number of integers, but since the number in the middle is $1/2$ , we know that the range of the consecutive numbers on both sides will be $(x$ to $0)$ and $(1$ to $-y)$
Nothing seems useful right now, but let's try plugging an odd number, $3$ , for $m$ in set $B$ . We see that there are $6$ consecutive integers and $3$ on both sides of $1/2$ . After plugging this into set $A$ , we find that the set equals \[{1,2,3}\] . From there, we find the absolute value of the difference of both of the greatest values, and get 0.
Let's try plugging in another odd number, $55$ . We see that the resulting set of numbers is $(-54$ to $0)$ , and $(1$ to $55)$ . We then plug this into set $A$ , and find that the set of numbers is $(-25$ to $-29)$ which indeed results in the average being $2$ . We then find the difference of the greatest values to be 26.
From here, we see a pattern that can be proven by more trial and error. When we make $m$ equal to $3$ , then the difference is $0$ whearas when we make it $55$ , then the difference is $26$ $55-3$ equals to $52$ and $26-0$ is just $0$ . We then see that $m$ increases twice as fast as the difference. So when the difference is $99$ , it increased $99$ from when it was $0$ , which means that $m$ increased by $99*2$ which is $198$ . We then add this to our initial $m$ of $3$ , and get $\boxed{201}$ as our answer.

Solution: Let the first term of $A$ be $a$ and the first term of $B$ be $b$ . There are $m$ elements in $A$ so $A$ is $a, a+1, a+2,...,a+m-1$ . Adding these up, we get $\frac{2a+m-1}{2}\cdot m = 2m \implies 2a+m=5$ . Set $B$ contains the numbers $b, b+1, b+2,...,b+2m-1$ . Summing these up, we get $\frac{2b+2m-1}{2}\cdot 2m =m \implies 2b+2m=2$ . The problem gives us that the absolute value of the difference of the largest terms in $A$ and $B$ is $99$ . The largest term in $A$ is $a+m-1$ and the largest term in $B$ is $b+2m-1$ so $|b-a+m|=99$ . From the first two equations we get, we can get that $2(b-a)+m=-3$ . Now, we make a guess and assume that $b-a+m=99$ (if we get a negative value for $m$ , we can try $b-a+m=-99$ ). From here we get that $b-a=-102$ . Solving for $m$ , we get that the answer is $\boxed{201}$


Answer: 20.0

Set $A$ has $20$ elements, and set $B$ has $15$ elements.  What is the smallest possible number of elements in $A \cup B$
$\textbf{(A)}5 \qquad\textbf{(B)}\ 15 \qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 35\qquad\textbf{(E)}\ 300$

Solution: $A \cup B$ will be smallest if $B$ is completely contained in $A$ , in which case all the elements in $B$ would be counted for in $A$ . So the total would be the number of elements in $A$ , which is $\boxed{20}$

Solution: Assume WLOG that $A={1, 2, 3, 4, \cdots , 20}$ , and $B={6, 7, 8, 9, 10, \cdots , 20}$ . Then, all the integers $6$ through $20$ would be redundant in $A \cup B$ , so $A \cup B = 1, 2, 3, 4, \cdots, 20 \implies \boxed{20}$


Answer: 10.0

Set $u_0 = \frac{1}{4}$ , and for $k \ge 0$ let $u_{k+1}$ be determined by the recurrence \[u_{k+1} = 2u_k - 2u_k^2.\]
This sequence tends to a limit; call it $L$ . What is the least value of $k$ such that \[|u_k-L| \le \frac{1}{2^{1000}}?\]
$\textbf{(A)}\: 10\qquad\textbf{(B)}\: 87\qquad\textbf{(C)}\: 123\qquad\textbf{(D)}\: 329\qquad\textbf{(E)}\: 401$

Solution:
Note that terms of the sequence $(u_k)$ lie in the interval $\left(0,\frac12\right),$ strictly increasing.
Since the sequence $(u_k)$ tends to the limit $L,$ we set $u_{k+1}=u_k=L>0.$
The given equation becomes \[L=2L-2L^2,\] from which $L=\frac12.$
The given inequality becomes \[\frac12-\frac{1}{2^{1000}} \leq u_k \leq \frac12+\frac{1}{2^{1000}},\] and we only need to consider $\frac12-\frac{1}{2^{1000}} \leq u_k.$
We have \begin{alignat*}{8} u_0 &= \phantom{1}\frac14 &&= \frac{2^1-1}{2^2}, \\ u_1 &= \phantom{1}\frac38 &&= \frac{2^2-1}{2^3}, \\ u_2 &= \ \frac{15}{32} &&= \frac{2^4-1}{2^5}, \\ u_3 &= \frac{255}{512} &&= \frac{2^8-1}{2^9}, \\ & \phantom{1111} \vdots \end{alignat*} By induction, it can be proven that \[u_k=\frac{2^{2^k}-1}{2^{2^k+1}}=\frac12-\frac{1}{2^{2^k+1}}.\] We substitute this into the inequality, then solve for $k:$ \begin{align*} \frac12-\frac{1}{2^{1000}} &\leq \frac12-\frac{1}{2^{2^k+1}} \\ -\frac{1}{2^{1000}} &\leq -\frac{1}{2^{2^k+1}} \\ 2^{1000} &\leq 2^{2^k+1} \\ 1000 &\leq 2^k+1. \end{align*} Therefore, the least such value of $k$ is $\boxed{10}.$

Solution:
If we list out the first few values of $k$ , we get the series $\frac{1}{4}, \frac{3}{8}, \frac{15}{32}, \frac{255}{512}$ , which always seems to be a negative power of $2$ away from $\frac{1}{2}$ . We can test this out by setting $u_k=\frac{1}{2}-\frac{1}{2^{n_k}}$ , where $n_0=2$
Now, we get \begin{align*} u_{k+1} &= 2\cdot\left(\frac{1}{2}-\frac{1}{2^{n_{k}}}\right)-2\cdot\left(\frac{1}{2}-\frac{1}{2^{n_{k}}}\right)^2 \\ &= 1-\frac{1}{2^{n_k - 1}}-2\cdot\left(\frac{1}{4}-\frac{1}{2^{n_k}}+\frac{1}{2^{2 \cdot n_k}}\right)\\ &= 1-\frac{1}{2^{n_k - 1}}-\frac{1}{2}+\frac{1}{2^{n_k-1}}-\frac{1}{2^{2 \cdot n_k-1}} \\ &= \frac{1}{2}-\frac{1}{2^{2 \cdot n_k-1}}. \end{align*} This means that this series approaches $\frac{1}{2}$ , as the second term is decreasing. In addition, we find that $n_{k+1}=2 \cdot n_k-1$
We claim that $n_k = 2^k+1$ , which can be proven by induction:
Base Case
We have $n_0=2=2^0+1$
Induction Step
Assuming that the claim is true, we have $n_{k+1}=2 \cdot (2^k+1)-1=2^{k+1}+1$
It follows that $n_{10}=2^{10}+1>1000$ and $n_9=2^9+1<1000$ . Therefore, the least value of $k$ would be $\boxed{10}$

Solution:
We are given $u_{k+1} = 2u_k - 2{u_k}^2$ . Multiply this equation by $2$ and subtract $1$ from both sides. The equations can then be written nicely as $2u_{k+1} - 1 = -(2u_k-1)^2$ . Let $v_k = 2u_k - 1$ so that $v_{k+1} = -(v_k)^2$
Clearly, $v_0 = 2u_0 - 1 = -\frac{1}{2}$ . Since the magnitude of $v_0$ is less than $1$ and because our recursive relation for $v_k$ squares the previous term (and negates it), we see that as $k \rightarrow \infty, 2u_k - 1 = v_k \rightarrow 0$ . This means $u_k \rightarrow \frac{1}{2}$ , so $L = \frac{1}{2}$
Isolating $u_k$ in our relation $2u_k - 1 = v_k$ gives us $u_k = \frac{v_k + 1}{2}$ .
Substituting into the inequality, we have $\left|\frac{v_k + 1}{2}-\frac{1}{2}\right| \le \frac{1}{2^{1000}}$ . Rewriting this, we get $|v_k| \le \frac{1}{2^{999}}$
The sequence $\{v_k\}$ is much easier to handle because of its simple recursive relation. Writing out a few terms shows that $|v_k| = \frac{1}{2^{2^k}}$ . Now it just comes down to having $2^k > 999$ , so $k = \boxed{10}$


Answer: 1504.0

Sets $A$ and $B$ , shown in the Venn diagram, have the same number of elements.
Their union has $2007$ elements and their intersection has $1001$ elements. Find
the number of elements in $A$
[asy] defaultpen(linewidth(0.7)); draw(Circle(origin, 5)); draw(Circle((5,0), 5)); label("$A$", (0,5), N); label("$B$", (5,5), N); label("$1001$", (2.5, -0.5), N);[/asy]
$\mathrm{(A)}\ 503 \qquad \mathrm{(B)}\ 1006 \qquad \mathrm{(C)}\ 1504 \qquad \mathrm{(D)}\ 1507 \qquad \mathrm{(E)}\ 1510$

Solution:
Let $x$ be the number of elements in $A$ and $B$ which is equal.
Then we could form equation $2x-1001 = 2007$
$2x = 3008$
$x = 1504$
The answer is $\boxed{1504}$

Solution: Let $x$ be the number of elements in $A$ not including the intersection. $2007-1001=1006$ total elements excluding the intersection. Since we know that $A=B$ , we can find that $x=\frac{1006}2=503$ . Now we need to add the intersection. $503+1001=\boxed{1504}$


Answer: 2.0

Seven cookies of radius $1$ inch are cut from a circle of cookie dough, as shown. Neighboring cookies are tangent, and all except the center cookie are tangent to the edge of the dough. The leftover scrap is reshaped to form another cookie of the same thickness. What is the radius in inches of the scrap cookie?
[asy] draw(circle((0,0),3)); draw(circle((0,0),1)); draw(circle((1,sqrt(3)),1)); draw(circle((-1,sqrt(3)),1));  draw(circle((-1,-sqrt(3)),1)); draw(circle((1,-sqrt(3)),1));  draw(circle((2,0),1)); draw(circle((-2,0),1)); [/asy]
$\textbf{(A) } \sqrt{2} \qquad \textbf{(B) } 1.5 \qquad \textbf{(C) } \sqrt{\pi} \qquad \textbf{(D) } \sqrt{2\pi} \qquad \textbf{(E) } \pi$

Solution: The big cookie has radius $3$ , since the center of the center cookie is the same as that of the large cookie.  The difference in areas of the big cookie and the seven small ones is $3^2\pi-7\pi=9\pi-7\pi=2 \pi$ .  The scrap cookie has this area, so its radius must be $\boxed{2}$


Answer: 658.0

Seven cubes, whose volumes are $1$ $8$ $27$ $64$ $125$ $216$ , and $343$ cubic units, are stacked vertically to form a tower in which the volumes of the cubes decrease from bottom to top. Except for the bottom cube, the bottom face of each cube lies completely on top of the cube below it. What is the total surface area of the tower (including the bottom) in square units?
$\textbf{(A)}\ 644\qquad\textbf{(B)}\ 658\qquad\textbf{(C)}\ 664\qquad\textbf{(D)}\ 720\qquad\textbf{(E)}\ 749$

Solution:
The volume of each cube follows the pattern of $n^3$ , for $n$ is between $1$ and $7$
We see that the total surface area can be comprised of three parts: the sides of the cubes, the tops of the cubes, and the bottom of the $7\times 7\times 7$ cube (which is just $7 \times 7 = 49$ ). The sides areas can be measured as the sum $4\sum_{n=1}^{7} n^2$ , giving us $560$ . Structurally, if we examine the tower from the top, we see that it really just forms a $7\times 7$ square of area $49$ . Therefore, we can say that the total surface area is $560 + 49 + 49 = \boxed{658}$ .
Alternatively, for the area of the tops, we could have found the sum $\sum_{n=2}^{7}((n)^{2}-(n-1)^{2})$ , giving us $49$ as well.

Solution:
It can quickly be seen that the side lengths of the cubes are the integers from 1 to 7 inclusive.
First, we will calculate the total surface area of the cubes, ignoring overlap. This value is $6 ( 1^2 + 2^2 + \cdots + 7^2 ) = 6\sum_{n=1}^{7} n^2 = 6 \left( \frac{7(7 + 1)(2 \cdot 7 + 1)}{6} \right) = 7 \cdot 8 \cdot 15 = 840$ . Then, we need to subtract out the overlapped parts of the cubes. Between each consecutive pair of cubes, one of the smaller cube's faces is completely covered, along with an equal area of one of the larger cube's faces. The total area of the overlapped parts of the cubes is thus equal to $2\sum_{n=1}^{6} n^2 = 182$ . Subtracting the overlapped surface area from the total surface area, we get $840 - 182 = \boxed{658}$ . ~ emerald_block

Solution:
It can be seen that the side lengths of the cubes using cube roots are all integers from $1$ to $7$ , inclusive.
Only the cubes with side length $1$ and $7$ have $5$ faces in the surface area and the rest have $4$ . Also, since the cubes are stacked, we have to find the difference between each $n^2$ and $(n-1)^2$ side length as $n$ ranges from $7$ to $2$
We then come up with this: $5(49)+13+4(36)+11+4(25)+9+4(16)+7+4(9)+5+4(4)+3+5(1)$
We then add all of this and get $\boxed{658}$

Solution:
Notice that the surface area of the top cube is $6s^2$ and the others are $4s^2$ . Then we can directly compute. The edge length for the first cube is $7$ and has a surface area of $294$ . The surface area of the next cube is $144$ . The surface area of the next cube $100$ . The surface area of the next cube is $64$ . The surface area of the next cube is $36$ . The surface area of the next cube is $16$ . The surface area of the next cube is $4$ . We then sum up $294+144+100+64+36+16+4$ to get $\boxed{658}$ .
~smartatmath

Solution:
First of all, compute the area of the sides, excluding the top and bottoms, of the cubes. The side lengths (cube root the volumes) are 1, 2, 3, 4, 5, 6, 7.
Each cube's area of the sides can be calculated with $4($ area of one side $)$ $4(l^2)$ so in total that is $4(1+4+16+...+49)$ so $4(140)=560$ the area of all the sides of the cubes is $560$ .
Then, calculate the bottom face of the largest cube, $7*7=49$ .
Now, notice that if you stack the cubes up on top of each other, and look directly down on them, the tops of the cubes showing add up to the area of the bottom cube, the 7x7. Therefore, the sum of the area of the tops of the cubes is $7*7=49$
Now add them all up: $49+49+560=658.$ Therefore, the answer is $\boxed{658}$


Answer: 658.0

Solution:
The volume of each cube follows the pattern of $n^3$ , for $n$ is between $1$ and $7$
We see that the total surface area can be comprised of three parts: the sides of the cubes, the tops of the cubes, and the bottom of the $7\times 7\times 7$ cube (which is just $7 \times 7 = 49$ ). The sides areas can be measured as the sum $4\sum_{n=1}^{7} n^2$ , giving us $560$ . Structurally, if we examine the tower from the top, we see that it really just forms a $7\times 7$ square of area $49$ . Therefore, we can say that the total surface area is $560 + 49 + 49 = \boxed{658}$ .
Alternatively, for the area of the tops, we could have found the sum $\sum_{n=2}^{7}((n)^{2}-(n-1)^{2})$ , giving us $49$ as well.

Solution:
It can quickly be seen that the side lengths of the cubes are the integers from 1 to 7 inclusive.
First, we will calculate the total surface area of the cubes, ignoring overlap. This value is $6 ( 1^2 + 2^2 + \cdots + 7^2 ) = 6\sum_{n=1}^{7} n^2 = 6 \left( \frac{7(7 + 1)(2 \cdot 7 + 1)}{6} \right) = 7 \cdot 8 \cdot 15 = 840$ . Then, we need to subtract out the overlapped parts of the cubes. Between each consecutive pair of cubes, one of the smaller cube's faces is completely covered, along with an equal area of one of the larger cube's faces. The total area of the overlapped parts of the cubes is thus equal to $2\sum_{n=1}^{6} n^2 = 182$ . Subtracting the overlapped surface area from the total surface area, we get $840 - 182 = \boxed{658}$ . ~ emerald_block

Solution:
It can be seen that the side lengths of the cubes using cube roots are all integers from $1$ to $7$ , inclusive.
Only the cubes with side length $1$ and $7$ have $5$ faces in the surface area and the rest have $4$ . Also, since the cubes are stacked, we have to find the difference between each $n^2$ and $(n-1)^2$ side length as $n$ ranges from $7$ to $2$
We then come up with this: $5(49)+13+4(36)+11+4(25)+9+4(16)+7+4(9)+5+4(4)+3+5(1)$
We then add all of this and get $\boxed{658}$

Solution:
Notice that the surface area of the top cube is $6s^2$ and the others are $4s^2$ . Then we can directly compute. The edge length for the first cube is $7$ and has a surface area of $294$ . The surface area of the next cube is $144$ . The surface area of the next cube $100$ . The surface area of the next cube is $64$ . The surface area of the next cube is $36$ . The surface area of the next cube is $16$ . The surface area of the next cube is $4$ . We then sum up $294+144+100+64+36+16+4$ to get $\boxed{658}$ .
~smartatmath

Solution:
First of all, compute the area of the sides, excluding the top and bottoms, of the cubes. The side lengths (cube root the volumes) are 1, 2, 3, 4, 5, 6, 7.
Each cube's area of the sides can be calculated with $4($ area of one side $)$ $4(l^2)$ so in total that is $4(1+4+16+...+49)$ so $4(140)=560$ the area of all the sides of the cubes is $560$ .
Then, calculate the bottom face of the largest cube, $7*7=49$ .
Now, notice that if you stack the cubes up on top of each other, and look directly down on them, the tops of the cubes showing add up to the area of the bottom cube, the 7x7. Therefore, the sum of the area of the tops of the cubes is $7*7=49$
Now add them all up: $49+49+560=658.$ Therefore, the answer is $\boxed{658}$


Answer: 1932.0

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

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

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

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


Answer: 365.0

Seven students count from 1 to 1000 as follows:
Alice says all the numbers, except she skips the middle number in each consecutive group of three numbers. That is, Alice says 1, 3, 4, 6, 7, 9, . . ., 997, 999, 1000.
Barbara says all of the numbers that Alice doesn't say, except she also skips the middle number in each consecutive group of three numbers.
Candice says all of the numbers that neither Alice nor Barbara says, except she also skips the middle number in each consecutive group of three numbers.
Debbie, Eliza, and Fatima say all of the numbers that none of the students with the first names beginning before theirs in the alphabet say, except each also skips the middle number in each of her consecutive groups of three numbers.
Finally, George says the only number that no one else says.
What number does George say?
$\textbf{(A)}\ 37\qquad\textbf{(B)}\ 242\qquad\textbf{(C)}\ 365\qquad\textbf{(D)}\ 728\qquad\textbf{(E)}\ 998$

Solution:
First look at the numbers Alice says. $1, 3, 4, 6, 7, 9 \cdots$ skipping every number that is congruent to $2 \pmod 3$ . Thus, Barbara says those numbers EXCEPT every second - being $2 + 3^1 \equiv 5 \pmod{3^2=9}$ . So Barbara skips every number congruent to $5 \pmod 9$ . We continue and see:
Alice skips $2 \pmod 3$ , Barbara skips $5 \pmod 9$ , Candice skips $14 \pmod {27}$ , Debbie skips $41 \pmod {81}$ , Eliza skips $122 \pmod {243}$ , and Fatima skips $365 \pmod {729}$
Since the only number congruent to $365 \pmod {729}$ and less than $1,000$ is $365$ , the correct answer is $\boxed{365}$

Solution:
After Alice says all her numbers, the numbers not mentioned yet are \[\text{Alice: } 2,5,8,11,14,17,\cdots,998.\] After Barbara says all her numbers, the numbers that haven't been said yet are \[\text{Barbara: } 5,14,23,32,41,50,\cdots,995.\] After Candice, the list is \[\text{Candice: } 14,41,68,\cdots,986.\] Notice how each list is an arithmetic sequence where the common differene is thrice the common ratio of the previous list and the first term is the second term of the previous list. Now that the pattern is clear, we construct the rest of the lists: \[\text{Debbie: } 41,122,203,\cdots,959\] \[\text{Eliza: } 122,365,608,878\] \[\text{Fatima: } 365\]
Thus, George says $\boxed{365}$

Solution:
Notice that Alice has skipped the numbers $3n-1$ for $n=1,2,3,...,333$ .
Namely, \[3\cdot1-1,3\cdot2-1,3\cdot3-1,...,3\cdot333-1\] Thus the numbers that Barbara skips are \[3\cdot2-1,3\cdot5-1,3\cdot8-1,...\] or in a more general expression, $3(3n-1)-1$ for $n=1,2,3,...$ .
Namely, \[3\cdot(3\cdot1-1)-1,3\cdot(3\cdot2-1)-1,3\cdot(3\cdot3-1)-1,...\] Repeating the pattern until George, we have the first number he says, \[3(3(3(3(3(3\cdot1-1)-1)-1)-1)-1)-1= \boxed{365}\] In addition, note that the second number George says exceeds $1000$

Solution: Similar to Solution 1 we find that the only number that George can say must leave a remainder of $2$ when divided by $3$ , and that it must also leave a remainder of $5$ when divided by $9$ . Since we as human beings are usually lazy, and that MAA provides answer choices, we check all the possible numbers and find that our answer is $\boxed{365}$

Solution: Every integer from 1 to 1000 can be written in the form $t_n+1$ in base 10, where $t_n$ is a trinary integer with no more than 7 significant digits. The important insight is that person $1\le{k}\le6$ will not say $n$ if and only if the $k$ th digit from the right of $t_n$ is 1. Therefore, the last 6 digits of $t_n$ must be 1, as the first 6 people never said the number. The only options for $t_n$ are thus $2111111$ $1111111$ , and $0111111$ . But, since George only said one number, the first two must have been too big for it to be $\le1000$ . Our answer is therefore $111111_3+1=\frac{3^6-1}{3-1}+1=364+1=\boxed{365}$


Answer: 831.0

Seven teams play a soccer tournament in which each team plays every other team exactly once. No ties occur, each team has a $50\%$ chance of winning each game it plays, and the outcomes of the games are independent. In each game, the winner is awarded a point and the loser gets 0 points. The total points are accumulated to decide the ranks of the teams. In the first game of the tournament, team $A$ beats team $B.$ The probability that team $A$ finishes with more points than team $B$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Solution:
The results of the five remaining games are independent of the first game, so by symmetry, the probability that $A$ scores higher than $B$ in these five games is equal to the probability that $B$ scores higher than $A$ . We let this probability be $p$ ; then the probability that $A$ and $B$ end with the same score in these five games is $1-2p$
Of these three cases ( $|A| > |B|, |A| < |B|, |A|=|B|$ ), the last is the easiest to calculate (see solution 2 for a way to directly calculate the other cases).
There are ${5\choose k}$ ways to $A$ to have $k$ victories, and ${5\choose k}$ ways for $B$ to have $k$ victories. Summing for all values of $k$
Thus $p = \frac 12 \left(1-\frac{126}{512}\right) = \frac{193}{512}$ . The desired probability is the sum of the cases when $|A| \ge |B|$ , so the answer is $\frac{126}{512} + \frac{193}{512} = \frac{319}{512}$ , and $m+n = \boxed{831}$

Solution:
You can break this into cases based on how many rounds $A$ wins out of the remaining $5$ games.
Summing these 6 cases, we get $\frac{638}{1024}$ , which simplifies to $\frac{319}{512}$ , so our answer is $319 + 512 = \boxed{831}$

Solution:
We can apply the concept of generating functions here.
The generating function for $B$ is $(1 + 0x^{1})$ for the first game where $x^{n}$ is winning n games. Since $B$ lost the first game, the coefficient for $x^{1}$ is 0. The generating function for the next 5 games is $(1 + x)^{5}$ . Thus, the total generating function for number of games he wins is
The generating function for $A$ is the same except that it is multiplied by $x$ instead of $(1+0x)$ .
Thus, the generating function for $A$ is
$1x + 5x^{2} + 10x^{3} + 10x^{4} + 5x^{5} + x^{6}$
The probability that $B$ wins 0 games is $\frac{1}{32}$ . Since the coefficients for all $x^{n}$ where
$n \geq 1$ sums to 32, the probability that $A$ wins more games is $\frac{32}{32}$
Thus, the probability that $A$ has more wins than $B$ is $\frac{1}{32} \times \frac{32}{32} + \frac{5}{32} \times \frac{31}{32} + \frac{10}{32} \times \frac{26}{32} + \frac{10}{32} \times \frac{16}{32} + \frac{5}{32} \times \frac{6}{32} +\frac{1}{32} \times \frac{1}{32} = \frac{638}{1024} = \frac{319}{512}$
Thus, $319 + 512 = \boxed{831}$

Solution:
After the first game, there are $10$ games we care about-- those involving $A$ or $B$ . There are $3$ cases of these $10$ games: $A$ wins more than $B$ $B$ wins more than $A$ , or $A$ and $B$ win the same number of games. Also, there are $2^{10} = 1024$ total outcomes. By symmetry, the first and second cases are equally likely, and the third case occurs $\binom{5}{0}^2+\binom{5}{1}^2+\binom{5}{2}^2+\binom{5}{3}^2+\binom{5}{4}^2+\binom{5}{5}^2 = \binom{10}{5} = 252$ times, by a special case of Vandermonde's Identity . There are therefore $\frac{1024-252}{2} = 386$ possibilities for each of the other two cases.
If $B$ has more wins than $A$ in its $5$ remaining games, then $A$ cannot beat $B$ overall. However, if $A$ has more wins or if $A$ and $B$ are tied, $A$ will beat $B$ overall. Therefore, out of the $1024$ possibilites, $386+252 = 638$ ways where $A$ wins, so the desired probability is $\frac{638}{1024} = \frac{319}{512}$ , and $m+n=\boxed{831}$


Answer: 2.0

Several figures can be made by attaching two equilateral triangles to the regular pentagon ABCDE in two of the five positions shown. How many non-congruent figures can be constructed in this way?
$\text {(A) } 1 \qquad \text {(B) } 2 \qquad \text {(C) } 3 \qquad \text {(D) } 4 \qquad \text {(E) } 5$

Solution: Place the first triangle. Now, we can place the second triangle either adjacent to the first, or with one side between them, for a total of $\boxed{2}$

Solution: Take ${5 \choose 2}$ to realize there are 10 ways to choose 2 different triangles. Then divide by 5 for each vertex of a pentagon to get $\boxed{2}$


Answer: 207.0

Several sets of prime numbers, such as $\{7,83,421,659\}$ use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?
$\text{(A) }193 \qquad \text{(B) }207 \qquad \text{(C) }225 \qquad \text{(D) }252 \qquad \text{(E) }447$

Solution:
Neither of the digits $4$ $6$ , and $8$ can be a units digit of a prime. Therefore the sum of the set is at least $40 + 60 + 80 + 1 + 2 + 3 + 5 + 7 + 9 = 207$
We can indeed create a set of primes with this sum, for example the following sets work: $\{ 41, 67, 89, 2, 3, 5 \}$ or $\{ 43, 61, 89, 2, 5, 7 \}$
Thus the answer is $207\implies \boxed{207}$


Answer: 13.0

Several students are competing in a series of three races.  A student earns $5$ points for winning a race, $3$ points for finishing second and $1$ point for finishing third.  There are no ties.  What is the smallest number of points that a student must earn in the three races to be guaranteed of earning more points than any other student?
$\text{(A)}\ 9 \qquad \text{(B)}\ 10 \qquad \text{(C)}\ 11 \qquad \text{(D)}\ 13 \qquad \text{(E)}\ 15$

Solution:
There are two ways for a student to get $11$ $5+5+1$ and $5+3+3$ .  Clearly if someone gets one of these combinations someone else could get the other, so we are not guaranteed the most points with $11$
There is only one way to get $13$ points: $5+5+3$ .  In this case, the largest score another person could get is $5+3+3=11$ , so having $13$ points guarantees having more points than any other person $\rightarrow \boxed{13}$

Solution:
If someone gets $11$ points, the possible combinations are $5,5,1$ and $5,3,3$ If he gets $5,3,3$ then someone else can be $5,3,3$ which would not guarantee victory.
If we have 13 points, the only way to make this is $5,5,3$ . There is no way to get any number of points higher than this, so the answer is $\boxed{13}$ .---stjwyl


Answer: 11.0

Several students are seated at a large circular table.  They pass around a bag containing $100$ pieces of candy.  Each person receives the bag, takes one piece of candy and then passes the bag to the next person.  If Chris takes the first and last piece of candy, then the number of students at the table could be
$\text{(A)}\ 10 \qquad \text{(B)}\ 11 \qquad \text{(C)}\ 19 \qquad \text{(D)}\ 20 \qquad \text{(E)}\ 25$

Solution: If this is the case, then if there were only $99$ pieces of candy, the bag would have gone around the table a whole number of times.  Thus, the number of students is a divisor of $99$ .  The only choice that satisfies this is choice $\boxed{11}$


Answer: 48.0

Shauna takes five tests, each worth a maximum of $100$ points. Her scores on the first three tests are $76$ $94$ , and $87$ . In order to average $81$ for all five tests, what is the lowest score she could earn on one of the other two tests?
$\textbf{(A) }48\qquad\textbf{(B) }52\qquad\textbf{(C) }66\qquad\textbf{(D) }70\qquad\textbf{(E) }74$

Solution: Right now, she scored $76, 94,$ and $87$ points, for a total of $257$ points. She wants her average to be $81$ for her $5$ tests, so she needs to score $405$ points in total. This means she needs to score a total of $405-257=  148$ points in her next $2$ tests. Since the maximum score she can get on one of her $2$ tests is $100$ , the least possible score she can get is $\boxed{48}$

Solution: We know that she scored $76, 94,$ and $87$ points on her first $3$ tests for a total of $257$ points and that she wants her average to be $81$ for her $5$ total tests. Therefore, she needs to score a total of $405$ points. In addition, one of the final $2$ tests needs to be the maximum of $100$ points, to make the final test score—the one that we are looking for—the lowest score possible for her to earn. We can now see here that the sum of $76+94+100$ has a units digit of $0$ and that the final test score must have a units digit ending with a $5$ . Now, $87$ needs to be added to a number that makes the sum divisible by $5$ . Among the answer choices of $48, 52, 66, 70,$ and $74$ , only $\boxed{48}$ has a units digit that works. ( $48+87=135$ , giving us a units digit of $5$ .)


Answer: 48.0

Solution: We should notice that we can turn the information we are given into a linear equation and just solve for our set variables. I'll use the variables $x$ and $y$ for the scores on the last two tests. \[\frac{76+94+87+x+y}{5} = 81,\] \[\frac{257+x+y}{5} = 81.\] We can now cross multiply to get rid of the denominator. \[257+x+y = 405,\] \[x+y = 148.\] Now that we have this equation, we will assign $y$ as the lowest score of the two other tests, and so: \[x = 100,\] \[y=48.\] Now we know that the lowest score on the two other tests is $\boxed{48}$

Solution:
We can compare each of the scores with the average of $81$ $76$ $\rightarrow$ $-5$ $94$ $\rightarrow$ $+13$ $87$ $\rightarrow$ $+6$ $100$ $\rightarrow$ $+19$
So the last one has to be $-33$ (since all the differences have to sum to $0$ ), which corresponds to $81-33 = \boxed{48}$


Answer: 18.0

Side $\overline{AB}$ of $\triangle ABC$ has length $10$ . The bisector of angle $A$ meets $\overline{BC}$ at $D$ , and $CD = 3$ . The set of all possible values of $AC$ is an open interval $(m,n)$ . What is $m+n$
$\textbf{(A) }16 \qquad \textbf{(B) }17 \qquad \textbf{(C) }18 \qquad \textbf{(D) }19 \qquad \textbf{(E) }20 \qquad$

Solution:
Let $AC=x.$ By Angle Bisector Theorem, we have $\frac{AB}{AC}=\frac{BD}{CD},$ from which $BD=CD\cdot\frac{AB}{AC}=\frac{30}{x}.$
Recall that $x>0.$ We apply the Triangle Inequality to $\triangle ABC:$
Taking the intersection of the solutions gives \[(m,n)=(0,\infty)\cap(0,15)\cap(3,\infty)=(3,15),\] so the answer is $m+n=\boxed{18}.$


Answer: 36.0

Sides $AB,BC,CD$ and $DA$ of convex polygon $ABCD$ have lengths 3, 4, 12, and 13, respectively, and $\angle CBA$ is a right angle. The area of the quadrilateral is
[asy] defaultpen(linewidth(0.7)+fontsize(10)); real r=degrees((12,5)), s=degrees((3,4)); pair D=origin, A=(13,0), C=D+12*dir(r), B=A+3*dir(180-(90-r+s)); draw(A--B--C--D--cycle); markscalefactor=0.05; draw(rightanglemark(A,B,C)); pair point=incenter(A,C,D); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$3$", A--B, dir(A--B)*dir(-90)); label("$4$", B--C, dir(B--C)*dir(-90)); label("$12$", C--D, dir(C--D)*dir(-90)); label("$13$", D--A, dir(D--A)*dir(-90));[/asy]
$\text{(A)} \ 32 \qquad \text{(B)} \ 36 \qquad \text{(C)} \ 39 \qquad \text{(D)} \ 42 \qquad \text{(E)} \ 48$

Solution: Connect C and A, and we have a 3-4-5 right triangle and 5-12-13 right triangle. The area of both is $\frac{3\cdot4}{2}+\frac{5\cdot12}{2}=36\Rightarrow\boxed{36}$


Answer: 25.0

Sides $AB,~ BC$ , and $CD$ of (simple*) quadrilateral $ABCD$ have lengths $4,~ 5$ , and $20$ , respectively.
If vertex angles $B$ and $C$ are obtuse and $\sin C = - \cos B =\frac{3}{5}$ , then side $AD$ has length
$\textbf{(A) }24\qquad \textbf{(B) }24.5\qquad \textbf{(C) }24.6\qquad \textbf{(D) }24.8\qquad \textbf{(E) }25$

Solution:
We know that $\sin(C)=-\cos(B)=\frac{3}{5}$ . Since $B$ and $C$ are obtuse, we have $\sin(180-C)=\cos(180-B)=\frac{3}{5}$ . It is known that $\sin(x)=\cos(90-x)$ , so $180-C=90-(180-C)=180-B$ . We simplify this as follows:
\[-90+C=180-B\]
\[B+C=270^{\circ}\]
Since $B+C=270^{\circ}$ , we know that $A+D=360-(B+C)=90^{\circ}$ . Now extend $AB$ and $CD$ as follows:

Let $AB$ and $CD$ intersect at $E$ . We know that $\angle AED=90^{\circ}$ because $\angle E = 180 - (A+D)=180-90 = 90^{\circ}$
Since $\sin BCD = \frac{3}{5}$ , we get $\sin ECB=\sin(180-BCD)=\sin BCD = \frac{3}{5}$ . Thus, $EB=3$ and $EC=4$ from simple sin application.
$AD$ is the hypotenuse of right $\triangle AED$ , with leg lengths $AB+BE=7$ and $EC+CD=24$ . Thus, $AD=\boxed{25}$


Answer: 23.0

Six bags of marbles contain $18, 19, 21, 23, 25$ and $34$ marbles, respectively. One bag contains chipped marbles only. The other $5$ bags contain no chipped marbles. Jane takes three of the bags and George takes two of the others. Only the bag of chipped marbles remains. If Jane gets twice as many marbles as George, how many chipped marbles are there?
$\mathrm{(A)\ } 18 \qquad \mathrm{(B) \ }19 \qquad \mathrm{(C) \  } 21 \qquad \mathrm{(D) \  } 23 \qquad \mathrm{(E) \  }25$

Solution:
Let George's bags contain a total of $x$ marbles, so Jane's bag contains $2x$ marbles. This means the total number of non-chipped marbles is $3x \equiv 0 \pmod{3}$ , while the total number of marbles is $18+19+21+23+25+34 = 140 \equiv 2 \pmod{3}$ , so the number of chipped marbles must also be congruent to $2-0 \equiv 2 \pmod{3}$
The answer choices are congruent modulo 3 to $0$ $1$ $0$ $2$ , and $1$ respectively, so the only possible number of chipped marbles among these is $23$ . Indeed, if Jane takes the bags containing $19$ $25$ , and $34$ marbles and George takes the remaining bags containing $18$ and $21$ marbles, then Jane will have a total of $19+25+34 = 78$ marbles, which is twice as many as George's $18+21 = 39$ marbles, as desired. Thus the answer is precisely $\boxed{23}$


Answer: 52.0

Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order.

Solution:
Realize that any sequence that works (ascending) can be reversed for descending, so we can just take the amount of sequences that satisfy the ascending condition and multiply by two.
If we choose any of the numbers $1$ through $6$ , there are five other spots to put them, so we get $6 \cdot 5 = 30$ . However, we overcount some cases. Take the example of $132456$ . We overcount this case because we can remove the $3$ or the $2$ . Therefore, any cases with two adjacent numbers swapped is overcounted, so we subtract $5$ cases (namely, $213456, 132456, 124356, 123546, 123465$ ,) to get $30-5=25$ , but we have to add back one more for the original case, $123456$ . Therefore, there are $26$ cases. Multiplying by $2$ gives the desired answer, $\boxed{052}$

Solution:
Similar to above, a $1-1$ correspondence between ascending and descending is established by subtracting each number from $7$
We note that the given condition is equivalent to "cycling" $123456$ for a contiguous subset of it. For example,
$12(345)6 \rightarrow 125346, 124536$
It's not hard to see that no overcount is possible, and that the cycle is either $1$ "right" or $1$ "left." Therefore, we consider how many elements we flip by. If we flip $1$ or $2$ such elements, then there is one way to cycle them. Otherwise, we have $2$ ways. Therefore, the total number of ascending is $1 + 5 + 2(4 + 3 + 2 + 1) = 26$ , and multiplying by two gives $\boxed{052}.$

Solution:
Similarly to above, we find the number of ascending arrangements and multiply by 2.
We can choose $5$ cards to be the ascending cards, therefore leaving $6$ places to place the remaining card. There are $\binom{6}{5}\cdot 6=36$ to do this. However, since the problem is asking for the number of arrangements, we overcount cases such as $123456$ . Notice that the only arrangements that overcount are $123456$ (case 1) or if two adjacent numbers of $123456$ are switched (case 2).
$\text{Case 1: }$ This arrangement is counted $6$ times. Each time it is counted for any of the $5$ numbers selected. Therefore we need to subtract $5$ cases of overcounting.
$\text{Case 2: }$ Each time $2$ adjacent numbers of switched, there is one overcount. For example, if we have $213456$ , both $1$ or $2$ could be removed. Since there are $5$ possible switches, we need to subtract $5$ cases of overcounting.
Therefore, we have $36-5-5=26$ total arrangements of ascending numbers. We multiply by two (for descending) to get the answer of $\boxed{052}.$

Solution:
Like in previous solutions, we will count the number of ascending arrangements and multiply by 2.
First, consider the arrangement 1-2-3-4-5-6. That gives us 1 arrangement which works.
Next, we can switch two adjacent cards. There are 5 ways to pick two adjacent cards, so this gives us 5 arrangements.
Now, we can "cycle" 3 adjacent cards. For example, 1-2-3 becomes 2-3-1 which becomes 3-1-2. There are 4 ways to pick a set of 3 adjacent cards, so this gives us 4x2=8 arrangements.
Cycling 4 adjacent cards, we get the new arrangements 2-3-4-1 (which works), 3-4-1-2 (which doesn't work), and 4-1-2-3 (which does work). We get 6 arrangements.
Similarly, when cycling 5 cards, we find 2x2=4 arrangements, and when cycling 6 cards, we find 2x1=2 arrangements.
Adding, we figure out that there are 1+5+8+6+4+2=26 ascending arrangements. Multiplying by 2, we get the answer $\boxed{052}.$

Solution: First count the number of permutations of the cards such that if one card is removed, the remaining cards will be in ascending order. There is $1$ such permutation where all the cards appear in order: $123456.$ There are $5$ such permutations where two adjacent cards are interchanged, as in $124356.$ The other such permutations arise from removing one card from $123456$ and placing it in a position at least two away from its starting location. There are $4$ such positions to place each of the cards numbered $1$ and $6,$ and $3$ such positions for each of the cards numbered $2, 3, 4,$ and $5.$ This accounts for $2\cdot4 + 4\cdot3 =20$ permutations. Thus there are $1 + 5 + 20 = 26$ permutations where one card can be removed so that the remaining cards are in ascending order. There is an equal number of permutations that result in the cards' being in descending order. This gives the total $26 + 26 = \boxed{52}$

Solution: More generally, suppose there are $n \geq 4$ cards numbered $1, 2, 3, \dots, n$ arranged in ascending order. If any one of the $n$ cards is removed and placed in one of the $n$ positions in the arrangement, the resulting permutation will have the property that one card can be removed so that the remaining cards are in ascending order. This accounts for $n\cdot n = n^2$ permutations. However, the original ascending order has been counted $n$ times, and each order that arises by switching two neighboring cards has been counted twice. Hence the number of arrangements where one card can be removed resulting in the remaining cards' being in ascending order is $n^2-(n-1)-(n-1)=(n-1)^2+1.$ When $n = 6$ , this is $(6-1)^2+1 = 26$ , and the final answer is $2\cdot26 = \boxed{52}$

Solution: For ascending, if the $1$ goes in anything but the first two slots, the rest of the numbers have to go in ascending from $2$ , which are $4$ cases if there are $6$ cards. If $1$ goes in the second spot, then you can put any of the rest in the first slot but then the rest are determined, so in the case of $6$ cards, that gives $5$ more. If $1$ goes in the first slot, that means that you are doing the same problem with $n-1$ cards. So the recursion is $a_n=(n-2)+(n-1)+a_{n-1}$ . There's $a_1=1$ and $a_2=2$ , so you get $a_3=2+3=5$ $a_4=5+5=10$ $a_5=7+10=17$ , and $a_6=9+17=26$ . Or you can see that $a_n=(n-1)^2+1$ . We double to account for descending and get $\boxed{052}$

Solution:
First, we know that ascending order and descending order are symmetrical to each other (namely, if we get 132456 where after we take out 3, it will be one scenario; and if we flip it and write 654231, it will be another scenario)
Thus, we only need to consider either descending or ascending and then times 2.
WLOG let us consider ascending order
Case 1: after we take out 1, the rest will be in ascending order:
Notice that 1 can be tucked in any one of the 6 spaces, thus there are 6 scenarios.
Case 2: after we take out 2, the rest will be in ascending order:
Notice that if we put 2 next to 1 (to the right or to the left of 1), it will be an overcount, so there are only 4 cases for 2.
It is easy to see that this is the same for 3, 4, 5, and 6.
Thus, in total, we have \[(6+4\times5)\times2=\boxed{052}\] ~Adali

Solution:
We start with five cards in ascending order, then insert the sixth card to obtain a valid arrangement.
Based on the card to be inserted, we have six cases. As shown below, the red squares indicate the possible positions to insert the sixth card.  Note that all arrangements of the six cards are distinct.
There are $26$ arrangements in which removing one card will leave the remaining five cards in ascending order. By symmetry, there are $26$ arrangements in which removing one card will leave the remaining five cards in descending order. So, the answer is $26\cdot2=\boxed{052}.$

Solution:
We first realize that as long as we have an ascending sequence of $5$ numbers, we can just plug in a $6$ th to make a sequence that works. For example, if we have $12345$ , we can plug in a $6$ in any of $6$ spaces, before $1$ , between $1$ and $2$ , and so on to after $5$ . We can also realize that this is completely symmetrical if the sequence is in descending order. For example, we could have $54321$ , and we could plug in a 6 in 6 of the spaces. For the total number of combinations, we have 6 ascending cases multiplied by the $6$ places that can hold whatever number is missing, and multiply by 2 because there is descending and ascending number cases.
But wait, what if we have $12345$ and plug in a $6$ at the end and $12346$ and plug in a $5$ at the $5$ th spot? We have overcounted, so we need to subtract off the identical pairs. Assume that one of them is the "right" combination. That means that there are $1$ "right" combination because all the rest will have $2$ of their combinations taken by the previous one. For example, if I have $12356$ and $12346$ , I would count those $123456$ as $12356$ 's instead of $12346$ 's. Therefore, we have $6+4+4+4+4+4 = 26$ combinations of ascending order, and since we need to count those of descending order as well, we have $26\cdot2=\boxed{052}.$

Solution: Like the previous solutions, we calculate ascending possibilities then multiply by two. Then, the configuration can look like +++++ or +-+++ (the minus can go anywhere), where "+" indicates an increase, and "-" indicates a decrease. Obviously, for the first case, the only possibility is 123456. For the second case, we can start with 123456, and then take either a card after the "-" and put it before the "-", or we could take a card before the "-" and put it after the "-". This means that every card other than the one at the position of the "-" can be used in one way. There are five ways to have 4 plus's, and one minus, and for each way, there are 5 ways to rearrange 123456 to achieve that. So, our answer is $2(5\cdot5+1)=\boxed{052}$

Solution: First, we select $5$ of the $6$ cards to put in ascending or descending order. Then, we must add the other card to the group to arrange the six cards such that one can be removed so that the remaining cards are in ascending or descending order. Then, it would seem that the answer is $(6C5)*2$ (ascending or descending)* $6$ (the number of ways to place the last card). However, this overcounts some cases. For example, 123456 and 654321 can be made with 12345 and 6, 12346 and 5, etc. Furthermore, 654312 can be made with 65432 and 1 or 65431 and 2. Therefore, we first find that $(6C5)*2*4$ $48$ . Then, we add the special cases ( $123456$ $654321$ $654312$ $123465$ ) to obtain $\boxed{052}$


Answer: 20.0

Six chairs are evenly spaced around a circular table. One person is seated in each chair. Each person gets up and sits down in a chair that is not the same and is not adjacent to the chair he or she originally occupied, so that again one person is seated in each chair. In how many ways can this be done?
$\textbf{(A)}\; 14 \qquad\textbf{(B)}\; 16 \qquad\textbf{(C)}\; 18 \qquad\textbf{(D)}\; 20 \qquad\textbf{(E)}\; 24$

Solution:
Consider shifting every person over three seats left after each person has gotten up and sat back down again. Now, instead of each person being seated not in the same chair and not in an adjacent chair, each person will be seated either in the same chair or an adjacent chair. The problem now becomes the number of ways in which six people can sit down in a chair that is either the same chair or an adjacent chair in a circle.
Consider the similar problem of $n$ people sitting in a chair that is either the same chair or an adjacent chair in a row. Call the number of possibilities for this $F_n$ . Then if the leftmost person stays put, the problem is reduced to a row of $n-1$ chairs, and if the leftmost person shifts one seat to the right, the new person sitting in the leftmost seat must be the person originally second from the left, reducing the problem to a row of $n-2$ chairs. Thus, $F_n = F_{n-1} + F_{n-2}$ for $n \geq 3$ . Clearly $F_1 = 1$ and $F_2 = 2$ , so $F_3 = 3$ $F_4 = 5$ , and $F_5 = 8$
Now consider the six people in a circle and focus on one person. If that person stays put, the problem is reduced to a row of five chairs, for which there are $F_5 = 8$ possibilities. If that person moves one seat to the left, then the person who replaces him in his original seat will either be the person originally to the right of him, which will force everyone to simply shift over one seat to the left, or the person originally to the left of him, which reduces the problem to a row of four chairs, for which there are $F_4 = 5$ possibilities, giving $1 + 5 = 6$ possibilities in all. By symmetry, if that person moves one seat to the right, there are another $6$ possibilities, so we have a total of $8+6+6 = \boxed{20}$ possibilities.

Solution:
Label the people sitting at the table $A, B, C, D, E, F,$ and assume that they are initially seated in the order $ABCDEF$ . The possible new positions for $A, B, C, D, E,$ and $F$ are respectively (a dash indicates a non-allowed position):
\[\begin{tabular}{| c | c | c | c | c | c |} \hline - & - & A & A & A & - \\ \hline - & - & - & B & B & B \\ \hline C & - & - & - & C & C \\ \hline D & D & - & - & - & D \\ \hline E & E & E & - & - & - \\ \hline - & F & F & F & - & - \\ \hline \end{tabular}\]
The permutations we are looking for should use one letter from each column, and there should not be any repeated letters:
$\begin{tabular}{c} CDEFAB \\ CEAFBD \\ CEFABD \\ CEFBAD \\ CFEABD \\ CFEBAD \\ DEAFBC \\ DEAFCB \\ DEFABC \\ DEFACB \\ DEFBAC \\ DFEABC \\ DFEACB \\ DFEBAC \\ EDAFBC \\ EDAFCB \\ EDFABC \\ EDFACB \\ EDFBAC \\ EFABCD \end{tabular}$
There are $\boxed{20}$ such permutations.

Solution:
We can represent each rearrangement as a permutation of the six elements $\{1,2,3,4,5,6\}$ in cycle notation. Note that any such permutation cannot have a 1-cycle, so the only possible types of permutations are 2,2,2-cycles, 4,2-cycles, 3,3-cycles, and 6-cycles. We deal with each case separately.
For 2,2,2-cycles, suppose that one of the 2-cycles switches the people across from each other, i.e. $(14)$ $(25)$ , or $(36)$ . WLOG, we may assume it to be $(14)$ . Then we could either have both of the other 2-cycles be across from each other, giving the permutation $(14)(25)(36)$ or else neither of the other 2-cycles is across from each other, in which case the only possible permutation is $(14)(26)(35)$ . This can happen for $(25)$ and $(36)$ as well. So since the first permutation is not counted twice, we find a total of $1+3=4$ permutations that are 2,2,2-cycles where at least one of the 2-cycles switches people diametrically opposite from each other. Otherwise, since the elements in a 2-cycle cannot differ by 1, 3, or 5 mod 6, they must differ by 2 or 4 mod 6, i.e. they must be of the same parity. But since we have three odd and three even elements, this is impossible. Hence there are exactly 4 such permutations that are 2,2,2-cycles.
For 4,2-cycles, we assume for the moment that 1 is part of the 2-cycle. Then the 2-cycle can be $(13)$ $(15)$ , or $(14)$ . The first two are essentially the same by symmetry, and we must arrange the elements 2, 4, 5, 6 into a 4-cycle. However, 5 must have two neighbors that are not next to it, which is impossible, hence the first two cases yield no permutations. If the 2-cycle is $(14)$ , then we must arrange the elements 2, 3, 5, 6 into a 4-cycle. Then 2 must have the neighbors 5 and 6. We find that the 4-cycles $(2536)$ and $(2635)$ satisfy the desired properties, yielding the permutations $(14)(2536)$ and $(14)(2635)$ . This can be done for the 2-cycles $(25)$ and $(36)$ as well, so we find a total of 6 such permutations that are 4,2-cycles.
For 3,3-cycles, note that if 1 neighbor 4, then the third element in the cycle will neighbor one of 1 and 4, so this is impossible. Therefore, the 3-cycle containing 1 must consist of elements 1, 3, and 5. Therefore, we obtain the four 3,3-cycles $(135)(246)$ $(153)(246)$ $(135)(264)$ , and $(153)(264)$
For 6-cycles, note that the neighbors of 1 can be 3 and 4, 3 and 5, or 4 and 5. In the first case, we may assume that it looks like $(314\dots)$ -- the form $(413\dots)$ is also possible but equivalent to this case. Then we must place the elements 2, 5, and 6. Note that 5 and 6 cannot go together, so 2 must go in between them. Also, 5 cannot neighbor 4, so we are left with one possibility, namely $(314625)$ , which has an analogous possibility $(413526)$ . In the second case, we assume that it looks like $(315\dots)$ . The 2 must go next to the 5, and the 6 must go last (to neighbor the 3), so the only possibility here is $(315246)$ , with the analogous possibility $(513642)$ . In the final case, we may assume that it looks like $(415\dots)$ . Then the 2 and 3 cannot go together, so the 6 must go in between them. Therefore, the only possibility is $(415362)$ , with the analogous possibility $(514263)$ . We have covered all possibilities for 6-cycles, and we have found 6 of them.
Therefore, there are $4+6+4+6 = \boxed{20}$ such permutations.


Answer: 942.0

Six congruent circles form a ring with each circle externally tangent to two circles adjacent to it. All circles are internally tangent to a circle $C$ with radius 30. Let $K$ be the area of the region inside circle $C$ and outside of the six circles in the ring. Find $\lfloor K \rfloor$ (the floor function ).
2005 AIME I Problem 1.png

Solution: Define the radii of the six congruent circles as $r$ . If we draw all of the radii to the points of external tangency, we get a regular hexagon . If we connect the vertices of the hexagon to the center of the circle $C$ , we form several equilateral triangles . The length of each side of the triangle is $2r$ . Notice that the radius of circle $C$ is equal to the length of the side of the triangle plus $r$ . Thus, the radius of $C$ has a length of $3r = 30$ , and so $r = 10$ $K = 30^2\pi - 6(10^2\pi) = 300\pi$ , so $\lfloor 300\pi \rfloor = \boxed{942}$


Answer: 26.0

Solution: Count the number of sides that are not exposed, where a cube is connected to another cube and subtract it from the total number of faces. There are $5$ places with two adjacent cubes, covering $10$ sides, and $(6)(6)=36$ faces. The exposed surface area is $36-10 = \boxed{26}$

Solution: We can count the number of showing faces from each side. One thing that we notice is that the front face has the same number of squares as the back face, the side faces have the same surface area, etc. Therefore, we are looking for $2($ front surface area $+$ side surface area $+$ top surface area $)$ . We find that this is $2(5 + 4 + 4) = 2 * 13 = \boxed{26}$


Answer: 29.0

Six different digits from the set \[\{ 1,2,3,4,5,6,7,8,9\}\] are placed in the squares in the figure shown so that the sum of the entries in the vertical column is 23 and the sum of the entries in the horizontal row is 12.
The sum of the six digits used is
[asy] unitsize(18); draw((0,0)--(1,0)--(1,1)--(4,1)--(4,2)--(1,2)--(1,3)--(0,3)--cycle); draw((0,1)--(1,1)--(1,2)--(0,2)); draw((2,1)--(2,2)); draw((3,1)--(3,2)); label("$23$",(0.5,0),S); label("$12$",(4,1.5),E); [/asy]
$\text{(A)}\ 27 \qquad \text{(B)}\ 29 \qquad \text{(C)}\ 31 \qquad \text{(D)}\ 33 \qquad \text{(E)}\ 35$

Solution:
Looking at the vertical column, the three numbers sum to $23$ .  If we make the numbers on either end $9$ and $8$ in some order, the middle number will be $6$ .  This is the minimum for the intersection.
Looking at the horizontal row, the four numbers sum to $12$ .  If we minimize the three numbers on the right to $123$ , the first number has a maximum value of $6$ .  This is the maximum for the intersection
Thus, the minimum of the intersection is $6$ , and the maximum of the intersection is $6$ .  This means the intersection must be $6$ , and the other numbers must be $9$ and $8$ in the column, and $123$ in the row.  The sum of all the numbers is $12 + 23 - 6 = 29$ , and the answer is $\boxed{29}$


Answer: 1.0

Six distinct positive integers are randomly chosen between $1$ and $2006$ , inclusive. What is the probability that some pair of these integers has a difference that is a multiple of $5$
$\textbf{(A) } \frac{1}{2}\qquad\textbf{(B) } \frac{3}{5}\qquad\textbf{(C) } \frac{2}{3}\qquad\textbf{(D) } \frac{4}{5}\qquad\textbf{(E) } 1\qquad$

Solution:
For two numbers to have a difference that is a multiple of $5$ , the numbers must be congruent $\bmod{5}$ (their remainders after division by $5$ must be the same).
$0, 1, 2, 3, 4$ are the possible values of numbers in $\bmod{5}$ . Since there are only $5$ possible values in $\bmod{5}$ and we are picking $6$ numbers, by the Pigeonhole Principle , two of the numbers must be congruent $\bmod{5}$
Therefore the probability that some pair of the $6$ integers has a difference that is a multiple of $5$ is $\boxed{1}$


Answer: 594.0

Six men and some number of women stand in a line in random order. Let $p$ be the probability that a group of at least four men stand together in the line, given that every man stands next to at least one other man. Find the least number of women in the line such that $p$ does not exceed 1 percent.

Solution:
Let $n$ be the number of women present, and let _ be some positive number of women between groups of men.  Since the problem states that every man stands next to another man, there cannot be isolated men.  Thus, there are five cases to consider, where $(k)$ refers to a consecutive group of $k$ men:
For the first case, we can place the three groups of men in between women.  We can think of the groups of men as dividers splitting up the $n$ women.  Since there are $n+1$ possible places to insert the dividers, and we need to choose any three of these locations, we have $\dbinom{n+1}{3}$ ways.
The second, third, and fourth cases are like the first, only that we need to insert two dividers among the $n+1$ possible locations.  Each gives us $\dbinom{n+1}{2}$ ways, for a total of $3\dbinom{n+1}{2}$ ways.
The last case gives us $\dbinom{n+1}{1}=n+1$ ways.
Therefore, the total number of possible ways where there are no isolated men is
\[\dbinom{n+1}{3}+3\dbinom{n+1}{2}+(n+1).\]
The total number of ways where there is a group of at least four men together is the sum of the third, fourth, and fifth case, or
\[2\dbinom{n+1}{2}+(n+1).\]
Thus, we want to find the minimum possible value of $n$ where $n$ is a positive integer such that
\[\dfrac{2\dbinom{n+1}{2}+(n+1)}{\dbinom{n+1}{3}+3\dbinom{n+1}{2}+(n+1)}\le\dfrac{1}{100}.\]
After simplification, we arrive at \[\dfrac{6(n+1)}{n^2+8n+6}\le\dfrac{1}{100}.\]
Simplifying again, we see that we seek the smallest positive integer value of $n$ such that $n(n-592)\ge594$ . Clearly $n>592$ , or the left side will not even be positive; we quickly see that $n=593$ is too small but $n=\boxed{594}$ satisfies the inequality.


Answer: 8.0

Six numbers from a list of nine integers are $7,8,3,5,9$ and $5$ . The largest possible value of the median of all nine numbers in this list is
$\text{(A)}\ 5\qquad\text{(B)}\ 6\qquad\text{(C)}\ 7\qquad\text{(D)}\ 8\qquad\text{(E)}\ 9$

Solution:
First, put the six numbers we have in order, since we are concerned with the median: $3, 5, 5, 7, 8, 9$
We have three more numbers to insert into the list, and the median will be the $5^{th}$ highest (and $5^{th}$ lowest) number on the list.  If we top-load the list by making all three of the numbers greater than $9$ , the median will be the highest it can possibly be.  Thus, the maximum median is the fifth piece of data in the list, which is $8$ , giving an answer of $\boxed{8}$


Answer: 23.0

Six pepperoni circles will exactly fit across the diameter of a $12$ -inch pizza when placed. If a total of $24$ circles of pepperoni are placed on this pizza without overlap, what fraction of the pizza is covered by pepperoni?
$\textbf{(A)}\ \frac 12 \qquad\textbf{(B)}\ \frac 23 \qquad\textbf{(C)}\ \frac 34 \qquad\textbf{(D)}\ \frac 56 \qquad\textbf{(E)}\ \frac 78$

Solution: The pepperoni circles' diameter is $2$ , since $\dfrac{12}{6} = 2$ . From that we see that the area of the $24$ circles of pepperoni is $\left ( \frac{2}{2} \right )^2 (24\pi) = 24\pi$ . The large pizza's area is $6^2\pi$ . Therefore, the ratio is $\frac{24\pi}{36\pi} = \boxed{23}$


Answer: 182.0

Six rectangles each with a common base width of $2$ have lengths of $1, 4, 9, 16, 25$ , and $36$ . What is the sum of the areas of the six rectangles?
$\textbf{(A) }91\qquad\textbf{(B) }93\qquad\textbf{(C) }162\qquad\textbf{(D) }182\qquad \textbf{(E) }202$

Solution: The sum of the areas is equal to $2\cdot1+2\cdot4+2\cdot9+2\cdot16+2\cdot25+2\cdot36$ . This is equal to $2(1+4+9+16+25+36)$ , which is equal to $2\cdot91$ . This is equal to our final answer of $\boxed{182}$


Answer: 32.0

Six spheres of radius $1$ are positioned so that their centers are at the vertices of a regular hexagon of side length $2$ . The six spheres are internally tangent to a larger sphere whose center is the center of the hexagon. An eighth sphere is externally tangent to the six smaller spheres and internally tangent to the larger sphere. What is the radius of this eighth sphere?
$\textbf{(A)} \ \sqrt{2} \qquad \textbf{(B)} \ \frac{3}{2} \qquad \textbf{(C)} \ \frac{5}{3} \qquad \textbf{(D)} \ \sqrt{3} \qquad \textbf{(E)} \ 2$

Solution: It can be seen that the diameter of the eighth sphere is equal to the radius of the seventh sphere by drawing out a diagram of the insides of the seventh sphere. The radius of the seventh sphere is $2+1=3$ , the radius of the eight sphere is $\boxed{32}$


Answer: 22.0

Six straight lines are drawn in a plane with no two parallel and no three concurrent. The number of regions into which they divide the plane is:
$\textbf{(A)}\ 16 \qquad \textbf{(B)}\ 20\qquad \textbf{(C)}\ 22 \qquad \textbf{(D)}\ 24 \qquad \textbf{(E)}\ 26$

Solution:
The first line divides the plane into two regions.  The second line intersects one line, creating two regions.  The third line intersects two lines, creating three regions.  Similarly, the fourth line intersects three lines and creates four regions, the fifth line intersects four lines and creates five regions, and the sixth line intersects five lines and creates six regions.
Totaling the regions created results in $2 + 2 + 3 + 4 + 5 + 6 = 22$ regions, which is answer choice $\boxed{22}$

Solution:
1963 AHSME Problem 27.png
With careful drawing, one can draw all six lines and count the regions.  There are $22$ regions in total, which is answer choice $\boxed{22}$


Answer: 22.0

Solution: We can use the fact that the number of regions that $n$ lines divide a plane is given by the equation $L_n = \frac{n^2 + n +2}{2}$ , and in this problems, $n=6$ , from which the answer is $\boxed{22}$


Answer: 100.0

Six trees are equally spaced along one side of a straight road. The distance from the first tree to the fourth is 60 feet. What is the distance in feet between the first and last trees?
$\text{(A)}\ 90 \qquad \text{(B)}\ 100 \qquad \text{(C)}\ 105 \qquad \text{(D)}\ 120 \qquad \text{(E)}\ 140$

Solution: There are $3$ spaces between the 1st and 4th trees, so each of these spaces has $\frac{60}{3}=20$ feet. Between the first and last trees there are $5$ spaces, so the distance between them is $20\times5=100$ feet, $\boxed{100}$


Answer: 22.5

Small lights are hung on a string $6$ inches apart in the order red, red, green, green, green, red, red, green, green, green, and so on continuing this pattern of $2$ red lights followed by $3$ green lights. How many feet separate the 3rd red light and the 21st red light?
Note: $1$ foot is equal to $12$ inches.
$\textbf{(A)}\ 18\qquad\textbf{(B)}\ 18.5\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 20.5\qquad\textbf{(E)}\ 22.5$

Solution: We know the repeating section is made of $2$ red lights and $3$ green lights. The 3rd red light would appear in the 2nd section of this pattern, and the 21st red light would appear in the 11th section. There would then be a total of $44$ lights in between the 3rd and 21st red light, translating to $45$ $6$ -inch gaps. Since the question asks for the answer in feet, the answer is $\frac{45*6}{12} \rightarrow \boxed{22.5}$


Answer: 5.0

Soda is sold in packs of 6, 12 and 24 cans. What is the minimum number of packs needed to buy exactly 90 cans of soda?
$\textbf{(A)}\ 4\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 15$

Solution: Start by buying the largest packs first. After three $24$ -packs, $90-3(24)=18$ cans are left. After one $12$ -pack, $18-12=6$ cans are left. Then buy one more $6$ -pack. The total number of packs is $3+1+1=\boxed{5}$


Answer: 8.0

Some boys and girls are having a car wash to raise money for a class trip to China. Initially $40\%$ of the group are girls. Shortly thereafter two girls leave and two boys arrive, and then $30\%$ of the group are girls. How many girls were initially in the group?
$\textbf{(A) } 4 \qquad\textbf{(B) } 6 \qquad\textbf{(C) } 8 \qquad\textbf{(D) } 10 \qquad\textbf{(E) } 12$

Solution: If we let $p$ be the number of people initially in the group, then $0.4p$ is the number of girls. If two girls leave and two boys arrive, the number of people in the group is still $p$ , but the number of girls is $0.4p-2$ . Since only $30\%$ of the group are girls, \begin{align*} \frac{0.4p-2}{p}&=\frac{3}{10}\\ 4p-20&=3p\\ p&=20\end{align*} The number of girls initially in the group is $0.4p=0.4(20)=\boxed{8}$

Solution: Let $x$ be the number of people initially in the group and $g$ the number of girls. $\frac{2}{5}x = g$ , so $x = \frac{5}{2}g$ . Also, the problem states $\frac{3}{10}x = g-2$ . Substituting $x$ in terms of $g$ into the second equation yields that $g = \boxed{8}$


Answer: 8.0

Solution: If we let $p$ be the number of people initially in the group, then $0.4p$ is the number of girls. If two girls leave and two boys arrive, the number of people in the group is still $p$ , but the number of girls is $0.4p-2$ . Since only $30\%$ of the group are girls, \begin{align*} \frac{0.4p-2}{p}&=\frac{3}{10}\\ 4p-20&=3p\\ p&=20\end{align*} The number of girls initially in the group is $0.4p=0.4(20)=\boxed{8}$

Solution: Let $x$ be the number of people initially in the group and $g$ the number of girls. $\frac{2}{5}x = g$ , so $x = \frac{5}{2}g$ . Also, the problem states $\frac{3}{10}x = g-2$ . Substituting $x$ in terms of $g$ into the second equation yields that $g = \boxed{8}$


Answer: 22.0

Some marbles in a bag are red and the rest are blue. If one red marble is removed, then one-seventh of the remaining marbles are red. If two blue marbles are removed instead of one red, then one-fifth of the remaining marbles are red. How many marbles were in the bag originally?
$\textbf{(A)}\ 8 \qquad\textbf{(B)}\ 22 \qquad\textbf{(C)}\ 36 \qquad\textbf{(D)}\ 57 \qquad\textbf{(E)}\ 71$

Solution: Let $r$ and $b$ be the number of red and blue marbles originally in the bag respectively. After $1$ red marble is removed, there are $r+b-1$ marbles left in the bag and $r-1$ red marbles left. So \[\frac{r-1}{r+b-1}=\frac{1}{7}.\] When $2$ blue marbles are removed, there are $r$ red marbles and $r+b-2$ total marbles left in the bag. So \[\frac{r}{r+b-2}=\frac{1}{5}.\] Cross multiplying for each yields \begin{align*}7r-7=r+b-1&\implies 7r-6=r+b\\ 5r=r+b-2&\implies 5r+2=r+b.\end{align*} We can equate each of these expressions to yields \[7r-6=5r+2\implies 2r=8\implies r=4\implies b=18.\] Therefore, the total number of marbles is \[r+b=4+18=\boxed{22.}\]


Answer: 23.0

Solution:
An even number comes from multiplying an even and even, even and odd, or odd and even. Since an odd number only comes from multiplying an odd and odd, there are less cases and it would be easier to find the probability of spinning two odd numbers from $1$ . Multiply the independent probabilities of each spinner getting an odd number together and subtract it from $1$
\[1-\frac24 \cdot \frac23 = 1- \frac13 = \boxed{23}\]

Solution: We can make a chart and the we see that the 12 possibilities: 1, 2, 3, 2, 4, 6, 3, 6, 9, 4, 8, and 12. Out of these only 8 work; thus the probability is \[\boxed{23}\]

Solution: We do a little bit of casework. In order to get a product that's even, we need at least one even number. First, we consider the probability of getting an even number on the first spinner, and then multiply by 1 because the second spinner can be anything. \[\frac12 \cdot 1 = \frac12\] Next, we look at the chance that we don't get an even on the first spinner, but get an even on the second spinner (we don't do the probability of even on the second spinner multiplied by one because we would be double counting both spinners are even). \[\frac12 \cdot \frac13 = \frac16\] Add these two together to get the total probability, and we get \[\frac12 + \frac16 = \frac46 = \boxed{23}\]


Answer: 307.0

Square $ABCD$ has center $O,\ AB=900,\ E$ and $F$ are on $AB$ with $AE<BF$ and $E$ between $A$ and $F, m\angle EOF =45^\circ,$ and $EF=400.$ Given that $BF=p+q\sqrt{r},$ where $p,q,$ and $r$ are positive integers and $r$ is not divisible by the square of any prime , find $p+q+r.$

Solution:
Let $G$ be the foot of the perpendicular from $O$ to $AB$ . Denote $x = EG$ and $y = FG$ , and $x > y$ (since $AE < BF$ and $AG = BG$ ). Then $\tan \angle EOG = \frac{x}{450}$ , and $\tan \angle FOG = \frac{y}{450}$
By the tangent addition rule $\left( \tan (a + b) = \frac{\tan a + \tan b}{1 - \tan a \tan b} \right)$ , we see that \[\tan 45 = \tan (EOG + FOG) = \frac{\frac{x}{450} + \frac{y}{450}}{1 - \frac{x}{450} \cdot \frac{y}{450}}.\] Since $\tan 45 = 1$ , this simplifies to $1 - \frac{xy}{450^2} = \frac{x + y}{450}$ . We know that $x + y = 400$ , so we can substitute this to find that $1 - \frac{xy}{450^2} = \frac 89 \Longrightarrow xy = 150^2$
Substituting $x = 400 - y$ again, we know have $xy = (400 - y)y = 150^2$ . This is a quadratic with roots $200 \pm 50\sqrt{7}$ . Since $y < x$ , use the smaller root, $200 - 50\sqrt{7}$
Now, $BF = BG - FG = 450 - (200 - 50\sqrt{7}) = 250 + 50\sqrt{7}$ . The answer is $250 + 50 + 7 = \boxed{307}$

Solution: Let the midpoint of $\overline{AB}$ be $M$ and let $FB = x$ , so then $MF = 450 - x$ and $AF = 900 - x$ . Drawing $\overline{AO}$ , we have $\triangle OEF\sim\triangle AOF$ , so \[\frac{OF}{EF} = \frac{AF}{OF}\Rightarrow (OF)^2 = 400(900 - x).\] By the Pythagorean Theorem on $\triangle OMF$ \[(OF)^2 = 450^2 + (450 - x)^2.\] Setting these two expressions for $(OF)^2$ equal and solving for $x$ (it is helpful to scale the problem down by a factor of 50 first), we get $x = 250\pm 50\sqrt{7}$ . Since $BF > AE$ , we want the value $x = 250 + 50\sqrt{7}$ , and the answer is $250 + 50 + 7 = \boxed{307}$

Solution: Let lower case letters be the complex numbers correspond to their respective upper case points in the complex plane, with $o = 0, a = -450 + 450i, b = 450 + 450i$ , and $f = x + 450i$ . Since $EF$ = 400, $e = (x-400) + 450i$ . From $\angle{EOF} = 45^{\circ}$ , we can deduce that the rotation of point $F$ 45 degrees counterclockwise, $E$ , and the origin are collinear. In other words, \[\dfrac{e^{i \frac{\pi}{4}} \cdot (x + 450i)}{(x - 400) + 450i}\] is a real number. Simplyfying using the fact that $e^{i \frac{\pi}{4}} = \dfrac{\sqrt{2}}{2} + i \dfrac{\sqrt{2}}{2}$ , clearing the denominator, and setting the imaginary part equal to $0$ , we eventually get the quadratic \[x^2 - 400x + 22500 = 0\] which has solutions $x = 200 \pm 50\sqrt{7}$ . It is given that $AE < BF$ , so $x = 200 - 50\sqrt{7}$ and \[BF = 450 - (200 - 50\sqrt{7}) = 250 + 50\sqrt{7} \Rightarrow \boxed{307}.\]

Solution:
 Let G be a point such that it lies on AB, and GOE is 90 degrees. Let H be foot of the altitude from O to AB.
Since $\triangle GOE \sim \triangle OHE$ $\frac{GO}{OE} = \frac{450}{x}$ , and by Angle Bisector Theorem $\frac{GF}{FE} = \frac{450}{x}$ . Thus, $GF = \frac{450 \cdot 400}{x}$ $AF = AH-FH = 50+x$ , and $KA = EB$ (90 degree rotation), and now we can bash on 2 similar triangles $\triangle GAK \sim \triangle GHO$
\[\frac{GA}{AK} = \frac{GH}{OH}\] \[\frac{\frac{450 \cdot 400}{x}-50-x}{450-x} = \frac{\frac{450 \cdot 400}{x}+400-x}{450}\] I hope you like expanding \[x^2 - 850x + \frac{81000000}{x} = -450x - 22500 + \frac{81000000}{x}\] \[x^2 - 400x + 22500 = 0\] Quadratic formula gives us \[x = 200 \pm 50 \sqrt{7}\] Since AE < BF \[x = 200 - 50 \sqrt{7}\] Thus, \[BF = 250 + 50 \sqrt{7}\] So, our answer is $\boxed{307}$

Solution:
We know that G is on the perpendicular bisector of $EF$ , which means that $EJ=JF=200$ $EG=GF=200\sqrt{2}$ and $GH=250$ . Now, let $HO$ be equal to $x$ . We can set up an equation with the Pythagorean Theorem:
\begin{align*} \sqrt{x^2+250^2}&=(200\sqrt{2})^2 \\ x^2+62500&=80000 \\ x^2&=17500 \\ x&=50\sqrt{7} \end{align*}
Now, since $IO=450$
\begin{align*} HI&=450-x \\ &=450-50\sqrt{7} \\ \end{align*} \\
Since $HI=AJ$ , we now have:
\begin{align*} BF&=AB-AJ-JF \\ &=900-(450-50\sqrt{7})-200 \\ &=250+50\sqrt{7} \\ \end{align*}
This means that our answer would be $250+50+7=\boxed{307}$

Solution: Construct $BO, AO.$ Let $\angle{FOB} = \alpha.$ Also let $FB = x$ then $AE = 500-x.$ We then have from simple angle-chasing: \begin{align*} \angle{BFO} = 135 - \alpha \\ \angle{OFE} = 45 + \alpha \\ \angle{EOA} = 45 - \alpha \\ \angle{AEO} = 90 + \alpha \\ \angle{OEF} = 90 - \alpha. \end{align*} From AA similarity we have \[\triangle{EOB} \sim \triangle{EFO}.\] This gives the ratios, \[\dfrac{400 + x}{EO} = \dfrac{450\sqrt{2}}{FO}.\] Similarly from AA similarity \[\triangle{FOA} \sim \triangle{FEO}.\] So we get the ratios \[\dfrac{EO}{450\sqrt{2}} = \dfrac{FO}{900-x}.\] We can multiply to get \[\dfrac{400 + x}{450\sqrt{2}} = \dfrac{450\sqrt{2}}{900 - x}.\] Cross-multiplying reveals \[360000 + 500x - x^2 = 405000.\] Bringing everything to one side we have \[x^2 - 500x + 45000 = 0.\] By the quadratic formula we get \[x = \dfrac{500 + \sqrt{500^2 - 4\cdot45000}}{2} = \dfrac{500 + \sqrt{70000}}{2} = \dfrac{500 + 100\sqrt{7}}{2} = 250 + 50\sqrt{7}.\] Therefore \[p+q+r = 250 + 50 + 7 = \boxed{307}.\] ~aa1024

Solution:
Draw AO, OB, and extend OB to D. Let $\angle{FOB} = \alpha.$ Then, after angle chasing, we find that \[\angle{AEB} = 90 + \alpha\] .
Using this, we draw a line perpendicular to $AB$ at $E$ to meet $BD$ at $M$ . Since $\angle{MEO} = \alpha$ and $\angle{EMO} = 45$ , we have that \[\triangle{EMO} \sim \triangle{OBF}\] Let $FB = x$ . Then $EM = 400+x$ . Since $FB/BO = \frac{x}{450\sqrt{2}}$ , and $MO/EM = FB/OB$ , we have \[MO = \frac{(400+x)x}{450\sqrt{2}}\] Since $\triangle{EBM}$ is a $45-45-90$ triangle, \[(400+x)\sqrt{2} = 450 \sqrt{2} + \frac{(400+x)x}{450\sqrt{2}}\] Solving for $x$ , we get that $x=250 +- 50s\sqrt{7}$ , but since $FB>AE$ $FB = 250+50\sqrt{7}$ , thus \[p+q+r=\boxed{307}\] -dchang0524


Answer: 578.0

Solution: Drawing $EF$ , it clearly passes through the center of $ABCD$ . Letting this point be $P$ , we note that $AEBP$ and $CFDP$ are congruent cyclic quadrilaterals, and that $AP=BP=CP=DP=\frac{13}{\sqrt{2}}.$ Now, from Ptolemy's, $13\cdot EP=\frac{13}{\sqrt{2}}(12+5)\implies EP=\frac{17\sqrt{2}}{2}$ . Since $EF=EP+FP=2\cdot EP$ , the answer is $(17\sqrt{2})^2=\boxed{578}.$

Solution:
We first see that the whole figure is symmetrical and reflections across the center that we will denote as $O$ bring each half of the figure to the other half. Thus we consider a single part of the figure, namely $EO.$
First note that $\angle BAO = 45^{\circ}$ since $O$ is the center of square $ABCD.$ Also note that $\angle EAB = \arccos{\left(\frac{12}{13}\right)}$ or $\arcsin{\left(\frac{5}{13}\right)}.$ Finally, we know that $AO =\frac{13\sqrt{2}}{2}.$ Now we apply laws of cosines on $\bigtriangleup AEO.$
We have $EO^2 = 12^2 + (\frac{13\sqrt{2}}{2})^2 - 2 \cdot 12 \cdot \left(\frac{13\sqrt{2}}{2}\right) \cdot \cos{\angle EAO}.$ We know that $\angle EAO = 45^{\circ} + \arccos{\left(\frac{12}{13}\right)}.$ Thus we have $\cos{\angle EAO} = \cos\left(45^{\circ} + \arccos{\left(\frac{12}{13}\right)}\right)$ which applying the cosine sum identity yields $\cos{45^{\circ}}\cos{\arccos\frac{12}{13}} - \sin{45^{\circ}}\sin\arcsin{\frac{5}{12}} =\frac{12\sqrt{2}}{26} -\frac{5\sqrt{2}}{26} =\frac{7\sqrt{2}}{26}.$
Note that we are looking for $4EO^2$ so we multiply $EO^2 = 12^2 + \left(\frac{13\sqrt{2}}{2}\right)^2 - 2 \cdot 12 \cdot \left(\frac{13\sqrt{2}}{2}\right) \cdot \cos{\angle EAO}$ by $4$ obtaining $4EO^2 = 576 + 338 - 8 \cdot\left(\frac{13\sqrt{2}}{2}\right) \cdot 12 \cdot\frac{7\sqrt{2}}{26} = 576 + 338 - 4  \cdot 12 \cdot  7 = \boxed{578}.$


Answer: 200.0

Square $ABCD$ has side length $30$ . Point $P$ lies inside the square so that $AP = 12$ and $BP = 26$ . The centroids of $\triangle{ABP}$ $\triangle{BCP}$ $\triangle{CDP}$ , and $\triangle{DAP}$ are the vertices of a convex quadrilateral. What is the area of that quadrilateral?
[asy] unitsize(120); pair B = (0, 0), A = (0, 1), D = (1, 1), C = (1, 0), P = (1/4, 2/3); draw(A--B--C--D--cycle); dot(P); defaultpen(fontsize(10pt)); draw(A--P--B); draw(C--P--D); label("$A$", A, W); label("$B$", B, W); label("$C$", C, E); label("$D$", D, E); label("$P$", P, N*1.5+E*0.5); dot(A); dot(B); dot(C); dot(D); [/asy]
$\textbf{(A) }100\sqrt{2}\qquad\textbf{(B) }100\sqrt{3}\qquad\textbf{(C) }200\qquad\textbf{(D) }200\sqrt{2}\qquad\textbf{(E) }200\sqrt{3}$

Solution:
As shown below, let $M_1,M_2,M_3,M_4$ be the midpoints of $\overline{AB},\overline{BC},\overline{CD},\overline{DA},$ respectively, and $G_1,G_2,G_3,G_4$ be the centroids of $\triangle{ABP},\triangle{BCP},\triangle{CDP},\triangle{DAP},$ respectively.  By SAS, we conclude that $\triangle G_1G_2P\sim\triangle M_1M_2P, \triangle G_2G_3P\sim\triangle M_2M_3P, \triangle G_3G_4P\sim\triangle M_3M_4P,$ and $\triangle G_4G_1P\sim\triangle M_4M_1P.$ By the properties of centroids, the ratio of similitude for each pair of triangles is $\frac23.$
Note that quadrilateral $M_1M_2M_3M_4$ is a square of side-length $15\sqrt2.$ It follows that:
Together, quadrilateral $G_1G_2G_3G_4$ is a square of side-length $10\sqrt2,$ so its area is $\left(10\sqrt2\right)^2=\boxed{200}.$

Solution:
This solution refers to the diagram in Solution 1.
By SAS, we conclude that $\triangle G_1G_3P\sim\triangle M_1M_3P$ and $\triangle G_2G_4P\sim\triangle M_2M_4P.$ By the properties of centroids, the ratio of similitude for each pair of triangles is $\frac23.$
Note that quadrilateral $M_1M_2M_3M_4$ is a square of diagonal-length $30,$ so $\overline{M_1M_3}\perp\overline{M_2M_4}.$ Since $\overline{G_1G_3}\parallel\overline{M_1M_3}$ and $\overline{G_2G_4}\parallel\overline{M_2M_4}$ by the Converse of the Corresponding Angles Postulate, we have $\overline{G_1G_3}\perp\overline{G_2G_4}.$
Therefore, the area of quadrilateral $G_1G_2G_3G_4$ is \[\frac12\cdot G_1G_3\cdot G_2G_4 = \frac12\cdot\left(\frac23\cdot M_1M_3\right)\cdot\left(\frac23\cdot M_2M_4\right)=\boxed{200}.\] ~Funnybunny5246 ~MRENTHUSIASM

Solution:
This solution refers to the diagram in Solution 1.
We place the diagram in the coordinate plane: Let $A=(0,30),B=(0,0),C=(30,0),D=(30,30),$ and $P=(3x,3y).$
Recall that for any triangle in the coordinate plane, the coordinates of its centroid are the averages of the coordinates of its vertices. It follows that $G_1=(x,y+10),G_2=(x+10,y),G_3=(x+20,y+10),$ and $G_4=(x+10,y+20).$
Note that $G_1G_3=G_2G_4=20$ and $\overline{G_1G_3}\perp\overline{G_2G_4}.$ Therefore, the area of quadrilateral $G_1G_2G_3G_4$ is \[\frac12\cdot G_1G_3\cdot G_2G_4=\boxed{200}.\]

Solution:
Let $X,Y,Z,W$ be the midpoints of sides $AB,BC,CD,DE$ , respectively.
Notice that a homothety centered at P with ratio $\frac{2}{3}$ will send $XYZW$ to $G_{1}G_{2}G_{3}G_{4}$ , so $G_{1}G_{2}G_{3}G_{4}$ is a square with area $\left(\frac{2}{3}\right)^2 [XYZW]$ , but $[XYZW]=\frac{1}{2}[ABCD]$ so our desired area is \[\frac{4}{9}\cdot\frac{1}{2}\cdot900=\boxed{200}\]


Answer: 12.0

Square $ABCD$ has sides of length 1. Points $E$ and $F$ are on $\overline{BC}$ and $\overline{CD},$ respectively, so that $\triangle AEF$ is equilateral . A square with vertex $B$ has sides that are parallel to those of $ABCD$ and a vertex on $\overline{AE}.$ The length of a side of this smaller square is $\frac{a-\sqrt{b}}{c},$ where $a, b,$ and $c$ are positive integers and $b$ is not divisible by the square of any prime. Find $a+b+c.$

Solution:
 Call the vertices of the new square A', B', C', and D', in relation to the vertices of $ABCD$ , and define $s$ to be one of the sides of that square. Since the sides are parallel , by corresponding angles and AA~ we know that triangles $AA'D'$ and $D'C'E$ are similar. Thus, the sides are proportional: $\frac{AA'}{A'D'} = \frac{D'C'}{C'E} \Longrightarrow \frac{1 - s}{s} = \frac{s}{1 - s - CE}$ . Simplifying, we get that $s^2 = (1 - s)(1 - s - CE)$
$\angle EAF$ is $60$ degrees, so $\angle BAE = \frac{90 - 60}{2} = 15$ . Thus, $\cos 15 = \cos (45 - 30) = \frac{\sqrt{6} + \sqrt{2}}{4} = \frac{1}{AE}$ , so $AE = \frac{4}{\sqrt{6} + \sqrt{2}} \cdot \frac{\sqrt{6} - \sqrt{2}}{\sqrt{6} - \sqrt{2}} = \sqrt{6} - \sqrt{2}$ . Since $\triangle AEF$ is equilateral $EF = AE = \sqrt{6} - \sqrt{2}$ $\triangle CEF$ is a $45-45-90 \triangle$ , so $CE = \frac{AE}{\sqrt{2}} = \sqrt{3} - 1$ . Substituting back into the equation from the beginning, we get $s^2 = (1 - s)(2 - \sqrt{3} - s)$ , so $(3 - \sqrt{3})s = 2 - \sqrt{3}$ . Therefore, $s = \frac{2 - \sqrt{3}}{3 - \sqrt{3}} \cdot \frac{3 + \sqrt{3}}{3 + \sqrt{3}} = \frac{3 - \sqrt{3}}{6}$ , and $a + b + c = 3 + 3 + 6 = \boxed{12}$

Solution: Suppose $\overline{AB} = \overline{AD} = x.$ Note that $\angle EAF = 60$ since the triangle is equilateral, and by symmetry, $\angle BAE = \angle DAF = 15.$ Note that if $\overline{AD} = x$ and $\angle BAE = 15$ , then $\overline{AA'}=\frac{x}{\tan(15)}.$ Also note that \[AB = 1 = \overline{AA'} + \overline{A'B} = \frac{x}{\tan(15)} + x\] Using the fact $\tan(15) = 2-\sqrt{3}$ , this yields \[x = \frac{1}{3+\sqrt{3}} = \frac{3-\sqrt{3}}{6} \rightarrow 3 + 3 + 6 = \boxed{12}\]

Solution: Why not solve in terms of the side $x$ only (single-variable beauty)? By similar triangles we obtain that $BE=\frac{x}{1-x}$ , therefore $CE=\frac{1-2x}{1-x}$ . Then $AE=\sqrt{2}*\frac{1-2x}{1-x}$ . Using Pythagorean Theorem on $\triangle{ABE}$ yields $\frac{x^2}{(1-x)^2} + 1 = 2 * \frac{(1-2x)^2}{(1-x)^2}$ . This means $6x^2-6x+1=0$ , and it's clear we take the smaller root: $x=\frac{3-\sqrt{3}}{6}$ . Answer: $\boxed{12}$

Solution: Since $AEF$ is equilateral, $AE=EF$ . Let $BE=x$ . By the Pythagorean theorem $1+x^2=2(1-x)^2$ . Simplifying, we get $x^2-4x+1=0$ . By the quadratic formula, the roots are $2 \pm \sqrt{3}$ . Since $x<1$ , we discard the root with the "+", giving $x=2-\sqrt{3}$  Let the side length of the square be s. Since $MEK$ is similar to $ABE$ $s=\frac{2-\sqrt{3}-s}{2-\sqrt{3}}$ . Solving, we get $s=\frac{3-\sqrt{3}}{6}$ and the final answer is $\boxed{012}$


Answer: 86.0

Square $ABCD$ has sides of length 2. Set $S$ is the set of all line segments that have length 2 and whose endpoints are on adjacent sides of the square. The midpoints of the line segments in set $S$ enclose a region whose area to the nearest hundredth is $k$ .  Find $100k$

Solution:
Without loss of generality, let $(0,0)$ $(2,0)$ $(0,2)$ , and $(2,2)$ be the vertices of the square. Suppose the endpoints of the segment lie on the two sides of the square determined by the vertex $(0,0)$ .  Let the two endpoints of the segment have coordinates $(x,0)$ and $(0,y)$ . Because the segment has length 2, $x^2+y^2=4$ . Using the midpoint formula, we find that the midpoint of the segment has coordinates $\left(\frac{x}{2},\frac{y}{2}\right)$ . Let $d$ be the distance from $(0,0)$ to $\left(\frac{x}{2},\frac{y}{2}\right)$ . Using the distance formula we see that $d=\sqrt{\left(\frac{x}{2}\right)^2+\left(\frac{y}{2}\right)^2}= \sqrt{\frac{1}{4}\left(x^2+y^2\right)}=\sqrt{\frac{1}{4}(4)}=1$ . Thus the midpoints lying on the sides determined by vertex $(0,0)$ form a quarter- circle with radius 1.
The set of all midpoints forms a quarter circle at each corner of the square.  The area enclosed by all of the midpoints is $4-4\cdot \left(\frac{\pi}{4}\right)=4-\pi \approx .86$ to the nearest hundredth. Thus $100\cdot k=\boxed{86}$

Solution: To imagine the area, think of a ladder with a length of $2$ sliding down a wall. It is known that as a ladder slides down a wall, its midpoint traces a quarter circle (if you don't believe me, try it with your pencil). There are $4$ quarter circles, so their area is one circle or $\pi$ . Thus, they enclose the area of the square minus the area of the quarter circles, which is $4-\pi \approx 0.86$ , so $100k = \boxed{086}$ . ~Extremelysupercooldude


Answer: 13.0

Square $ABCD$ has sides of length 3. Segments $CM$ and $CN$ divide the square's area into three equal parts. How long is segment $CM$
[asy] pair A,B,C,D,M,N; A = (0,0); B = (0,3); C = (3,3); D = (3,0); M = (0,1); N = (1,0); draw(A--B--C--D--cycle); draw(M--C--N); label("$A$",A,SW); label("$M$",M,W); label("$B$",B,NW); label("$C$",C,NE); label("$D$",D,SE); label("$N$",N,S); [/asy]
$\text{(A)}\ \sqrt{10} \qquad \text{(B)}\ \sqrt{12} \qquad \text{(C)}\ \sqrt{13} \qquad \text{(D)}\ \sqrt{14} \qquad \text{(E)}\ \sqrt{15}$

Solution:
Since the square has side length $3$ , the area of the entire square is $9$
The segments divide the square into 3 equal parts, so the area of each part is $9 \div 3 = 3$
Since $\triangle CBM$ has area $3$ and base $CB = 3$ , using the area formula for a triangle:
$A_{tri} = \frac{1}{2}bh$
$3 = \frac{1}{2}3h$
$h = 2$
Thus, height $BM = 2$
Since $\triangle CBM$ is a right triangle, $CM = \sqrt{BM^2 + BC^2} = \sqrt{2^2 + 3^2} = \boxed{13}$

Solution: Connect $AC$ $S_\triangle AMC=S_\triangle ANC$ . To satisfied the three area is equal, we have $2S_\triangle AMC=S_\triangle BMC$ $2S_\triangle ANC=S_\triangle DNC$ . Thus, $AM=AN=\frac{1}{2}BM=\frac{1}{2}AB=1$ $BM=2,BC=3,MC=\boxed{13}$


Answer: 251.0

Square $ABCD$ is inscribed in a circle . Square $EFGH$ has vertices $E$ and $F$ on $\overline{CD}$ and vertices $G$ and $H$ on the circle. If the area of square $ABCD$ is $1$ , then the area of square $EFGH$ can be expressed as $\frac {m}{n}$ where $m$ and $n$ are relatively prime positive integers and $m < n$ . Find $10n + m$

Solution:
Let $O$ be the center of the circle, and $2a$ be the side length of $ABCD$ $2b$ be the side length of $EFGH$ . By the Pythagorean Theorem , the radius of $\odot O = OC = a\sqrt{2}$
Now consider right triangle $OGI$ , where $I$ is the midpoint of $\overline{GH}$ . Then, by the Pythagorean Theorem,
\begin{align*} OG^2 = 2a^2 &= OI^2 + GI^2 = (a+2b)^2 + b^2 \\ 0 &= a^2 - 4ab - 5b^2 = (a - 5b)(a + b) \end{align*}
Thus $a = 5b$ (since lengths are positive, we discard the other root). The ratio of the areas of two similar figures is the square of the ratio of their corresponding side lengths, so $\frac{[EFGH]}{[ABCD]} = \left(\frac 15\right)^2 = \frac{1}{25}$ , and the answer is $10n + m = \boxed{251}$

Solution: Let point $A$ be the top-left corner of square $ABCD$ and the rest of the vertices be arranged, in alphabetical order, in a clockwise arrangement from there. Let $D$ have coordinates $(0,0)$ and the side length of square $ABCD$ be $a$ . Let $DF$ $b$ and diameter $HI$ go through $J$ the midpoint of $EF$ . Since a diameter always bisects a chord perpendicular to it, $DJ$ $JC$ and since $F$ and $E$ must be symmetric around the diameter, $FJ = JE$ and it follows that $DF = EC = b.$ Hence $FE$ the side of square $EFGH$ has length $a - 2b$ $F$ has coordinates $(b,0)$ and $G$ has coordinates $(b, 2b - a).$ We know that point $G$ must be on the circle $O$ - hence it must satisfy the circle equation. Since the center of the circle is at the center of the square $(a/2, a/2)$ and has radius $a *$ $\sqrt{2} / 2$ , half the diagonal of the square, $(x - a/2)^2 + (y - a/2)^2 = 1/2a^2$ follows as the circle equation. Then substituting coordinates of $G$ into the equation, $(b - a/2)^2 + (2b - a - a/2)^2 = a^2/2$ . Simplifying and factoring, we get $2a^2-7ab+5b^2 = (2a-5b)(a-b) = 0.$ Since $a = b$ would imply $m = n$ , and $m < n$ in the problem, we must use the other factor. We get $b = 2/5a$ , meaning the ratio of areas $((a-2b)/a)^2$ $(1/5)^2$ $1/25$ $m/n.$ Then $10n + m = 25 * 10 + 1 = \boxed{251}$


Answer: 35.0

Square $ABCD$ is rotated $20^{\circ}$ clockwise about its center to obtain square $EFGH$ , as shown below. IMG 1031.jpeg
What is the degree measure of $\angle EAB$
$\text{(A)}\ 24^{\circ} \qquad \text{(B)}\ 35^{\circ} \qquad \text{(C)}\ 30^{\circ} \qquad \text{(D)}\ 32^{\circ} \qquad \text{(E)}\ 20^{\circ}$

Solution: First, let's call the center of both squares $I$ . Then, $\angle{AIE} = 20$ , and since $\overline{EI} = \overline{AI}$ $\angle{AEI} = \angle{EAI} = 80$ . Then, we know that $AI$ bisects angle $\angle{DAB}$ , so $\angle{BAI} = \angle{DAI} = 45$ . Subtracting $45$ from $80$ , we get $\boxed{35}$

Solution: First, label the point between $A$ and $H$ point $O$ and the point between $A$ and $H$ point $P$ . We know that $\angle{AOP} = 20$ and that $\angle{A} = 90$ . Subtracting $20$ and $90$ from $180$ , we get that $\angle{APO}$ is $70$ . Subtracting $70$ from $180$ , we get that $\angle{OPB} = 110$ . From this, we derive that $\angle{APE} = 110$ . Since triangle $APE$ is an isosceles triangle, we get that $\angle{EAP} = (180 - 110)/2 = 35$ . Therefore, $\angle{EAB} = 35$ . The answer is $\boxed{35}$

Solution: Call the center of both squares point $O$ , and draw circle $O$ such that it circumscribes the squares. $\angle{EOF} = 90$ and $\angle{BOF} = 20$ , so $\angle{EOB} = 70$ . Since $\angle{EAB}$ is inscribed in arc $\overset \frown {EB}$ $\angle{EAB} = 70/2 = \boxed{35}$

Solution:
Draw $EA$ : we want to find $\angle EAB$ . Call $P$ the point at which $AB$ and $EH$ intersect. Reflecting $\triangle APE$ over $EA$ , we have a parallelogram. Since $\angle EPB = 70^{\circ}$ , angle subtraction tells us that two of the angles of the parallelogram are $110^{\circ}$ . The other two are equal to $2\angle EAB$ (by properties of reflection).
Since angles on the transversal of a parallelogram sum to $180^{\circ}$ , we have $2\angle EAB + 110 = 180$ , yielding $\angle EAB = \boxed{35}$

Solution: We call the point where $AB$ and $EH$ intersect I. We can make an educated guess that triangle AEI is isosceles so $AI=EI$ $\angle AIE = 110^{\circ}$ $\angle AIH = 20^{\circ}$ , and $\angle EIB = 70^{\circ}$ . So, we get $\angle EAI$ is $(180^{\circ} - 110^{\circ})/2  = \boxed{35}$


Answer: 25.0

Square $AIME$ has sides of length $10$ units.  Isosceles triangle $GEM$ has base $EM$ , and the area common to triangle $GEM$ and square $AIME$ is $80$ square units.  Find the length of the altitude to $EM$ in $\triangle GEM$

Solution:
Note that if the altitude of the triangle is at most $10$ , then the maximum area of the intersection of the triangle and the square is $5\cdot10=50$ .
This implies that vertex G must be located outside of square $AIME$
Let $GE$ meet $AI$ at $X$ and let $GM$ meet $AI$ at $Y$ . Clearly, $XY=6$ since the area of trapezoid $XYME$ is $80$ . Also, $\triangle GXY \sim \triangle GEM$
Let the height of $GXY$ be $h$ . By the similarity, $\dfrac{h}{6} = \dfrac{h + 10}{10}$ , we get $h = 15$ . Thus, the height of $GEM$ is $h + 10 = \boxed{025}$


Answer: 255.0

Square $S_{1}$ is $1\times 1.$ For $i\ge 1,$ the lengths of the sides of square $S_{i+1}$ are half the lengths of the sides of square $S_{i},$ two adjacent sides of square $S_{i}$ are perpendicular bisectors of two adjacent sides of square $S_{i+1},$ and the other two sides of square $S_{i+1},$ are the perpendicular bisectors of two adjacent sides of square $S_{i+2}.$ The total area enclosed by at least one of $S_{1}, S_{2}, S_{3}, S_{4}, S_{5}$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers.  Find $m-n.$
AIME 1995 Problem 1.png

Solution:
The sum of the areas of the squares if they were not interconnected is a geometric sequence
Then subtract the areas of the intersections, which is $\left(\frac{1}{4}\right)^2 + \ldots + \left(\frac{1}{32}\right)^2$
The majority of the terms cancel, leaving $1 + \frac{1}{4} - \frac{1}{1024}$ , which simplifies down to $\frac{1024 + \left(256 - 1\right)}{1024}$ . Thus, $m-n =  \boxed{255}$


Answer: 500.0

Solution: If the sides of the open box are folded down so that a flat sheet with four corners cut out remains, then the revealed surface would have the same area as the interior of the box. This is equal to the area of the four corners subtracted from the area of the original sheet, which is $((20)(30)-4(5)(5)) = 600-100 = \boxed{500}$


Answer: 175.0

Solution:
The area of the entire region in the plane is the area of the figure. However, we cannot simply add the two areas of the squares. We find the area of $\triangle ABG$ and subtract this from $200$ , the total area of the two squares.
Since $G$ is the center of $ABCD$ $BG$ is half of the diagonal of the square. The diagonal of $ABCD$ is $10\sqrt{2}$ so $BG=5\sqrt{2}$ . Since $EFGH$ is a square, $\angle G=90^\circ$ . So $\triangle ABG$ is an isosceles right triangle. Its area is $\frac{(5\sqrt{2})^2}{2}=\frac{50}{2}=25$ . Therefore, the area of the region is $200-25=\boxed{175.}$


Answer: 840.0

Squares $ABCD$ and $EFGH$ have a common center and $\overline{AB} || \overline{EF}$ . The area of $ABCD$ is 2016, and the area of $EFGH$ is a smaller positive integer. Square $IJKL$ is constructed so that each of its vertices lies on a side of $ABCD$ and each vertex of $EFGH$ lies on a side of $IJKL$ . Find the difference between the largest and smallest positive integer values for the area of $IJKL$

Solution:
Letting $AI=a$ and $IB=b$ , we have \[IJ^{2}=a^{2}+b^{2} \geq 1008\] by AM-GM inequality . Also, since $EFGH||ABCD$ , the angles that each square cuts another are equal, so all the triangles are formed by a vertex of a larger square and $2$ adjacent vertices of a smaller square are similar. Therefore, the areas form a geometric progression, so since \[2016=12^{2} \cdot 14\] we have the maximum area is \[2016 \cdot \dfrac{11}{12} = 1848\] (the areas of the squares from largest to smallest are $12^{2} \cdot 14, 11 \cdot 12 \cdot 14, 11^{2} \cdot 14$ forming a geometric progression).
The minimum area is $1008$ (every square is half the area of the square whose sides its vertices touch), so the desired answer is \[1848-1008=\boxed{840}\]