Answer: 351.0

A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible?

Solution:
Let $0$ represent a house that does not receive mail and $1$ represent a house that does receive mail. This problem is now asking for the number of $19$ -digit strings of $0$ 's and $1$ 's such that there are no two consecutive $1$ 's and no three consecutive $0$ 's.
The last two digits of any $n$ -digit string can't be $11$ , so the only possibilities are $00$ $01$ , and $10$
Let $a_n$ be the number of $n$ -digit strings ending in $00$ $b_n$ be the number of $n$ -digit strings ending in $01$ , and $c_n$ be the number of $n$ -digit strings ending in $10$
If an $n$ -digit string ends in $00$ , then the previous digit must be a $1$ , and the last two digits of the $n-1$ digits substring will be $10$ . So \[a_{n} = c_{n-1}.\]
If an $n$ -digit string ends in $01$ , then the previous digit can be either a $0$ or a $1$ , and the last two digits of the $n-1$ digits substring can be either $00$ or $10$ . So \[b_{n} = a_{n-1} + c_{n-1}.\]
If an $n$ -digit string ends in $10$ , then the previous digit must be a $0$ , and the last two digits of the $n-1$ digits substring will be $01$ . So \[c_{n} = b_{n-1}.\]
Clearly, $a_2=b_2=c_2=1$ . Using the recursive equations and initial values: \[\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|} \multicolumn{19}{c}{}\\\hline n&2&3&4&5&6&7&8&9&10&11&12&13&14&15&16&17&18&19\\\hline a_n&1&1&1&2&2&3&4&5&7&9&12&16&21&28&37&49&65&86\\\hline b_n&1&2&2&3&4&5&7&9&12&16&21&28&37&49&65&86&114&151\\\hline c_n&1&1&2&2&3&4&5&7&9&12&16&21&28&37&49&65&86&114\\\hline \end{array}\]
As a result $a_{19}+b_{19}+c_{19}=\boxed{351}$

Solution:
We split the problem into cases using the number of houses that get mail. Let "|" represent a house that gets mail, and "o" represent a house that doesn't. With a fixed number of |, an o can be inserted between 2 |'s or on the very left or right. There cannot be more than one o that is free to arrange to be placed between two |'s because no three o's can be adjacent, but there can be a maximum of two o's placed on the very left or right. Note that according to the Pigeonhole Principle , no more than 10 houses can get mail on the same day.
Case 1: 10 houses get mail. No 2 adjacent houses can get mail on the same day, so there must be an o between every two |. $10-1=9$ o's are fixed so we count the number of ways to insert $19 - 10 - 9 = 0$ o's to $10+1 = 11$ spots, or $\binom{11}{0} = 1$
Case 2: 9 houses get mail. In this case, $9-1 = 8$ o's are fixed so we count the number of ways to insert $19 - 9 - 8 = 2$ o's to $9+1=10$ spots. However, there is also the case where two o's are both on the very left / right. When both o's that are free to arrange are put on a side, there are $10-1=9$ spots left to insert $2-2=0$ o's. Hence the total number of ways in this case is $\binom{10}{2} + 2\binom{9}{0} = 47$
Case 3: 8 houses get mail. In this case, $8-1=7$ o's are fixed so we count the number of ways to insert $19-8-7=4$ o's to $8+1=9$ spots. When two o's are put to the very left / right, there are $9-1=8$ spots left to insert $4-2=2$ o's. We also need to take care of the case where two o's are on the very left and two o's are on the very right: we have $9-1-1=7$ spots to insert $4-2-2=0$ o's. Hence the total number of ways in this case is $\binom{9}{4} + 2\binom{8}{2} + \binom{7}{0} = 183$
Case 4: 7 houses get mail. In this case, $7-1=6$ o's are fixed so we count the number of ways to insert $19-7-6=6$ o's to $7+1=8$ spots. When two o's are put to the very left / right, there are $8-1=7$ spots left to insert $6-2=4$ o's. When two o's are on the very left and two o's are on the very right, we have $8-1-1=6$ spots to insert $6-2-2=2$ o's. Hence the total number of ways in this case is $\binom{8}{6} + 2\binom{7}{4} + \binom{6}{2} = 113$
Case 5: 6 houses get mail. We have to be careful in this case: $6-1=5$ o's are fixed so we are inserting $19-6-5=8$ o's to $6+1=7$ spots, which means that at least 1 of the 2 sides must have two o's. When 1 of the 2 sides have two o's, there are $7-1=6$ spots to insert $8-2=6$ o's. When both sides have two o's, there are $7-1-1=5$ spots to insert $8-2-2=4$ o's. Hence the total number of ways in this case is $2\binom{6}{6} + \binom{5}{4} = 7$
When less than 6 houses get(s) mail, it's again not possible since at least three o's must be together (again, according to the Pigeonhole Principle). Therefore, the desired answer is $1+47+183+113+7=\boxed{351}$

Solution:
There doesn't seem to be anything especially noticeable about the number nineteen in this problem, meaning that we can replace the number nineteen with any number without a big effect on the logic that we use to solve the problem. This pits the problem as a likely candidate for recursion.
At first, it's not immediately clear how to relate the state of $n$ houses in general to that of $n - 1, n - 2,$ or $n - 3.$ We thus break it up into cases, based on whether the first house gets mail or not.
Let $p_n$ be the number of ways to distribute the mail to $n$ houses. Assume that the first house gets mail. Therefore, since no two adjacent houses get mail on the same day, the second house must not get mail. Starting from the third house, however, things start to look messy, and it looks like we have to break our recurrence down into even smaller cases, which is something that we don't like -- we want to keep our relations as simple as possible. Therefore, seeing that we can't work forwards anymore, we try to work backwards.
Once the mail carrier delivers the mail to the first and (lack of mail) to the second houses, have him deliver mail to the remaining $n - 3$ houses at the end of the row, skipping the third house. There are $p_{n - 3}$ ways to do this. Now, we see that the availability of mail at the third house is fixed -- if the fourth house doesn't receive mail, the third one must, and if the fourth house receives mail, the third one can't. Therefore, there are simply $p_{n-3}$ ways to deliver the mail if the first house gets mail.
If the first house doesn't get mail, then we use the same logic -- have the mail carrier skip the second house and deliver the remaining mail to the $n - 2$ houses in $p_{n-2}$ ways. Then, the availability of mail for the second house is fixed, so there are $p_{n - 2}$ ways to deliver the mail in this case.
We thus have established a recurrence relation -- since the first house either gets mail or it doesn't, and cannot achieve both at the same time, we are confident about the validity of our relation: \[p_n = p_{n-2} + p_{n-3}.\] Now, we simply calculate $p_1, p_2,$ and $p_3.$ Then, it's off to the races for computation!
$p_1 = 2,$ because the first house can either gets mail or it doesn't -- there are no restrictions.
$p_2 = 3,$ because all of the possible deliveries are valid (of which there are $2 \cdot 2 = 4$ ) except the one where both houses receive mail.
$p_3 = 4,$ as there are $4$ possible ways (here, M represents that that house gets mail and N represents no mail): MNM, MNN, NNM, NMN.
Using our recurrence relation, we eventually get that $p_{19} = \boxed{351},$ and we're done.

Solution:
Let $w_n$ be the number of possible ways if the last house has mail, and $b_n$ be the number of possible ways if the last house does not have mail.
If the last house has mail, then, the next house can't have mail, meaning that $b_n = w_{n - 1}$
If the last house doesn't have mail, then the next house can either have mail or not have mail. If the next house has mail, then we simply count the number of ways that the row ends in a house with mail, so that means so far, our recursive rule is $w_n = b_{n - 1} + \text{something}$ . If the next house does not have mail, then the next house after that must have mail, meaning that $w_n = b_{n - 1} + b_{n - 2}$
Recursing all the way up to $b_{19}$ and $w_{19}$ , we get $100 + 251 = \boxed{351}$

Solution:
Let $a_n$ be the number of ways if the first house has mail, and let $b_n$ be the number of ways if the first house does not get mail.
$a_n=a_{n-2}+a_{n-3}$ because if the first house gets mail, the next house that gets mail must either be the third or fourth house.
$b_n=a_{n-1}+a_{n-2}$ because if the first house does not get mail, the next house that gets mail must either be the second or third house.
Note that we only need list out values of $a_n$ as $b$ depends on $a$ $a_1=1, a_2=1, a_3=2, a_4=2, \ldots$
$a_{19}+b_{19}=a_{17}+a_{16}+a_{18}+a_{17}=a_{16}+2\cdot a_{17}+a_{18}=65+2\cdot 86+114=\boxed{351}$


Answer: 11.0

A majority of the $30$ students in Ms. Demeanor's class bought pencils at the school bookstore. Each of these students bought the same number of pencils, and this number was greater than $1$ . The cost of a pencil in cents was greater than the number of pencils each student bought, and the total cost of all the pencils was $$17.71$ . What was the cost of a pencil in cents?
$\textbf{(A)}\ 7 \qquad \textbf{(B)}\ 11 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 23 \qquad \textbf{(E)}\ 77$

Solution:
The total cost of the pencils can be found by $(\text{students}\cdot\text{pencils purchased by each}\cdot\text{price of each pencil})$
Since $1771$ is the product of three sets of values, we can begin with prime factorization, since it gives some insight into the values: $7, 11, 23$ . Since neither $(C)$ nor $(E)$ are any of these factors, they can be eliminated immediately, leaving $(A)$ $(B)$ , and $(D)$
Beginning with $(A) 7$ , we see that the number of pencils purchased by each student must be either $11$ or $23$ . However, the problem states that the price of each pencil must exceed the number of pencils purchased, so we can eliminate this.
Continuing with $(B) 11$ , we can conclude that the only case that fulfils the restrictions are that there are $23$ students who each purchased $7$ such pencils, so the answer is $\boxed{11}$ . We can apply the same logic to $(E)$ as we applied to $(A)$ if one wants to make doubly sure.

Solution:
We know the total cost of the pencils can be found by $(\text{students}\cdot\text{pencils purchased by each}\cdot\text{price of each pencil})$
Using prime factorization like in the solution above, we see that there is only one combination of three whole numbers whose product is equal to $1771$ $7, 11, 23$ (without using $1$ ). So we know that $7, 11$ , and $23$ must be the number of students, the number of pencils purchased by each student and the price of each pencil in cents.
We know that $23$ must be the number of students, as it is the only number that makes up the majority of 30.
We pick the greater of the remaining numbers for the price of each pencil in cents, which is $11$
Therefore, our answer is $\boxed{11}$

Solution:
We let $s$ be the number of students that bought pencils at the bookstore, $c$ be the cost of each pencil in cents, and $n$ the number of pencils each student bought. Thus, we are looking for $c.$ Since a majority of the students in the class bought pencils at the bookstore, $s>\dfrac{30}2=15.$ (s>15) We also know that $n>1$ and $c>n>1.$ Finally, $s\cdot c\cdot n=1771.$ We can factor $1771$ as $7\cdot11\cdot23.$ Since $n>15$ and $c>n>1,$ none of them can be $1,$ and therefore $c,n,$ and $s$ are $7,11,$ and $23$ in some order. We know that $n>15,$ so $n$ must be $23.$ $c>n,$ so $c=11$ and $n=7.$ Thus, $c=\boxed{11}$ cents.
~Technodoggo


Answer: 11.0

Solution:
The total cost of the pencils can be found by $(\text{students}\cdot\text{pencils purchased by each}\cdot\text{price of each pencil})$
Since $1771$ is the product of three sets of values, we can begin with prime factorization, since it gives some insight into the values: $7, 11, 23$ . Since neither $(C)$ nor $(E)$ are any of these factors, they can be eliminated immediately, leaving $(A)$ $(B)$ , and $(D)$
Beginning with $(A) 7$ , we see that the number of pencils purchased by each student must be either $11$ or $23$ . However, the problem states that the price of each pencil must exceed the number of pencils purchased, so we can eliminate this.
Continuing with $(B) 11$ , we can conclude that the only case that fulfils the restrictions are that there are $23$ students who each purchased $7$ such pencils, so the answer is $\boxed{11}$ . We can apply the same logic to $(E)$ as we applied to $(A)$ if one wants to make doubly sure.

Solution:
We know the total cost of the pencils can be found by $(\text{students}\cdot\text{pencils purchased by each}\cdot\text{price of each pencil})$
Using prime factorization like in the solution above, we see that there is only one combination of three whole numbers whose product is equal to $1771$ $7, 11, 23$ (without using $1$ ). So we know that $7, 11$ , and $23$ must be the number of students, the number of pencils purchased by each student and the price of each pencil in cents.
We know that $23$ must be the number of students, as it is the only number that makes up the majority of 30.
We pick the greater of the remaining numbers for the price of each pencil in cents, which is $11$
Therefore, our answer is $\boxed{11}$

Solution:
We let $s$ be the number of students that bought pencils at the bookstore, $c$ be the cost of each pencil in cents, and $n$ the number of pencils each student bought. Thus, we are looking for $c.$ Since a majority of the students in the class bought pencils at the bookstore, $s>\dfrac{30}2=15.$ (s>15) We also know that $n>1$ and $c>n>1.$ Finally, $s\cdot c\cdot n=1771.$ We can factor $1771$ as $7\cdot11\cdot23.$ Since $n>15$ and $c>n>1,$ none of them can be $1,$ and therefore $c,n,$ and $s$ are $7,11,$ and $23$ in some order. We know that $n>15,$ so $n$ must be $23.$ $c>n,$ so $c=11$ and $n=7.$ Thus, $c=\boxed{11}$ cents.
~Technodoggo


Answer: 1806.0

A man born in the first half of the nineteenth century was $x$ years old in the year $x^2$ . He was born in:
$\textbf{(A)}\ 1849 \qquad \textbf{(B)}\ 1825 \qquad \textbf{(C)}\ 1812 \qquad \textbf{(D)}\ 1836 \qquad \textbf{(E)}\ 1806$

Solution: If a man born in the 19th century was $x$ years of in the year $x^2$ , it implies that the year the man was born was $x^2-x$ . So, if the man was born in the first half of the 19th century, it means that $x^2-x < 1850$ . Noticing that $40^2 - 40 = 1560$ and $50^2-50 = 2450$ , we see that $40 < x < 50$ . We can guess values until we hit a solution. $43^2-43 = 1806$ , so we see that the man had to have been $43$ years old in the year $1849=43^2$ , so the answer is $\boxed{1806}$


Answer: 83.33

A man buys a house for $10,000 and rents it. He puts $12\frac{1}{2}\%$ of each month's rent aside for repairs and upkeep; pays  $325 a year taxes and realizes $5\frac{1}{2}\%$ on his investment. The monthly rent (in dollars) is:
$\textbf{(A)} \ \ 64.82\qquad\textbf{(B)} \ \ 83.33\qquad\textbf{(C)} \ \ 72.08\qquad\textbf{(D)} \ \ 45.83\qquad\textbf{(E)} \ \ 177.08$

Solution: $12\frac{1}{2}\%$ is the same as $\frac{1}{8}$ , so the man sets one eighth of each month's rent aside, so he only gains $\frac{7}{8}$ of his rent. He also pays $325 each year, and he realizes $5.5\%$ , or $550, on his investment. Therefore he must have collected a total of $325 +$550 = $875 in rent. This was for the whole year, so he collected $\frac{875}{12}$ dollars each month as rent. This is only $\frac{7}{8}$ of the monthly rent, so the monthly rent in dollars is $\frac{875}{12}\cdot \frac{8}{7}=\boxed{83.33}$


Answer: 16.0

A man can commute either by train or by bus. If he goes to work on the train in the morning, he comes home on the bus in the afternoon; and if he comes home in the afternoon on the train, he took the bus in the morning. During a total of $x$ working days, the man took the bus to work in the morning $8$ times, came home by bus in the afternoon $15$ times, and commuted by train (either morning or afternoon) $9$ times. Find $x$
$\textbf{(A)}\ 19 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 16 \qquad \\ \textbf{(E)}\ \text{ not enough information given to solve the problem}$

Solution:
The man has three possible combinations of transportation: \[\text{Morning train, Afternoon bus (m.t., a.b.)}\] \[\text{Morning bus, Afternoon train (m.b., a.t.)}\] \[\text{Morning bus, Afternoon bus (m.b, a.b.)}\]
Let $y$ be the number of times the man takes the $\text{a.t.}$ . Then, $9-y$ is the number of times he takes the $\text{m.t.}$ . Keep in mind that $\text{m.b.}=y$ and $\text{a.b.}=9-y$
Let $z$ be the number of times the man takes the $\text{m.b.}$ and $\text{a.b.}$ . Now, we get the two equations \[y+z=8\] and \[9-y+z=15.\]
Solving the system of equations, we get $y=1$ and $z=7$
So during the $x$ working days, the man took the $\text{(m.t., a.b.)}$ on $9-1=8$ days, the $\text{(m.b., a.t.)}$ on $1$ day, and the $\text{(m.b., a.b.)}$ on $7$ days.
Therefore, $x=8+1+7= \boxed{16}$ . ~ jiang147369


Answer: 6.4

A man has $\textdollar{10,000 }$ to invest. He invests $\textdollar{4000}$ at 5% and $\textdollar{3500}$ at 4%.
In order to have a yearly income of $\textdollar{500}$ , he must invest the remainder at:
$\textbf{(A)}\ 6\%\qquad\textbf{(B)}\ 6.1\%\qquad\textbf{(C)}\ 6.2\%\qquad\textbf{(D)}\ 6.3\%\qquad\textbf{(E)}\ 6.4\%$

Solution: The man currently earns $4000 \cdot \frac{5}{1000} + 3500 \cdot \frac{4}{1000} = 340$ dollars. So, we need to find the value of $x$ such that \[2500 \cdot \frac{x}{1000} = 160.\] Solving, we get $x = \boxed{6.4}$


Answer: 4.8

A man has part of $ $4500$ invested at $4$ % and the rest at $6$ %. If his annual return on each investment is the same, the average rate of interest which he realizes of the $4500 is:
$\textbf{(A)}\ 5\% \qquad \textbf{(B)}\ 4.8\% \qquad \textbf{(C)}\ 5.2\% \qquad \textbf{(D)}\ 4.6\% \qquad \textbf{(E)}\ \text{none of these}$

Solution: You are trying to find $\frac{2(0.06x)}{4500}$ , where $x$ is the principle for one investment. To find $x$ , solve $0.04(4500-x) = 0.06x$ $X$ will come out to be $1800$ . Then, plug in x into the first equation, $\frac{2(0.06)(1800)}{4500}$ , to get $0.048$ . Finally, convert that to a percentage and you get $\boxed{4.8}$


Answer: 40.0

A man on his way to dinner short after $6: 00$ p.m. observes that the hands of his watch form an angle of $110^{\circ}$ . Returning before $7: 00$ p.m. he notices that again the hands of his watch form an angle of $110^{\circ}$ . The number of minutes that he has been away is:
$\textbf{(A)}\ 36\frac{2}3\qquad\textbf{(B)}\ 40\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 42.4\qquad\textbf{(E)}\ 45$

Solution: Let $n$ be the number of minutes after 6:00. Let $h(n)=180+\frac{n}2$ be the angle, in degrees, of the hour hand (with $0^{\circ}$ at the top and increasing in the clockwise direction); similarly, let $m(n)=6n$ be the angle of the minute hand. We want $|h(n)-m(n)|=110$ . This is equivalent to \[180-\frac{11n}2=\pm110\] \[-\frac{11n}2\in\{-70,-290\}\] \[\frac{11n}2\in\{70,290\}\] \[11n\in\{140,580\}\] \[n\in\{\frac{140}{11},\frac{580}{11}\}\] The difference between the two values of $n$ is $\frac{440}{11}=\boxed{40}$


Answer: 372.0

A mathematical organization is producing a set of commemorative license plates. Each plate contains a sequence of five characters chosen from the four letters in AIME and the four digits in 2007. No character may appear in a sequence more times than it appears among the four letters in AIME or the four digits in 2007. A set of plates in which each possible sequence appears exactly once contains N license plates. Find $\frac{N}{10}$

Solution:
There are 7 different characters that can be picked, with 0 being the only number that can be repeated twice.
Thus, $N = 2520 + 1200 = 3720$ , and $\frac{N}{10} = \boxed{372}$


Answer: 125.0

A merchant bought some goods at a discount of $20\%$ of the list price. He wants to mark them at such a price that he can give a discount of $20\%$ of the marked price and still make a profit of $20\%$ of the selling price. The per cent of the list price at which he should mark them is:
$\textbf{(A) \ }20  \qquad \textbf{(B) \ }100 \qquad \textbf{(C) \ }125 \qquad \textbf{(D) \ }80 \qquad \textbf{(E) \ }120$

Solution:
Let $C$ represent the cost of the goods, and let $L$ $S$ , and $M$ represent the list, selling, and marked prices of the goods, respectively. Hence, we have three equations, which we need to manipulate in order to relate $M$ and $L$
$C=\frac{4}{5}L$
$S=C+\frac{1}{5}S$
$S=\frac{4}{5}M$
We find that $M=\frac{5}{4}L$ . Hence, the percent of the list price which should be marked is $\boxed{125}$


Answer: 125.0

A merchant buys goods at $25\%$ off the list price. He desires to mark the goods so that he can give a discount of $20\%$ on the marked price and still clear a profit of $25\%$ on the selling price. What percent of the list price must he mark the goods?
$\textbf{(A)}\ 125\% \qquad \textbf{(B)}\ 100\% \qquad \textbf{(C)}\ 120\% \qquad \textbf{(D)}\ 80\% \qquad \textbf{(E)}\ 75\%$

Solution:
Without loss of generality, we can set the list price equal to $100$ . The merchant buys the goods for $100*.75=75$ . Let $x$ be the marked price.
We then use the equation $0.8x-75=25$ to solve for $x$ and get a marked price of $\boxed{125}$


Answer: 44.0

A merchant offers a large group of items at $30\%$ off. Later, the merchant takes $20\%$ off these sale prices. The total discount is
$\text{(A)}\ 35\%\qquad\text{(B)}\ 44\%\qquad\text{(C)}\ 50\%\qquad\text{(D)}\ 56\%\qquad\text{(E)}\ 60\%$

Solution:
Let's assume that each item is $100$ dollars. First we take off $30\%$ off of $100$ dollars. $100\cdot0.7=70$
Next, we take off the extra $20\%$ as asked by the problem. $70\cdot0.80=56$
So the final price of an item is $56. We have to do $100-56$ because $56$ was the final price and we wanted the discount. So the final answer is $44\%$ , which is answer choice $\boxed{44}$


Answer: 40.0

A mixture of $30$ liters of paint is $25\%$ red tint, $30\%$ yellow
tint and $45\%$ water. Five liters of yellow tint are added to
the original mixture. What is the percent of yellow tint
in the new mixture?
$\mathrm{(A)}\ 25 \qquad \mathrm{(B)}\ 35 \qquad \mathrm{(C)}\ 40 \qquad \mathrm{(D)}\ 45 \qquad \mathrm{(E)}\ 50$

Solution: Since $30\%$ of the original $30$ liters of paint was yellow, and 5 liters of yellow paint were added to make the new mixture, there are $9+5=14$ liters of yellow tint in the new mixture. Since only 5 liters of paint were added to the original 30, there are a total of 35 liters of paint in the new mixture. This gives $40\%$ of yellow tint in the new mixture, which is $\boxed{40}$


Answer: 3.0

A month with $31$ days has the same number of Mondays and Wednesdays. How many of the seven days of the week could be the first day of this month?
$\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$

Solution: $31 \equiv 3 \pmod {7}$ so the week cannot start with Saturday, Sunday, Tuesday or Wednesday as that would result in an unequal number of Mondays and Wednesdays. Therefore, Monday, Thursday, and Friday are valid so the answer is $\boxed{3}$


Answer: 3.0

Solution: $31 \equiv 3 \pmod {7}$ so the week cannot start with Saturday, Sunday, Tuesday or Wednesday as that would result in an unequal number of Mondays and Wednesdays. Therefore, Monday, Thursday, and Friday are valid so the answer is $\boxed{3}$


Answer: 252.0

A moving particle starts at the point $(4,4)$ and moves until it hits one of the coordinate axes for the first time. When the particle is at the point $(a,b)$ , it moves at random to one of the points $(a-1,b)$ $(a,b-1)$ , or $(a-1,b-1)$ , each with probability $\frac{1}{3}$ , independently of its previous moves. The probability that it will hit the coordinate axes at $(0,0)$ is $\frac{m}{3^n}$ , where $m$ and $n$ are positive integers such that $m$ is not divisible by $3$ . Find $m + n$

Solution:
One could recursively compute the probabilities of reaching $(0,0)$ as the first axes point from any point $(x,y)$ as \[P(x,y) = \frac{1}{3} P(x-1,y) + \frac{1}{3} P(x,y-1) + \frac{1}{3} P(x-1,y-1)\] for $x,y \geq 1,$ and the base cases are $P(0,0) = 1, P(x,0) = P(y,0) = 0$ for any $x,y$ not equal to zero.
We then recursively find $P(4,4) = \frac{245}{2187}$ so the answer is $245 + 7 = \boxed{252}$

Solution: Obviously, the only way to reach (0,0) is to get to (1,1) and then have a $\frac{1}{3}$ chance to get to (0,0). Let x denote a move left 1 unit, y denote a move down 1 unit, and z denote a move left and down one unit each. The possible cases for these moves are $(x,y,z)=(0,0,3),(1,1,2),(2,2,1)$ and $(3,3,0)$ . This gives a probability of $1 \cdot \frac{1}{27} + \frac{4!}{2!} \cdot \frac{1}{81} + \frac{5!}{2! \cdot 2!} \cdot \frac{1}{243} +\frac{6!}{3! \cdot 3!} \cdot \frac{1}{729}=\frac{245}{729}$ to get to $(1,1)$ . The probability of reaching $(0,0)$ is $\frac{245}{3^7}$ . This gives $245+7=\boxed{252}$

Solution:
Since the particle stops at one of the axes, we know that the particle most pass through $(1,1)$ . Thus, it suffices to consider the probability our particle will reach $(1,1)$ . Then the only ways to get to $(1,1)$ from $(4,4)$ are the following:
(1) 3 moves diagonally
(2) 2 moves diagonally, 1 move left, 1 move down
(3) 1 move diagonally, 2 moves left and 2 moves down.
(4) 3 moves left, 3 moves down.
The probability of (1) is $\frac{1}{3^3}$ . The probability of (2) is $\frac{\frac{4!}{2!}}{3^4} = \frac{12}{3^4}$ . The probability of (3) is $\frac{\frac{5!}{2!2!}}{3^5} = \frac{30}{3^5}$ . The probability of (4) is $\frac{\frac{6!}{3!3!}}{3^6} = \frac{20}{3^6}$ . Adding all of these together, we obtain a total probability of $\frac{245}{3^6}$ that our particle will hit $(1,1)$ . Trivially, there is a $\frac{1}{3}$ chance our particle will hit $(0,0)$ from $(1,1)$ . So our final probability will be $\frac{245}{3^6} \cdot \frac{1}{3} = \frac{245}{3^7} \implies m = 245, n = 7 \implies \boxed{252}$


Answer: 12.0

A multiple choice examination consists of $20$ questions.  The scoring is $+5$ for each correct answer, $-2$ for each incorrect answer, and $0$ for each unanswered question.  John's score on the examination is $48$ .  What is the maximum number of questions he could have answered correctly?
$\text{(A)}\ 9 \qquad \text{(B)}\ 10 \qquad \text{(C)}\ 11 \qquad \text{(D)}\ 12 \qquad \text{(E)}\ 16$

Solution:
Let $c$ be the number of questions correct, $w$ be the number of questions wrong, and $b$ be the number of questions left blank.  We are given that \begin{align} c+w+b &= 20 \\ 5c-2w &= 48  \end{align}
Adding equation $(2)$ to double equation $(1)$ , we get \[7c+2b=88\]
Since we want to maximize the value of $c$ , we try to find the largest multiple of $7$ less than $88$ .  This is $84=7\times 12$ , so let $c=12$ .  Then we have \[7(12)+2b=88\Rightarrow b=2\]
Finally, we have $w=20-12-2=6$ .  We want $c$ , so the answer is $12$ , or $\boxed{12}$

Solution: If John answered 16 questions correctly, then he answered at most 4 questions incorrectly, giving him at least $16 \cdot 5 - 4 \cdot 2 = 72$ points. Therefore, John did not answer 16 questions correctly. If he answered 12 questions correctly and 6 questions incorrectly (leaving 2 questions unanswered), then he scored $12 \cdot 5 - 6 \cdot 2 = 48$ points. As all other options are less than 12, we conclude that 12 is the most questions John could have answered correctly, and the answer is $\boxed{12}$


Answer: 6.0

A nickel is placed on a table. The number of nickels which can be placed around it, each tangent to it and to two others is:
$\textbf{(A)}\ 4 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 8 \qquad\textbf{(E)}\ 12$

Solution: Arranging the nickels in a hexagonal fashion, we see that only $\boxed{6}$ nickels can be placed around the central nickel.


Answer: 45678.0

A non-zero digit is chosen in such a way that the probability of choosing digit $d$ is $\log_{10}{(d+1)}-\log_{10}{d}$ . The probability that the digit $2$ is chosen is exactly $1/2$ the probability that the digit chosen is in the set
$\mathrm{(A)\ } \{2,3\} \qquad \mathrm{(B) \ }\{3,4\} \qquad \mathrm{(C) \  } \{4,5,6,7,8\} \qquad \mathrm{(D) \  } \{5,6,7,8,9\} \qquad \mathrm{(E) \  }\{4,5,6,7,8,9\}$

Solution: We have $\log_{10}{(d+1)}-\log_{10}{d} = \log_{10}{\left(\frac{d+1}{d}\right)}$ , so the probability of choosing $2$ is $\log_{10}{\left(\frac{3}{2}\right)}$ . The probability that the digit chosen is in the set must therefore be \begin{align*}2\log_{10}{\left(\frac{3}{2}\right)} = &\log_{10}{\left(\left(\frac{3}{2}\right)^2\right)} \\ = &\log_{10}{\left(\frac{9}{4}\right)} \\ = &\log_{10}{9}-\log_{10}{4} \\ = &\left(\log_{10}{9}-\log_{10}{8}\right)+\left(\log_{10}{8}-\log_{10}{7}\right)+\left(\log_{10}{7}-\log_{10}{6}\right) \\ &+\left(\log_{10}{6}-\log_{10}{5}\right)+\left(\log_{10}{5}-\log_{10}{4}\right),\end{align*} which, by definition, is the probability that the digit chosen is in the set $\boxed{4,5,6,7,8}$


Answer: 4.0

A number is called flippy if its digits alternate between two distinct digits. For example, $2020$ and $37373$ are flippy, but $3883$ and $123123$ are not. How many five-digit flippy numbers are divisible by $15?$
$\textbf{(A) }3 \qquad \textbf{(B) }4 \qquad \textbf{(C) }5 \qquad \textbf{(D) }6 \qquad \textbf{(E) }8$

Solution: A number is divisible by $15$ precisely if it is divisible by $3$ and $5$ . The latter means the last digit must be either $5$ or $0$ , and the former means the sum of the digits must be divisible by $3$ . If the last digit is $0$ , the first digit would be $0$ (because the digits alternate), which is not possible. Hence the last digit must be $5$ , and the number is of the form $5\square 5\square 5$ . If the unknown digit is $x$ , we deduce $5+x+5+x+5 \equiv 0 \pmod{3} \Rightarrow 2x \equiv 0 \pmod{3}$ . We know $2^{-1}$ exists modulo $3$ because 2 is relatively prime to 3, so we conclude that $x$ (i.e. the second and fourth digit of the number) must be a multiple of $3$ . It can be $0$ $3$ $6$ , or $9$ , so there are $\boxed{4}$ options: $50505$ $53535$ $56565$ , and $59595$

Solution: As in Solution 1, we find that such numbers must start with $5$ and alternate with $5$ (i.e. must be of the form $5\square 5\square 5$ ), where the two digits between the $5$ s need to be the same. Call that digit $x$ . For the number to be divisible by $3$ , the sum of the digits must be divisible by $3$ ; since the sum of the three $5$ s is $15$ , which is already a multiple of $3$ , it must also be the case that $x+x=2x$ is a multiple of $3$ . Thus, the problem reduces to finding the number of digits from $0$ to $9$ for which $2x$ is a multiple of $3$ . This leads to $x=0$ $3$ $6$ , or $9$ , so there are $\boxed{4}$ possible numbers (namely $50505$ $53535$ $56565$ , and $59595$ ).

Solution: After finding out that the last digit must be $5$ , the number is of the form $5\square 5\square 5$ . If the unknown digit is $x$ , we can find that one of the solutions to $x$ is $0$ , since $5+5+5$ is equal to $15$ , which is divisible by $3$ . After trying every one digit number, you'll notice that $x$ must be a multiple of $3$ , meaning that $x=0$ $3$ $6$ , or $9$ $50505$ $53535$ $56565$ , and $59595$ are the $\boxed{4}$ solutions to this question.


Answer: 4.0

Solution: assume the number is $ababa$ $10101a+1010b=0 (mod 15)\newline$ $6a+5b=0 (mod 15)\newline$ $a=0 (mod 5)\newline$ $5b=0 (mod 15)\newline$ $b=0 (mod 3)\newline$ Solutions: $(5,0),(5,3),(5,6),(5,9)\newline$ $\boxed{4}$


Answer: 173.0

A number of linked rings, each $1$ cm thick, are hanging on a peg. The top ring has an outside diameter of $20$ cm. The outside diameter of each of the outer rings is $1$ cm less than that of the ring above it. The bottom ring has an outside diameter of $3$ cm. What is the distance, in cm, from the top of the top ring to the bottom of the bottom ring?
[asy] size(7cm); pathpen = linewidth(0.7); D(CR((0,0),10)); D(CR((0,0),9.5)); D(CR((0,-18.5),9.5)); D(CR((0,-18.5),9)); MP("$\vdots$",(0,-31),(0,0)); D(CR((0,-39),3)); D(CR((0,-39),2.5)); D(CR((0,-43.5),2.5)); D(CR((0,-43.5),2)); D(CR((0,-47),2)); D(CR((0,-47),1.5)); D(CR((0,-49.5),1.5)); D(CR((0,-49.5),1.0));  D((12,-10)--(12,10)); MP('20',(12,0),E); D((12,-51)--(12,-48)); MP('3',(12,-49.5),E);[/asy]
$\textbf{(A) } 171\qquad\textbf{(B) } 173\qquad\textbf{(C) } 182\qquad\textbf{(D) } 188\qquad\textbf{(E) } 210\qquad$

Solution: The inside diameters of the rings are the positive integers from $1$ to $18$ .  The total distance needed is the sum of these values plus $2$ for the top of the first ring and the bottom of the last ring. Using the formula for the sum of an arithmetic series , the answer is $\frac{18 \cdot 19}{2} + 2 = \boxed{173}$

Solution: Alternatively, the sum of the consecutive integers from 3 to 20 is $\frac{1}{2}(18)(3+20) = 207$ .  However, the 17 intersections between the rings must be subtracted, and we also get $207 - 2(17) = \boxed{173}$


Answer: 173.0

Solution: The inside diameters of the rings are the positive integers from $1$ to $18$ .  The total distance needed is the sum of these values plus $2$ for the top of the first ring and the bottom of the last ring. Using the formula for the sum of an arithmetic series , the answer is $\frac{18 \cdot 19}{2} + 2 = \boxed{173}$

Solution: Alternatively, the sum of the consecutive integers from 3 to 20 is $\frac{1}{2}(18)(3+20) = 207$ .  However, the 17 intersections between the rings must be subtracted, and we also get $207 - 2(17) = \boxed{173}$


Answer: 89.0

A number of students from Fibonacci Middle School are taking part in a community service project. The ratio of $8^\text{th}$ -graders to $6^\text{th}$ -graders is $5:3$ , and the the ratio of $8^\text{th}$ -graders to $7^\text{th}$ -graders is $8:5$ . What is the smallest number of students that could be participating in the project?
$\textbf{(A)}\ 16 \qquad \textbf{(B)}\ 40 \qquad \textbf{(C)}\ 55 \qquad \textbf{(D)}\ 79 \qquad \textbf{(E)}\ 89$

Solution:
We multiply the first ratio by 8 on both sides, and the second ratio by 5 to get the same number for 8th graders, in order that we can put the two ratios together:
$5:3 = 5(8):3(8) = 40:24$
$8:5 = 8(5):5(5) = 40:25$
Therefore, the ratio of 8th graders to 7th graders to 6th graders is $40:25:24$ . Since the ratio is in lowest terms, the smallest number of students participating in the project is $40+25+24 = \boxed{89}$

Solution: The number of 8th graders has to be a multiple of 8 and 5, so assume it is 40 (the smallest possibility). Then there are $40*\frac{3}{5}=24$ 6th graders and $40*\frac{5}{8}=25$ 7th graders. The numbers of students is $40+24+25=\boxed{89}$


Answer: 2519.0

A number which when divided by $10$ leaves a remainder of $9$ , when divided by $9$ leaves a remainder of $8$ , by $8$ leaves a remainder of $7$ , etc., down to where, when divided by $2$ , it leaves a remainder of $1$ , is:
$\textbf{(A)}\ 59\qquad\textbf{(B)}\ 419\qquad\textbf{(C)}\ 1259\qquad\textbf{(D)}\ 2519\qquad\textbf{(E)}\ \text{none of these answers}$

Solution: If we add $1$ to the number, it becomes divisible by $10, 9, 8, \cdots, 2, 1$ . The LCM of $1$ through $10$ is $2520$ , therefore the number we want to find is $2520-1=\boxed{2519}$


Answer: 11.0

A one-cubic-foot cube is cut into four pieces by three cuts parallel to the top face of the cube. The first cut is $\frac{1}{2}$ foot from the top face. The second cut is $\frac{1}{3}$ foot below the first cut, and the third cut is $\frac{1}{17}$ foot below the second cut. From the top to the bottom the pieces are labeled A, B, C, and D. The pieces are then glued together end to end as shown in the second diagram. What is the total surface area of this solid in square feet? [asy] import three; real d=11/102; defaultpen(fontsize(8)); defaultpen(linewidth(0.8)); currentprojection=orthographic(1,8/15,7/15); draw(unitcube, white, thick(), nolight); void f(real x) { draw((0,1,x)--(1,1,x)--(1,0,x)); } f(d); f(1/6); f(1/2); label("A", (1,0,3/4), W); label("B", (1,0,1/3), W); label("C", (1,0,1/6-d/4), W); label("D", (1,0,d/2), W); label("1/2", (1,1,3/4), E); label("1/3", (1,1,1/3), E); label("1/17", (0,1,1/6-d/4), E);[/asy]
[asy] import three; real d=11/102; defaultpen(fontsize(8)); defaultpen(linewidth(0.8)); currentprojection=orthographic(2,8/15,7/15); int t=0; void f(real x) { path3 r=(t,1,x)--(t+1,1,x)--(t+1,1,0)--(t,1,0)--cycle; path3 f=(t+1,1,x)--(t+1,1,0)--(t+1,0,0)--(t+1,0,x)--cycle; path3 u=(t,1,x)--(t+1,1,x)--(t+1,0,x)--(t,0,x)--cycle; draw(surface(r), white, nolight); draw(surface(f), white, nolight); draw(surface(u), white, nolight); draw((t,1,x)--(t+1,1,x)--(t+1,1,0)--(t,1,0)--(t,1,x)--(t,0,x)--(t+1,0,x)--(t+1,1,x)--(t+1,1,0)--(t+1,0,0)--(t+1,0,x)); t=t+1; } f(d); f(1/2); f(1/3); f(1/17); label("D", (1/2, 1, 0), SE); label("A", (1+1/2, 1, 0), SE); label("B", (2+1/2, 1, 0), SE); label("C", (3+1/2, 1, 0), SE);[/asy]
$\textbf{(A)}\:6\qquad\textbf{(B)}\:7\qquad\textbf{(C)}\:\frac{419}{51}\qquad\textbf{(D)}\:\frac{158}{17}\qquad\textbf{(E)}\:11$

Solution: The areas of the tops of $A$ $B$ $C$ , and $D$ in the figure formed has sum $1+1+1+1 = 4$ as do the bottoms. Thus, the total so far is $8$ . Now, one of the sides has an area of one, since it combines all of the heights of $A$ $B$ $C$ , and $D$ , which is $1$ . The other side is also the same. Thus the total area now is $10$ . From the front, the surface area is half, because if you looked at it straight from the front it would look exactly like a side of $A$ , with a surface area of half. From the back, it is the same thing. Thus, the total surface area is $10+\frac{1}{2}+\frac{1}{2}= 11$ , or $\boxed{11}$

Solution: The top parts and the bottom parts sum to 8. The sides add on another 2. Therefore, the only logical answer would be $\boxed{11}$ since it is the only answer greater than 10.


Answer: 4.0

A pair of fair $6$ -sided dice is rolled $n$ times. What is the least value of $n$ such that the probability that the sum of the numbers face up on a roll equals $7$ at least once is greater than $\frac{1}{2}$
$\textbf{(A) } 2 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 4 \qquad \textbf{(D) } 5 \qquad \textbf{(E) } 6$

Solution:
Rolling a pair of fair $6$ -sided dice, the probability of getting a sum of $7$ is $\frac16:$ Regardless what the first die shows, the second die has exactly one outcome to make the sum $7.$ We consider the complement: The probability of not getting a sum of $7$ is $1-\frac16=\frac56.$ Rolling the pair of dice $n$ times, the probability of getting a sum of $7$ at least once is $1-\left(\frac56\right)^n.$
Therefore, we have $1-\left(\frac56\right)^n>\frac12,$ or \[\left(\frac56\right)^n<\frac12.\] Since $\left(\frac56\right)^4<\frac12<\left(\frac56\right)^3,$ the least integer $n$ satisfying the inequality is $\boxed{4}.$

Solution: Let's try the answer choices. We can quickly find that when we roll $3$ dice, either the first and second sum to $7$ , the first and third sum to $7$ , or the second and third sum to $7$ . There are $6$ ways for the first and second dice to sum to $7$ $6$ ways for the first and third to sum to $7$ , and $6$ ways for the second and third dice to sum to $7$ . However, we overcounted (but not by much) so we can assume that the answer is $\boxed{4}$

Solution: We can start by figuring out what the probability is for each die to add up to $7$ if there is only $1$ roll. We can quickly see that the probability is $\frac16$ , as there are $6$ ways to make $7$ from $2$ numbers on a die, and there are a total of $36$ ways to add $2$ numbers on a die. And since each time we roll the dice, we are adding to the probability, we can conclude that the total probability for $n$ rolls would be $\frac16$ $n$ . The smallest number that satisfies this is $\boxed{4}$


Answer: 13.0

A pair of six-sided dice are labeled so that one die has only even numbers (two each of 2, 4, and 6), and the other die has only odd numbers (two of each 1, 3, and 5). The pair of dice is rolled. What is the probability that the sum of the numbers on the tops of the two dice is 7?
$\textbf{(A)}\ \frac{1}{6}\qquad\textbf{(B)}\ \frac{1}{5}\qquad\textbf{(C)}\ \frac{1}{4}\qquad\textbf{(D)}\ \frac{1}{3}\qquad\textbf{(E)}\ \frac{1}{2}$

Solution:
The total number of combinations when rolling two dice is $6*6 = 36$
There are three ways that a sum of 7 can be rolled. $2+5$ $4+3$ , and $6+1$ . There are two 2's on one die and two 5's on the other, so there are a total of 4 ways to roll the combination of 2 and 5. There are two 4's on one die and two 3's on the other, so there are a total of 4 ways to roll the combination of 4 and 3. There are two 6's on one die and two 1's on the other, so there are a total of 4 ways to roll the combination of 6 and 1. Add $4 + 4 + 4 = 12$
Thus, our probability is $\frac{12}{36} = \frac{1}{3}$ . The answer is $\boxed{13}$

Solution: Assume we roll the die with only evens first. For whatever value rolled, there are exactly 2 faces on the odd die that makes the sum 7. The odd die has 6 faces, so our probability is $\boxed{13}$


Answer: 113.0

A paper equilateral triangle $ABC$ has side length $12$ . The paper triangle is folded so that vertex $A$ touches a point on side $\overline{BC}$ a distance $9$ from point $B$ . The length of the line segment along which the triangle is folded can be written as $\frac{m\sqrt{p}}{n}$ , where $m$ $n$ , and $p$ are positive integers, $m$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $m+n+p$
[asy] import cse5; size(12cm); pen tpen = defaultpen + 1.337; real a = 39/5.0; real b = 39/7.0; pair B = MP("B", (0,0), dir(200)); pair A = MP("A", (9,0), dir(-80)); pair C = MP("C", (12,0), dir(-20)); pair K = (6,10.392); pair M = (a*B+(12-a)*K) / 12; pair N = (b*C+(12-b)*K) / 12; draw(B--M--N--C--cycle, tpen); draw(M--A--N--cycle); fill(M--A--N--cycle, mediumgrey); pair shift = (-20.13, 0); pair B1 = MP("B", B+shift, dir(200)); pair A1 = MP("A", K+shift, dir(90)); pair C1 = MP("C", C+shift, dir(-20)); draw(A1--B1--C1--cycle, tpen);[/asy]

Solution:
Let $M$ and $N$ be the points on $\overline{AB}$ and $\overline{AC}$ , respectively, where the paper is folded. Let $D$ be the point on $\overline{BC}$ where the folded $A$ touches it.  We have $AF=6\sqrt{3}$ and $FD=3$ , so $AD=3\sqrt{13}$ . Denote $\angle DAF = \theta$ ; we get $\cos\theta = 2\sqrt{3}/\sqrt{13}$
In triangle $AXY$ $AY=\tfrac 12 AD = \tfrac 32 \sqrt{13}$ , and $AX=AY\sec\theta =\tfrac{13}{4}\sqrt{3}$
In triangle $AMX$ , we get $\angle AMX=60^\circ-\theta$ and then use sine-law to get $MX=\tfrac 12 AX\csc(60^\circ-\theta)$ ; similarly, from triangle $ANX$ we get $NX=\tfrac 12 AX\csc(60^\circ+\theta)$ . Thus \[MN=\tfrac 12 AX(\csc(60^\circ-\theta) +\csc(60^\circ+\theta)).\] Since $\sin(60^\circ\pm \theta) = \tfrac 12 (\sqrt{3}\cos\theta \pm \sin\theta)$ , we get \begin{align*}     \csc(60^\circ-\theta) +\csc(60^\circ+\theta) &= \frac{\sqrt{3}\cos\theta}{\cos^2\theta - \tfrac 14} = \frac{24 \cdot \sqrt{13}}{35} \end{align*} Then \[MN = \frac 12 AX \cdot \frac{24 \cdot \sqrt{13}}{35} = \frac{39\sqrt{39}}{35}\]
The answer is $39 + 39 + 35 = \boxed{113}$

Solution:
Let $P$ and $Q$ be the points on $\overline{AB}$ and $\overline{AC}$ , respectively, where the paper is folded.
Let $D$ be the point on $\overline{BC}$ where the folded $A$ touches it.
Let $a$ $b$ , and $x$ be the lengths $AP$ $AQ$ , and $PQ$ , respectively.
We have $PD = a$ $QD = b$ $BP = 12 - a$ $CQ = 12 - b$ $BD = 9$ , and $CD = 3$
Using the Law of Cosines on $BPD$
$a^{2} = (12 - a)^{2} + 9^{2} - 2 \times (12 - a) \times 9 \times \cos{60}$
$a^{2} = 144 - 24a + a^{2} + 81 - 108 + 9a$
$a = \frac{39}{5}$
Using the Law of Cosines on $CQD$
$b^{2} = (12 - b)^{2} +3^{2} - 2 \times (12 - b) \times 3 \times \cos{60}$
$b^{2} = 144 - 24b + b^{2} + 9 - 36 + 3b$
$b = \frac{39}{7}$
Using the Law of Cosines on $DPQ$
$x^{2} = a^{2} + b^{2} - 2ab \cos{60}$
$x^{2} = (\frac{39}{5})^2 + (\frac{39}{7})^2 - (\frac{39}{5} \times \frac{39}{7})$
$x = \frac{39 \sqrt{39}}{35}$
The solution is $39 + 39 + 35 = \boxed{113}$

Solution:
Proceed with the same labeling as in Solution 1.
$\angle B = \angle C = \angle A = \angle PDQ = 60^\circ$
$\angle PDB + \angle PDQ + \angle QDC = \angle QDC + \angle CQD + \angle C = 180^\circ$
Therefore, $\angle PDB = \angle CQD$
Similarly, $\angle BPD = \angle QDC$
Now, $\bigtriangleup BPD$ and $\bigtriangleup CDQ$ are similar triangles, so
$\frac{3}{12-a} = \frac{12-b}{9} = \frac{b}{a}$
Solving this system of equations yields $a = \frac{39}{5}$ and $b = \frac{39}{7}$
Using the Law of Cosines on $APQ$
$x^{2} = a^{2} + b^{2} - 2ab \cos{60}$
$x^{2} = (\frac{39}{5})^2 + (\frac{39}{7})^2 - (\frac{39}{5} \times \frac{39}{7})$
$x = \frac{39 \sqrt{39}}{35}$
The solution is $39 + 39 + 35 = \boxed{113}$

Solution:
We let the original position of $A$ be $A$ , and the position of $A$ after folding be $D$ . Also, we put the triangle on the coordinate plane such that $A=(0,0)$ $B=(-6,-6\sqrt3)$ $C=(6,-6\sqrt3)$ , and $D=(3,-6\sqrt3)$

Note that since $A$ is reflected over the fold line to $D$ , the fold line is the perpendicular bisector of $AD$ . We know $A=(0,0)$ and $D=(3,-6\sqrt3)$ . The midpoint of $AD$ (which is a point on the fold line) is $(\tfrac32, -3\sqrt3)$ . Also, the slope of $AD$ is $\frac{-6\sqrt3}{3}=-2\sqrt3$ , so the slope of the fold line (which is perpendicular), is the negative of the reciprocal of the slope of $AD$ , or $\frac{1}{2\sqrt3}=\frac{\sqrt3}{6}$ . Then, using point slope form, the equation of the fold line is \[y+3\sqrt3=\frac{\sqrt3}{6}\left(x-\frac32\right)\] \[y=\frac{\sqrt3}{6}x-\frac{13\sqrt3}{4}\] Note that the equations of lines $AB$ and $AC$ are $y=\sqrt3x$ and $y=-\sqrt3x$ , respectively. We will first find the intersection of $AB$ and the fold line by substituting for $y$ \[\sqrt3 x=\frac{\sqrt3}{6}x-\frac{13\sqrt3}{4}\] \[\frac{5\sqrt3}{6}x=-\frac{13\sqrt3}{4} \implies x=-\frac{39}{10}\] Therefore, the point of intersection is $\left(-\tfrac{39}{10},-\tfrac{39\sqrt3}{10}\right)$ . Now, lets find the intersection with $AC$ . Substituting for $y$ yields \[-\sqrt3 x=\frac{\sqrt3}{6}x-\frac{13\sqrt3}{4}\] \[\frac{-7\sqrt3}{6}x=-\frac{13\sqrt3}{4} \implies x=\frac{39}{14}\] Therefore, the point of intersection is $\left(\tfrac{39}{14},-\tfrac{39\sqrt3}{14}\right)$ . Now, we just need to use the distance formula to find the distance between $\left(-\tfrac{39}{10},-\tfrac{39\sqrt3}{10}\right)$ and $\left(\tfrac{39}{14},-\tfrac{39\sqrt3}{14}\right)$ \[\sqrt{\left(\frac{39}{14}+\frac{39}{10}\right)^2+\left(-\frac{39\sqrt3}{14}+\frac{39\sqrt3}{10}\right)^2}\] The number 39 is in all of the terms, so let's factor it out: \[39\sqrt{\left(\frac{1}{14}+\frac{1}{10}\right)^2+\left(-\frac{\sqrt3}{14}+\frac{\sqrt3}{10}\right)^2}=39\sqrt{\left(\frac{6}{35}\right)^2+\left(\frac{\sqrt3}{35}\right)^2}\] \[\frac{39}{35}\sqrt{6^2+\sqrt3^2}=\frac{39\sqrt{39}}{35}\] Therefore, our answer is $39+39+35=\boxed{113}$ , and we are done.


Answer: 12.0

A parabola $y = ax^{2} + bx + c$ has vertex $(4,2)$ . If $(2,0)$ is on the parabola, then $abc$ equals
$\textbf{(A)}\ -12\qquad \textbf{(B)}\ -6\qquad \textbf{(C)}\ 0\qquad \textbf{(D)}\ 6\qquad \textbf{(E)}\ 12$

Solution: Consider the quadratic in completed square form: it must be $y=a(x-4)^{2}+2$ . Now substitute $x=2$ and $y=0$ to give $a=-\frac{1}{2}$ . Now expanding gives $y=-\frac{1}{2}x^{2}+4x-6$ , so the product is $-\frac{1}{2} \cdot 4 \cdot -6  = 3 \cdot 4 = 12$ , which is $\boxed{12}$


Answer: 13.0

A park is in the shape of a regular hexagon $2$ km on a side. Starting at a corner,
Alice walks along the perimeter of the park for a distance of $5$ km.
How many kilometers is she from her starting point?
$\textbf{(A)}\ \sqrt{13}\qquad \textbf{(B)}\ \sqrt{14}\qquad \textbf{(C)}\ \sqrt{15}\qquad \textbf{(D)}\ \sqrt{16}\qquad \textbf{(E)}\ \sqrt{17}$

Solution: We imagine this problem on a coordinate plane and let Alice's starting position be the origin. We see that she will travel along two edges and then go halfway along a third. Therefore, her new $x$ -coordinate will be $1 + 2 + \frac{1}{2} = \frac{7}{2}$ because she travels along a distance of $2 \cdot \frac{1}{2} = 1$ km because of the side relationships of an equilateral triangle, then $2$ km because the line is parallel to the $x$ -axis, and the remaining  distance is $\frac{1}{2}$ km because she went halfway along and because of the logic for the first part of her route. For her $y$ -coordinate, we can use similar logic to find that the coordinate is $\sqrt{3} + 0 - \frac{\sqrt{3}}{2} =  \frac{\sqrt{3}}{2}$ . Therefore, her distance is \[\sqrt{\left(\frac{7}{2}\right)^2 + \left(\frac{\sqrt{3}}{2}\right)^2} = \sqrt{\frac{49}{4} + \frac{3}{4}} = \sqrt{\frac{52}{4}} = \sqrt{13},\] giving an answer of $\boxed{13}$


Answer: 19.0

A particle is located on the coordinate plane at $(5,0)$ . Define a move for the particle as a counterclockwise rotation of $\pi/4$ radians about the origin followed by a translation of $10$ units in the positive $x$ -direction. Given that the particle's position after $150$ moves is $(p,q)$ , find the greatest integer less than or equal to $|p| + |q|$

Solution:
Let the particle's position be represented by a complex number. Recall that multiplying a number by cis $\left( \theta \right)$ rotates the object in the complex plane by $\theta$ counterclockwise. In this case, we use $a = cis(\frac{\pi}{4})$ . Therefore, applying the rotation and shifting the coordinates by 10 in the positive x direction in the complex plane results to
where a is cis $\left( \theta \right)$ . By De-Moivre's theorem, $\left(cis( \theta \right)^n )$ =cis $\left(n \theta \right)$ .
Therefore,
Furthermore, $5a^{150} = - 5i$ . Thus, the final answer is
As before, consider $z$ as a complex number.  Consider the transformation $z \to (z-\omega)e^{i\theta} + \omega$ .  This is a clockwise rotation of $z$ by $\theta$ radians about the points $\omega$ .  Let $f(z)$ denote one move of $z$ .  Then
Therefore, $z$ rotates along a circle with center $\omega = 5+(5+5\sqrt2)i$ .  Since $8 \cdot \frac{\pi}{4} = 2\pi$ $f^9(z) = f(z) \implies f^{150}(z) = f^6(z) \implies p+q = \boxed{019}$ , as desired (the final algebra bash isn't bad).

Solution:
Let $T:\begin{pmatrix}x\\y\end{pmatrix}\rightarrow R(\frac{\pi}{4})\begin{pmatrix}x\\y\end{pmatrix}+\begin{pmatrix}10\\0\end{pmatrix}$ . We assume that the rotation matrix $R(\frac{\pi}{4}) = R$ here. Then we have
This simplifies to
Since $R+R^{7}=O, R^2+R^6=O, R^3+R^5=O, I+R^4=O$ , so we have $R^6\begin{pmatrix}5\\0\end{pmatrix}+(-R^6-R^7)\begin{pmatrix}10\\0\end{pmatrix}$ , giving $p=-5\sqrt{2}, q=5\sqrt{2}+5$ . The answer is yet $\lfloor10\sqrt{2}+5\rfloor=\boxed{019}$


Answer: 83.0

A particle moves in the Cartesian plane according to the following rules:
How many different paths can the particle take from $(0,0)$ to $(5,5)$

Solution:
The length of the path (the number of times the particle moves) can range from $l = 5$ to $9$ ; notice that $d = 10-l$ gives the number of diagonals. Let $R$ represent a move to the right, $U$ represent a move upwards, and $D$ to be a move that is diagonal. Casework upon the number of diagonal moves:
Together, these add up to $2 + 18 + 42 + 20 + 1 = \boxed{083}$

Solution:
Another possibility is to use block-walking and recursion : for each vertex, the number of ways to reach it is $a + b + c$ , where $a$ is the number of ways to reach the vertex from the left (without having come to that vertex (the one on the left) from below), $b$ is the number of ways to reach the vertex from the vertex diagonally down and left, and $c$ is the number of ways to reach the vertex from below (without having come to that vertex (the one below) from the left).
Assign to each point $(i,j)$ the triplet $(a_{i,j}, b_{i,j}, c_{i,j})$ . Let $s(i,j) = a_{i,j}+ b_{i,j}+ c_{i,j}$ . Let all lattice points that contain exactly one negative coordinate be assigned to $(0,0,0)$ . This leaves the lattice points of the first quadrant, the positive parts of the $x$ and $y$ axes, and the origin unassigned. As a seed, assign to $(0,1,0)$ . (We will see how this correlates with the problem.) Then define for each lattice point $(i,j)$ its triplet thus: \begin{align*} a_{i,j} &= s(i-1,j) - c_{i-1,j}\\ b_{i,j} &= s(i-1,j-1) \\ c_{i,j} &= s(i,j-1) - a_{i,j-1}. \end{align*} It is evident that $s(i,j)$ is the number of ways to reach $(i,j)$ from $(0,0)$ . Therefore we compute vertex by vertex the triplets $(a_{i,j}, b_{i,j}, c_{i,j})$ with $0 \leq i, j \leq 5$  Finally, after simple but tedious calculations, we find that $(a_{5,5}, b_{5,5}, c_{5,5}) = (28,27,28)$ , so $s(i,j)=28+27+28 = \boxed{083}$


Answer: 4435.0

A particle moves through the first quadrant as follows. During the first minute it moves from the origin to $(1,0)$ . Thereafter, it continues to follow the directions indicated in the figure, going back and forth between the positive x and y axes, moving one unit of distance parallel to an axis in each minute. At which point will the particle be after exactly 1989 minutes?
[asy] import graph; Label f; f.p=fontsize(6);  xaxis(0,3.5,Ticks(f, 1.0));  yaxis(0,4.5,Ticks(f, 1.0));  draw((0,0)--(1,0)--(1,1)--(0,1)--(0,2)--(2,2)--(2,0)--(3,0)--(3,3)--(0,3)--(0,4)--(1.5,4),blue+linewidth(2)); arrow((2,4),dir(180),blue); [/asy]
$\text{(A)}\ (35,44)\qquad\text{(B)}\ (36,45)\qquad\text{(C)}\ (37,45)\qquad\text{(D)}\ (44,35)\qquad\text{(E)}\ (45,36)$

Solution:
Squares of size $1\times1,\ 2\times2,\ 3\times3,\ ...$ are successively enclosed between the path and the axes.

It takes $1+1+1$ minutes to enclose the first square, $1+2+2$ minutes to enclose the second, $1+3+3$ minutes to enclose the third, and so on. After odd squares, the particle is on the Y axis; after even squares, the particle is on the X axis.
First we find the highest integer $n$ such that $\sum_{k=1}^n1+2k\le1989$ . The sum is equal to \[\sum_{k=1}^n1+2\sum_{k=1}^nk=n+n(n+1)=n(n+2)=(n+1)^2-1\] so the highest value is $n=43$ for which the sum is $1935$
After $1935$ minutes the 43rd square is enclosed and the particle is at the point $(0,43)$ . During the 1936th minute it moves up to $(0,44)$ . At the end of the 1980th minute it has moved right to $(44,44)$ . After this it moves downward, and at the end of the 1989th minute it is at $(44,35)$ . The answer is $\boxed{44,35}$


Answer: 400.0

A particle projected vertically upward reaches, at the end of $t$ seconds, an elevation of $s$ feet where $s = 160 t - 16t^2$ . The highest elevation is:
$\textbf{(A)}\ 800 \qquad \textbf{(B)}\ 640\qquad \textbf{(C)}\ 400 \qquad \textbf{(D)}\ 320 \qquad \textbf{(E)}\ 160$

Solution: The highest elevation a particle can reach is the vertex of the quadratic.  The x-value that can get the maximum is $\frac{-160}{-2 \cdot 16} = 5$ , so the highest elevation is $160(5) - 16(5^2) = 400$ feet, which is answer choice $\boxed{400}$


Answer: 12.0

A particular $12$ -hour digital clock displays the hour and minute of a day. Unfortunately, whenever it is supposed to display a $1$ , it mistakenly displays a $9$ . For example, when it is 1:16 PM the clock incorrectly shows 9:96 PM. What fraction of the day will the clock show the correct time?
$\mathrm{(A)}\ \frac 12\qquad \mathrm{(B)}\ \frac 58\qquad \mathrm{(C)}\ \frac 34\qquad \mathrm{(D)}\ \frac 56\qquad \mathrm{(E)}\ \frac {9}{10}$

Solution: The clock will display the incorrect time for the entire hours of $1, 10, 11$ and $12$ .  So the correct hour is displayed $\frac 23$ of the time.  The minutes will not display correctly whenever either the tens digit or the ones digit is a $1$ , so the minutes that will not display correctly are $10, 11, 12, \dots, 19$ and $01, 21, 31, 41,$ and $51$ .  This amounts to fifteen of the sixty possible minutes for any given hour.  Hence the fraction of the day that the clock shows the correct time is $\frac 23 \cdot \left(1 - \frac {15}{60}\right) = \frac 23 \cdot \frac 34  = \boxed{12}$


Answer: 12.0

Solution: The clock will display the incorrect time for the entire hours of $1, 10, 11$ and $12$ .  So the correct hour is displayed $\frac 23$ of the time.  The minutes will not display correctly whenever either the tens digit or the ones digit is a $1$ , so the minutes that will not display correctly are $10, 11, 12, \dots, 19$ and $01, 21, 31, 41,$ and $51$ .  This amounts to fifteen of the sixty possible minutes for any given hour.  Hence the fraction of the day that the clock shows the correct time is $\frac 23 \cdot \left(1 - \frac {15}{60}\right) = \frac 23 \cdot \frac 34  = \boxed{12}$


Answer: 48.0

A permutation $(a_1,a_2,a_3,a_4,a_5)$ of $(1,2,3,4,5)$ is heavy-tailed if $a_1 + a_2 < a_4 + a_5$ .  What is the number of heavy-tailed permutations?
$\mathrm{(A)}\ 36\qquad\mathrm{(B)}\ 40\qquad\textbf{(C)}\ 44\qquad\mathrm{(D)}\ 48\qquad\mathrm{(E)}\ 52$

Solution:
We use case work on the value of $a_3$
Case 1: $a_3 = 1$ . Since $a_1 + a_2 < a_4 + a_5$ $(a_1, a_2)$ can only be a permutation of $(2, 3)$ or $(2, 4)$ . The values of $a_1$ and $a_2$ , as well as the values of $a_4$ and $a_5$ , are interchangeable, so this case produces a total of $2(2 \cdot 2) = 8$ solutions.
Case 2: $a_3 = 2$ . Similarly, we have $(a_1, a_2)$ is a permutation of $(1, 3)$ $(1, 4)$ , or $(1, 5)$ , which gives a total of $3(2 \cdot 2) = 12$ solutions.
Case 3: $a_3 = 3$ $(a_1, a_2)$ is a permutation of $(1, 2)$ or $(1, 4)$ , which gives a total of $2(2 \cdot 2) = 8$ solutions.
Case 4: $a_3 = 4$ $(a_1, a_2)$ is a permutation of $(1, 2)$ $(1, 3)$ , or $(2, 3)$ , which gives a total of $3(2 \cdot 2) = 12$ solutions.
Case 5: $a_3 = 5$ $(a_1, a_2)$ is a permutation of $(1, 2)$ or $(1, 3)$ , which gives a total of $2(2 \cdot 2) = 8$ solutions.
Therefore, our answer is $8 + 12 + 8 + 12 + 8 = 48 \Rightarrow \boxed{48}$


Answer: 4489.0

A permutation of the set of positive integers $[n] = \{1, 2, \ldots, n\}$ is a sequence $(a_1, a_2, \ldots, a_n)$ such that each element of $[n]$ appears precisely one time as a term of the sequence. For example, $(3, 5, 1, 2, 4)$ is a permutation of $[5]$ . Let $P(n)$ be the number of permutations of $[n]$ for which $ka_k$ is a perfect square for all $1\leq k\leq n$ . Find with proof the smallest $n$ such that $P(n)$ is a multiple of $2010$

Solution: We claim that the smallest $n$ is $67^2 = \boxed{4489}$

Solution:
This proof can also be rephrased as follows, in a longer way, but with fewer highly technical words such as "equivalence relation":
It is possible to write all positive integers $n$ in the form $p\cdot m^2$ , where $m^2$ is the largest perfect square dividing $n$ , so $p$ is not divisible by the square of any prime. Obviously, one working permutation of $[n]$ is simply $(1, 2, \ldots, n)$ ; this is acceptable, as $ka_k$ is always $k^2$ in this sequence.
Lemma 1. We can permute any numbers that, when each divided by the largest perfect square that divides it, yield equal quantities $p$
Proof. Let $p_k$ and $m_k$ be the values of $p$ and $m$ , respectively, for a given $k$ as defined above, such that $p$ is not divisible by the square of any prime. We can obviously permute two numbers which have the same $p$ , since if $p_j = p_w$ where $j$ and $w$ are 2 values of $k$ , then $j\cdot w = p_j^2\cdot m_j^2\cdot m_w^2$ , which is a perfect square. This proves that we can permute any numbers with the same value of $p$
End Lemma
Lemma 2. We will prove the converse of Lemma 1: Let one number have a $p$ value of $\phi$ and another, $\gamma$ $\phi\cdot f$ and $\gamma\cdot g$ are both perfect squares.
Proof. $\phi\cdot f$ and $\gamma\cdot g$ are both perfect squares, so for $\phi\cdot \gamma$ to be a perfect square, if $g$ is greater than or equal to $f$ $g/f$ must be a perfect square, too. Thus $g$ is $f$ times a square, but $g$ cannot divide any squares besides $1$ , so $g = 1f$ $g = f$ . Similarly, if $f\geq g$ , then $f = g$ for our rules to keep working.
End Lemma
We can permute $l$ numbers with the same $p$ in $l!$ ways. We must have at least 67 numbers with a certain $p$ so our product will be divisible by 67. Obviously, then it will also be divisible by 2, 3, and 5, and thus 2010, as well. Toms as $h$ , in general, we need numbers all the way up to $h\cdot 67^2$ , so obviously, $67^2$ is the smallest such number such that we can get a $67!$ term; here 67 $p$ terms are 1. Thus we need the integers $1, 2, \ldots, 67^2$ , so $67^2$ , or $\boxed{4489}$ , is the answer.

Solution:
It's well known that there exists $f(n)$ and $g(n)$ such that $n = f(n) \cdot g(n)$ , no square divides $f(n)$ other than 1, and $g(n)$ is a perfect square.
We prove first: If $f(k) = f(a_k)$ $k \cdot a_k$ is a perfect square.
$k \cdot a_k = f(k) \cdot g(k) \cdot f(a_k) \cdot g(a_k) = f(k)^2 \cdot g(k) \cdot g(a_k)$ , which is a perfect square.
We will now prove: If $k \cdot a_k$ is a perfect square, $f(k) = f(a_k)$
We do proof by contrapositive: If $f(k) \neq f(a_k)$ $k \cdot a_k$ is not a perfect square.
$v_p(k)$ is the p-adic valuation of k. (Basically how many factors of p you can take out of k)
Note that if $f(k) \neq f(a_k)$ , By the Fundamental Theorem of Arithmetic, $f(k)$ and $f(a_k)$ 's prime factorization are different, and thus there exists a prime p, such that $v_p(f(k)) \neq v_p(f(a_k))$ . Also, since $f(k)$ and $f(a_k)$ is squarefree, $v_p(k), v_p(a_k) \leq 1$ . Thus, $v_p(k \cdot a_k) = 1$ , making $k \cdot a_k$ not a square.
Thus, we can only match k with $a_k$ if they have the same f value. Thus, to find P(k), we can do it by f value, permuting the $a_k$ with f value 1, then 2, ... Thus, our answer is:
$P(n) = \prod_{1 \leq i \leq n, g(i) = 1} \left\lfloor \sqrt{\frac{n}{i}} \right \rfloor !$
For all $n < 67^2$ $P(n)$ doesn't have a factor of 67. However, if $n = 67^2$ , the first term will be a multiple of 2010, and thus the answer is $67^2 = \boxed{4489}$


Answer: 10.0

A piece of cheese is located at $(12,10)$ in a coordinate plane . A mouse is at $(4,-2)$ and is running up the line $y=-5x+18$ . At the point $(a,b)$ the mouse starts getting farther from the cheese rather than closer to it. What is $a+b$
$\mathrm{(A)}\ 6\qquad \mathrm{(B)}\ 10\qquad \mathrm{(C)}\ 14\qquad \mathrm{(D)}\ 18\qquad \mathrm{(E)}\ 22$

Solution: The point $(a,b)$ is the foot of the perpendicular from $(12,10)$ to the line $y=-5x+18$ . The perpendicular has slope $\frac{1}{5}$ , so its equation is $y=10+\frac{1}{5}(x-12)=\frac{1}{5}x+\frac{38}{5}$ . The $x$ -coordinate at the foot of the perpendicular satisfies the equation $\frac{1}{5}x+\frac{38}{5}=-5x+18$ , so $x=2$ and $y=-5\cdot2+18=8$ . Thus $(a,b) = (2,8)$ , and $a+b = \boxed{10}$

Solution: If the mouse is at $(x, y) = (x, 18 - 5x)$ , then the square of the distance from the mouse to the cheese is $(x - 12)^2 + (8 - 5x)^2 = 26(x^2 - 4x + 8) = 26((x - 2)^2 + 4).$ The value of this expression is smallest when $x = 2$ , so the mouse is closest to the cheese at the point $(2, 8)$ , and $a+b=2+8 = \boxed{10}$

Solution: We are trying to find the point where distance between the mouse and $(12, 10)$ is minimized. This point is where the line that passes through $(12, 10)$ and is perpendicular to $y=-5x+18$ intersects $y=-5x+18$ . By basic knowledge of perpendicular lines, this line is $y=\frac{x}{5}+\frac{38}{5}$ . This line intersects $y=-5x+18$ at $(2,8)$ . So $a+b=\boxed{10}$ . - MegaLucario1001

Solution:
If the mouse is at $(x, y) = (x, 18 - 5x)$ , then the square of the distance from the mouse to the cheese is $(x - 12)^2 + (8 - 5x)^2 = 26(x^2 - 4x + 8) = 26((x - 2)^2 + 4)$ .
The value of this expression is smallest when $x = 2$ , so the mouse is closest to the cheese at the point $(2, 8)$ , and $a+b=2+8 = \boxed{10}$ .
-Paixiao


Answer: 6.8

A piece of graph paper is folded once so that $(0,2)$ is matched with $(4,0)$ , and $(7,3)$ is matched with $(m,n)$ . Find $m+n$
$\mathrm{(A) \ }6.7 \qquad \mathrm{(B) \ }6.8 \qquad \mathrm{(C) \ }6.9 \qquad \mathrm{(D) \ }7.0 \qquad \mathrm{(E) \ }8.0$

Solution:
Note that the fold is the perpendicular bisector of $(0,2)$ and $(4,0)$ .  Thus, the fold goes through the midpoint $(2,1)$
The fold also has a slope of $-\frac{1}{m}$ , where the $m$ is the slope of the line connecting these two points.  We find $m = \frac{0 - 2}{4 - 0} = -\frac{1}{2}$ . Thus, the slope of the fold is $2$ and goes through $(2,1)$ , so the equation of the fold is $y = 2x - 3$
We want the line connecting $(7,3)$ and $(m,n)$ to have the same fold as a perpendicular bisector. The slope should be $-\frac{1}{2}$ , so we get $\frac{n - 3}{m - 7} = -\frac{1}{2}$ , which leads to $m = 13 -2n$
We also want $y = 2x - 3$ to bisect the segment from $(7,3)$ to $(m,n)$ . Thus, the midpoint $(x,y) = \left(\dfrac{7 + m}{2}, \frac{3 + n}{2}\right)$ must lie on the line. Plugging into the equation of the line, we find $\frac{3 + n}{2} = (7 + m) - 3$ , which simplifies to $n = 5 + 2m$
Solving the system of two equations in two variables $m = 13 - 2n$ and $n = 5 + 2m$ gives $m = \frac{3}{5}$ and $n = \frac{31}{5}$ , for a sum of $\boxed{6.8}$


Answer: 6.8

Solution:
The line of the fold is the perpendicular bisector of the segment that connects $(0,2)$ and $(4,0)$ .
The point $(m,n)$ is the image of the point $(7,3)$ according to this axis.
The situation looks as follows.
Now, we will compute the coordinates of the point $D$ , using the following facts:
As the triangles $SCT$ and $SDT$ are congruent, their areas are equal. The area of the triangle $SCT$ is $1/2$ of the size of the vector product $\overrightarrow{SC}\times\overrightarrow{ST}$ , and the area of $SDT$ is $1/2$ of the size of $\overrightarrow{ST}\times\overrightarrow{SD}$
We get that $\overrightarrow{SC}\times\overrightarrow{ST} = \overrightarrow{ST}\times\overrightarrow{SD}$
The equality remains valid if we multiply the vector $\overrightarrow{ST}$ by any constant. In other words, instead of $\overrightarrow{ST}$ we can use any vector with the same direction.
The axis of symmetry is perpendicular to $\overrightarrow{AB}$ . Thus its direction is $(2,4)=(1,2)$
We get that $\overrightarrow{SC}\times (1,2) = (1,2) \times\overrightarrow{SD}$
Substituting the coordinates $\overrightarrow{SC}=(5,2)$ and $\overrightarrow{SD}=(m-2,n-1)$ we get $5\cdot 2 - 2\cdot 1 = 1\cdot (n-1) - 2\cdot(m-2)$ . This simplifies to $n=2m+5$
We just discovered that the coordinates of $D$ are $(m,2m+5)$ . We will now use the second two facts mentioned above to find $m$
We have $|SD| = |SC|$ and therefore $|SD|^2 = |SC|^2$ . We know that $|SC|^2 = 5^2 + 2^2 = 29$ , and $|SD|^2 = (m-2)^2 + (2m+4)^2$ . Simplifying, we get the equation $5m^2 + 12m - 9 = 0$ . This has exactly one positive root $m=0.6$
It follows that $D=(0.6,6.2)$ , and that $m+n = 6.2 + 0.6 = \boxed{6.8}$


Answer: 607.0

A plane contains $40$ lines, no $2$ of which are parallel. Suppose that there are $3$ points where exactly $3$ lines intersect, $4$ points where exactly $4$ lines intersect, $5$ points where exactly $5$ lines intersect, $6$ points where exactly $6$ lines intersect, and no points where more than $6$ lines intersect. Find the number of points where exactly $2$ lines intersect.

Solution:
In this solution, let $\boldsymbol{n}$ -line points be the points where exactly $n$ lines intersect. We wish to find the number of $2$ -line points.
There are $\binom{40}{2}=780$ pairs of lines. Among them:
It follows that the $2$ -line points account for $780-9-24-50-90=\boxed{607}$ pairs of lines, where each pair intersect at a single point.


Answer: 60.0

A player pays $\textdollar 5$ to play a game. A die is rolled. If the number on the die is odd, the game is lost. If the number on the die is even, the die is rolled again. In this case the player wins if the second number matches the first and loses otherwise. How much should the player win if the game is fair? (In a fair game the probability of winning times the amount won is what the player should pay.)
$\textbf{(A) } \textdollar12\qquad\textbf{(B) } \textdollar30\qquad\textbf{(C) } \textdollar50\qquad\textbf{(D) } \textdollar60\qquad\textbf{(E) } \textdollar 100\qquad$

Solution: The probability of rolling an even number on the first turn is $\frac{1}{2}$ and the probability of rolling the same number on the next turn is $\frac{1}{6}$ . The probability of winning is $\frac{1}{2}\cdot \frac{1}{6} =\frac{1}{12}$ . If the game is to be fair, the amount paid, $5$ dollars, must be $\frac{1}{12}$ the amount of the prize money, so the answer is $\boxed{60}.$


Answer: 5.0

A point $(x,y)$ in the plane is called a lattice point if both $x$ and $y$ are integers. The area of the largest square that contains exactly three lattice points in its interior is closest to
$\mathrm{(A) \ } 4.0 \qquad \mathrm{(B) \ } 4.2 \qquad \mathrm{(C) \ } 4.5 \qquad \mathrm{(D) \ } 5.0 \qquad \mathrm{(E) \ }  5.6$

Solution: The best square's side length is slightly less than $\sqrt 5$ , yielding an answer of $\boxed{5.0}$


Answer: 281.0

A point $P$ is chosen at random in the interior of a unit square $S$ . Let $d(P)$ denote the distance from $P$ to the closest side of $S$ . The probability that $\frac{1}{5}\le d(P)\le\frac{1}{3}$ is equal to $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution:
Any point outside the square with side length $\frac{1}{3}$ that has the same center and orientation as the unit square and inside the square with side length $\frac{3}{5}$ that has the same center and orientation as the unit square has $\frac{1}{5}\le d(P)\le\frac{1}{3}$
Since the area of the unit square is $1$ , the probability of a point $P$ with $\frac{1}{5}\le d(P)\le\frac{1}{3}$ is the area of the shaded region, which is the difference of the area of two squares.
$\left(\frac{3}{5}\right)^2-\left(\frac{1}{3}\right)^2=\frac{9}{25}-\frac{1}{9}=\frac{56}{225}$
Thus, the answer is $56 + 225 = \boxed{281}.$

Solution: First, let's figure out $d(P) \geq \frac{1}{3}$ which is \[\left(\frac{3}{5}\right)^2=\frac{9}{25}.\] Then, $d(P) \geq \frac{1}{5}$ is a square inside $d(P) \geq \frac{1}{3}$ , so \[\left(\frac{1}{3}\right)^2=\frac{1}{9}.\] Therefore, the probability that $\frac{1}{5}\le d(P)\le\frac{1}{3}$ is \[\frac{9}{25}-\frac{1}{9}=\frac{56}{225}\] So, the answer is $56+225=\boxed{281}$

Solution: First, lets assume that point $P$ is closest to a side $S$ of the square. If it is $\frac{1}{5}$ far from $S$ , then it should be at least $\frac{1}{5}$ from both the adjacent sides of $S$ in the square. This leaves a segment of $1 - 2 \cdot \frac{1}{5} = \frac{3}{5}$ . If the distance from $P$ to $S$ is $\frac{1}{3}$ , then notice the length of the side-ways segment for $P$ is $1 - 2 \cdot \frac{1}{3} = \frac{1}{3}$ . Notice that as the distance from $P$ to $S$ increases, the possible points for the side-ways decreases. This produces a trapezoid with parallel sides $\frac{3}{5}$ and $\frac{1}{3}$ with height $\frac{1}{3} - \frac{1}{5} = \frac{2}{15}$ . This trapezoid has area (or probability for one side) $\frac{1}{2} \cdot \left(\frac{1}{3}+\frac{3}{5}\right)\cdot \frac{2}{15} = \frac{14}{225}$ . Since the square has $4$ sides, we multiply by $4$ . Hence, the probability is $\frac{56}{225}$ . The answer is $\boxed{281}$ .               ~Saucepan_man02


Answer: 5.0

A point $P$ is outside a circle and is $13$ inches from the center. A secant from $P$ cuts the circle at $Q$ and $R$ so that the external segment of the secant $PQ$ is $9$ inches and $QR$ is $7$ inches. The radius of the circle is:
$\textbf{(A)}\ 3" \qquad \textbf{(B)}\ 4" \qquad \textbf{(C)}\ 5" \qquad \textbf{(D)}\ 6"\qquad\textbf{(E)}\ 7"$

Solution: Using the Secant-Secant Power Theorem, you can get $9(16)=(13-r)(13+r)$ , where $r$ is the radius of the given circle. Solving the equation, you get a quadratic: $r^2-25$ . A radius cannot be negative so the answer is $\boxed{5}$


Answer: 0.4

A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0), (2020, 0), (2020, 2020),$ and $(0, 2020)$ . The probability that the point is within $d$ units of a lattice point is $\tfrac{1}{2}$ . (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$ to the nearest tenth $?$
$\textbf{(A) } 0.3 \qquad \textbf{(B) } 0.4 \qquad \textbf{(C) } 0.5 \qquad \textbf{(D) } 0.6 \qquad \textbf{(E) } 0.7$

Solution:
The diagram represents each unit square of the given $2020 \times 2020$ square.
We consider an individual one-by-one block.
If we draw a quarter of a circle from each corner (where the lattice points are located), each with radius $d$ , the area covered by the circles should be $0.5$ . Because of this, and the fact that there are four circles, we write
\[4 \cdot \frac{1}{4} \cdot \pi d^2 = \frac{1}{2}\]
Solving for $d$ , we obtain $d = \frac{1}{\sqrt{2\pi}}$ , where with $\pi \approx 3$ , we get $d \approx \frac{1}{\sqrt{6}} \approx \dfrac{1}{2.5} = \dfrac{10}{25} = \dfrac{2}{5}$ , and from here, we see that $d \approx 0.4 \implies \boxed{0.4}.$

Solution: As in the previous solution, we obtain the equation $4 \cdot \frac{1}{4} \cdot \pi d^2 = \frac{1}{2}$ , which simplifies to $\pi d^2 = \frac{1}{2} = 0.5$ . Since $\pi$ is slightly more than $3$ $d^2$ is slightly less than $\frac{0.5}{3} = 0.1\bar{6}$ . We notice that $0.1\bar{6}$ is slightly more than $0.4^2 = 0.16$ , so $d$ is roughly $\boxed{0.4}.$ emerald_block

Solution:
As above, we find that we need to estimate $d = \frac{1}{\sqrt{2\pi}}$
Note that we can approximate $2\pi \approx 6.28318 \approx 6.25$ and so $\frac{1}{\sqrt{2\pi}}$ $\approx \frac{1}{\sqrt{6.25}}=\frac{1}{2.5}=0.4$
And so our answer is $\boxed{0.4}$

Solution:
We only need to figure out the probability for a unit square, as it will scale up to the $2020\times 2020$ square. Since we want to find the probability that a point inside a unit square that is $d$ units away from a lattice point (a corner of the square) is $\frac{1}{2}$ , we can find which answer will come the closest to covering $\frac{1}{2}$ of the area.
Since the closest is $0.4$ which turns out to be $(0.4)^2\times \pi = 0.16 \times \pi$ which is about $0.502$ , we find that the answer rounded to the nearest tenth is $0.4$ or $\boxed{0.4}$

Solution:
As per the above diagram, realize that $\pi d^2 = \frac{1}{2}$ , so $d = \frac{1}{(\sqrt{2})(\sqrt{\pi})}$
$\sqrt{2} \approx 1.4 = \frac{7}{5}$
$\sqrt{\pi}$ is between $1.7$ and $1.8$ $((1.7)^2 = 2.89$ and $(1.8)^2 = 3.24)$ , so we can say $\sqrt{\pi} \approx 1.75 = \frac{7}{4}$
So $d \approx \frac{1}{(\frac{7}{5})(\frac{7}{4})} = \frac{1}{\frac{49}{20}} = \frac{20}{49}$ . This is slightly above $\boxed{0.4}$

Solution:
As above, we have the equation $\pi d^2 = \frac{1}{2}$ , and we want to find the most accurate value of $d$ . We resort to the answer choices and can plug those values of $d$ in and see which value of $d$ will lead to the most accurate value of $\pi$
Starting off in the middle, we try option C with $d=0.5$ . Plugging this in, we get $\pi \left(\frac{1}{2}\right)^2 = \frac{1}{2},$ and after simplifying we get $\pi = \frac{1}{2} \cdot 4 = 2.$ That's not very good. We know $\pi \approx 3.14.$
Let's see if we can do better. Trying option A with $d = 0.3,$ we get $\pi = \frac{1}{2} \cdot \frac{100}{9} = \frac{50}{9} = 5 \frac{5}{9}.$
Hm, let's try option B with $d = 0.4.$ We get $\pi = \frac{1}{2} \cdot \frac{25}{4} = \frac{25}{8} = 3 \frac{1}{8}$ . This is very close to $\pi$ and is the best estimate for $\pi$ of the 5 options.
Therefore, the answer is $\boxed{0.4}.$ ~ epiconan


Answer: 0.4

Solution:
The diagram represents each unit square of the given $2020 \times 2020$ square.
We consider an individual one-by-one block.
If we draw a quarter of a circle from each corner (where the lattice points are located), each with radius $d$ , the area covered by the circles should be $0.5$ . Because of this, and the fact that there are four circles, we write
\[4 \cdot \frac{1}{4} \cdot \pi d^2 = \frac{1}{2}\]
Solving for $d$ , we obtain $d = \frac{1}{\sqrt{2\pi}}$ , where with $\pi \approx 3$ , we get $d \approx \frac{1}{\sqrt{6}} \approx \dfrac{1}{2.5} = \dfrac{10}{25} = \dfrac{2}{5}$ , and from here, we see that $d \approx 0.4 \implies \boxed{0.4}.$

Solution: As in the previous solution, we obtain the equation $4 \cdot \frac{1}{4} \cdot \pi d^2 = \frac{1}{2}$ , which simplifies to $\pi d^2 = \frac{1}{2} = 0.5$ . Since $\pi$ is slightly more than $3$ $d^2$ is slightly less than $\frac{0.5}{3} = 0.1\bar{6}$ . We notice that $0.1\bar{6}$ is slightly more than $0.4^2 = 0.16$ , so $d$ is roughly $\boxed{0.4}.$ emerald_block

Solution:
As above, we find that we need to estimate $d = \frac{1}{\sqrt{2\pi}}$
Note that we can approximate $2\pi \approx 6.28318 \approx 6.25$ and so $\frac{1}{\sqrt{2\pi}}$ $\approx \frac{1}{\sqrt{6.25}}=\frac{1}{2.5}=0.4$
And so our answer is $\boxed{0.4}$

Solution:
We only need to figure out the probability for a unit square, as it will scale up to the $2020\times 2020$ square. Since we want to find the probability that a point inside a unit square that is $d$ units away from a lattice point (a corner of the square) is $\frac{1}{2}$ , we can find which answer will come the closest to covering $\frac{1}{2}$ of the area.
Since the closest is $0.4$ which turns out to be $(0.4)^2\times \pi = 0.16 \times \pi$ which is about $0.502$ , we find that the answer rounded to the nearest tenth is $0.4$ or $\boxed{0.4}$

Solution:
As per the above diagram, realize that $\pi d^2 = \frac{1}{2}$ , so $d = \frac{1}{(\sqrt{2})(\sqrt{\pi})}$
$\sqrt{2} \approx 1.4 = \frac{7}{5}$
$\sqrt{\pi}$ is between $1.7$ and $1.8$ $((1.7)^2 = 2.89$ and $(1.8)^2 = 3.24)$ , so we can say $\sqrt{\pi} \approx 1.75 = \frac{7}{4}$
So $d \approx \frac{1}{(\frac{7}{5})(\frac{7}{4})} = \frac{1}{\frac{49}{20}} = \frac{20}{49}$ . This is slightly above $\boxed{0.4}$

Solution:
As above, we have the equation $\pi d^2 = \frac{1}{2}$ , and we want to find the most accurate value of $d$ . We resort to the answer choices and can plug those values of $d$ in and see which value of $d$ will lead to the most accurate value of $\pi$
Starting off in the middle, we try option C with $d=0.5$ . Plugging this in, we get $\pi \left(\frac{1}{2}\right)^2 = \frac{1}{2},$ and after simplifying we get $\pi = \frac{1}{2} \cdot 4 = 2.$ That's not very good. We know $\pi \approx 3.14.$
Let's see if we can do better. Trying option A with $d = 0.3,$ we get $\pi = \frac{1}{2} \cdot \frac{100}{9} = \frac{50}{9} = 5 \frac{5}{9}.$
Hm, let's try option B with $d = 0.4.$ We get $\pi = \frac{1}{2} \cdot \frac{25}{4} = \frac{25}{8} = 3 \frac{1}{8}$ . This is very close to $\pi$ and is the best estimate for $\pi$ of the 5 options.
Therefore, the answer is $\boxed{0.4}.$ ~ epiconan


Answer: 98.0

A point whose coordinates are both integers is called a lattice point. How many lattice points lie on the hyperbola $x^2 - y^2 = 2000^2$

Solution:
\[(x-y)(x+y)=2000^2=2^8 \cdot 5^6\]
Note that $(x-y)$ and $(x+y)$ have the same parities , so both must be even. We first give a factor of $2$ to both $(x-y)$ and $(x+y)$ . We have $2^6 \cdot 5^6$ left. Since there are $7 \cdot 7=49$ factors of $2^6 \cdot 5^6$ , and since both $x$ and $y$ can be negative, this gives us $49\cdot2=\boxed{098}$ lattice points.


Answer: 0.189

A poll shows that $70\%$ of all voters approve of the mayor's work. On three separate occasions a pollster selects a voter at random. What is the probability that on exactly one of these three occasions the voter approves of the mayor's work?
$\mathrm{(A)}\ {{{0.063}}} \qquad \mathrm{(B)}\ {{{0.189}}} \qquad \mathrm{(C)}\ {{{0.233}}} \qquad \mathrm{(D)}\ {{{0.333}}} \qquad \mathrm{(E)}\ {{{0.441}}}$

Solution: Letting Y stand for a voter who approved of the work, and N stand for a person who didn't approve of the work, the pollster could select responses in $3$ different ways: $\text{YNN, NYN, and NNY}$ . The probability of each of these is $(0.7)(0.3)^2=0.063$ . Thus, the answer is $3\cdot0.063=\boxed{0.189}$

Solution: In more concise terms, this problem is an extension of the binomial distribution. We find the number of ways only 1 person approves of the mayor multiplied by the probability 1 person approves and 2 people disapprove: ${3\choose 1} \cdot(0.7)^1\cdot(1-0.7)^{(3-1)}=3\cdot0.7\cdot0.09=\boxed{0.189}$


Answer: 621.0

A positive integer $N$ has base-eleven representation $\underline{a}\kern 0.1em\underline{b}\kern 0.1em\underline{c}$ and base-eight representation $\underline1\kern 0.1em\underline{b}\kern 0.1em\underline{c}\kern 0.1em\underline{a},$ where $a,b,$ and $c$ represent (not necessarily distinct) digits. Find the least such $N$ expressed in base ten.

Solution: From the given information, $121a+11b+c=512+64b+8c+a \implies 120a=512+53b+7c$ . Since $a$ $b$ , and $c$ have to be positive, $a \geq 5$ . Since we need to minimize the value of $n$ , we want to minimize $a$ , so we have $a = 5$ . Then we know $88=53b+7c$ , and we can see the only solution is $b=1$ $c=5$ . Finally, $515_{11} = 621_{10}$ , so our answer is $\boxed{621}$


Answer: 4.0

A positive integer $N$ is a palindrome if the integer obtained by reversing the sequence of digits of $N$ is equal to $N$ . The year 1991 is the only year in the current century with the following 2 properties:
(a) It is a palindrome
(b) It factors as a product of a 2-digit prime palindrome and a 3-digit prime palindrome.
How many years in the millenium between 1000 and 2000 have properties (a) and (b)?
$\text{(A) } 1\quad \text{(B) } 2\quad \text{(C) } 3\quad \text{(D) } 4\quad \text{(E) } 5$

Solution:
Solution by e_power_pi_times_i
Notice that all four-digit palindromes are divisible by $11$ , so that is our two-digit prime. Because the other factor is a three-digit number, we are looking at palindromes between $1100$ and $2000$ , which also means that the last digit of the three-digit number is $1$ . Checking through the three-digit numbers $101, 111, 121,\dots, 181$ , we find out that there are $\boxed{4}$ three-digit prime numbers, which when multiplied by $11$ , result in palindromes.


Answer: 2.0

A positive integer $n$ has $60$ divisors and $7n$ has $80$ divisors.  What is the greatest integer $k$ such that $7^k$ divides $n$
$\mathrm{(A)}\ {{{0}}} \qquad \mathrm{(B)}\ {{{1}}} \qquad \mathrm{(C)}\ {{{2}}} \qquad \mathrm{(D)}\ {{{3}}} \qquad \mathrm{(E)}\ {{{4}}}$

Solution: We may let $n = 7^k \cdot m$ , where $m$ is not divisible by 7. Using the fact that the number of divisors function $d(n)$ is multiplicative, we have $d(n) = d(7^k)d(m) = (k+1)d(m) = 60$ . Also, $d(7n) = d(7^{k+1})d(m) = (k+2)d(m) = 80$ . These numbers are in the ratio 3:4, so $\frac{k+1}{k+2} = \frac{3}{4} \implies k = 2 \Rightarrow \boxed{2}$


Answer: 1.0

A positive integer $n$ is nice if there is a positive integer $m$ with exactly four positive divisors (including $1$ and $m$ ) such that the sum of the four divisors is equal to $n$ . How many numbers in the set $\{ 2010,2011,2012,\dotsc,2019 \}$ are nice?
$\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5$

Solution:
A positive integer with only four positive divisors has its prime factorization in the form of $a \cdot b$ , where $a$ and $b$ are both prime positive integers or $c^3$ where $c$ is a prime. One can easily deduce that none of the numbers are even near a cube so the second case is not possible. We now look at the case of $a \cdot b$ . The four factors of this number would be $1$ $a$ $b$ , and $ab$ .  The sum of these would be $ab+a+b+1$ , which can be factored into the form $(a+1)(b+1)$ . Easily we can see that now we can take cases again.
Case 1: Either $a$ or $b$ is 2.
If this is true then we have to have that one of $(a+1)$ or $(b+1)$ is odd and that one is 3. The other is still even.  So we have that in this case the only numbers that work are even multiples of 3 which are 2010 and 2016. So we just have to check if either $\frac{2016}{3} - 1$ or $\frac{2010}{3} - 1$ is a prime. We see that in this case none of them work.
Case 2: Both $a$ and $b$ are odd primes.
This implies that both $(a+1)$ and $(b+1)$ are even which implies that in this case the number must be divisible by $4$ . This leaves only $2012$ and $2016$ $2012={4}\cdot{503}$ so either $(a+1)$ or $(b+1)$ both have a factor of $2$ or one has a factor of $4$ . If it was the first case, then $a$ or $b$ will equal $1$ .  That means that either $(a+1)$ or $(b+1)$ has a factor of $4$ .  That means that $a$ or $b$ is $502$ which isn't a prime, so 2012 does not work. $2016 = 4 \cdot 504$ so we have $(503 + 1)(3 + 1)$ . 503 and 3 are both odd primes, so 2016 is a solution. Thus the answer is $\boxed{1}$

Solution: After deducing that $2012$ and case $1$ is impossible, and since there is no option for $0$ $2016$ is obviously a solution and the answer is $\boxed{1}$


Answer: 0.08

A positive integer $n$ not exceeding $100$ is chosen in such a way that if $n\le 50$ , then the probability of choosing $n$ is $p$ , and if $n > 50$ , then the probability of choosing $n$ is $3p$ . The probability that a perfect square is chosen is
$\textbf{(A) }.05\qquad \textbf{(B) }.065\qquad \textbf{(C) }.08\qquad \textbf{(D) }.09\qquad  \textbf{(E) }.1$

Solution: Let's say that we will have $3$ slips for every number not exceeding $100$ but bigger than $50.$ This is to account for the $3p$ probability part. Let's now say that we will only have one slip for each number below or equal to $50.$ The probability(or $p$ ) will then be $\frac{1}{200}.$ Now let's have all the squares under $50,$ which are $1,4,9,16,25,36,49.$ The probability for these are $\frac{7}{200}.$ The numbers above $50$ that are squares are $64,81,100.$ We then need to multiply the probability by $3$ so the probability of these are $\frac{9}{200}.$ The answer is $\frac{7}{200}+\frac{9}{200}=0.08\implies\boxed{.08}$


Answer: 23.0

A positive integer divisor of $12!$ is chosen at random. The probability that the divisor chosen is a perfect square can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. What is $m+n$
$\textbf{(A)}\ 3\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 23$

Solution:
The prime factorization of $12!$ is $2^{10} \cdot 3^5 \cdot 5^2 \cdot 7 \cdot 11$ .
This yields a total of $11 \cdot 6 \cdot 3 \cdot 2 \cdot 2$ divisors of $12!.$ In order to produce a perfect square divisor, there must be an even exponent for each number in the prime factorization. Note that the divisor can't have any factors of $7$ and $11$ in the prime factorization because there is only one of each in $12!.$ Thus, there are $6 \cdot 3 \cdot 2$ perfect squares. (For $2$ , you can have $0$ $2$ $4$ $6$ $8$ , or $10$ $2$ s, etc.)
The probability that the divisor chosen is a perfect square is \[\frac{6\cdot 3\cdot 2}{11\cdot 6\cdot 3\cdot 2\cdot 2}=\frac{1}{22} \implies \frac{m}{n}=\frac{1}{22} \implies m\ +\ n = 1\ +\ 22 = \boxed{23}\]


Answer: 20.0

A positive number $x$ has the property that $x\%$ of $x$ is $4$ .  What is $x$
$\textbf{(A) }\ 2      \qquad \textbf{(B) }\ 4      \qquad \textbf{(C) }\ 10      \qquad \textbf{(D) }\ 20      \qquad \textbf{(E) }\ 40$

Solution:
Since $x\%$ means $0.01x$ , the statement " $x\% \text{ of } x \text{ is 4}$ " can be rewritten as " $0.01x \cdot x = 4$ ":
$0.01x \cdot x=4 \Rightarrow x^2 = 400 \Rightarrow x = \boxed{20}.$

Solution: Try the answer choices one by one. Upon examination, it is quite obvious that the answer is $\boxed{20}.$ Very fast.


Answer: 20.0

Solution:
Since $x\%$ means $0.01x$ , the statement " $x\% \text{ of } x \text{ is 4}$ " can be rewritten as " $0.01x \cdot x = 4$ ":
$0.01x \cdot x=4 \Rightarrow x^2 = 400 \Rightarrow x = \boxed{20}.$

Solution: Try the answer choices one by one. Upon examination, it is quite obvious that the answer is $\boxed{20}.$ Very fast.


Answer: 245.0

A powderman set a fuse for a blast to take place in $30$ seconds. He ran away at a rate of $8$ yards per second. Sound travels at the rate of $1080$ feet per second. When the powderman heard the blast, he had run approximately: $\textbf{(A)}\ \text{200 yd.}\qquad\textbf{(B)}\ \text{352 yd.}\qquad\textbf{(C)}\ \text{300 yd.}\qquad\textbf{(D)}\ \text{245 yd.}\qquad\textbf{(E)}\ \text{512 yd.}$

Solution: Let $p(t)=24t$ be the number of feet the powderman is from the blast at $t$ seconds after the fuse is lit, and let $q(t)=1080t-32400$ be the number of feet the sound has traveled. We want to solve for $p(t)=q(t)$ \[24t=1080t-32400\] \[1056t=32400\] \[t=\frac{32400}{1056}\] \[t=\frac{675}{22}=30.6\overline{81}\] The number of yards the powderman is from the blast at time $t$ is $\frac{24t}3=8t$ , so the answer is $8(30.6\overline{81})$ , which is about $245$ yards. $\boxed{245}$


Answer: 4.5

A power boat and a raft both left dock $A$ on a river and headed downstream. The raft drifted at the speed of the river current. The power boat maintained a constant speed with respect to the river. The power boat reached dock $B$ downriver, then immediately turned and traveled back upriver. It eventually met the raft on the river 9 hours after leaving dock $A.$ How many hours did it take the power boat to go from $A$ to $B$
$\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 3.5 \qquad \textbf{(C)}\  4 \qquad \textbf{(D)}\ 4.5 \qquad \textbf{(E)}\ 5$

Solution: WLOG let the speed of the river be 0. This is allowed because the problem never states that the speed of the current has to have a magnitude greater than 0. In this case, when the powerboat travels from $A$ to $B$ , the raft remains at $A$ . Thus the trip from $A$ to $B$ takes the same time as the trip from $B$ to the raft. Since these times are equal and sum to $9$ hours, the trip from $A$ to $B$ must take half this time, or $4.5$ hours. The answer is thus $\boxed{4.5}$

Solution:
What's important in this problem is to consider everything in terms of the power boat and the raft, since that is how the problem is given to us. Think of the blue arrow as the power boat and the red arrow as the raft in the following three diagrams, which represent different time intervals of the problem.

Thinking about the distance covered as their distances with respect to each other, they are $0$ distance apart in the first diagram when they haven't started to move yet, some distance $d$ apart in the second diagram when the power boat reaches $B$ , and again $0$ distance apart in the third diagram when they meet. Therefore, with respect to each other, the boat and the raft cover a distance of $d$ on the way there, and again cover a distance of $d$ on when drawing closer. This makes sense, because from the 1st diagram to the second, the raft moves in the same direction as the boat, while from the 2nd to the 3rd, the boat and raft move in opposite directions.
Let $b$ denote the speed of the power boat (only the power boat, not factoring in current) and $r$ denote the speed of the raft, which, as given by the problem, is also equal to the speed of the current. Thus, from $A$ to $B$ , the boat travels at a velocity of $b+r$ , and on the way back, travels at a velocity of $-(b-r)=r-b$ , since the current aids the boat on the way there, and goes against the boat on the way back. With respect to the raft then, the boat's velocity from $A$ to $B$ becomes $(r+b)-r=b$ , and on the way back it becomes $(r-b)-r=-b$ . Since the boat's velocities with respect to the raft are exact opposites, $b$ and $-b$ , we therefore know that the boat and raft travel apart from each other at the same rate that they travel toward each other.
From this, we have that the boat travels a distance $d$ at rate $b$ with respect to the raft both on the way to $B$ and on the way back. Thus, using $\dfrac{distance}{speed}=time$ , we have $\dfrac{2d}{b}=9\text{ hours}$ , and to see how long it took to travel half the distance, we have $\dfrac{d}{b}=4.5\text{ hours}\implies\boxed{4.5}$

Solution:
Let $t$ be the time it takes the power boat to go from $A$ to $B$ in hours, $r$ be the speed of the river current (and thus also the raft), and $p$ to be the speed of the power boat with respect to the river.
Using $d = rt$ , the raft covers a distance of $9r$ , the distance from $A$ to $B$ is $(p + r)t$ , and the distance from $B$ to where the raft and power boat met up is $(9 - t)(p - r)$
Then, $9r + (9 - t)(p - r) = (p + r)t$ . Solving for $t$ , we get $t = 4.5$ , which is $\boxed{4.5}$


Answer: 784.0

A pyramid has a square base $ABCD$ and vertex $E$ .  The area of square $ABCD$ is $196$ , and the areas of $\triangle ABE$ and $\triangle CDE$ are $105$ and $91$ , respectively.  What is the volume of the pyramid?
$\textbf{(A)}\ 392 \qquad \textbf{(B)}\ 196\sqrt {6} \qquad \textbf{(C)}\ 392\sqrt {2} \qquad \textbf{(D)}\ 392\sqrt {3} \qquad \textbf{(E)}\ 784$

Solution:
Let $h$ be the height of the pyramid and $a$ be the distance from $h$ to $CD$ . The side length of the base is $14$ . The heights of $\triangle ABE$ and $\triangle CDE$ are $2\cdot105\div14=15$ and $2\cdot91\div14=13$ , respectively. Consider a side view of the pyramid from $\triangle BCE$ .  We have a systems of equations through the Pythagorean Theorem:
$13^2-(14-a)^2=h^2 \\ 15^2-a^2=h^2$
Setting them equal to each other and simplifying gives $-27+28a=225 \implies a=9$
Therefore, $h=\sqrt{15^2-9^2}=12$ , and the volume of the pyramid is $\frac{bh}{3}=\frac{12\cdot 196}{3}=\boxed{784}$


Answer: 803.0

A pyramid has a triangular base with side lengths $20$ $20$ , and $24$ . The three edges of the pyramid from the three corners of the base to the fourth vertex of the pyramid all have length $25$ . The volume of the pyramid is $m\sqrt{n}$ , where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$

Solution:
Let the triangular base be $\triangle ABC$ , with $\overline {AB} = 24$ . We find that the altitude to side $\overline {AB}$ is $16$ , so the area of $\triangle ABC$ is $(24*16)/2 = 192$
Let the fourth vertex of the tetrahedron be $P$ , and let the midpoint of $\overline {AB}$ be $M$ . Since $P$ is equidistant from $A$ $B$ , and $C$ , the line through $P$ perpendicular to the plane of $\triangle ABC$ will pass through the circumcenter of $\triangle ABC$ , which we will call $O$ . Note that $O$ is equidistant from each of $A$ $B$ , and $C$ . Then,
\[\overline {OM} + \overline {OC} = \overline {CM} = 16\]
Let $\overline {OM} = d$ . Then $OC=OA=\sqrt{d^2+12^2}.$ Equation $(1)$ \[d + \sqrt {d^2 + 144} = 16\]
Squaring both sides, we have
\[d^2 + 144 + 2d\sqrt {d^2+144} + d^2 = 256\]
\[2d^2 + 2d\sqrt {d^2+144} = 112\]
\[2d(d + \sqrt {d^2+144}) = 112\]
Substituting with equation $(1)$
\[2d(16) = 112\]
\[d = 7/2\]
We now find that $\sqrt{d^2 + 144} = 25/2$
Let the distance $\overline {OP} = h$ . Using the Pythagorean Theorem on triangle $AOP$ $BOP$ , or $COP$ (all three are congruent by SSS):
\[25^2 = h^2 + (25/2)^2\]
\[625 = h^2 + 625/4\]
\[1875/4 = h^2\]
\[25\sqrt {3} / 2 = h\]
Finally, by the formula for volume of a pyramid,
\[V = Bh/3\]
\[V = (192)(25\sqrt{3}/2)/3\] This simplifies to $V = 800\sqrt {3}$ , so $m+n = \boxed{803}$

Solution:
We can place a three dimensional coordinate system on this pyramid. WLOG assume the vertex across from the line that has length $24$ is at the origin, or $(0, 0, 0)$ . Then, the two other vertices can be $(-12, -16, 0)$ and $(12, -16, 0)$ . Let the fourth vertex have coordinates of $(x, y, z)$ . We have the following $3$ equations from the distance formula.
\[x^2+y^2+z^2=625\]
\[(x+12)^2+(y+16)^2+z^2=625\]
\[(x-12)^2+(y+16)^2+z^2=625\]
Adding the last two equations and substituting in the first equation, we get that $y=-\frac{25}{2}$ . If you drew a good diagram, it should be obvious that $x=0$ . Now, solving for $z$ , we get that $z=\frac{25\sqrt{3}}{2}$ . So, the height of the pyramid is $\frac{25\sqrt{3}}{2}$ . The base is equal to the area of the triangle, which is $\frac{1}{2} \cdot 24 \cdot 16 = 192$ . The volume is $\frac{1}{3} \cdot 192 \cdot \frac{25\sqrt{3}}{2} = 800\sqrt{3}$ . Thus, the answer is $800+3 = \boxed{803}$

Solution:
Label the four vertices of the tetrahedron and the midpoint of $\overline {AB}$ , and notice that the area of the base of the tetrahedron, $\triangle ABC$ , equals $192$ , according to Solution 1.
Notice that the altitude of $\triangle CPM$ from $\overline {CM}$ to point $P$ is the height of the tetrahedron. Side $\overline {PM}$ is can be found using the Pythagorean Theorem on $\triangle APM$ , giving us $\overline {PM}=\sqrt{481}.$
Using Heron's Formula, the area of $\triangle CPM$ can be written as \[\sqrt{\frac{41+\sqrt{481}}{2}(\frac{41+\sqrt{481}}{2}-16)(\frac{41+\sqrt{481}}{2}-25)(\frac{41+\sqrt{481}}{2}-\sqrt{481})}\] \[=\frac{\sqrt{(41+\sqrt{481})(9+\sqrt{481})(-9+\sqrt{481})(41-\sqrt{481})}}{4}\]
Notice that both $(41+\sqrt{481})(41-\sqrt{481})$ and $(9+\sqrt{481})(-9+\sqrt{481})$ can be rewritten as differences of squares; thus, the expression can be written as \[\frac{\sqrt{(41^2-481)(481-9^2)}}{4}=\frac{\sqrt{480000}}{4}=100\sqrt{3}.\]
From this, we can determine the height of both $\triangle CPM$ and tetrahedron $ABCP$ to be $\frac{100\sqrt{3}}{8}$ ; therefore, the volume of the tetrahedron equals $\frac{100\sqrt{3}}{8} \cdot 192=800\sqrt{3}$ ; thus, $m+n=800+3=\boxed{803}.$

Solution: Notation is shown on diagram. \[AM = MB = c = 12, AC = BC = b = 20,\] \[DA = DB = DC = a = 25.\] \[CM = x + y = \sqrt{b^2-c^2} = 16,\] \[x^2 - y^2 = CD^2 – DM^2 = CD^2 – (BD^2 – BM^2) = c^2 = 144,\] \[x – y = \frac{x^2 – y^2}{x+y} = \frac {c^2} {16} = 9,\] \[x = \frac {16 + 9}{2} = \frac {a}{2},\] \[h = \sqrt{a^2 -\frac{ a^2}{4}} = a \frac {\sqrt{3}}{2},\] \[V = \frac{h\cdot CM \cdot c}{3}= \frac{16\cdot 25 \sqrt{3} \cdot 12}{3} = 800 \sqrt{3} \implies \boxed{803}.\] vladimir.shelomovskii@gmail.com, vvsss