Answer: 37.0

A game is played with tokens according to the following rule.  In each round, the player with the most tokens gives one token to each of the other players and also places one token in the discard pile.  The game ends when some player runs out of tokens.  Players $A$ $B$ , and $C$ start with $15$ $14$ , and $13$ tokens, respectively.  How many rounds will there be in the game?
$\mathrm{(A) \ } 36 \qquad \mathrm{(B) \ } 37 \qquad \mathrm{(C) \ } 38 \qquad \mathrm{(D) \ } 39 \qquad \mathrm{(E) \ } 40$

Solution:
We look at a set of three rounds, where the players begin with $x+1$ $x$ , and $x-1$ tokens.
After three rounds, there will be a net loss of $1$ token per player (they receive two tokens and lose three). Therefore, after $36$ rounds -- or $12$ three-round sets, $A,B$ and $C$ will have $3$ $2$ , and $1$ tokens, respectively.  After $1$ more round, player $A$ will give away $3$ tokens, leaving them empty-handed, and thus the game will end. We then have there are $36+1=\boxed{37}$ rounds until the game ends.

Solution:
Let's bash a few rounds. The amounts are for players $1,2,$ and $3$ , respectively.
First round: $15,14,13$ (given)
Second round: $12,15,14$ Third round: $13,12,15$ Fourth round: $14,13,12$
We see that after $3$ rounds are played, we have the exact same scenario as the first round but with one token less per player. So, the sequence $1,4,7,10...$ where each of the next members are $3$ greater than the previous one corresponds with the sequence $15,14,13,12...$ where the first sequence represents the round and the second sequence represents the number of tokens player $1$ has. But we note that once player $1$ reaches $3$ coins, the game will end on his next turn as he must give away all his coins. Therefore, we want the $15-3+1=13$ th number in the sequence $1,4,7,10...$ which is $\boxed{37}$

Solution: Looking at a set of five rounds, you'll see $A$ has $4$ fewer tokens than in the beginning. Looking at four more rounds, you'll notice $A$ has the same amount of tokens, namely $11$ , compared to round five. If you keep doing this process, you'll see a pattern: Every four rounds, the amount of tokens $A$ has either decreased by $4$ or stayed the same compared to the previous four rounds. For example, in round nine, $A$ had $11$ tokens, in round $13$ $A$ had $11$ tokens, and in round $17$ $A$ had $7$ tokens, etc. Using this weird pattern, you can find out that in round $37$ $A$ should have $3$ tokens, but since they would have given them away in that round, the game would end on $\boxed{37}$


Answer: 37.0

Solution:
We look at a set of three rounds, where the players begin with $x+1$ $x$ , and $x-1$ tokens.
After three rounds, there will be a net loss of $1$ token per player (they receive two tokens and lose three). Therefore, after $36$ rounds -- or $12$ three-round sets, $A,B$ and $C$ will have $3$ $2$ , and $1$ tokens, respectively.  After $1$ more round, player $A$ will give away $3$ tokens, leaving them empty-handed, and thus the game will end. We then have there are $36+1=\boxed{37}$ rounds until the game ends.

Solution:
Let's bash a few rounds. The amounts are for players $1,2,$ and $3$ , respectively.
First round: $15,14,13$ (given)
Second round: $12,15,14$ Third round: $13,12,15$ Fourth round: $14,13,12$
We see that after $3$ rounds are played, we have the exact same scenario as the first round but with one token less per player. So, the sequence $1,4,7,10...$ where each of the next members are $3$ greater than the previous one corresponds with the sequence $15,14,13,12...$ where the first sequence represents the round and the second sequence represents the number of tokens player $1$ has. But we note that once player $1$ reaches $3$ coins, the game will end on his next turn as he must give away all his coins. Therefore, we want the $15-3+1=13$ th number in the sequence $1,4,7,10...$ which is $\boxed{37}$

Solution: Looking at a set of five rounds, you'll see $A$ has $4$ fewer tokens than in the beginning. Looking at four more rounds, you'll notice $A$ has the same amount of tokens, namely $11$ , compared to round five. If you keep doing this process, you'll see a pattern: Every four rounds, the amount of tokens $A$ has either decreased by $4$ or stayed the same compared to the previous four rounds. For example, in round nine, $A$ had $11$ tokens, in round $13$ $A$ had $11$ tokens, and in round $17$ $A$ had $7$ tokens, etc. Using this weird pattern, you can find out that in round $37$ $A$ should have $3$ tokens, but since they would have given them away in that round, the game would end on $\boxed{37}$


Answer: 420.0

A game show offers a contestant three prizes A, B and C, each of which is worth a whole number of dollars from $$ 1$ to $$ 9999$ inclusive. The contestant wins the prizes by correctly guessing the price of each prize in the order A, B, C. As a hint, the digits of the three prices are given. On a particular day, the digits given were $1, 1, 1, 1, 3, 3, 3$ . Find the total number of possible guesses for all three prizes consistent with the hint.

Solution:
[Clarification: You are supposed to find the number of all possible tuples of prices, $(A, B, C)$ , that could have been on that day.]
Since we have three numbers, consider the number of ways we can put these three numbers together in a string of 7 digits. For example, if $A=113, B=13, C=31$ , then the string is
\[1131331.\]
Since the strings have seven digits and three threes, there are $\binom{7}{3}=35$ arrangements of all such strings.
In order to obtain all combination of A,B,C, we partition all the possible strings into 3 groups.
Let's look at the example. We have to partition it into 3 groups with each group having at least 1 digit. In other words, we need to find the solution to
\[x+y+z=7, x,y,z>0.\]
This gives us
\[\binom{6}{2}=15\]
ways by balls and urns. But we have counted the one with 5 digit numbers; that is, $(5,1,1),(1,1,5),(1,5,1)$
Thus, each arrangement has \[\binom{6}{2}-3=12\] ways per arrangement, and there are $12\times35=\boxed{420}$ ways.


Answer: 106.0

A gardener plants three maple trees, four oaks, and five birch trees in a row. He plants them in random order, each arrangement being equally likely. Let $\frac m n$ in lowest terms be the probability that no two birch trees are next to one another. Find $m+n$

Solution:
First notice that there is no difference between the maple trees and the oak trees; we have only two types, birch trees and "non-birch" trees. (If you don't believe this reasoning, think about it. You could also differentiate the tall oak trees from the short oak trees, and the maple trees with many branches as opposed to those with few branches. Indeed, you could keep dividing until you have them each in their own category, but in the end it will not change the probability of the birch trees being near each other. That is, in the end, you multiply the numerator by the number of ways to arrange the oak and maple trees and you also multiply the denominator by the number of ways to arrange the oak and maple trees, making them cancel out.)
The five birch trees must be placed amongst the seven previous trees. We can think of these trees as 5 dividers of 8 slots that the birch trees can go in, making ${8\choose5} = 56$ different ways to arrange this.
There are ${12 \choose 5} = 792$ total ways to arrange the twelve trees, so the probability is $\frac{56}{792} = \frac{7}{99}$
The answer is $7 + 99 = \boxed{106}$

Solution:
Let $b$ $n$ denote birch tree and not-birch tree, respectively. Notice that we only need $4$ $n$ s to separate the $5$ $b$ s. Specifically, \[b,n,b,n,b,n,b,n,b\] Since we have $7$ $n$ s, we are placing the extra $3$ $n$ s into the $6$ intervals beside the $b$ s.
Now doing simple casework.
If all $3$ $n$ s are in the same interval, there are $6$ ways.
If $2$ of the $3$ $n$ s are in the same interval, there are $6\cdot5=30$ ways.
If the $n$ s are in $3$ different intervals, there are ${6 \choose 3} =20$ ways.
In total there are $6+30+20=56$ ways.
There are ${12\choose5}=792$ ways to distribute the birch trees among all $12$ trees.
Thus the probability equals $\frac{56}{792}=\frac{7}{99}\Longrightarrow m+n=7+99=\boxed{106}$

Solution:
Note that the requested probability is computed by dividing the number of configurations with no adjacent Birch trees by the total number of configurations. We can compute the number of configurations with no adjacent Birch trees using complementary counting and then the Principle of Inclusion-Exclusion.
The number of configurations with no adjacent Birch trees is equal to the total number of configurations minus the number of configurations with at least one pair of adjacent Birch trees.
The total number of configurations is given by $\frac{12!}{3! \cdot 4! \cdot 5!}$ . To compute the number of configurations with at least one pair of adjacent Birch trees, we use PIE.
$\#$ (configurations with at least one pair of adjacent Birch trees) $=$ $\#$ (configurations with one pair) $-$ $\#$ (configurations with two pairs) $+$ $\#$ (configurations with three pairs) $-$ $\#$ (configurations with four pairs).
To compute the first term, note that we can treat the adjacent pair of Birch trees as one separate tree. This then gives $\frac{11!}{3! \cdot 3! \cdot 4!}$ configurations.
For the second term, we have two cases. The two pairs could either happen consecutively (BBB) or separately (BB BB). They both give $\frac{10!}{2! \cdot 3! \cdot 4!}$ cases. So our second term is $\frac{2 \cdot 10!}{2! \cdot 3! \cdot 4!}$
The third term can also happen in two ways. The three pairs could be arranged like BBBB or BBB BB. Both cases together give $\frac{2 \cdot 9!}{3! \cdot 4!}$ arrangements.
The final term can happen in one way (BBBBB). This gives $\frac{8!}{3! \cdot 4!}$ arrangements.
Substituting these into our PIE expression, we find that there are $25760$ configurations with at least one pair of adjacent Birch trees. Therefore, there are a total of $\frac{12!}{3! \cdot 4! \cdot 5!} - 25760 = 1960$ configurations with no adjacent Birch trees.
Thus, the probability of a given configuration having no two adjacent Birch trees is given by $\frac{1960}{\frac{12!}{3! \cdot 4! \cdot 5!}} = \frac{7}{99}$
Therefore, the desired result is given by $7+99 = \boxed{106}$

Solution:
Here is a solution leaving out nothing. This solution is dedicated to those that are in self study and wish to learn the most they can. I will make it as elementary as possible and intuition based.
Arrange first the $3$ maple and $4$ oaks as $MMMOOOO$ . We then notice that for none of the $5$ birch trees to be adjacent, they must be put in between these $M$ 's and $O$ 's. We then see that there are $8$ spots to put these $5$ birch trees in. So we can select $5$ spots for these birch trees in $\binom{8}{5}$ . But then, we can rearrange the $M$ 's and $O$ 's in $7!/(3!4!)=\binom{7}{3}$ ways. So then there are $\binom{8}{5}\binom{7}{3}$ valid arrangements with no given consecutive birch trees.
There are then a total of $\frac{12!}{3!4!5!}$ different total arrangements. Therefore the probability is given as $\frac{\binom{8}{5}\binom{7}{3}}{\frac{12!}{3!4!5!}}=\frac{7}{99}$ , so the answer is $7+99=\boxed{106}$


Answer: 8.0

A geometric sequence $(a_n)$ has $a_1=\sin x$ $a_2=\cos x$ , and $a_3= \tan x$ for some real number $x$ . For what value of $n$ does $a_n=1+\cos x$
$\textbf{(A)}\ 4 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 8$

Solution:
By the defintion of a geometric sequence, we have $\cos^2x=\sin x \tan x$ . Since $\tan x=\frac{\sin x}{\cos x}$ , we can rewrite this as $\cos^3x=\sin^2x$
The common ratio of the sequence is $\frac{\cos x}{\sin x}$ , so we can write
\[a_1= \sin x\] \[a_2= \cos x\] \[a_3= \frac{\cos^2x}{\sin x}\] \[a_4=\frac{\cos^3x}{\sin^2x}=1\] \[a_5=\frac{\cos x}{\sin x}\] \[a_6=\frac{\cos^2x}{\sin^2x}\] \[a_7=\frac{\cos^3x}{\sin^3x}=\frac{1}{\sin x}\] \[a_8=\frac{\cos x}{\sin^2 x}=\frac{1}{\cos^2 x}\]
Since $\cos^3x=\sin^2x=1-\cos^2x$ , we have $\cos^3x+\cos^2x=1 \implies \cos^2x(\cos x+1)=1 \implies \cos x+1=\frac{1}{\cos^2 x}$ , which is $a_8$ , making our answer $8 \Rightarrow \boxed{8}$

Solution: Notice that the common ratio is $r=\frac{\cos(x)}{\sin(x)}$ ; multiplying it to $\tan(x)=\frac{\sin(x)}{\cos(x)}$ gives $a_4=1$ . Then, working backwards we have $a_3=\frac{1}{r}$ $a_2=\frac{1}{r^2}$ and $a_1=\frac{1}{r^3}$ . Now notice that since $a_1=\sin(x)$ and $a_2=\cos(x)$ , we need $a_1^2+a_2^2=1$ , so $\frac{1}{r^6}+\frac{1}{r^4}=\frac{r^2+1}{r^6}=1\implies r^2+1=r^6$ . Dividing both sides by $r^2$ gives $1+\frac{1}{r^2}=r^4$ , which the left side is equal to $1+\cos(x)$ ; we see as well that the right hand side is equal to $a_8$ given $a_4=1$ , so the answer is $\boxed{8}$ . - mathleticguyyy


Answer: 931.0

A given sequence $r_1, r_2, \dots, r_n$ of distinct real numbers can be put in ascending order by means of one or more "bubble passes".  A bubble pass through a given sequence consists of comparing the second term with the first term, and exchanging them if and only if the second term is smaller, then comparing the third term with the second term and exchanging them if and only if the third term is smaller, and so on in order, through comparing the last term, $r_n$ , with its current predecessor and exchanging them if and only if the last term is smaller.
The example below shows how the sequence 1, 9, 8, 7 is transformed into the sequence 1, 8, 7, 9 by one bubble pass.  The numbers compared at each step are underlined.
Suppose that $n = 40$ , and that the terms of the initial sequence $r_1, r_2, \dots, r_{40}$ are distinct from one another and are in random order.  Let $p/q$ , in lowest terms, be the probability that the number that begins as $r_{20}$ will end up, after one bubble pass, in the $30^{\mbox{th}}$ place.  Find $p + q$

Solution:
If any of $r_1, \ldots, r_{19}$ is larger than $r_{20}$ , one of these numbers will be compared with $r_{20}$ on the 19th step of the first bubble pass and $r_{20}$ will be moved back to the 19th position.  Thus, $r_{20}$ must be the largest of the first 20 terms.  In addition, $r_{20}$ must be larger than $r_{21}, r_{22}, \ldots, r_{30}$ but smaller than $r_{31}$ in order that it move right to the 30th position but then not continue moving right to the 31st.
Thus, our problem can be restated: What is the probability that in a sequence of 31 distinct real numbers, the largest is in position 31 and the second-largest is in position 20 (the other 29 numbers are irrelevant)?
This is much easier to solve: there are $31!$ ways to order the first thirty-one numbers and $29!$ ways to arrange them so that the largest number is in the 31st position and the second-largest is in the 20th. This gives us a desired probability of $\frac{29!}{31!} = \frac{1}{31\cdot 30} = \frac{1}{930}$ , so the answer is $\boxed{931}$

Solution:
Note that you can solve the restated problem differently:
We see that the numerator is $1$ because there is only $1$ way to make the $31^{\text{st}}$ term the largest and the $20^{\text{th}}$ the second-largest. To calculate the denominator, we note that there are $31\times30$ ways to pick the largest term and the second-largest term. Therefore, our answer is $\boxed{931}$ .
~Yiyj1


Answer: 26.0

A gives $B$ as many cents as $B$ has and $C$ as many cents as $C$ has. Similarly, $B$ then gives $A$ and $C$ as many cents as each then has. $C$ , similarly, then gives $A$ and $B$ as many cents as each then has. If each finally has $16$ cents, with how many cents does $A$ start?
$\textbf{(A)}\ 24 \qquad \textbf{(B)}\ 26\qquad \textbf{(C)}\ 28 \qquad \textbf{(D)}\ 30 \qquad \textbf{(E)}\ 32$

Solution:
Let $a$ be number of cents $A$ originally had, $b$ be number of cents $B$ originally had, and $c$ be number of cents $C$ originally had.
After $A$ gave his money away, $A$ has $a-b-c$ cents, $B$ has $2b$ cents, and $C$ has $2c$ cents.
After $B$ gave his money away, $A$ has $2a-2b-2c$ cents, $B$ has $-a+3b-c$ cents, and $C$ has $4c$ cents.
After $C$ gave his money away, $A$ has $4a-4b-4c$ cents, $B$ has $-2a+6b-2c$ cents, and $C$ has $-a-b+7c$ cents.
Since all of them have $16$ cents in the end, we can write a system of equations \[4a-4b-4c=16\] \[-2a+6b-2c=16\] \[-a-b+7c=16\] Note that adding the three equation yields $a+b+c=48$ , so $4a+4b+4c=192$ .  Therefore, $8a=208$ , so $a = 26$ .  Solving for $a$ can also be done traditionally.
Thus, $A$ started out with $26$ cents, which is answer choice $\boxed{26}$

Solution: We know that people not giving away money on the previous turn now have twice what they previously had. Using the fact that the sum of their money is $48$ cents, we can work backward \[16,16,16\] \[8,8,32\] \[4,28,16\] \[26,14,8\] Thus at the beginning $A$ has $26\boxed{26}$ cents.


Answer: 10.0

A grocer makes a display of cans in which the top row has one can and each lower row has two more cans than the row above it. If the display contains $100$ cans, how many rows does it contain?
$\mathrm{(A)\ }5\qquad\mathrm{(B)\ }8\qquad\mathrm{(C)\ }9\qquad\mathrm{(D)\ }10\qquad\mathrm{(E)\ }11$

Solution: The sum of the first $n$ odd numbers is $n^2$ . As in our case $n^2=100$ , we have $n=\boxed{10}$


Answer: 10.0

Solution: The sum of the first $n$ odd numbers is $n^2$ . As in our case $n^2=100$ , we have $n=\boxed{10}$


Answer: 100.0

A grocer stacks oranges in a pyramid-like stack whose rectangular base is $5$ oranges by $8$ oranges.  Each orange above the first level rests in a pocket formed by four oranges below.  The stack is completed by a single row of oranges.  How many oranges are in the stack?
$\mathrm{(A) \ } 96 \qquad \mathrm{(B) \ } 98 \qquad \mathrm{(C) \ } 100 \qquad \mathrm{(D) \ } 101 \qquad \mathrm{(E) \ } 134$

Solution:
There are $5\times8=40$ oranges on the $1^{\text{st}}$ layer of the stack. The $2^{\text{nd}}$ layer that is added on top of the first will be a layer of $4\times7=28$ oranges.  When the third layer is added on top of the $2^{\text{nd}}$ , it will be a layer of $3\times6=18$ oranges, etc.
Therefore, there are $5\times8+4\times7+3\times6+2\times5+1\times4=40+28+18+10+4=100$ oranges in the stack. $\boxed{100}$


Answer: 1925.0

A group of $12$ pirates agree to divide a treasure chest of gold coins among themselves as follows.  The $k^{\text{th}}$ pirate to take a share takes $\frac{k}{12}$ of the coins that remain in the chest.  The number of coins initially in the chest is the smallest number for which this arrangement will allow each pirate to receive a positive whole number of coins.  How many coins does the $12^{\text{th}}$ pirate receive?
$\textbf{(A)}\ 720\qquad\textbf{(B)}\ 1296\qquad\textbf{(C)}\ 1728\qquad\textbf{(D)}\ 1925\qquad\textbf{(E)}\ 3850$

Solution:
Let $x$ be the number of coins.  After the $k^{\text{th}}$ pirate takes his share, $\frac{12-k}{12}$ of the original amount is left.  Thus, we know that
$x \cdot \frac{11}{12} \cdot \frac{10}{12} \cdot \frac{9}{12} \cdot \frac{8}{12} \cdot \frac{7}{12} \cdot \frac{6}{12} \cdot \frac{5}{12} \cdot \frac{4}{12} \cdot \frac{3}{12} \cdot \frac{2}{12} \cdot \frac{1}{12}$ must be an integer.  Simplifying, we get
$x \cdot \frac{11}{12} \cdot \frac{5}{6} \cdot \frac{1}{2}  \cdot \frac{7}{12} \cdot \frac{1}{2} \cdot \frac{5}{12} \cdot \frac{1}{3} \cdot \frac{1}{4} \cdot \frac{1}{6} \cdot \frac{1}{12}$ .  Now, the minimal $x$ is the denominator of this fraction multiplied out, obviously.  We mentioned before that this product must be an integer.  Specifically, it is an integer and it is the amount that the $12^{\text{th}}$ pirate receives, as he receives $\frac{12}{12} = 1 =$ all of what is remaining.
Thus, we know the denominator is canceled out, so the number of gold coins received is going to be the product of the numerators, $11 \cdot 5 \cdot 7 \cdot 5 = \boxed{1925}$

Solution:
Solution $1$ mentioned the expression $x \cdot \frac{11}{12} \cdot \frac{10}{12} \cdot ... \cdot \frac{1}{12}$ . Note that this is equivalent to $\frac{x \cdot 11!}{12^{11}}$
We can compute the amount of factors of $2$ $3$ $5$ , etc. but this is not necessary. To minimize this expression, we must take out factors of $2$ and $3$ , since $12^{11}=2^{22} \cdot 3^{11}$ $11!$ has neither $22$ factors of $2$ , nor $11$ factors of $3$ . This means that if $11!$ contains $a$ factors of $2$ , then $x$ will contain $22-a$ factors of $2$ . This also holds for factors of $3$
Thus, once simplified, the expression will have no factors of $2$ . It will also have no factors of $3$
Looking at the answer choices, there is only one answer which is not even, which is $\boxed{1925}$

Solution:
We know that the 11th pirate takes $\frac{11}{12}$ of what is left from the 10th pirate, so we have the 12th pirate taking \[\frac{12}{12}\cdot(1-\frac{11}{12})=1\cdot\frac{1}{12}\] of what is left from the 10th pirate. Similarly, since the 10th pirate takes $\frac{10}{12}$ of what is left from the 9th pirate, we have the 11th pirate taking \[\frac{11}{12}\cdot(1-\frac{10}{12})=\frac{11}{12}\cdot\frac{2}{12}\] of what is left from the 9th pirate. Thus, the 12th pirate takes \[1\cdot\frac{1}{12}\cdot\frac{2}{12}\] of what is left from the 9th pirate. Repeating the method, we can find that the 12th pirate takes \[1\cdot\frac{1}{12}\cdot\frac{2}{12}\cdot\frac{3}{12}\cdot...\cdot\frac{10}{12}\cdot\frac{11}{12}\] of what is left from the 1st pirate, or \[1\cdot\frac{1}{12}\cdot\frac{2}{12}\cdot\frac{3}{12}\cdot...\cdot\frac{10}{12}\cdot\frac{11}{12}\cdot\frac{12}{12}\] of the total amount of coins.
Now canceling out the denominator with the numerator as possible, we are left with $\frac{1\cdot5\cdot7\cdot5\cdot11}{...}=\frac{1925}{...}$ with some factors of 12 in the denominator. For this fraction to be an integer, the smallest possible number of coins is the same as the denominator, so the numerator is the number of coins taken by the 12th pirate, or $1925 \,\boxed{1925}$


Answer: 1925.0

A group of $12$ pirates agree to divide a treasure chest of gold coins among themselves as follows. The $k^\text{th}$ pirate to take a share takes $\frac{k}{12}$ of the coins that remain in the chest. The number of coins initially in the chest is the smallest number for which this arrangement will allow each pirate to receive a positive whole number of coins. How many coins does the $12^{\text{th}}$ pirate receive?
$\textbf{(A)} \ 720 \qquad  \textbf{(B)} \ 1296 \qquad  \textbf{(C)} \ 1728 \qquad  \textbf{(D)} \ 1925 \qquad  \textbf{(E)} \ 3850$

Solution:
The first pirate takes $\frac{1}{12}$ of the $x$ coins, leaving $\frac{11}{12} x$
The second pirate takes $\frac{2}{12}$ of the remaining coins, leaving $\frac{10}{12}\cdot   \frac{11}{12}*x$
Note that
$12^{11} = (2^2 \cdot 3)^{11} = 2^{22} \cdot 3^{11}$
$11! = 11 \cdot 10 \cdot 9 \cdot 8 \cdot 7 \cdot 6 \cdot 5 \cdot 4 \cdot 3 \cdot 2$
All the $2$ s and $3$ s cancel out of $11!$ , leaving
$11 \cdot 5 \cdot 7 \cdot 5 = 1925$
in the numerator.
We know there were just enough coins to cancel out the denominator in the fraction. So, at minimum, $x$ is the denominator, leaving $\boxed{1925}$ coins for the twelfth pirate.

Solution:
The answer cannot be an even number. Here is why:
Consider the highest power of 2 that divides the starting number of coins, and consider how this value changes as each pirate takes their share. At each step, the size of the pile is multiplied by some $\frac{n}{12}$ . This means the highest power of 2 that divides the number of coins is continually decreasing or staying the same (except once, briefly, when we multiply by $\frac{2}{3}$ for pirate 4, but it immediately drops again in the next step).
Therefore, if the 12th pirate's coin total were even, then it can't be the smallest possible value, because we can safely cut the initial pot (and all the intermediate totals) in half. We could continue halving the result until the 12th pirate's total is finally odd.
Only one of the choices given is odd, $\boxed{1925}$

Solution: Let $x$ be the number of coins the $12$ th pirate takes. Then the number of coins the $k<12$ th pirate takes is $\frac{12}{1} \cdot \frac{12}{2} \cdots \frac{12}{12-k} x$ . For all these to be an integer, we need the denominators to divide into the numerators. Looking at prime factors, obviously there are sufficient $2$ s and $3$ s, so we just need $5^2 \cdot 7 \cdot 11 = \boxed{1925}$ to divide into $x$ . -Frestho


Answer: 89.0

A group of children held a grape-eating contest. When the contest was over, the winner had eaten $n$ grapes, and the child in $k$ -th place had eaten $n+2-2k$ grapes. The total number of grapes eaten in the contest was $2009$ . Find the smallest possible value of $n$

Solution:
The total number of grapes eaten can be computed as the sum of the arithmetic progression with initial term $n$ (the number of grapes eaten by the child in $1$ -st place), difference $d=-2$ , and number of terms $c$ . We can easily compute that this sum is equal to $c(n-c+1)$
Hence we have the equation $2009=c(n-c+1)$ , and we are looking for a solution $(n,c)$ , where both $n$ and $c$ are positive integers, $n\geq 2(c-1)$ , and $n$ is minimized. (The condition $n\geq 2(c-1)$ states that even the last child had to eat a non-negative number of grapes.)
The prime factorization of $2009$ is $2009=7^2 \cdot 41$ . Hence there are $6$ ways how to factor $2009$ into two positive terms $c$ and $n-c+1$
The smallest valid solution is therefore $c=41$ $n=\boxed{089}$

Solution:
If the first child ate $n=2m$ grapes, then the maximum number of grapes eaten by all the children together is $2m + (2m-2) + (2m-4) + \cdots + 4 + 2 = m(m+1)$ . Similarly, if the first child ate $2m-1$ grapes, the maximum total number of grapes eaten is $(2m-1)+(2m-3)+\cdots+3+1 = m^2$
For $m=44$ the value $m(m+1)=44\cdot 45 =1980$ is less than $2009$ . Hence $n$ must be at least $2\cdot 44+1=89$ . For $n=89$ , the maximum possible sum is $45^2=2025$ . And we can easily see that $2009 = 2025 - 16 = 2025 - (1+3+5+7)$ , hence $2009$ grapes can indeed be achieved for $n=89$ by dropping the last four children.
Hence we found a solution with $n=89$ and $45-4=41$ kids, and we also showed that no smaller solution exists. Therefore the answer is $\boxed{089}$

Solution:
If the winner ate n grapes, then 2nd place ate $n+2-4=n-2$ grapes, 3rd place ate $n+2-6=n-4$ grapes, 4th place ate $n-6$ grapes, and so on. Our sum can be written as $n+(n-2)+(n-4)+(n-6)\dots$ . If there are x places, we can express this sum as $(x+1)n-x(x+1)$ , as there are $(x+1)$ occurrences of n, and $(2+4+6+\dots)$ is equal to $x(x+1)$ . This can be factored as $(x+1)(n-x)=2009$ . Our factor pairs are (1,2009), (7,287), and (41,49). To minimize n we take (41,49). If $x+1=41$ , then $x=40$ and $n=40+49=\boxed{089}$ . (Note we would have come upon the same result had we used $x+1=49$ .)
~MC413551


Answer: 5.0

A group of children riding on bicycles and tricycles rode past Billy Bob's house. Billy Bob counted $7$ children and $19$ wheels. How many tricycles were there?
$\mathrm{(A)}\ 2 \qquad\mathrm{(B)}\ 4 \qquad\mathrm{(C)}\ 5 \qquad\mathrm{(D)}\ 6 \qquad\mathrm{(E)}\ 7$

Solution: If all the children were riding bicycles, there would be $2 \times 7=14$ wheels. Each tricycle adds an extra wheel and $19-14=5$ extra wheels are needed, so there are $\boxed{5}$ tricycles.

Solution: Setting up an equation, we have $a+b=7$ children and $3a+2b=19$ . Solving for the variables, we get, $a=\boxed{5}$ tricycles.


Answer: 945.0

A group of clerks is assigned the task of sorting $1775$ files. Each clerk sorts at a constant rate of $30$ files per hour. At the end of the first hour, some of the clerks are reassigned to another task; at the end of the second hour, the same number of the remaining clerks are also reassigned to another task, and a similar assignment occurs at the end of the third hour. The group finishes the sorting in $3$ hours and $10$ minutes. Find the number of files sorted during the first one and a half hours of sorting.

Solution:
There are $x$ clerks at the beginning, and $t$ clerks are reassigned to another task at the end of each hour. So, $30x+30(x-t)+30(x-2t)+30\cdot\frac{10}{60} \cdot (x-3t)=1775$ , and simplify that we get $19x-21t=355$ .
Now the problem is to find a reasonable integer solution. Now we know $x= \frac{355+21t}{19}$ , so $19$ divides $355+21t$ , AND as long as $t$ is a integer, $19$ must divide $2t+355$ . Now, we suppose that $19m=2t+355$ , similarly we get $t=\frac{19m-355}{2}$ , and so in order to get a minimum integer solution for $t$ , it is obvious that $m=19$ works. So we get $t=3$ and $x=22$ .  One and a half hour's work should be $30x+15(x-t)$ , so the answer is $\boxed{945}$

Solution: We start with the same approach as solution 1 to get $19x-21t=355$ . Then notice that $21t + 355 \equiv 0 \pmod{19}$ , or $2t-6 \equiv 0 \pmod{19}$ , giving the smallest solution at $t=3$ . We find that $x=22$ . Then the number of files they sorted will be $30x+15(x-t)=660+285=\boxed{945}.$


Answer: 24.0

A group of frogs (called an army) is living in a tree. A frog turns green when in the shade and turns yellow
when in the sun. Initially, the ratio of green to yellow frogs was $3 : 1$ . Then $3$ green frogs moved to the
sunny side and $5$ yellow frogs moved to the shady side. Now the ratio is $4 : 1$ . What is the difference
between the number of green frogs and the number of yellow frogs now?
$\textbf{(A) } 10\qquad\textbf{(B) } 12\qquad\textbf{(C) } 16\qquad\textbf{(D) } 20\qquad\textbf{(E) } 24$

Solution:
Since the original ratio is $3:1$ and the new ratio is $4:1$ , the number of frogs must be a multiple of $12$ , the only solutions left are $(B)$ and $(E)$
Let's start with $12$ frogs:
We must have $9$ frogs in the shade and $3$ frogs in the sun. After the change, there would be $11$ frogs in the shade and $1$ frog in the sun, which is not a $4:1$ ratio.
Therefore the answer is: $\boxed{24}$


Answer: 10.0

A gumball machine contains $9$ red, $7$ white, and $8$ blue gumballs.  The least number of gumballs a person must buy to be sure of getting four gumballs of the same color is
$\text{(A)}\ 8 \qquad \text{(B)}\ 9 \qquad \text{(C)}\ 10 \qquad \text{(D)}\ 12 \qquad \text{(E)}\ 18$

Solution: If a person gets three gumballs of each of the three colors, that is, $9$ gumballs, then the $10^{\text{th}}$ gumball must be the fourth one for one of the colors. Therefore, the person must buy $\boxed{10}$ gumballs.


Answer: 30.0

A haunted house has six windows. In how many ways can
Georgie the Ghost enter the house by one window and leave
by a different window?
$\mathrm{(A)}\ 12 \qquad\mathrm{(B)}\ 15 \qquad\mathrm{(C)}\ 18 \qquad\mathrm{(D)}\ 30 \qquad\mathrm{(E)}\ 36$

Solution:
Georgie can enter the haunted house through any of the six windows. Then, he can leave through any of the remaining five windows.
So, Georgie has a total of $6 \cdot 5$ ways he can enter the house by one window and leave
by a different window.
Therefore, we have $\boxed{30}$ ways.


Answer: 409.0

A hexagon inscribed in a circle has three consecutive sides each of length 3 and three consecutive sides each of length 5.  The chord of the circle that divides the hexagon into two trapezoids, one with three sides each of length 3 and the other with three sides each of length 5, has length equal to $m/n$ , where $m$ and $n$ are relatively prime positive integers.  Find $m + n$
$\textbf{(A)}\ 309 \qquad \textbf{(B)}\ 349 \qquad \textbf{(C)}\ 369 \qquad \textbf{(D)}\ 389  \qquad \textbf{(E)}\ 409$

Solution:
All angle measures are in degrees.
Let the first trapezoid be $ABCD$ , where $AB=BC=CD=3$ .  Then the second trapezoid is $AFED$ , where $AF=FE=ED=5$ .  We look for $AD$
Since $ABCD$ is an isosceles trapezoid, we know that $\angle BAD=\angle CDA$ and, since $AB=BC$ , if we drew $AC$ , we would see $\angle BCA=\angle BAC$ .  Anyway, $\widehat{AB}=\widehat{BC}=\widehat{CD}$ $\widehat{AB}$ means arc AB).  Using similar reasoning, $\widehat{AF}=\widehat{FE}=\widehat{ED}$
Let $\widehat{AB}=2\phi$ and $\widehat{AF}=2\theta$ .  Since $6\theta+6\phi=360$ (add up the angles), $2\theta+2\phi=120$ and thus $\widehat{AB}+\widehat{AF}=\widehat{BF}=120$ .  Therefore, $\angle FAB=\frac{1}{2}\widehat{BDF}=\frac{1}{2}(240)=120$ $\angle CDE=120$ as well.
Now I focus on triangle $FAB$ .  By the Law of Cosines, $BF^2=3^2+5^2-30\cos{120}=9+25+15=49$ , so $BF=7$ .  Seeing $\angle ABF=\theta$ and $\angle AFB=\phi$ , we can now use the Law of Sines to get: \[\sin{\phi}=\frac{3\sqrt{3}}{14}\;\text{and}\;\sin{\theta}=\frac{5\sqrt{3}}{14}.\]
Now I focus on triangle $AFD$ $\angle AFD=3\phi$ and $\angle ADF=\theta$ , and we are given that $AF=5$ , so \[\frac{\sin{\theta}}{5}=\frac{\sin{3\phi}}{AD}.\] We know $\sin{\theta}=\frac{5\sqrt{3}}{14}$ , but we need to find $\sin{3\phi}$ .  Using various identities, we see \begin{align*}\sin{3\phi}&=\sin{(\phi+2\phi)}=\sin{\phi}\cos{2\phi}+\cos{\phi}\sin{2\phi}\\ &=\sin{\phi}(1-2\sin^2{\phi})+2\sin{\phi}\cos^2{\phi}\\ &=\sin{\phi}\left(1-2\sin^2{\phi}+2(1-\sin^2{\phi})\right)\\ &=\sin{\phi}(3-4\sin^2{\phi})\\ &=\frac{3\sqrt{3}}{14}\left(3-\frac{27}{49}\right)=\frac{3\sqrt{3}}{14}\left(\frac{120}{49}\right)=\frac{180\sqrt{3}}{343} \end{align*} Returning to finding $AD$ , we remember \[\frac{\sin{\theta}}{5}=\frac{\sin{3\phi}}{AD}\;\text{so}\;AD=\frac{5\sin{3\phi}}{\sin{\theta}}.\] Plugging in and solving, we see $AD=\frac{360}{49}$ . Thus, the answer is $360 + 49 = 409$ , which is answer choice $\boxed{409}$

Solution:
Note that minor arc $\overarc{AB}$ is a third of the circumference, therefore, $\angle AOB = 120^{\circ}$ . Major arc $\overarc{AB}$ $=240^{\circ}$ $\angle ACB = 120^{\circ}$
By the Law of Cosine, $AB = \sqrt{ 3^2 + 5^2 - 2 \cdot 3 \cdot 5 \cdot \cos 120^{\circ}} = \sqrt{ 9 + 25 + 15 } = 7$
$\frac{\angle AOB}{2} = 60^{\circ}$ , therefore, $r = \frac{\frac{AB}{2}}{\sin 60^{\circ}} = \frac{\frac{7}{2}}{ \frac{\sqrt{3}}{2} } = \frac{7\sqrt{3}}{3}$
$\sin \frac{\theta}{2} = \frac{\frac32}{r} = \frac{3}{2r} = \frac{3}{2 \cdot \frac{7\sqrt{3}}{3}} = \frac{3 \sqrt{3}}{14}$
Let $x$ be the length of the chord, $\sin \frac{3 \theta}{2} = \frac{\frac{x}{2}}{r}$
By the triple angle formula, $\sin \frac{3 \theta}{2} = 3 \cdot \sin \frac{\theta}{2} - 4 \cdot \sin(\frac{ \theta}{2})^3 = 3 \cdot \frac{3 \sqrt{3}}{14} - 4 \cdot (\frac{3 \sqrt{3}}{14})^3$
$x = 2 \cdot \frac{7\sqrt{3}}{3} \cdot [3 \cdot \frac{3 \sqrt{3}}{14} - 4 \cdot (\frac{3 \sqrt{3}}{14})^3] = 2 \cdot \frac{7\sqrt{3}}{3} \cdot (\frac{9\sqrt{3}}{14} - \frac{82\sqrt{3}}{2 \cdot 7^3}) = 9 - \frac{81}{49} = \frac{360}{49}$
Therefore, the answer is $\boxed{409}$

Solution:
Note that minor arc $\overarc{AB}$ is a third of the circumference, therefore, $\angle AOB = 120^{\circ}$
$\sin \frac{\alpha}{2} = \frac{\frac32}{r}$ $\sin \frac{\alpha}{2} = \frac{3}{2r}$
$\sin \frac{120^{\circ}-\alpha}{2} = \frac{\frac52}{r}$ $\sin (60^{\circ} - \frac{\alpha}{2}) = \frac{5}{2r}$
$\frac{\sin \frac{\alpha}{2}}{\sin (60^{\circ} - \frac{\alpha}{2}) } = \frac{\frac{3}{2r}}{\frac{5}{2r}} = \frac35$ $5 \cdot \sin \frac{\alpha}{2} = 3 \cdot \sin (60^{\circ} - \frac{\alpha}{2})$
$5 \cdot \sin \frac{\alpha}{2} = 3 ( \sin 60^{\circ} \cos \frac{\alpha}{2} - \sin \frac{\alpha}{2} \cos 60^{\circ}) = 3 ( \frac{\sqrt{3}}{2} \cdot \cos \frac{\alpha}{2} - \frac12 \cdot \sin \frac{\alpha}{2})$
$13 \cdot \sin \frac{\alpha}{2} = \frac{3\sqrt{3}}{2} \cdot \cos \frac{\alpha}{2}$
Let $\sin \frac{\alpha}{2} = a$ $\cos \frac{\alpha}{2} = \sqrt{1-a^2}$ $13a = \frac{3\sqrt{3}}{2} \cdot  \sqrt{1-a^2}$
$169a^2 = 27-27a^2$ $196a^2=27$ $\sin \frac{\alpha}{2} = a = \sqrt{\frac{27}{196}} = \frac{3 \sqrt{3}}{14}$
Let $x$ be the length of the chord, $\sin \frac{3 \alpha}{2} = \frac{\frac{x}{2}}{r}$
By the triple angle formula, $\sin \frac{3 \alpha}{2} = 3 \cdot \sin \frac{\alpha}{2} - 4 \cdot \sin(\frac{ \alpha}{2})^3 = 3 \cdot \frac{3 \sqrt{3}}{14} - 4 \cdot (\frac{3 \sqrt{3}}{14})^3$
$x = 2 \cdot \frac{7\sqrt{3}}{3} \cdot [3 \cdot \frac{3 \sqrt{3}}{14} - 4 \cdot (\frac{3 \sqrt{3}}{14})^3] = 2 \cdot \frac{7\sqrt{3}}{3} \cdot (\frac{9\sqrt{3}}{14} - \frac{82\sqrt{3}}{2 \cdot 7^3}) = 9 - \frac{81}{49} = \frac{360}{49}$
Therefore, the answer is $\boxed{409}$

Solution:
Note that major arc $\overarc{AE}$ is two thirds of the circumference, therefore, $\angle AFE = 120^{\circ}$
By the Law of Cosine, $AE= \sqrt{ 3^2 + 5^2 - 2 \cdot 3 \cdot 5 \cdot \cos 120^{\circ}} = \sqrt{ 9 + 25 + 15 } = 7$
By the Ptolemy's theorem of quadrilateral $ABDE$ $AD \cdot BE = AB \cdot DE + BD \cdot AE$ $AD = BE$ $AD^2= 3 \cdot 5 + 7^2 = 64$ $AD = 8$
By the Ptolemy's theorem of quadrilateral $ABCD$ $AC \cdot BD = BC \cdot AD + AB \cdot CD$ $7AC = 3 \cdot 8 + 3 \cdot 5 = 39$ $AC = \frac{39}{7}$
By the Ptolemy's theorem of quadrilateral $ABCF$ $AC \cdot BF = AB \cdot CF + BC \cdot AF$ $AC = BF$ $(\frac{39}{7})^2 = 3 \cdot CF + 3 \cdot 3$ $CF = \frac{360}{49}$
Therefore, the answer is $\boxed{409}$


Answer: 409.0

Solution:
In hexagon $ABCDEF$ , let $AB=BC=CD=3$ and let $DE=EF=FA=5$ . Since arc $BAF$ is one third of the circumference of the circle, it follows that $\angle BCF = \angle BEF=60^{\circ}$ . Similarly, $\angle CBE =\angle CFE=60^{\circ}$ . Let $P$ be the intersection of $\overline{BE}$ and $\overline{CF}$ $Q$ that of $\overline{BE}$ and $\overline{AD}$ , and $R$ that of $\overline{CF}$ and $\overline{AD}$ . Triangles $EFP$ and $BCP$ are equilateral, and by symmetry, triangle $PQR$ is isosceles and thus also equilateral.
Furthermore, $\angle BAD$ and $\angle BED$ subtend the same arc, as do $\angle ABE$ and $\angle ADE$ . Hence triangles $ABQ$ and $EDQ$ are similar. Therefore, \[\frac{AQ}{EQ}=\frac{BQ}{DQ}=\frac{AB}{ED}=\frac{3}{5}.\] It follows that \[\frac{\frac{AD-PQ}{2}}{PQ+5} =\frac{3}{5}\quad \mbox {and}\quad \frac{3-PQ}{\frac{AD+PQ}{2}}=\frac{3}{5}.\] Solving the two equations simultaneously yields $AD=360/49,$ so $m+n=\boxed{409}. \blacksquare$


Answer: 272.0

A hexagon that is inscribed in a circle has side lengths $22$ $22$ $20$ $22$ $22$ , and $20$ in that order. The radius of the circle can be written as $p+\sqrt{q}$ , where $p$ and $q$ are positive integers. Find $p+q$

Solution:
Let us call the hexagon $ABCDEF$ , where $AB=CD=DE=AF=22$ , and $BC=EF=20$ .
We can just consider one half of the hexagon, $ABCD$ , to make matters simpler.
Draw a line from the center of the circle, $O$ , to the midpoint of $BC$ $X$ . Now, draw a line from $O$ to the midpoint of $AB$ $Y$ . Clearly, $\angle BXO=90^{\circ}$ , because $BO=CO$ , and $\angle BYO=90^{\circ}$ , for similar reasons. Also notice that $\angle AOX=90^{\circ}$ .
Let us call $\angle BOY=\theta$ . Therefore, $\angle AOB=2\theta$ , and so $\angle BOX=90-2\theta$ . Let us label the radius of the circle $r$ . This means \[\sin{\theta}=\frac{BY}{r}=\frac{11}{r}\] \[\sin{(90-2\theta)}=\frac{BX}{r}=\frac{10}{r}\] Now we can use simple trigonometry to solve for $r$ .
Recall that $\sin{(90-\alpha)}=\cos(\alpha)$ : That means $\sin{(90-2\theta)}=\cos{2\theta}=\frac{10}{r}$ .
Recall that $\cos{2\alpha}=1-2\sin^2{\alpha}$ : That means $\cos{2\theta}=1-2\sin^2{\theta}=\frac{10}{r}$ .
Let $\sin{\theta}=x$ .
Substitute to get $x=\frac{11}{r}$ and $1-2x^2=\frac{10}{r}$ Now substitute the first equation into the second equation: $1-2\left(\frac{11}{r}\right)^2=\frac{10}{r}$ Multiplying both sides by $r^2$ and reordering gives us the quadratic \[r^2-10r-242=0\] Using the quadratic equation to solve, we get that $r=5+\sqrt{267}$ (because $5-\sqrt{267}$ gives a negative value), so the answer is $5+267=\boxed{272}$

Solution: Using the trapezoid $ABCD$ mentioned above, draw an altitude of the trapezoid passing through point $B$ onto $AD$ at point $J$ . Now, we can use the pythagorean theorem: $(22^2-(r-10)^2)+10^2=r^2$ . Expanding and combining like terms gives us the quadratic \[r^2-10r-242=0\] and solving for $r$ gives $r=5+\sqrt{267}$ . So the solution is $5+267=\boxed{272}$

Solution:
Join the diameter of the circle $AD$ and let the length be $d$ . By Ptolemy's Theorem on trapezoid $ADEF$ $(AD)(EF) + (AF)(DE) = (AE)(DF)$ . Since it is an isosceles trapezoid, both diagonals are equal. Let them be equal to $x$ each. Then
\[20d + 22^2 = x^2\]
Since $\angle AED$ is subtended by the diameter, it is right. Hence by the Pythagorean Theorem with right $\triangle AED$
\[(AE)^2 + (ED)^2 = (AD)^2\] \[x^2 + 22^2 = d^2\]
From the above equations, we have: \[x^2 = d^2 - 22^2 = 20d + 22^2\] \[d^2 - 20d = 2\times22^2\] \[d^2 - 20d + 100 = 968+100 = 1068\] \[(d-10) = \sqrt{1068}\] \[d = \sqrt{1068} + 10 = 2\times(\sqrt{267}+5)\]
Since the radius is half the diameter, it is $\sqrt{267}+5$ , so the answer is $5+267 \Rightarrow \boxed{272}$

Solution: As we can see this image, it is symmetrical hence the diameter divides the hexagon into two congruent quadrilateral. Now we can apply the Ptolemy's theorem. Denote the radius is r, we can get \[22*2x+440=\sqrt{4x^2-400}\sqrt{4x^2-484}\] , after simple factorization, we can get \[x^4-342x^2-2420x=0\] , it is easy to see that $x=-10, x=0$ are two solutions for the equation, so we can factorize that into \[x(x+10)(x^2-10x-242)\] so we only need to find the solution for \[x^2-10x-242=0\] and we can get $x=(\sqrt{267}+5)$ is the desired answer for the problem, and our answer is $5+267 \Rightarrow \boxed{272}$ .～bluesoul

Solution: Using solution 1's diagram, extend line segments $AB$ and $CD$ upwards until they meet at point $G$ . Let point $O$ be the center of the hexagon. By the $AA$ postulate, $\Delta ADG \sim \Delta BCG \sim \Delta CDO$ . This means $\frac{DC}{AD} = \frac{22}{2r} = \frac{CO}{AG}$ , so $AG = r \times \frac{2r}{22} = \frac{r^2}{11}$ . We then solve for $AB$ \[\frac{AD-BC}{AD} = \frac{2r-20}{2r} = \frac{AB}{AG}\] \[AB = \frac{r^2}{11} \times \frac{2r-20}{2r} = \frac{r^2-10r}{11}\] Remember that $AB=22$ as well, so $22 = \frac{r^2-10r}{11} \Rightarrow r^2-10r-242=0$ . Solving for $r$ gives $r=5+\sqrt{267}$ . So the solution is $5+267=\boxed{272}$

Solution: Let $\angle{AOB} = \theta$ . So, we have $\sin \dfrac{\theta}{2} = \dfrac{11}{r}$ and $\cos \dfrac{\theta}{2} = \dfrac{\sqrt{r^{2} - 121}}{r}$ . So, $\sin \theta = 2 \sin \dfrac{\theta}{2} \cos \dfrac{\theta}{2} = \dfrac{22 \sqrt{r^{2} - 121}}{r^{2}}$ . Let $H$ be the foot of the perpendicular from $B$ to $\overline{AD}$ . We have $BF = 2 BH = 2 r \sin \theta = \dfrac{44 \sqrt{r^{2} - 121}}{r}$ . Using Pythagorean theorem on $\triangle BCF$ , to get $(\dfrac{44 \sqrt{r^{2} - 121}}{r})^{2} + 20^{2} = (2r)^{2}$ , or $\dfrac{44^{2}r^{2} - 44^{2} \cdot 121}{r^{2}} + 20^{2} = 4r^{4}$ . Multiplying by $r^{2}$ , we get $44^{2} r^{2} - 44^{2} \cdot 121 + 20^{2} r^{2} = 4r^{4}$ . Rearranging and simplifying, we get a quadratic in $r^{2}$ \[r^{4} - 584r^{2} + 242^{2} = 0 \text\] which gives us $r^{2} = 292 \pm 10\sqrt{267}$ . Because $r$ is in the form $p + \sqrt{q}$ , we know to choose the larger option, meaning $r^2 = 292 + 10\sqrt{267}$ , so $p\sqrt{q} = 5\sqrt{267}$ and $p^2 + q = 292$ . By inspection, we get $(p, q) = (5, 267)$ , so our answer is $5 + 267 = \boxed{272}$

Solution:
We know that $AD=x$ is a diameter, hence $ABD$ and $ACD$ are right triangles. Let $AB=BC=22$ , and $CD=20.$ Hence, $ABD$ is a right triangle with legs $22,\sqrt{x^2-484},$ and hypotenuse, $x,$ and $ACD$ is a right triangle with legs $20, \sqrt{x^2-400},$ with hypotenuse $x$ . By Ptolemy's we have \[22(x+20)=\sqrt{x^2-400}\sqrt{x^2-484}\] .
We square both sides to get \[484(x+20)^2=(x^2-400)(x^2-484) \implies 484(x+20)=(x-20)(x^2-484) \implies 484x=x^3-20x^2-484x \implies x(x^2-20x-968)=0\]
We solve for $x$ via the Quadratic Formula and receive $x=10+2\sqrt{267}$ , but we must divide by $2$ since we want the radius, and hence $267+5=\boxed{272}.$ ~SirAppel


Answer: 34.0

A high school basketball game between the Raiders and Wildcats was tied at the end of the first quarter. The number of points scored by the Raiders in each of the four quarters formed an increasing geometric sequence, and the number of points scored by the Wildcats in each of the four quarters formed an increasing arithmetic sequence. At the end of the fourth quarter, the Raiders had won by one point. Neither team scored more than $100$ points. What was the total number of points scored by the two teams in the first half?
$\textbf{(A)}\ 30 \qquad \textbf{(B)}\ 31 \qquad \textbf{(C)}\ 32 \qquad \textbf{(D)}\ 33 \qquad \textbf{(E)}\ 34$

Solution:
Let $a,ar,ar^{2},ar^{3}$ be the quarterly scores for the Raiders. We know $r > 1$ because the sequence is said to be increasing. We also know that each of $a, ar, ar^2, ar^3$ is an integer. We start by showing that $r$ must also be an integer.
Suppose not, and say $r = m/n$ where $m>n>1$ , and $\gcd(m,n)=1$ . Then $n, n^2, n^3$ must all divide $a$ so $a=n^3k$ for some integer $k$ . Then $S_R = n^3k + n^2mk + nm^2k + m^3k < 100$ and we see that even if $k=1$ and $n=2$ , we get $m < 4$ , which means that the only option for $r$ is $r=3/2$ . A quick check shows that even this doesn't work. Thus $r$ must be an integer.
Let $a, a+d, a+2d, a+3d$ be the quarterly scores for the Wildcats. Let $S_W = a+(a+d) + (a+2d)+(a+3d) = 4a+6d$ . Let $S_R = a+ar+ar^2+ar^3 = a(1+r)(1+r^2)$ . Then $S_R<100$ implies that $r<5$ , so $r\in \{2, 3, 4\}$ . The Raiders win by one point, so \[a(1+r)(1+r^2) = 4a+6d+1.\]
Then the quarterly scores for the Raiders are $5, 10, 20, 40$ , and those for the Wildcats are $5, 14, 23, 32$ . Also $S_R = 75 = S_W + 1$ . The total number of points scored by the two teams in the first half is $5+10+5+14=\boxed{34}$

Solution:
Let $a,ar,ar^{2},ar^{3}$ be the quarterly scores for the Raiders. We know that the Raiders and Wildcats both scored the same number of points in the first quarter so let $a,a+d,a+2d,a+3d$ be the quarterly scores for the Wildcats. The sum of the Raiders scores is $a(1+r+r^{2}+r^{3})$ and the sum of the Wildcats scores is $4a+6d$ . Now we can narrow our search for the values of $a,d$ , and $r$ . Because points are always measured in positive integers, we can conclude that $a$ and $d$ are positive integers. We can also conclude that $r$ is a positive integer by writing down the equation:
\[a(1+r+r^{2}+r^{3})=4a+6d+1\]
Now we can start trying out some values of $r$ . We try $r=2$ , which gives
\[15a=4a+6d+1\]
\[11a=6d+1\]
We need the smallest multiple of $11$ (to satisfy the <100 condition) that is $\equiv 1 \pmod{6}$ . We see that this is $55$ , and therefore $a=5$ and $d=9$
So the Raiders' first two scores were $5$ and $10$ and the Wildcats' first two scores were $5$ and $14$
\[5+10+5+14=34 \longrightarrow \boxed{34}\]


Answer: 34.0

Solution:
Let $a,ar,ar^{2},ar^{3}$ be the quarterly scores for the Raiders. We know $r > 1$ because the sequence is said to be increasing. We also know that each of $a, ar, ar^2, ar^3$ is an integer. We start by showing that $r$ must also be an integer.
Suppose not, and say $r = m/n$ where $m>n>1$ , and $\gcd(m,n)=1$ . Then $n, n^2, n^3$ must all divide $a$ so $a=n^3k$ for some integer $k$ . Then $S_R = n^3k + n^2mk + nm^2k + m^3k < 100$ and we see that even if $k=1$ and $n=2$ , we get $m < 4$ , which means that the only option for $r$ is $r=3/2$ . A quick check shows that even this doesn't work. Thus $r$ must be an integer.
Let $a, a+d, a+2d, a+3d$ be the quarterly scores for the Wildcats. Let $S_W = a+(a+d) + (a+2d)+(a+3d) = 4a+6d$ . Let $S_R = a+ar+ar^2+ar^3 = a(1+r)(1+r^2)$ . Then $S_R<100$ implies that $r<5$ , so $r\in \{2, 3, 4\}$ . The Raiders win by one point, so \[a(1+r)(1+r^2) = 4a+6d+1.\]
Then the quarterly scores for the Raiders are $5, 10, 20, 40$ , and those for the Wildcats are $5, 14, 23, 32$ . Also $S_R = 75 = S_W + 1$ . The total number of points scored by the two teams in the first half is $5+10+5+14=\boxed{34}$

Solution:
Let $a,ar,ar^{2},ar^{3}$ be the quarterly scores for the Raiders. We know that the Raiders and Wildcats both scored the same number of points in the first quarter so let $a,a+d,a+2d,a+3d$ be the quarterly scores for the Wildcats. The sum of the Raiders scores is $a(1+r+r^{2}+r^{3})$ and the sum of the Wildcats scores is $4a+6d$ . Now we can narrow our search for the values of $a,d$ , and $r$ . Because points are always measured in positive integers, we can conclude that $a$ and $d$ are positive integers. We can also conclude that $r$ is a positive integer by writing down the equation:
\[a(1+r+r^{2}+r^{3})=4a+6d+1\]
Now we can start trying out some values of $r$ . We try $r=2$ , which gives
\[15a=4a+6d+1\]
\[11a=6d+1\]
We need the smallest multiple of $11$ (to satisfy the <100 condition) that is $\equiv 1 \pmod{6}$ . We see that this is $55$ , and therefore $a=5$ and $d=9$
So the Raiders' first two scores were $5$ and $10$ and the Wildcats' first two scores were $5$ and $14$
\[5+10+5+14=34 \longrightarrow \boxed{34}\]


Answer: 79.0

A hotel packed breakfast for each of three guests. Each breakfast should have consisted of three types of rolls, one each of nut, cheese, and fruit rolls. The preparer wrapped each of the nine rolls and once wrapped, the rolls were indistinguishable from one another. She then randomly put three rolls in a bag for each of the guests. Given that the probability each guest got one roll of each type is $\frac mn,$ where $m$ and $n$ are relatively prime integers , find $m+n.$

Solution:
Use construction . We need only calculate the probability the first and second person all get a roll of each type, since then the rolls for the third person are determined.
Our answer is thus $\frac{9}{28} \cdot \frac{2}{5} = \frac{9}{70}$ , and $m + n = \boxed{79}$

Solution: Call the three different types of rolls as A, B, and C. We need to arrange 3As, 3Bs, and 3Cs in a string such that A, B, and C appear in the first three, second three, and the third three like ABCABCABC or BCABACCAB. This can occur in $\left(\frac{3!}{1!1!1!}\right)^3 = 6^3 = 216$ different manners. The total number of possible strings is $\frac{9!}{3!3!3!} = 1680$ . The solution is therefore $\frac{216}{1680} = \frac{9}{70}$ , and $m + n = \boxed{79}$

Solution:
The denominator of m/n is equal to the total amount of possible roll configurations given to the three people. This is equal to ${9 \choose 3}{6 \choose3}$ as the amount of ways to select three rolls out of 9 to give to the first person is ${9 \choose 3}$ , and three rolls out of 6 is ${6 \choose3}$ . After that, the three remaining rolls have no more configurations.
The numerator is the amount of ways to give one roll of each type to each of the three people, which can be done by defining the three types of rolls as x flavored, y flavored, and z flavored.
xxx, yyy, zzz
So you have to choose one x, one y, and one z to give to the first person. There are 3 xs, 3 ys, and 3 zs to select from, giving $3^3$ combinations. Multiply that by the combinations of xs, ys, and zs for the second person, which is evidently $2^3$ since there are two of each letter left.
$(27*8)/{9 \choose 3}{6 \choose3}$ simplifies down to our fraction m/n, which is $9/70$ . Adding them up gives $9 + 70 = \boxed{79}$


Answer: 1000.0

A house and store were sold for $\textdollar 12,000$ each. The house was sold at a loss of $20\%$ of the cost, and the store at a gain of $20\%$ of the cost. The entire transaction resulted in:
$\textbf{(A) \ }\text{no loss or gain}  \qquad \textbf{(B) \ }\text{loss of }\textdollar 1000 \qquad \textbf{(C) \ }\text{gain of }\textdollar 1000 \qquad \textbf{(D) \ }\text{gain of }\textdollar 2000 \qquad \textbf{(E) \ }\text{none of these}$

Solution: Denote the original price of the house and the store as $h$ and $s$ , respectively. It is given that $\frac{4h}{5}=\textdollar 12,000$ , and that $\frac{6s}{5}=\textdollar 12,000$ . Thus, $h=\textdollar 15,000$ $s=\textdollar10,000$ , and $h+s=\textdollar25,000$ . This value is $\textdollar1000$ higher than the current price of the property, $2\cdot \textdollar12,000$ . Hence, the transaction resulted in a $\boxed{1000}$


Answer: 42.0

A jar contains $5$ different colors of gumdrops. $30\%$ are blue, $20\%$ are brown, $15\%$ are red, $10\%$ are yellow, and other $30$ gumdrops are green. If half of the blue gumdrops are replaced with brown gumdrops, how many gumdrops will be brown?
$\textbf{(A)}\ 35\qquad\textbf{(B)}\ 36\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 64$

Solution: We do $100-30-20-15-10$ to find the percent of gumdrops that are green. We find that $25\%$ of the gumdrops are green. That means there are $120$ gumdrops. If we replace half of the blue gumdrops with brown gumdrops, then $15\%$ of the jar's gumdrops are brown. $\dfrac{35}{100} \cdot 120=42 \Rightarrow \boxed{42}$


Answer: 441.0

A jar has $10$ red candies and $10$ blue candies. Terry picks two candies at random, then Mary picks two of the remaining candies at random. Given that the probability that they get the same color combination, irrespective of order, is $m/n,$ where $m$ and $n$ are relatively prime positive integers , find $m+n.$

Solution:
The probability that Terry picks two red candies is $\frac{10 \cdot 9}{20 \cdot 19} = \frac{9}{38}$ , and the probability that Mary picks two red candies after Terry chooses two red candies is $\frac{7\cdot8}{18\cdot17} = \frac{28}{153}$ .  So the probability that they both pick two red candies is $\frac{9}{38} \cdot \frac{28}{153} = \frac{14}{323}$ .  The same calculation works for the blue candies.
The probability that Terry picks two different candies is $\frac{20\cdot10}{20\cdot19} = \frac{10}{19}$ , and the probability that Mary picks two different candies after Terry picks two different candies is $\frac{18\cdot 9}{18\cdot 17} = \frac{9}{17}$ . Thus, the probability that they both choose two different candies is $\frac{10}{19}\cdot\frac{9}{17} = \frac{90}{323}$ .  Then the total probability is
\[2 \cdot \frac{14}{323} + \frac{90}{323} = \frac{118}{323}\]
and so the answer is $118 + 323 = \boxed{441}$


Answer: 1500.0

A lake contains $250$ trout, along with a variety of other fish. When a marine biologist catches and releases a sample of $180$ fish from the lake, $30$ are identified as trout. Assume that the ratio of trout to the total number of fish is the same in both the sample and the lake. How many fish are there in the lake?
$\textbf{(A)}\ 1250 \qquad \textbf{(B)}\ 1500 \qquad \textbf{(C)}\ 1750 \qquad \textbf{(D)}\ 1800 \qquad \textbf{(E)}\ 2000$

Solution: Note that \[\frac{\text{number of trout}}{\text{total number of fish}} = \frac{30}{180} = \frac16.\] So, the total number of fish is $6$ times the number of trout. Since the lake contains $250$ trout, there are $250\cdot6=\boxed{1500}$ fish in the lake.


Answer: 342.0

A large bag of coins contains pennies, dimes and quarters. There are twice as many dimes as pennies and three times as many quarters as dimes. An amount of money which could be in the bag is
$\mathrm{(A)\ } $306 \qquad \mathrm{(B) \ }  $333 \qquad \mathrm{(C)\ } $342 \qquad \mathrm{(D) \  }  $348 \qquad \mathrm{(E) \  }  $360$

Solution:
If there are $x$ pennies in the bag, then there are $2x$ dimes and $3(2x) = 6x$ quarters. Since pennies are $$0.01$ , dimes are $$0.10$ , and quarters are $$0.25$ , the total amount of money in the bag is \[$ \left(0.01x+(0.10)(2x)+(0.25)(6x)\right) = $1.71x.\] Therefore, the possible amounts of money are precisely the integer multiples of $$1.71$
Since the answer choices are all integer numbers of dollars, we multiply by $100$ to deduce that the answer must be an integer multiple of $$171$ . The only such multiple among the answer choices is $$(2 \cdot 171) = \boxed{342}$


Answer: 350.0

A large candle is $119$ centimeters tall.  It is designed to burn down more quickly when it is first lit and more slowly as it approaches its bottom.  Specifically, the candle takes $10$ seconds to burn down the first centimeter from the top, $20$ seconds to burn down the second centimeter, and $10k$ seconds to burn down the $k$ -th centimeter.  Suppose it takes $T$ seconds for the candle to burn down completely.  Then $\tfrac{T}{2}$ seconds after it is lit, the candle's height in centimeters will be $h$ .  Find $10h$

Solution: We find that $T=10(1+2+\cdots +119)$ . From Gauss's formula, we find that the value of $T$ is $10(7140)=71400$ . The value of $\frac{T}{2}$ is therefore $35700$ . We find that $35700$ is $10(3570)=10\cdot \frac{k(k+1)}{2}$ , so $3570=\frac{k(k+1)}{2}$ . As a result, $7140=k(k+1)$ , which leads to $0=k^2+k-7140$ . We notice that $k=84$ , so the answer is $10(119-84)=\boxed{350}$


Answer: 19.0

A large cube is formed by stacking 27 unit cubes. A plane is perpendicular to one of the internal diagonals of the large cube and bisects that diagonal. The number of unit cubes that the plane intersects is
$\mathrm{(A) \ 16 } \qquad \mathrm{(B) \ 17 } \qquad \mathrm{(C) \ 18 } \qquad \mathrm{(D) \ 19 } \qquad \mathrm{(E) \ 20 }$

Solution:
Place the cube so that its space diagonal is perpendicular to the ground. The space diagonal has length of $3\sqrt{3}$ , the altitude of the top vertex of the newly placed cube is $3\sqrt{3}$ . The plane perpendicular and bisecting the space diagonal is now parallel to the ground and also bisecting the space diagonal into $\frac{3\sqrt{3}}{2}$ , so that the height of the plane is $\frac{3\sqrt{3}}{2}$
By symmetry, the space diagonal is trisected by the pyramid at the top of the cube and the pyramid at the bottom of the cube.
We can prove that the space diagonal is trisected. Let the altitude of the pyramid at the top of the cube be $h$ . The base of the pyramid is an equilateral triangle with side length of $\sqrt{3^2+3^2}=3\sqrt{2}$ . The height of the triangle is $\frac{ \sqrt{3} }{2} \cdot 3\sqrt{2}$ . The distance of the center of the triangle to the vertex is $\frac23 \cdot \frac{ \sqrt{3} }{2} \cdot 3\sqrt{2} = \sqrt {6}$ . Therefore, $h = \sqrt{3^2-(\sqrt {6})^2} = \sqrt{9-6}=\sqrt{3}$ . The altitude of the pyramid at the bottom of the cube is also $h$ . The altitude in the middle is $3\sqrt{3}-\sqrt{3}-\sqrt{3}=\sqrt{3}$
The altitude of the vertex at the top is $3\sqrt{3}$ . The altitude of the second highest $3$ vertices are all $2\sqrt{3}$ . The altitude of the third highest $3$ vertices are all $\sqrt{3}$ . The altitude of the bottom-most vertex is $0$
By scale, for the unit cube, place the cube so that its space diagonal is perpendicular to the ground. The altitude of the vertex at the top is $\sqrt{3}$ . The altitude of the second highest $3$ vertices are all $\frac{2\sqrt{3}}{3}$ . The altitude of the third highest $3$ vertices are all $\frac{\sqrt{3}}{3}$ . The altitude of the bottom-most vertex is $0$
The length of the space diagonal of a unit cube is $\sqrt{3}$ . The highest vertex of the bottom-most unit cube has an altitude of $\sqrt{3}$ . As $\sqrt{3} < \frac{3\sqrt{3}}{2}$ , therefore, the plane will not pass through the unit cube at the bottom.
For the next $3$ cubes from the bottom, the altitude of their highest vertex is $\frac{\sqrt{3}}{3} + \sqrt{3} = \frac{4\sqrt{3}}{3}$ . As $\frac{4\sqrt{3}}{3} < \frac{3\sqrt{3}}{2}$ , therefore, the plane will not pass through the next $3$ unit cubes.
For the next $3$ cubes from the bottom, the altitude of their highest vertex is $\frac{2\sqrt{3}}{3} + \frac{\sqrt{3}}{3} = \frac{5\sqrt{3}}{3}$ . As $\frac{5\sqrt{3}}{3} > \frac{3\sqrt{3}}{2}$ , therefore, the plane will pass through the next $3$ unit cubes.
So at the bottom half of the cube, there are only $1+3 = 4$ unit cubes that the plane does not passes through. By symmetry, the plane will not pass through $4$ unit cubes at the top half of the cube.
Thus, the plane does not pass through $4+4 = 8$ unit cubes, it passes through $27-8=\boxed{19}$ unit cubes.


Answer: 19.0

Solution:
Place one corner of the cube at the origin of the coordinate system so that its sides are parallel to the axes.
Now consider the diagonal from $(0,0,0)$ to $(3,3,3)$ . The midpoint of this diagonal is at $\left(\frac 32,\frac 32,\frac 32\right)$ . The plane that passes through this point and is orthogonal to the diagonal has the equation $x+y+z=\frac 92$
The unit cube with opposite corners at $(x,y,z)$ and $(x+1,y+1,z+1)$ is intersected by this plane if and only if $x+y+z < \frac 92 < (x+1)+(y+1)+(z+1)=(x+y+z)+3$ . Therefore the cube is intersected by this plane if and only if $x+y+z\in\{2,3,4\}$
There are six cubes such that $x+y+z=2$ : permutations of $(1,1,0)$ and $(2,0,0)$ Symmetrically, there are six cubes such that $x+y+z=4$ Finally, there are seven cubes such that $x+y+z=3$ : permutations of $(2,1,0)$ and the central cube $(1,1,1)$
That gives a total of $\boxed{19}$ intersected cubes.


Answer: 1507509.0

A large equilateral triangle is constructed by using toothpicks to create rows of small equilateral triangles. For example, in the figure, we have $3$ rows of small congruent equilateral triangles, with $5$ small triangles in the base row.  How many toothpicks would be needed to construct a large equilateral triangle if the base row of the triangle consists of $2003$ small equilateral triangles?
[asy] unitsize(15mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); pair Ap=(0,0), Bp=(1,0), Cp=(2,0), Dp=(3,0), Gp=dir(60); pair Fp=shift(Gp)*Bp, Ep=shift(Gp)*Cp; pair Hp=shift(Gp)*Gp, Ip=shift(Gp)*Fp; pair Jp=shift(Gp)*Hp; pair[] points={Ap,Bp,Cp,Dp,Ep,Fp,Gp,Hp,Ip,Jp}; draw(Ap--Dp--Jp--cycle); draw(Gp--Bp--Ip--Hp--Cp--Ep--cycle); for(pair p : points) { fill(circle(p, 0.07),white); } pair[] Cn=new pair[5]; Cn[0]=centroid(Ap,Bp,Gp); Cn[1]=centroid(Gp,Bp,Fp); Cn[2]=centroid(Bp,Fp,Cp); Cn[3]=centroid(Cp,Fp,Ep); Cn[4]=centroid(Cp,Ep,Dp); label("$1$",Cn[0]); label("$2$",Cn[1]); label("$3$",Cn[2]); label("$4$",Cn[3]); label("$5$",Cn[4]); for (pair p : Cn) { draw(circle(p,0.1)); }[/asy]
$\mathrm{(A) \ } 1,004,004 \qquad \mathrm{(B) \ } 1,005,006 \qquad \mathrm{(C) \ } 1,507,509 \qquad \mathrm{(D) \ } 3,015,018 \qquad \mathrm{(E) \ } 6,021,018$

Solution:
There are $1+3+5+...+2003=1002^{2}=1004004$ small equilateral triangles.
Each small equilateral triangle needs $3$ toothpicks to make it.
But, each toothpick that isn't one of the $1002\cdot3=3006$ toothpicks on the outside of the large equilateral triangle is a side for $2$ small equilateral triangles.
So, the number of toothpicks on the inside of the large equilateral triangle is $\frac{10040004\cdot3-3006}{2}=1504503$
Therefore the total number of toothpicks is $1504503+3006=\boxed{1,507,509}$ ~dolphin7

Solution: We just need to count upward facing triangles because if we exclude the downward-facing triangles, we won't be overcounting any toothpicks. The first row of triangles has $1$ upward-facing triangle, the second row has $2$ upward-facing triangles, the third row has $3$ upward-facing triangles, and so on having $n$ upward-facing triangles in the $n^\text{th}$ row. The last row with $2003$ small triangles has $1002$ upward-facing triangles. By Gauss's formula, the number of the upward-facing triangles in the entire triangle are now $\frac{1002\times1003}{2}$ , meaning that the number of toothpicks are $\frac{1002\times1003}{2}\times3$ , or $\boxed{1,507,509}$

Solution: You don't have to calculate the value of $\frac{1002\times1003}{2}\times3$ , and you can use units digits to find the answer easily. The units digit of $1002\times1003$ is $6$ , and has a unit digit of $3$ after being divided by $2$ . Then this is multiplied by $3$ , now the final number ending with a $9$ . This leaves only one answer choice possible, which is $\boxed{1,507,509}$


Answer: 1507509.0

Solution:
Test out some fewer cases first.
When there is just 1 equilateral triangle in the base, you need $3$ toothpicks.
When there are 3 equilateral triangles in the base, you need $9$ toothpicks in all.
When there are 5 equilateral triangles in the base, you need $18$ toothpicks in all.
When there are 7 equilateral triangles in the base, you need $30$ toothpicks in all.
Taking the finite differences, we get $6, 9, 12.$ It forms a linear equations. This means the original numbers $(3, 9, 18, 30)$ form a quadratic.
Let the quadratic be $y = ax^2 + bx + c$ where $y = 2* \text{equilateral triangles in base} - 1.$
Then, we have the following points: $(1, 3), (2, 9), (3, 18), (4, 30).$
We can plug these values into $y = ax^2 + bx + c$ , giving:
\[a + b + c = 3, 4a + b + c = 9, 9a + 3b + c = 18.\]
Solving gives $a = b = 1.5, c = 0.$ So, \[y = 1.5x^2 + 1.5x.\]
For our problem, we need it when there are $2003$ equilateral triangles in the base. For the quadratic, the corresponding $x$ -value would be $\frac{2003 + 1}{2} = 1002.$ . So, our answer is simply: \[1.5 * 1002^2 + 1.5*1002 = \boxed{1507509}.\]


Answer: 15.0

A large rectangle is partitioned into four rectangles by two segments parallel to its sides. The areas of three of the resulting rectangles are shown. What is the area of the fourth rectangle? [asy] draw((0,0)--(10,0)--(10,7)--(0,7)--cycle); draw((0,5)--(10,5)); draw((3,0)--(3,7)); label("6", (1.5,6)); label("?", (1.5,2.5)); label("14", (6.5,6)); label("35", (6.5,2.5)); [/asy]
$\textbf{(A)}\ 10 \qquad\textbf{(B)}\ 15 \qquad\textbf{(C)}\ 20 \qquad\textbf{(D)}\ 21 \qquad\textbf{(E)}\ 25$

Solution: We can easily see the dimensions of each small rectangle. So the area of the last rectangle is $3\times 5=\boxed{15}$


Answer: 49.0

A large square is divided into a small square surrounded by four congruent rectangles as shown. The perimter of each of the congruent rectangles is $14$ . What is the area of the large square?
$\mathrm{(A) \ }49 \qquad \mathrm{(B) \ }64 \qquad \mathrm{(C) \ }100 \qquad \mathrm{(D) \ }121 \qquad \mathrm{(E) \ }196$

Solution: Let the length of the longer side be $x$ , and the length of the shorter side be $y$ .  We are given that $2x+2y=14\implies x+y=7$ .  However, note that $x+y$ is also the length of a side of the larger square.  Thus the area of the larger square is $(x+y)^2=7^2=\boxed{49}$

Solution: Expand the small square so it basically equals the area of the large square.  Two of the sides of the rectangles shrink to zero.  The other two sides expand to equal the length of the large outer square, and have a length of $\frac{14}{2} = 7$ .  Thus, the area of the larger square is $7^2=\boxed{49}$


Answer: 50.0

A large urn contains $100$ balls, of which $36 \%$ are red and the rest are blue. How many of the blue balls must be removed so that the percentage of red balls in the urn will be $72 \%$ ? (No red balls are to be removed.)
$\textbf{(A)}\ 28 \qquad\textbf{(B)}\  32 \qquad\textbf{(C)}\  36 \qquad\textbf{(D)}\ 50 \qquad\textbf{(E)}\ 64$

Solution: There are $36$ red balls; for these red balls to comprise $72 \%$ of the urn, there must be only $14$ blue balls. Since there are currently $64$ blue balls, this means we must remove $\boxed{50}$

Solution: There are $36$ red balls and $64$ blue balls. For the percentage of the red balls to double from $36 \%$ to $72 \%$ of the urn, half of the total number of balls must be removed. Therefore, the number of blue balls that need to be removed is $\boxed{50}$

Solution:
There are $36$ red balls out of the total $100$ balls.
We want to continuously remove blue balls until the percentage of red balls in the urn is 72%.
Therefore, we want \[\frac{36}{100-x}=\frac{72}{100}.\] Solving for $x$ gives that we must remove $\boxed{50}$ blue balls.


Answer: 4.0

A lattice point is a point in the plane with integer coordinates. How many lattice points are on the line segment whose endpoints are $(3,17)$ and $(48,281)$ ? (Include both endpoints of the segment in your count.)
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 16\qquad\textbf{(E)}\ 46$

Solution:
The difference in the $y$ -coordinates is $281 - 17 = 264$ , and the difference in the $x$ -coordinates is $48 - 3 = 45$ .
The gcd of 264 and 45 is 3, so the line segment joining $(3,17)$ and $(48,281)$ has slope \[\frac{88}{15}.\] The points on the line have coordinates \[\left(3+t,17+\frac{88}{15}t\right).\] If $t$ is an integer, the $y$ -coordinate of this point is an integer if and only if $t$ is a multiple of 15. The points where $t$ is a multiple of 15 on the segment $3\leq x\leq 48$ are $3$ $3+15$ $3+30$ , and $3+45$ . There are 4 lattice points on this line. Hence the answer is $\boxed{4}$


Answer: 5.0

A lemming sits at a corner of a square with side length $10$ meters. The lemming runs $6.2$ meters along a diagonal toward the opposite corner. It stops, makes a $90^{\circ}$ right turn and runs $2$ more meters. A scientist measures the shortest distance between the lemming and each side of the square. What is the average of these four distances in meters?
$\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 4.5 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6.2 \qquad \textbf{(E)}\ 7$

Solution: The shortest segments would be perpendicular to the square. The lemming went $x$ meters horizontally and $y$ meters vertically. No matter how much it went, the lemming would have been $x$ and $y$ meters from the sides and $10-x$ and $10-y$ meters from the remaining two. To find the average, add the lengths of the four segments and divide by four: $\frac {\cancel{x}+10-\cancel{x}+\cancel{y}+10-\cancel{y}}{4} =$ $\boxed{5}$

Solution: For any point in the square, the sum of its distance to the left edge and right edge is equal to $10$ , and the sum of its distance to the up edge and down edge is also equal to $10$ . Thus, the answer is $\boxed{5}$ , and the moving progress is misguide at all.


Answer: 6.0

A line $x=k$ intersects the graph of $y=\log_5 x$ and the graph of $y=\log_5 (x + 4)$ . The distance between the points of intersection is $0.5$ . Given that $k = a + \sqrt{b}$ , where $a$ and $b$ are integers, what is $a+b$
$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 9\qquad\textbf{(E)}\ 10$

Solution:
Since the line $x=k$ is vertical, we are only concerned with vertical distance.
In other words, we want to find the value of $k$ for which the distance $|\log_5 x - \log_5 (x+4)| = \frac{1}{2}$
Since $\log_5 x$ is a strictly increasing function, we have:
$\log_5 (x + 4) - \log_5 x = \frac{1}{2}$
$\log_5 (\frac{x+4}{x}) = \frac{1}{2}$
$\frac{x+4}{x} = 5^\frac{1}{2}$
$x + 4 = x\sqrt{5}$
$x\sqrt{5} - x = 4$
$x = \frac{4}{\sqrt{5} - 1}$
$x = \frac{4(\sqrt{5} + 1)}{5 - 1^2}$
$x = 1 + \sqrt{5}$
The desired quantity is $1 + 5 = 6$ , and the answer is $\boxed{6}$


Answer: 2.0

A line segment is divided so that the lesser part is to the greater part as the greater part is to the whole. If $R$ is the ratio of the lesser part to the greater part, then the value of
\[R^{[R^{(R^2+R^{-1})}+R^{-1}]}+R^{-1}\]
is
$\mathrm{(A)\ } 2 \qquad \mathrm{(B) \ }2R \qquad \mathrm{(C) \  } R^{-1} \qquad \mathrm{(D) \  } 2+R^{-1} \qquad \mathrm{(E) \  }2+R$

Solution:
Let $w$ be the length of the shorter segment and $l$ be the length of the longer segment. We're given that $\frac{w}{l}=\frac{l}{w+l}$ . Cross-multiplying, we find that $w^2+wl=l^2\implies w^2+wl-l^2=0$ . Now we divide both sides by $l^2$ to get $\left(\frac{w}{l}\right)^2+\left(\frac{w}{l}\right)-1=0$ . Therefore, $R^2+R-1=0$
From this, we have $R^2=-R+1$ . Dividing both sides by $R$ , we get $R=-1+\frac{1}{R}\implies R^{-1}=R+1$ . Therefore, $R^2+R^{-1}=-R+1+R+1=2$ . Finally, we have \[R^{[R^{(R^2+R^{-1})}+R^{-1}]}+R^{-1}=R^{[R^2+R^{-1}]}+R^{-1}=R^2+R^{-1}= \boxed{2}.\]


Answer: 10.0

A line with slope $2$ intersects a line with slope $6$ at the point $(40,30)$ . What is the distance between the $x$ -intercepts of these two lines?
$\textbf{(A) } 5 \qquad \textbf{(B) } 10 \qquad \textbf{(C) } 20 \qquad \textbf{(D) } 25 \qquad \textbf{(E) } 50$

Solution: Using point slope form, we get the equations $y-30 = 6(x-40)$ and $y-30 = 2(x-40)$ . Simplifying, we get $6x-y=210$ and $2x-y=50$ . Letting $y=0$ in both equations and solving for $x$ gives the $x$ -intercepts: $x=35$ and $x=25$ , respectively. Thus the distance between them is $35-25=\boxed{10}$

Solution: In order for the line with slope $2$ to travel "up" $30$ units (from $y=0$ ), it must have traveled $30/2=15$ units to the right. Thus, the $x$ -intercept is at $x=40-15=25$ . As for the line with slope $6$ , in order for it to travel "up" $30$ units it must have traveled $30/6=5$ units to the right. Thus its $x$ -intercept is at $x=40-5=35$ . Then the distance between them is $35-25=\boxed{10}$


Answer: 2.0

A line with slope $3$ intersects a line with slope $5$ at point $(10,15)$ . What is the distance between the $x$ -intercepts of these two lines?
$\textbf{(A) } 2 \qquad\textbf{(B) } 5 \qquad\textbf{(C) } 7 \qquad\textbf{(D) } 12 \qquad\textbf{(E) } 20$

Solution:
Using the point-slope form, the equation of each line is
\[y-15=3(x-10) \longrightarrow y=3x-15\] \[y-15=5(x-10) \longrightarrow y=5x-35\]
Substitute in $y=0$ to find the $x$ -intercepts.
\[0=3x-15\longrightarrow x=5\] \[0=5x-35\longrightarrow x=7\] The difference between them is $7-5=\boxed{2}$

Solution:
The $x$ -intercepts of a line is where the line's $y$ -coordinate is $=0$ . The slope is defined as $\frac{\text{change in } y\text{-coordinate}}{\text{change in } x\text{-coordinate}}$ . Therefore, the line with slope $3$ can be expressed as
\[\frac{\text{change in }y\text{-coordinate}}{\text{change in }x\text{-coordinate}}=3\]
From $(10,15)$ to the $x$ -intercept, the line must move $-15$ units to the $x$ -axis. Therefore, \[\frac{\text{change in }y\text{-coordinate}}{\text{change in }x\text{-coordinate}}=\frac{-15}{x_1}=3\implies x_1=-5\]
Therefore, the $x$ -intercept of the line with slope $3$ is $(10-5,0)=(5,0)$ .Note that some sources may state "the $x$ -intercept is $5$ " instead of "the $x$ -intercept is $(5,0)$
If an idea functions great for one part of the problem but does not find the solution to the problem, we want to use the idea again. Using the idea for the line with slope $5$ , we find \[\frac{\text{change in }y\text{-coordinate}}{\text{change in }x\text{-coordinate}}=\frac{-15}{x_2}=5\implies x_2=-3\] .
Therefore, the $x$ -intercept of the line with slope $5$ is $(10-3,0)=(7,0)$ . The distance between $\boxed{2}$


Answer: 35.0

A list of $11$ positive integers has a mean of $10$ , a median of $9$ , and a unique mode of $8$ . What is the largest possible value of an integer in the list?
$\textbf {(A) } 24 \qquad \textbf {(B) } 30 \qquad \textbf {(C) } 31\qquad \textbf {(D) } 33 \qquad \textbf {(E) } 35$

Solution:
We start off with the fact that the median is $9$ , so we must have $a, b, c, d, e, 9, f, g, h, i, j$ , listed in ascending order. Note that the integers do not have to be distinct.
Since the mode is $8$ , we have to have at least $2$ occurrences of $8$ in the list. If there are $2$ occurrences of $8$ in the list, we will have $a, b, c, 8, 8, 9, f, g, h, i, j$ . In this case, since $8$ is the unique mode, the rest of the integers have to be distinct. So we minimize $a,b,c,f,g,h,i$ in order to maximize $j$ . If we let the list be $1,2,3,8,8,9,10,11,12,13,j$ , then $j = 11 \times 10 - (1+2+3+8+8+9+10+11+12+13) = 33$
Next, consider the case where there are $3$ occurrences of $8$ in the list. Now, we can have two occurrences of another integer in the list. We try $1,1,8,8,8,9,9,10,10,11,j$ . Following the same process as above, we get $j = 11 \times 10 - (1+1+8+8+8+9+9+10+10+11) = 35$ . As this is the highest choice in the list, we know this is our answer. Therefore, the answer is $\boxed{35}$

Solution: Note that $x_1 + \ldots + x_{11} = 110$ let $x_6 = 9$ so $x_1 + \ldots + x_5 + x_7 + \ldots + x_{11} = 101$ . To maximize the value of $x_i$ where $i$ ranges from $1$ to $11$ , we let any $7$ elements be $1,2,\ldots,7$ so $x_1 + x_2 + x_3 = 57$ . Now we have to let one of above $3$ values = $8$ hence $x_1 + x_2 = 49$ now let $x_1 = 35$ $x_2 = 14$ hence $\boxed{35}$ is the answer.


Answer: 35.0

A list of $11$ positive integers has a mean of $10$ , a median of $9$ , and a unique mode of $8$ . What is the largest possible value of an integer in the list?
$\textbf{(A)}\ 24\qquad\textbf{(B)}\ 30\qquad\textbf{(C)}\ 31\qquad\textbf{(D)}\ 33\qquad\textbf{(E)}\ 35$

Solution:
We start off with the fact that the median is $9$ , so we must have $a, b, c, d, e, 9, f, g, h, i, j$ , listed in ascending order. Note that the integers do not have to be distinct.
Since the mode is $8$ , we have to have at least $2$ occurrences of $8$ in the list. If there are $2$ occurrences of $8$ in the list, we will have $a, b, c, 8, 8, 9, f, g, h, i, j$ . In this case, since $8$ is the unique mode, the rest of the integers have to be distinct. So we minimize $a,b,c,f,g,h,i$ in order to maximize $j$ . If we let the list be $1,2,3,8,8,9,10,11,12,13,j$ , then $j = 11 \times 10 - (1+2+3+8+8+9+10+11+12+13) = 33$
Next, consider the case where there are $3$ occurrences of $8$ in the list. Now, we can have two occurrences of another integer in the list. We try $1,1,8,8,8,9,9,10,10,11,j$ . Following the same process as above, we get $j = 11 \times 10 - (1+1+8+8+8+9+9+10+10+11) = 35$ . As this is the highest choice in the list, we know this is our answer. Therefore, the answer is $\boxed{35}$


Answer: 225.0

A list of $2018$ positive integers has a unique mode, which occurs exactly $10$ times. What is the least number of distinct values that can occur in the list?
$\textbf{(A)}\ 202\qquad\textbf{(B)}\ 223\qquad\textbf{(C)}\ 224\qquad\textbf{(D)}\ 225\qquad\textbf{(E)}\ 234$

Solution: To minimize the number of distinct values, we want to maximize the number of times a number appears. So, we could have $223$ numbers appear $9$ times, $1$ number appear once, and the mode appear $10$ times, giving us a total of $223 + 1 + 1 = \boxed{225}.$

Solution: As in Solution 1, we want to maximize the number of time each number appears to do so. We can set up an equation $10 + 9( x - 1 )\geq2018,$ where $x$ is the number of values. Notice how we can then rearrange the equation into $1 + 9 ( 1 )+9 ( x - 1 )\geq2018,$ which becomes $9 x\geq2017,$ or $x\geq224\frac19.$ We cannot have a fraction of a value so we must round up to $\boxed{225}.$


Answer: 225.0

Solution: To minimize the number of distinct values, we want to maximize the number of times a number appears. So, we could have $223$ numbers appear $9$ times, $1$ number appear once, and the mode appear $10$ times, giving us a total of $223 + 1 + 1 = \boxed{225}.$

Solution: As in Solution 1, we want to maximize the number of time each number appears to do so. We can set up an equation $10 + 9( x - 1 )\geq2018,$ where $x$ is the number of values. Notice how we can then rearrange the equation into $1 + 9 ( 1 )+9 ( x - 1 )\geq2018,$ which becomes $9 x\geq2017,$ or $x\geq224\frac19.$ We cannot have a fraction of a value so we must round up to $\boxed{225}.$


Answer: 6.0

A list of five positive integers has mean $12$ and range $18$ . The mode and median are both $8$ . How many different values are possible for the second largest element of the list?
$\mathrm{(A) \ 4 } \qquad \mathrm{(B) \ 6 } \qquad \mathrm{(C) \ 8 } \qquad \mathrm{(D) \ 10 } \qquad \mathrm{(E) \ 12 }$

Solution:
Let $a$ be the smallest element, so $a+18$ is the largest element. Since the mode is $8$ , at least two of the five numbers must be $8$ . The last number we denote as $b$
Then their average is $\frac{a + (8) + (8) + b + (a+18)}5 = 12 \Longrightarrow 2a + b = 26$ . Clearly $a \le 8$ . Also we have $b \le a + 18 \Longrightarrow 26-2a \le a + 18 \Longrightarrow 8/3 < 3 \le a$ . Thus there are a maximum of $6$ values of $a$ which corresponds to $6$ values of $b$ ; listing shows that all such values work. The answer is $\boxed{6}$


Answer: 20.0

A list of integers has mode $32$ and mean $22$ . The smallest number in the list is $10$ . The median $m$ of the list is a member of the list. If the list member $m$ were replaced by $m+10$ , the mean and median of the new list would be $24$ and $m+10$ , respectively. If were $m$ instead replaced by $m-8$ , the median of the new list would be $m-4$ . What is $m$
$\textbf{(A)}\ 16\qquad\textbf{(B)}\ 17\qquad\textbf{(C)}\ 18\qquad\textbf{(D)}\ 19\qquad\textbf{(E)}\ 20$

Solution:
Let there be $n$ integers on the list.  The list of $n$ integers has mean $22$ , so the sum of the integers is $22n$
Replacing $m$ with $m+10$ will increase the sum of the list from $22n$ to $22n + 10$
The new mean of the list is $24$ , so the new sum of the list is also $24n$
Thus, we get $22n + 10 = 24n$ , leading to $n=5$ numbers on the list.
If there are $5$ numbers on the list with mode $32$ and smallest number $10$ , then the list is $\{10, x, m, 32, 32\}$
Since replacing $m$ with $m-8$ gives a new median of $m-4$ , and $m-4$ must be on the list of $5$ integers since $5$ is odd, $x = m-4$ , and the list is now $\{10, m-4, m, 32, 32\}$
The sum of the numbers on this list is $22n = 22\cdot 5 = 110$ , so we get:
$10 + m - 4 + m + 32 + 32 = 110$
$70 + 2m = 110$
$m = 20$ , giving answer $\boxed{20}$


Answer: 236.0

A list of positive integers has the following properties:
$\bullet$ The sum of the items in the list is $30$
$\bullet$ The unique mode of the list is $9$
$\bullet$ The median of the list is a positive integer that does not appear in the list itself.
Find the sum of the squares of all the items in the list.

Solution:
The third condition implies that the list's size must be an even number, as if it were an odd number, the median of hte list would surely appear in the list itself.
Therefore, we can casework on what even numbers work.
Say the size is 2. Clearly, this doesn't work as the only list would be $\{9, 9\}$ , which doesn't satisfy condition 1.
If the size is 4, then we can have two $9$ s, and a remaining sum of $12$ . Since the other two values in the list must be distinct, and their sum must equal $30-18=12$ , we have that the two numbers are in the form $a$ and $12-a$ . Note that we cannot have both values greater than $9$ , and we cannot have only one value greater than $9$ , because this would make the median $9$ , which violates condition 3. Since the median of the list is a positive integer, this means that the greater of $a$ and $12-a$ must be an odd number. The only valid solution to this is $a=5$ . Thus, our answer is $5^2+7^2+9^2+9^2 = \boxed{236}$ . ~akliu

Solution: If there were an odd number of elements, the median would be in the set. Thus, we start with 4 elements. For 9 to be the mode, there must be 2 9s. For 9 to not be the median, either both numbers are greater than 9, or both numbers are less than 9. Clearly, both numbers must be less. From here, the numbers are clearly $(5,7,9,9)$ , and we add their squares to get $\boxed{236}$ -westwoodmonster

Solution:
Since the median is not in the list, there must not be an odd number of elements. Suppose the list has two elements. To meet the mode condition, both must equal $9$ , but this does not satisfy the other conditions.
Next, suppose the list has six elements. If there were at least three $9$ s, then the other elements would sum to at most $30-27=3$ . Since the elements are positive integers, this can only be achieved with the set $\{1,1,1,9,9,9\}$ , which violates the unique mode condition. Therefore, there must be exactly two $9$ s, and the other four elements must be distinct to satisfy the unique mode condition. Two sets of four unique positive integers add to $12$ $\{1,2,3,6\}$ and $\{1,2,4,5\}$ . Neither can act as the remaining four elements since both possibilities violate the constraint that the median is an integer.
Next, suppose the list had at least eight elements. For the sake of contradiction, suppose the third-largest element was at least $9$ . Then, since every element is a positive integer, the minimum sum would be $1+1+1+1+1+9+9+9>30$ . So, to satisfy the unique mode condition, there must be exactly two $9$ s, and the other elements must be distinct. But then the minimum sum is $1+2+3+4+5+6+9+9>30$ , so the sum constraint can never be satisfied. From these deductions, we conclude that the list has exactly four elements.
Note that no element can appear three times in the list, or else the middle-two-largest elements would be equal, violating the condition that the median is not in the list. Therefore, to satisfy the unique mode condition, the list contains two $9$ s and two other distinct integers that add to $30-18=12$ . Five sets of two unique positive integers add to $12$ $\{1,11\}$ $\{2,10\}$ $\{3,9\}$ $\{4,8\}$ , and $\{5,7\}$ . The first four options violate the median condition (either they make the median one of the list elements, or they make the median a non-integer). Thus, the set must be $\{5,7,9,9\}$ , and the sum of the squares of these elements is $25+49+81+81=\boxed{236}$


Answer: 36.0

A long piece of paper $5$ cm wide is made into a roll for cash registers by wrapping it $600$ times around a cardboard tube of diameter $2$ cm,
forming a roll $10$ cm in diameter. Approximate the length of the paper in meters.
(Pretend the paper forms $600$ concentric circles with diameters evenly spaced from $2$ cm to $10$ cm.)
$\textbf{(A)}\ 36\pi \qquad \textbf{(B)}\ 45\pi \qquad \textbf{(C)}\ 60\pi \qquad \textbf{(D)}\ 72\pi \qquad \textbf{(E)}\ 90\pi$

Solution: Notice (by imagining unfolding the roll), that the length of the paper is equal to the sum of the circumferences of the concentric circles, which is $\pi$ times the sum of the diameters. Now the, the diameters form an arithmetic series with first term $2$ , last term $10$ , and $600$ terms in total, so using the formula $\frac{1}{2}n(a+l)$ , the sum is $300 \times 12 = 3600$ , so the length is $3600\pi$ centimetres, or $36\pi$ metres, which is answer $\boxed{36}$


Answer: 593.0

A long thin strip of paper is $1024$ units in length, $1$ unit in width, and is divided into $1024$ unit squares. The paper is folded in half repeatedly. For the first fold, the right end of the paper is folded over to coincide with and lie on top of the left end. The result is a $512$ by $1$ strip of double thickness. Next, the right end of this strip is folded over to coincide with and lie on top of the left end, resulting in a $256$ by $1$ strip of quadruple thickness. This process is repeated $8$ more times. After the last fold, the strip has become a stack of $1024$ unit squares. How many of these squares lie below the square that was originally the $942$ nd square counting from the left?

Solution:
Number the squares $0, 1, 2, 3, ... 2^{k} - 1$ .  In this case $k = 10$ , but we will consider more generally to find an inductive solution.  Call $s_{n, k}$ the number of squares below the $n$ square after the final fold in a strip of length $2^{k}$
Now, consider the strip of length $1024$ .  The problem asks for $s_{941, 10}$ .  We can derive some useful recurrences for $s_{n, k}$ as follows:  Consider the first fold.  Each square $s$ is now paired with the square $2^{k} - s - 1$ .  Now, imagine that we relabel these pairs with the indices $0, 1, 2, 3... 2^{k - 1} - 1$ - then the $s_{n, k}$ value of the pairs correspond with the $s_{n, k - 1}$ values - specifically, double, and maybe $+ 1$ (if the member of the pair that you're looking for is the top one at the final step).
So, after the first fold on the strip of length $1024$ , the $941$ square is on top of the $82$ square.  We can then write
\[s_{941, 10} = 2s_{82, 9} + 1\]
(We add one because $941$ is the odd member of the pair, and it will be on top.  This is more easily visually demonstrated than proven.)  We can repeat this recurrence, adding one every time we pair an odd to an even (but ignoring the pairing if our current square is the smaller of the two):
\[s_{82, 9} = 2s_{82, 8} = 4s_{82, 7} = 8s_{127 - 82, 6} = 8s_{45, 6}\]
\[s_{45, 6} = 2s_{63 - 45, 5} + 1 = 2s_{18, 5} + 1 = 4s_{31 - 18, 4} + 1 = 4s_{13, 4} + 1\]
\[s_{13, 4} = 2s_{15 - 13, 3} + 1 = 2s_{2, 3}+1\]
We can easily calculate $s_{2, 3} = 4$ from a diagram.  Plugging back in,
\begin{align*} s_{13, 4} &= 9 \\ s_{45, 6} &= 37 \\ s_{82, 9} &= 296 \\ s_{941, 10} &= \boxed{593}

Solution: We can keep track of the position of the square labeled 942 in each step. We use an $(x,y)$ coordinate system, so originally the 942 square is in the position $(942,1)$ . In general, suppose that we've folded the strip into an array $r=2^k$ squares wide and $c=1024/r=2^{10-k}$ squares tall (so we've made $10-k$ folds). Then if a square occupies the location $(x,y)$ , we find that after the next fold, it will be in the location described by the procedure \[(x,y)\to\begin{cases}(x,y)&\text{if }x\le 2^{k-1}\\ (r+1-x,2c+1-y)&\text{otherwise}.\end{cases}\] Therefore, we can keep track of the square's location in the following table. \[\begin{array}{c|c|c} (x,y)&\text{rows}&\text{columns}\\\hline (942,1)&1024&1\\ (83,2)&512&2\\ (83,2)&256&4\\ (83,2)&128&8\\ (46,15)&64&16\\ (19,18)&32&32\\ (14,47)&16&64\\ (3,82)&8&128\\ (3,82)&4&256\\ (2,431)&2&512\\ (1,594)&1&1024.\\ \end{array}\] Therefore, at the end of the process, the square labeled 942 will be in the position $(1,594)$ , i.e., it will be above $\boxed{593}$ squares.


Answer: 26.0

A machine-shop cutting tool has the shape of a notched circle, as shown. The radius of the circle is $\sqrt{50}$ cm, the length of $AB$ is $6$ cm and that of $BC$ is $2$ cm. The angle $ABC$ is a right angle. Find the square of the distance (in centimeters) from $B$ to the center of the circle.
[asy] size(150);  defaultpen(linewidth(0.6)+fontsize(11)); real r=10; pair O=(0,0), A=r*dir(45),B=(A.x,A.y-r); path P=circle(O,r); pair C=intersectionpoint(B--(B.x+r,B.y),P); // Drawing arc instead of full circle //draw(P); draw(arc(O, r, degrees(A), degrees(C))); draw(C--B--A--B); dot(A); dot(B); dot(C); label("$A$",A,NE); label("$B$",B,S); label("$C$",C,SE); [/asy]

Solution:
Because we are given a right angle, we look for ways to apply the Pythagorean Theorem .  Let the foot of the perpendicular from $O$ to $AB$ be $D$ and let the foot of the perpendicular from $O$ to the line $BC$ be $E$ . Let $OE=x$ and $OD=y$ . We're trying to find $x^2+y^2$
Applying the Pythagorean Theorem, $OA^2 = OD^2 + AD^2$ and $OC^2 = EC^2 + EO^2$
Thus, $\left(\sqrt{50}\right)^2 = y^2 + (6-x)^2$ , and $\left(\sqrt{50}\right)^2 = x^2 + (y+2)^2$ . We solve this system to get $x = 1$ and $y = 5$ , such that the answer is $1^2 + 5^2 = \boxed{026}$

Solution:
Drop perpendiculars from $O$ to $AB$ (with foot $T_1$ ), $M$ to $OT_1$ (with foot $T_2$ ), and $M$ to $AB$ (with foot $T_3$ ).
Also, mark the midpoint $M$ of $AC$
First notice that by computation, $OAC$ is a $\sqrt {50} - \sqrt {40} - \sqrt {50}$ isosceles triangle, so $AC = MO$ .
Then, notice that $\angle MOT_2 = \angle T_3MO = \angle BAC$ . Therefore, the two blue triangles are congruent, from which we deduce $MT_2 = 2$ and $OT_2 = 6$ . As $T_3B = 3$ and $MT_3 = 1$ , we subtract and get $OT_1 = 5,T_1B = 1$ . Then the Pythagorean Theorem tells us that $OB^2 = \boxed{026}$

Solution:
Draw segment $OB$ with length $x$ , and draw radius $OQ$ such that $OQ$ bisects chord $AC$ at point $M$ . This also means that $OQ$ is perpendicular to $AC$ . By the Pythagorean Theorem, we get that $AC=\sqrt{(BC)^2+(AB)^2}=2\sqrt{10}$ , and therefore $AM=\sqrt{10}$ . Also by the Pythagorean theorem, we can find that $OM=\sqrt{50-10}=2\sqrt{10}$
Next, find $\angle BAC=\arctan{\left(\frac{2}{6}\right)}$ and $\angle OAM=\arctan{\left(\frac{2\sqrt{10}}{\sqrt{10}}\right)}$ . Since $\angle OAB=\angle OAM-\angle BAC$ , we get \[\angle OAB=\arctan{2}-\arctan{\frac{1}{3}}\] \[\tan{(\angle OAB)}=\tan{(\arctan{2}-\arctan{\frac{1}{3}})}\] By the subtraction formula for $\tan$ , we get \[\tan{(\angle OAB)}=\frac{2-\frac{1}{3}}{1+2\cdot \frac{1}{3}}\] \[\tan{(\angle OAB)}=1\] \[\cos{(\angle OAB)}=\frac{1}{\sqrt{2}}\] Finally, by the Law of Cosines on $\triangle OAB$ , we get \[x^2=50+36-2(6)\sqrt{50}\frac{1}{\sqrt{2}}\] \[x^2=\boxed{026}.\]

Solution:
We use coordinates. Let the circle have center $(0,0)$ and radius $\sqrt{50}$ ; this circle has equation $x^2 + y^2 = 50$ . Let the coordinates of $B$ be $(a,b)$ . We want to find $a^2 + b^2$ $A$ and $C$ with coordinates $(a,b+6)$ and $(a+2,b)$ , respectively, both lie on the circle. From this we obtain the system of equations
$a^2 + (b+6)^2 = 50$
$(a+2)^2 + b^2 = 50$
After expanding these terms, we notice by subtracting the first and second equations, we can cancel out $a^2$ and $b^2$ . after substituting $a=3b+8$ and plugging back in, we realize that $(a,b)=(-7,-5)$ or $(5,-1)$ . Since the first point is out of the circle, we find that $(5,-1)$ is the only relevant answer. This paragraph is written by ~hastapasta.
Solving, we get $a=5$ and $b=-1$ , so the distance is $a^2 + b^2 = \boxed{026}$

Solution:
I will use the law of cosines in triangle $\triangle OAC$ and $\triangle OBC$
$AC = \sqrt{AB^2 + BC^2} = \sqrt{6^2 + 2^2} = 2 \sqrt{10}$
$\cos \angle ACB = \frac{2}{2\sqrt{10}} = \frac{1}{\sqrt{10}}$
$\cos \angle ACO = \frac{AC^2+OC^2-OA^2}{2 \cdot AC \cdot OC} = \frac{(2\sqrt{10})^2+(\sqrt{50})^2-(\sqrt{50})^2}{2 \cdot 2\sqrt{10} \cdot \sqrt{50}} = \frac{1}{\sqrt{5}}$
$\sin \angle ACB = \sqrt{1-\cos^2 \angle ACB} = \sqrt{1-(\frac{1}{\sqrt{10}})^2} = \frac{3}{\sqrt{10}}$
$\sin \angle ACO = \sqrt{1-\cos^2 \angle ACO} = \sqrt{1-(\frac{1}{\sqrt{5}})^2} = \frac{2}{\sqrt{5}}$
$\cos \angle OCB = \cos (\angle ACB - \angle ACO) = \cos \angle ACB \cdot \cos \angle ACO + \sin \angle ACB \cdot \sin \angle ACO = \frac{1}{\sqrt{10}} \cdot \frac{1}{\sqrt{5}} + \frac{3}{\sqrt{10}} \cdot \frac{2}{\sqrt{5}} = \frac{7}{5\sqrt{2}}$
$OB^2 = OC^2 + BC^2 - 2 \cdot OC \cdot BC \cdot \cos \angle OCB = (\sqrt{50})^2 + 2^2 - 2 \cdot \sqrt{50} \cdot 2 \cdot \frac{7}{5\sqrt{2}} = 50 + 4 - 28 = \boxed{026}$

Solution: Notice that $50=5^2+5^2=7^2+1^2$ , and by the size of the diagram, it seems reasonable that $OA$ represents $5^2+5^2$ , and $OC$ means the $7^1+1^2$ , and indeed, the values work ( $7-5=2$ and $5+1=6$ ), so $OB^2=5^2+1^2=\boxed{026}$