Answer: 462.0

Squares $S_1$ and $S_2$ are inscribed in right triangle $ABC$ , as shown in the figures below. Find $AC + CB$ if area $(S_1) = 441$ and area $(S_2) = 440$
AIME 1987 Problem 15.png

Solution:
1987 AIME-15a.png
Because all the triangles in the figure are similar to triangle $ABC$ , it's a good idea to use area ratios . In the diagram above, $\frac {T_1}{T_3} = \frac {T_2}{T_4} = \frac {441}{440}.$ Hence, $T_3 = \frac {440}{441}T_1$ and $T_4 = \frac {440}{441}T_2$ . Additionally, the area of triangle $ABC$ is equal to both $T_1 + T_2 + 441$ and $T_3 + T_4 + T_5 + 440.$
Setting the equations equal and solving for $T_5$ $T_5 = 1 + T_1 - T_3 + T_2 - T_4 = 1 + \frac {T_1}{441} + \frac {T_2}{441}$ . Therefore, $441T_5 = 441 + T_1 + T_2$ . However, $441 + T_1 + T_2$ is equal to the area of triangle $ABC$ ! This means that the ratio between the areas $T_5$ and $ABC$ is $441$ , and the ratio between the sides is $\sqrt {441} = 21$ . As a result, $AB = 21\sqrt {440} = \sqrt {AC^2 + BC^2}$ . We now need $(AC)(BC)$ to find the value of $AC + BC$ , because $AC^2 + BC^2 + 2(AC)(BC) = (AC + BC)^2$
Let $h$ denote the height to the hypotenuse of triangle $ABC$ . Notice that $h - \frac {1}{21}h = \sqrt {440}$ . (The height of $ABC$ decreased by the corresponding height of $T_5$ ) Thus, $(AB)(h) = (AC)(BC) = 22\cdot 21^2$ . Because $AC^2 + BC^2 +  2(AC)(BC) = (AC + BC)^2 = 21^2\cdot22^2$ $AC + BC = (21)(22) = \boxed{462}$

Solution: Let $\tan\angle ABC = x$ . Now using the 1st square, $AC=21(1+x)$ and $CB=21(1+x^{-1})$ . Using the second square, $AB=\sqrt{440}(1+x+x^{-1})$ . We have $AC^2+CB^2=AB^2$ , or \[441(x^2+x^{-2}+2x+2x^{-1}+2)=440(x^2+x^{-2}+2x+2x^{-1}+3).\] Rearranging and letting $u=x+x^{-1} \Rightarrow u^2 - 2 = x^2 + x^{-2}$ gives us $u^2+2u-440=0.$ We take the positive root, so $u=20$ , which means $AC+CB=21(2+x+x^{-1})=21(2+u)=\boxed{462}$

Solution:
Let $\theta$ be the smaller angle in the triangle. Then the sum of shorter and longer leg is $\sqrt{441}(2+\tan{\theta}+\cot{\theta})$ . We observe that the short leg has length $\sqrt{441}(1+\tan{\theta}) = \sqrt{440}(\sec{\theta}+\sin{\theta})$ . Grouping and squaring, we get $\sqrt{\frac{440}{441}} = \frac{\sin{\theta}+\cos{\theta}}{1+\sin{\theta}\cos{\theta}}$ . Squaring and using the double angle identity for sine, we get, $110(\sin{2\theta})^2 + \sin{2\theta} - 1 = 0$ . Solving, we get $\sin{2\theta} = \frac{1}{10}$ . Now to find $\tan{\theta}$ , we find $\cos{2\theta}$ using the Pythagorean
Identity, and then use the tangent double angle identity. Thus, $\tan{\theta} = 10-3\sqrt{11}$ . Substituting into the original sum,
we get $\boxed{462}$

Solution:
Label points as above. Let $x=AC$ $y=BC$ $s_1 = 21$ be the side length of $S_1$ , and $s_2 = \sqrt{440}$ be the side length of $S_2$
Since $\triangle ABC\sim\triangle AED$ , we have $\frac{x}{y} = \frac{x-s_1}{s_1}$
$\implies xs_1=xy-ys_1$
$\implies xy=s_1(x+y)$
$\implies xy=21(x+y) \qquad \qquad (*)$
Since $\triangle ABC\sim\triangle AWX\sim\triangle ZBY$ , we have $s_2 + \frac{s_2x}{y} + \frac{s_2y}{x}=\sqrt{x^2+y^2}$
$\implies s_2(x^2+xy+y^2)=xy\sqrt{x^2+y^2}$
$\implies s_2^2(x^2+xy+y^2)^2 = x^2y^2(x^2+y^2)$
$\implies 440(x^2+xy+y^2)^2 = x^2y^2(x^2+y^2)$
Let $t=x+y$ . Repeatedly applying $(*)$ , we get \[440(t^2-21t)^2 = 441t^2(t^2 - 42t)\] \[440(t-21)^2 = 441(t^2-42t)\] \[440t^2 - 42\cdot 440t + 440\cdot 441 = 441t^2 - 441\cdot 42t\] \[t^2-42t-440\cdot 441=0\] \[(t-21)^2 = 441^2\] \[t-21=441\] \[t=\boxed{462}\]


Answer: 103.0

Star lists the whole numbers $1$ through $30$ once. Emilio copies Star's numbers, replacing each occurrence of the digit $2$ by the digit $1$ . Star adds her numbers and Emilio adds his numbers. How much larger is Star's sum than Emilio's?
$\textbf{(A)}\ 13\qquad\textbf{(B)}\ 26\qquad\textbf{(C)}\ 102\qquad\textbf{(D)}\ 103\qquad\textbf{(E)}\ 110$

Solution: For every tens digit 2, we subtract 10, and for every units digit 2, we subtract 1. Because 2 appears 10 times as a tens digit and 2 appears 3 times as a units digit, the answer is $10\cdot 10+1\cdot 3=\boxed{103.}$


Answer: 67.0

Starting at $(0,0),$ an object moves in the coordinate plane via a sequence of steps, each of length one.  Each step is left, right, up, or down, all four equally likely.  Let $p$ be the probability that the object reaches $(2,2)$ in six or fewer steps.  Given that $p$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$

Solution:
It takes an even number of steps for the object to reach $(2,2)$ , so the number of steps the object may have taken is either $4$ or $6$
If the object took $4$ steps, then it must have gone two steps and two steps , in some permutation. There are $\frac{4!}{2!2!} = 6$ ways for these four steps of occuring, and the probability is $\frac{6}{4^{4}}$
If the object took $6$ steps, then it must have gone two steps and two steps , and an additional pair of moves that would cancel out, either N/S or W/E . The sequences N,N,N,E,E,S can be permuted in $\frac{6!}{3!2!1!} = 60$ ways. However, if the first four steps of the sequence are N,N,E,E in some permutation, it would have already reached the point $(2,2)$ in four moves. There are $\frac{4!}{2!2!}$ ways to order those four steps and $2!$ ways to determine the order of the remaining two steps, for a total of $12$ sequences that we have to exclude. This gives $60-12=48$ sequences of steps. There are the same number of sequences for the steps N,N,E,E,E,W , so the probability here is $\frac{2 \times 48}{4^6}$
The total probability is $\frac{6}{4^4} + \frac{96}{4^6} = \frac{3}{64}$ , and $m+n= \boxed{067}$

Solution:
Let's let the object wander for 6 steps so we get a constant denominator of $4^{6}$
In the first case, we count how many ways the object can end at (2,2), at the end of 6 steps. We will also count it even if we go to (2,2), and go back to (2,2). So, there are 2 different paths for the object to end at (2,2):
1.To go a permutation of R,R,R,U,U,L or
2.To go a permutation of R,R,U,U,U,D.
There are 60 ways to permute for each case, giving a total of 120 ways for the object to succeed and end at (2,2). In these 120 ways the object could reach (2,2) first and then come back to (2,2). This will be a factor in our second case.
In the second case, the object can get to (2,2) first in 4 moves, then move away from (2,2) with the remaing 2 moves. So, there are 6 ways to get to (2,2) in 4 moves, then there are 16 ways the object can "move around", but 4 of the ways will return the object back to (2,2). Those 4 ways were already counted in the first case, so we should only count 12 of the 16 ways to prevent over-counting. Thus, there are $12*6 =$ 72 ways in the second case.
So, in all, there are 120+72 ways for the object to achieve it's goal of moving to (2,2). Put that over our denominator, we get $\frac{192}{4^{6}} = \frac{3}{4^{3}} = \frac{3}{64}$ , in which adding the numerator and denominator get us an answer of $\boxed{067}$


Answer: 45.0

Starting with some gold coins and some empty treasure chests, I tried to put $9$ gold coins in each treasure chest, but that left $2$ treasure chests empty.  So instead I put $6$ gold coins in each treasure chest, but then I had $3$ gold coins left over.  How many gold coins did I have?
$\textbf{(A) }9\qquad\textbf{(B) }27\qquad\textbf{(C) }45\qquad\textbf{(D) }63\qquad\textbf{(E) }81$

Solution:
We can represent the amount of gold with $g$ and the amount of chests with $c$ . We can use the problem to make the following equations: \[9c-18 = g\] \[6c+3 = g\]
We do this because for 9 chests there are 2 empty and if 9 were in each 9 multiplied by 2 is 18 left.
Therefore, $6c+3 = 9c-18.$ This implies that $c = 7.$ We therefore have $g = 45.$ So, our answer is $\boxed{45}$ .
~CHECKMATE2021

Solution: With $9$ coins, there are $\frac{9}{9}+2=1+2=3$ chests, by the first condition. These don't fit in with the second condition, so we move onto $27$ coins. By the same first condition, there are $5$ chests( $\frac{27}{9}+2$ ). This also doesn't fit with the second condition. So, onto $45$ coins. The first condition implies that there are $\frac{45}{9}+2=7$ chests, which DOES fit with the second condition, since $6\cdot7+3=42+3=45$ . Thus, the desired value is $\boxed{45}$


Answer: 9.0

Steph scored $15$ baskets out of $20$ attempts in the first half of a game, and $10$ baskets out of $10$ attempts in the second half. Candace took $12$ attempts in the first half and $18$ attempts in the second. In each half, Steph scored a higher percentage of baskets than Candace. Surprisingly they ended with the same overall percentage of baskets scored. How many more baskets did Candace score in the second half than in the first? [asy] size(7cm); draw((-8,27)--(72,27)); draw((16,0)--(16,35)); draw((40,0)--(40,35)); label("12", (28,3)); draw((25,6.5)--(25,12)--(31,12)--(31,6.5)--cycle); draw((25,5.5)--(31,5.5)); label("18", (56,3)); draw((53,6.5)--(53,12)--(59,12)--(59,6.5)--cycle); draw((53,5.5)--(59,5.5)); draw((53,5.5)--(59,5.5)); label("20", (28,18)); label("15", (28,24)); draw((25,21)--(31,21)); label("10", (56,18)); label("10", (56,24)); draw((53,21)--(59,21)); label("First Half", (28,31)); label("Second Half", (56,31)); label("Candace", (2.35,6)); label("Steph", (0,21)); [/asy] $\textbf{(A) } 7\qquad\textbf{(B) } 8\qquad\textbf{(C) } 9\qquad\textbf{(D) } 10\qquad\textbf{(E) } 11$

Solution: Let $x$ be the number of shots that Candace made in the first half, and let $y$ be the number of shots Candace made in the second half. Since Candace and Steph took the same number of attempts, with an equal percentage of baskets scored, we have $x+y=10+15=25.$ In addition, we have the following inequalities: \[\frac{x}{12}<\frac{15}{20} \implies x<9,\] and \[\frac{y}{18}<\frac{10}{10} \implies y<18.\] Pairing this up with $x+y=25$ we see the only possible solution is $(x,y)=(8,17),$ for an answer of $17-8 = \boxed{9}.$

Solution: Clearly, Steph made $15 + 10 = 25$ shots in total. Also, due to parity reasons, the difference between the amount of shots Candace made in the first and second half must be odd. Thus, we can just test 7, 9, and 11, and after doing so we find that the answer is $\boxed{9}.$

Solution: Steph made 75 percent of his shots in the first half. He makes all of his shots in the second half. The most baskets Candace could have made in the first half is 8 baskets. The most she could have made in the second half is 17 baskets. Steph makes 25 and misses 5 baskets and the only way for Candace to make 25 shots is to make 8 in the first half and 17 in the second. Thus, $17 - 8 = \boxed{9}.$


Answer: 440.0

Steve says to Jon, "I am thinking of a polynomial whose roots are all positive integers. The polynomial has the form $P(x) = 2x^3-2ax^2+(a^2-81)x-c$ for some positive integers $a$ and $c$ . Can you tell me the values of $a$ and $c$ ?"
After some calculations, Jon says, "There is more than one such polynomial."
Steve says, "You're right.  Here is the value of $a$ ." He writes down a positive integer and asks, "Can you tell me the value of $c$ ?"
Jon says, "There are still two possible values of $c$ ."
Find the sum of the two possible values of $c$

Solution:
We call the three roots (some may be equal to one another) $x_1$ $x_2$ , and $x_3$ .  Using Vieta's formulas, we get $x_1+x_2+x_3 = a$ $x_1 \cdot x_2+x_1 \cdot x_3+x_2 \cdot x_3 = \frac{a^2-81}{2}$ , and $x_1 \cdot x_2 \cdot x_3 = \frac{c}{2}$
Squaring our first equation we get $x_1^2+x_2^2+x_3^2+2 \cdot x_1 \cdot x_2+2 \cdot x_1 \cdot x_3+2 \cdot x_2 \cdot x_3 = a^2$
We can then subtract twice our second equation to get $x_1^2+x_2^2+x_3^2 = a^2-2 \cdot \frac{a^2-81}{2}$
Simplifying the right side:
\begin{align*} a^2-2 \cdot \frac{a^2-81}{2} &= a^2-a^2+81\\ &= 81.\\ \end{align*}
So, we know $x_1^2+x_2^2+x_3^2 = 81$
We can then list out all the triples of positive integers whose squares sum to $81$
We get $(1, 4, 8)$ $(3, 6, 6)$ , and $(4, 4, 7)$
These triples give $a$ values of $13$ $15$ , and $15$ , respectively, and $c$ values of $64$ $216$ , and $224$ , respectively.
We know that Jon still found two possible values of $c$ when Steve told him the $a$ value, so the $a$ value must be $15$ .  Thus, the two $c$ values are $216$ and $224$ , which sum to $\boxed{440}$

Solution:
First things first. Vietas gives us the following:
\begin{align} x_1+x_2+x_3 = a\\ x_1 \cdot x_2+x_1 \cdot x_3+x_2 \cdot x_3 = \frac{a^2-81}{2}\\ x_1 \cdot x_2 \cdot x_3 = \frac{c}{2} \end{align}
From $(2)$ $a$ must have odd parity, meaning $a^2-81$ must be a multiple of $4$ , which implies that both sides of $(2)$ are even. Then, from $(1)$ , we see that an odd number of $x_1$ $x_2$ , and $x_3$ must be odd, because we have already deduced that $a$ is odd. In order for both sides of $(2)$ to be even, there must only be one odd number and two even numbers.
Now, the theoretical maximum value of the left side of $(2)$ is $3 \cdot \biggl(\frac{a}{3}\biggr)^2=\frac{a^2}{3}$ . That means that the maximum bound of $a$ is where \[\frac{a^2}{3} > \frac{a^2-81}{2},\] which simplifies to $\sqrt{243} > a$ , meaning \[16 > a.\] So now we have that $9<a$ from $(2)$ $a<16$ , and $a$ is odd from $(2)$ . This means that $a$ could equal $11$ $13$ , or $15$ . At this point, we have simplified the problem to the point where we can casework+ brute force. As said above, we arrive at our solutions of $(1, 4, 8)$ $(3, 6, 6)$ , and $(4, 4, 7)$ , of which the last two return equal $a$ values. Then, $2(3 \cdot 6 \cdot 6+4 \cdot 4 \cdot 7)=\boxed{440}$ AWD.

Solution:
Since each of the roots is positive, the local maximum of the function must occur at a positive value of $x$ . Taking $\frac{d}{dx}$ of the polynomial yields $6x^2-4ax+a^2-81$ , which is equal to $0$ at the local maximum. Since this is a quadratic in $a$ , we can find an expression for $a$ in terms of $x$ . The quadratic formula gives $a=\frac{4x\pm\sqrt{324-8x^2}}{2}$ , which simplifies to $a=2x\pm\sqrt{81-2x^2}$ . We know that $a$ is a positive integer, and testing small positive integer values of $x$ yields $a=15$ or $a=1$ when $x=4$ , and $a=15$ or $a=9$ when $x=6$ . Because the value of $a$ alone does not determine the polynomial, $a$ $a$ must equal $15$
Now our polynomial equals $2x^3-30x^2+144x-c$ . Because one root is less than (or equal to) the $x$ value at the local maximum (picture the graph of a cubic equation), it suffices to synthetically divide by small integer values of $x$ to see if the resulting quadratic also has positive integer roots. Dividing by $x=3$ leaves a quotient of $2x^2-24x+72=2(x-6)^2$ , and dividing by $x=4$ leaves a quotient of $2x^2-22x+56=2(x-4)(x-7)$ . Thus, $c=2\cdot 3\cdot 6\cdot 6=216$ , or $c=2\cdot 4\cdot 4\cdot 7=224$ . Our answer is $216+224=\boxed{440}$ ~bad_at_mathcounts


Answer: 11.0

Steve wrote the digits $1$ $2$ $3$ $4$ , and $5$ in order repeatedly from left to right, forming a list of $10,000$ digits, beginning $123451234512\ldots.$ He then erased every third digit from his list (that is, the $3$ rd, $6$ th, $9$ th, $\ldots$ digits from the left), then erased every fourth digit from the resulting list (that is, the $4$ th, $8$ th, $12$ th, $\ldots$ digits from the left in what remained), and then erased every fifth digit from what remained at that point. What is the sum of the three digits that were then in the positions $2019, 2020, 2021$
$\textbf{(A)}\ 7 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)}\ 12$

Solution:
Note that cycles exist initially and after each round of erasing.
Let the parentheses denote cycles. It follows that:
Since $2019,2020,2021$ are congruent to $3,4,5$ modulo $12,$ respectively, the three digits in the final positions $2019,2020,2021$ are $4,2,5,$ respectively: \[(12\underline{425}3415251).\] Therefore, the answer is $4+2+5=\boxed{11}.$

Solution:
After erasing every third digit, the list becomes $1245235134\ldots$ repeated. After erasing every fourth digit from this list, the list becomes $124235341452513\ldots$ repeated. Finally, after erasing every fifth digit from this list, the list becomes $124253415251\ldots$ repeated. Since this list repeats every $12$ digits and $2019,2020,2021$ are $3,4,5$ respectively
in $\pmod{12},$ we have that the $2019$ th, $2020$ th, and $2021$ st digits are the $3$ rd, $4$ th, and $5$ th digits respectively. It follows that the answer is $4+2+5= \boxed{11}.$

Solution:
Note that cycles exist initially and after each round of erasing.
We will consider one cycle after all three rounds of erasing. Suppose this cycle has length $L$ before any round of erasing. It follows that:
The least such positive integer $L$ is $\operatorname{lcm}(5,3,2,5)=30.$ So, there is a repeating pattern for every $30$ digits on the original list. As shown below, the digits erased in the first, second, and third rounds are colored in red, yellow, and green, respectively:  As indicated by the white squares, each group of $30$ digits on the original list has $\frac25\cdot30=12$ digits remaining on the final list.
Since $2019,2020,2021$ are congruent to $3,4,5$ modulo $12,$ respectively, the three digits in the final positions $2019,2020,2021$ are $4,2,5,$ respectively:  Therefore, the answer is $4+2+5=\boxed{11}.$

Solution: As the LCM of $3$ $4$ , and $5$ is $60$ , let us look at a $60$ -digit block of original numbers (many will be erased by Steve). After he erases every third number $\left(\dfrac{1}{3}\right)$ , then every fourth number of what remains $\left(\dfrac{1}{4}\right)$ , then every fifth number of what remains $\left(\dfrac{1}{5}\right)$ , we are left with $\dfrac{2}{3} \cdot \dfrac{3}{4} \cdot \dfrac{4}{5} \cdot 60=24$ digits from this $60$ -digit block. $2019 \equiv 3 \pmod {24}, 2020 \equiv 4 \pmod {24}, 2021 \equiv 5 \pmod {24}$ . Writing out the first few digits of this sequence, we have $\underbrace{1}_{\#1}, \underbrace{2}_{\#2}, \cancel{3}, \underbrace{4}_{\#3}, \cancel{5}, \cancel{1}, \underbrace{2}_{\#4}, \cancel{3}, \cancel{4}, \underbrace{5}_{\#5}, \dots$ . Therefore, our answer is $4+2+5=\boxed{11}$

Solution:
Lemma: Given a sequence $a_1, a_2, a_3, \cdots$ , and an positive integer $k>2$ . If we erase every $k$ th item in this sequence, and we name $b_1, b_2, b_3, \cdots$ as the remaining sequence.
Then we have \[b_{(k-1)m+1}=a_{km+1}, b_{(k-1)m+2}=a_{km+2}, \cdots, b_{(k-1)m+k-1}=a_{km+k-1}.\]
Proof:  For $a_{km+j}$ with some $j, 1\le j\le k-1$ , we will have $m$ items removed before this item, so it becomes $b_{(k-1)m+j}$ in the new sequence. Hence, we have $b_{(k-1)m+j}=a_{km+j}$
If we start with $a_1, a_2, a_3, \cdots,$ and let $b_1, b_2, \cdots$ be the sequence after removing all the indexes that are multiples of $3$ . Then, we have $b_{2n+1}=a_{3n+1},b_{2n+2}=a_{3n+2}$
Similarly, if we start with $b_1, b_2, b_3, \cdots,$ and remove all multiples of $4$ , and get $c_1, c_2, \cdots$ We have $c_{3n+1}=b_{4n+1},c_{3n+2}=b_{4n+2},  c_{3n+3}=b_{4n+3}$
If we start with $c_1, c_2, \cdots$ and $d_1, d_2, \cdots$ are remove all multiples of $5$ , we get \[d_{4n+1}=c_{5n+1}, d_{4n+2}=c_{5n+2}, d_{4n+3}=c_{5n+3}, d_{4n+4}=c_{5n+4}.\] Therefore, \begin{align*} d_{2019}&=d_{4\cdot504+3}=c_{5\cdot 504+3}=c_{2523}=c_{3\cdot 840+3}=b_{4\cdot 840+3}=b_{3363}=b_{2\cdot 1681+1}=a_{3\cdot 1681+1}=a_{5044}=a_4=4, \\ d_{2020}&=d_{4\cdot504+4}=c_{5\cdot 504+4}=c_{2524}=c_{3\cdot841+1}=b_{4\cdot841+1}=b_{3365}=b_{2\cdot1682+1}=a_{3\cdot 1682+1}=a_{5047}=a_2=2, \\ d_{2021}&=d_{4\cdot505+1}=c_{5\cdot505+1}=c_{2526}=c_{3\cdot841+3}=b_{4\cdot841+3}=b_{3367}=b_{2\cdot1683+1}=a_{3\cdot1683+1}=a_{5050}=a_5=5, \end{align*} and the answer is $4+2+5=\boxed{11}$


Answer: 40.0

Steve's empty swimming pool will hold $24,000$ gallons of water when full. It will be filled by $4$ hoses, each of which supplies $2.5$ gallons of water per minute. How many hours will it take to fill Steve's pool?
$\textbf{(A)}\  40  \qquad \textbf{(B)}\   42  \qquad \textbf{(C)}\  44   \qquad \textbf{(D)}\  46   \qquad \textbf{(E)}\   48$

Solution: Each of the four hoses hose fills $24,000/4 = 6,000$ gallons of water. At the rate it goes at it will take $6,000/2.5 = 2400$ minutes, or $\boxed{40}$ hours.

Solution: If all four hoses fill $2.5$ gallons a minute, every minute $10$ gallons would be added. Since every hour has $60$ minutes, $600$ gallons of water would be added every hour. $24000/600=\boxed{40}$ hours.


Answer: 180.0

Students from three middle schools worked on a summer project.
The total amount paid for the students' work was 744.  Assuming each student received the same amount for a day's work, how much did the students from Balboa school earn altogether?
$\text{(A)}\ 9.00\text{ dollars} \qquad \text{(B)}\ 48.38\text{ dollars} \qquad \text{(C)}\ 180.00\text{ dollars} \qquad \text{(D)}\ 193.50\text{ dollars} \qquad \text{(E)}\ 258.00\text{ dollars}$

Solution: Altogether, the summer project totaled $(7)(3)+(4)(5)+(5)(9)=21+20+45=86$ days of work for a single student. This equals $744/86=9$ dollars per day per student. The students from Balboa school earned $9(4)(5)=\boxed{180.00}$


Answer: 37.0

Students guess that Norb's age is $24, 28, 30, 32, 36, 38, 41, 44, 47$ , and $49$ . Norb says, "At least half of you guessed too low, two of you are off by one, and my age is a prime number." How old is Norb?
$\textbf{(A) }29\qquad\textbf{(B) }31\qquad\textbf{(C) }37\qquad\textbf{(D) }43\qquad\textbf{(E) }48$

Solution:
If at least half the guesses are too low, then Norb's age must be greater than $36.$
If two of the guesses are off by one, then his age is in between two guesses whose difference is $2.$ It could be $31,37,$ or $48,$ but because his age is greater than $36$ it can only be $37$ or $48.$
Lastly, Norb's age is a prime number so the answer must be $\boxed{37}$

Solution: Since two guesses are off by one, we know that both $x+1$ and $x-1$ are in the list where $x$ is the age of Norb. Now, we know that $x+1$ and $x-1$ are $28$ and $30$ $30$ and $32$ $36$ and $38$ and $47$ and $49$ . From these values, we know that $x$ must be $29$ $31$ , and $37$ . Since half of the guesses are too low, $24, 28, 30, 32,$ and $36$ are all too low so we can eliminate all numbers in our list lesser than or equal to $36$ . Therefore, our list has only $37$ left so the answer is $\boxed{37}$


Answer: 28.0

Successive discounts of $10\%$ and $20\%$ are equivalent to a single discount of:
$\textbf{(A)}\ 30\%\qquad\textbf{(B)}\ 15\%\qquad\textbf{(C)}\ 72\%\qquad\textbf{(D)}\ 28\%\qquad\textbf{(E)}\ \text{None of these}$

Solution: Without loss of generality, assume something costs $100$ dollars. Then with each successive discount, it would cost $90$ dollars, then $72$ dollars. This amounts to a total of $28$ dollars off, so the single discount would be $\boxed{28}$


Answer: 75.0

Suppose $15\%$ of $x$ equals $20\%$ of $y.$ What percentage of $x$ is $y?$
$\textbf{(A) }5 \qquad \textbf{(B) }35 \qquad \textbf{(C) }75 \qquad \textbf{(D) }133 \frac13 \qquad \textbf{(E) }300$

Solution: Since $20\% = \frac{1}{5}$ , multiplying the given condition by $5$ shows that $y$ is $15 \cdot 5 = \boxed{75}$ percent of $x$

Solution: Letting $x=100$ (without loss of generality), the condition becomes $0.15\cdot 100 = 0.2\cdot y \Rightarrow 15 = \frac{y}{5} \Rightarrow y=75$ . Clearly, it follows that $y$ is $75\%$ of $x$ , so the answer is $\boxed{75}$

Solution: We have $15\%=\frac{3}{20}$ and $20\%=\frac{1}{5}$ , so $\frac{3}{20}x=\frac{1}{5}y$ . Solving for $y$ , we multiply by $5$ to give $y = \frac{15}{20}x = \frac{3}{4}x$ , so the answer is $\boxed{75}$

Solution: We are given $0.15x = 0.20y$ , so we may assume without loss of generality that $x=20$ and $y=15$ . This means $\frac{y}{x}=\frac{15}{20}=\frac{75}{100}$ , and thus the answer is $\boxed{75}$

Solution: $15\%$ of $x$ is $0.15x$ , and $20\%$ of $y$ is $0.20y$ . We put $0.15x$ and $0.20y$ into an equation, creating $0.15x = 0.20y$ because $0.15x$ equals $0.20y$ . Solving for $y$ , dividing $0.2$ to both sides, we get $y = \frac{15}{20}x = \frac{3}{4}x$ , so the answer is $\boxed{75}$

Solution: $15\%$ of $x$ can be written as $\frac{15}{100}x$ , or $\frac{15x}{100}$ $20\%$ of $y$ can similarly be written as $\frac{20}{100}y$ , or $\frac{20y}{100}$ . So now, $\frac{15x}{100} = \frac{20y}{100}$ . Using cross-multiplication, we can simplify the equation as: $1500x = 2000y$ . Dividing both sides by $500$ , we get: $3x = 4y$ $\frac{3}{4}$ is the same thing as $75\%$ , so the answer is $\boxed{75}$


Answer: 100.0

Suppose $A>B>0$ and A is $x$ % greater than $B$ . What is $x$
$\textbf {(A) } 100\left(\frac{A-B}{B}\right) \qquad \textbf {(B) } 100\left(\frac{A+B}{B}\right) \qquad \textbf {(C) } 100\left(\frac{A+B}{A}\right)\qquad \textbf {(D) } 100\left(\frac{A-B}{A}\right) \qquad \textbf {(E) } 100\left(\frac{A}{B}\right)$

Solution:
We have that A is $x\%$ greater than B, so $A=\frac{100+x}{100}(B)$ . We solve for $x$ . We get
$\frac{A}{B}=\frac{100+x}{100}$
$100\frac{A}{B}=100+x$
$100\left(\frac{A}{B}-1\right)=x$
$100\left(\frac{A-B}{B}\right)=x$ $\boxed{100}$

Solution: The question is basically asking the percentage increase from $B$ to $A$ . We know the formula for percentage increase is $\frac{\text{New-Original}}{\text{Original}}$ . We know the new is $A$ and the original is $B$ . We also must multiple by $100$ to get $x$ out of it's fractional/decimal form. Therefore, the answer is $100\left(\frac{A-B}{B}\right)$ or $\boxed{100}$

Solution: Without loss of generality, let $A = 125$ and $B = 100,$ forcing $x$ to be $25$ . Plugging our values for $A$ and $B$ into these answer choices, we find that only $\boxed{100}$ returns $25$


Answer: 4.0

Suppose $S$ cans of soda can be purchased from a vending machine for $Q$ quarters. Which of the following expressions describes the number of cans of soda that can be purchased for $D$ dollars, where $1$ dollar is worth $4$ quarters?
$\textbf{(A) } \frac{4DQ}{S} \qquad \textbf{(B) } \frac{4DS}{Q} \qquad \textbf{(C) } \frac{4Q}{DS} \qquad \textbf{(D) } \frac{DQ}{4S} \qquad \textbf{(E) } \frac{DS}{4Q}$

Solution: Each can of soda costs $\frac QS$ quarters, or $\frac{Q}{4S}$ dollars. Therefore, $D$ dollars can purchase $\frac{D}{\left(\tfrac{Q}{4S}\right)}=\boxed{4}$ cans of soda.

Solution:
Note that $S$ is in the unit of $\text{can}.$ On the other hand, $Q$ and $D$ are both in the unit of $\text{cost}.$
The units of $\textbf{(A)},\textbf{(B)},\textbf{(C)},\textbf{(D)},$ and $\textbf{(E)}$ are $\frac{\text{cost}^2}{\text{can}},\text{can},\frac{1}{\text{can}},\frac{\text{cost}^2}{\text{can}},$ and $\text{can},$ respectively. Since the answer is in the unit of $\text{can},$ we eliminate $\textbf{(A)},\textbf{(C)},$ and $\textbf{(D)}.$ Moreover, it is clear that $D$ dollars can purchase more than $S=\frac{DS}{4Q}$ cans of soda, so we eliminate $\textbf{(E)}.$
Finally, the answer is $\boxed{4}.$


Answer: 438.0

Suppose $a$ $b$ $c$ are positive integers such that \[a+b+c=23\] and \[\gcd(a,b)+\gcd(b,c)+\gcd(c,a)=9.\] What is the sum of all possible distinct values of $a^2+b^2+c^2$
$\textbf{(A)}\: 259\qquad\textbf{(B)} \: 438\qquad\textbf{(C)} \: 516\qquad\textbf{(D)} \: 625\qquad\textbf{(E)} \: 687$

Solution:
Because $a + b + c$ is odd, $a$ $b$ $c$ are either one odd and two evens or three odds.
$\textbf{Case 1}$ $a$ $b$ $c$ have one odd and two evens.
Without loss of generality, we assume $a$ is odd and $b$ and $c$ are even.
Hence, ${\rm gcd} \left( a , b \right)$ and ${\rm gcd} \left( a , c \right)$ are odd, and ${\rm gcd} \left( b , c \right)$ is even.
Hence, ${\rm gcd} \left( a , b \right) + {\rm gcd} \left( b , c \right) + {\rm gcd} \left( c , a \right)$ is even. This violates the condition given in the problem.
Therefore, there is no solution in this case.
$\textbf{Case 2}$ $a$ $b$ $c$ are all odd.
In this case, ${\rm gcd} \left( a , b \right)$ ${\rm gcd} \left( a , c \right)$ ${\rm gcd} \left( b , c \right)$ are all odd.
Without loss of generality, we assume \[ {\rm gcd} \left( a , b \right) \leq {\rm gcd} \left( b , c \right) \leq {\rm gcd} \left( c , a \right) . \] $\textbf{Case 2.1}$ ${\rm gcd} \left( a , b \right) = 1$ ${\rm gcd} \left( b , c \right) = 1$ ${\rm gcd} \left( c , a \right) = 7$
The only solution is $(a, b, c) = (7, 9, 7)$
Hence, $a^2 + b^2 + c^2 = 179$
$\textbf{Case 2.2}$ ${\rm gcd} \left( a , b \right) = 1$ ${\rm gcd} \left( b , c \right) = 3$ ${\rm gcd} \left( c , a \right) = 5$
The only solution is $(a, b, c) = (5, 3, 15)$
Hence, $a^2 + b^2 + c^2 = 259$
$\textbf{Case 2.3}$ ${\rm gcd} \left( a , b \right) = 3$ ${\rm gcd} \left( b , c \right) = 3$ ${\rm gcd} \left( c , a \right) = 3$
There is no solution in this case.
Therefore, putting all cases together, the answer is $179 + 259 = \boxed{438}$

Solution:
Let $\gcd(a,b)=x$ $\gcd(b,c)=y$ $\gcd(c,a)=z$ . Without the loss of generality, let $x \le y \le z$ . We can split this off into cases:
$x=1,y=1,z=7$ : let $a=7A, c=7C,$ we can try all possibilities of $A$ and $C$ to find that $a=7, b=9, c=7$ is the only solution.
$x=1,y=2,z=6$ : No solutions. By $y$ and $z$ , we know that $a$ $b$ , and $c$ have to all be divisible by $2$ . Therefore, $x$ cannot be equal to $1$
$x=1,y=3,z=5$ : Note that $c$ has to be both a multiple of $3$ and $5$ . Therefore, $c$ has to be a multiple of $15$ . The only solution for this is $a=5, b=3, c=15$
$x=1,y=4,z=4$ : No solutions. By $y$ and $z$ , we know that $a$ $b$ , and $c$ have to all be divisible by $4$ . Therefore, $x$ cannot be equal to $1$
$x=2,y=2,z=5$ : No solutions. By $x$ and $y$ , we know that $a$ $b$ , and $c$ have to all be divisible by $2$ . Therefore, $z$ cannot be equal to $5$
$x=2,y=3,z=4$ : No solutions. By $x$ and $z$ , we know that $a$ $b$ , and $c$ have to all be divisible by $2$ . Therefore, $y$ cannot be equal to $3$
$x=3,y=3,z=3$ : No solutions. As $a$ $b$ , and $c$ have to all be divisible by $3$ $a+b+c$ has to be divisible by $3$ . This contradicts the sum $a+b+c=23$
Putting these solutions together, we have $(7^2+9^2+7^2)+(5^2+3^2+15^2)=179+259=\boxed{438}$

Solution:
Since $a+b+c=23$ $\gcd(a,b,c)=23$ or $\gcd(a,b,c)=1$
As $\gcd(a,b)+\gcd(b,c)+\gcd(c,a)=9$ , it is impossible for $\gcd(a,b,c)=23$ , so $\gcd(a,b,c)=1$
This means that $\gcd(a,b)$ $\gcd(b,c)$ , and $\gcd(c,a)$ must all be coprime. The only possible ways for this to be true are $1+1+7=9$ and $1+3+5=9$
Without loss of generality, let $a\le b\le c$ . Since $a+b+c=23$ , then $a=7, b=7, c=9$ or $a=3, b=5, c=15$
$(7^2+7^2+9^2)+(3^2+5^2+15^2)=179+259=\boxed{438}$


Answer: 0.0

Suppose $a$ $b$ , and $c$ are nonzero real numbers, and $a+b+c=0$ . What are the possible value(s) for $\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}+\frac{abc}{|abc|}$
$\textbf{(A) }0\qquad\textbf{(B) }1\text{ and }-1\qquad\textbf{(C) }2\text{ and }-2\qquad\textbf{(D) }0,2,\text{ and }-2\qquad\textbf{(E) }0,1,\text{ and }-1$

Solution:
There are $2$ cases to consider:
Case $1$ $2$ of $a$ $b$ , and $c$ are positive and the other is negative. Without loss of generality (WLOG), we can assume that $a$ and $b$ are positive and $c$ is negative. In this case, we have that \[\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}+\frac{abc}{|abc|}=1+1-1-1=0.\]
Case $2$ $2$ of $a$ $b$ , and $c$ are negative and the other is positive. WLOG, we can assume that $a$ and $b$ are negative and $c$ is positive. In this case, we have that \[\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}+\frac{abc}{|abc|}=-1-1+1+1=0.\]
Note these are the only valid cases, for neither $3$ negatives nor $3$ positives would work as they cannot sum up to $0$ . In both cases, we get that the given expression equals $\boxed{0}$


Answer: 492.0

Suppose $a$ $b$ and $c$ are positive integers with $a+b+c=2006$ , and $a!b!c!=m\cdot 10^n$ , where $m$ and $n$ are integers and $m$ is not divisible by $10$ . What is the smallest possible value of $n$
$\mathrm{(A)}\ 489 \qquad \mathrm{(B)}\ 492  \qquad \mathrm{(C)}\ 495 \qquad \mathrm{(D)}\ 498 \qquad \mathrm{(E)}\ 501$

Solution: The power of $10$ for any factorial is given by the well-known algorithm \[\left\lfloor \frac n{5}\right\rfloor + \left\lfloor \frac n{25}\right\rfloor + \left\lfloor \frac n{125}\right\rfloor + \cdots\] It is rational to guess numbers right before powers of $5$ because we won't have any extra numbers from higher powers of $5$ . As we list out the powers of 5, it is clear that $5^{4}=625$ is less than 2006 and $5^{5}=3125$ is greater. Therefore, set $a$ and $b$ to be 624. Thus, c is $2006-(624\cdot 2)=758$ . Applying the algorithm, we see that our answer is $152+152+188= \boxed{492}$

Solution:
Clearly, the power of $2$ that divides $n!$ is larger or equal than the power of $5$ which divides
it. Hence we are trying to minimize the power of $5$ that will divide $a!b!c!$
Consider $n! = 1\cdot 2 \cdot \dots \cdot n$ . Each fifth term is divisible by $5$ , each $25$ -th one
by $25$ , and so on. Hence the total power of $5$ that divides $n$ is $\left\lfloor \frac n{5}\right\rfloor + \left\lfloor \frac n{25}\right\rfloor + \cdots$ . (For any $n$ only finitely many terms in the sum
are
non-zero.)
In our case we have $a<2006$ , so the largest power of $5$ that will be less than $a$ is at most $5^4 = 625$ . Therefore the power of $5$ that divides $a!$ is equal to $\left\lfloor \frac a{5}\right\rfloor + \left\lfloor \frac a{25}\right\rfloor + \left\lfloor \frac a{125}\right\rfloor + \left\lfloor \frac a{625}\right\rfloor$ . The same
is true for $b$ and $c$
Intuition may now try to lure us to split $2006$ into $a+b+c$ as evenly as possible, giving $a=b=669$ and $c=668$ . However, this solution is not optimal.
To see how we can do better, let's rearrange the terms as follows:
\begin{align*} \text{result} & = \Big\lfloor \frac a{5}\Big\rfloor + \Big\lfloor \frac b{5}\Big\rfloor + \Big\lfloor \frac c{5}\Big\rfloor \\ & + \Big\lfloor \frac a{25}\Big\rfloor + \Big\lfloor \frac b{25}\Big\rfloor + \Big\lfloor \frac c{25}\Big\rfloor \\ & + \Big\lfloor \frac a{125}\Big\rfloor + \Big\lfloor \frac b{125}\Big\rfloor + \Big\lfloor \frac c{125}\Big\rfloor \\ & + \Big\lfloor \frac a{625}\Big\rfloor + \Big\lfloor \frac b{625}\Big\rfloor + \Big\lfloor \frac c{625}\Big\rfloor \end{align*}
The idea is that the rows of the above equation are roughly equal to $\left\lfloor \frac n{5}\right\rfloor$ $\left\lfloor \frac n{25}\right\rfloor$ , etc.
More precisely, we can now notice that for any positive integers $a,b,c,k$ we can write $a,b,c$ in the form $a=a_0k + a_1$ $b=b_0k+b_1$ $c=c_0k + c_1$ , where all $a_i,b_i,c_i$ are integers and $0\leq a_1,b_1,c_1<k$
It follows that \[\Big\lfloor \frac a{k}\Big\rfloor + \Big\lfloor \frac b{k}\Big\rfloor + \Big\lfloor \frac c{k}\Big\rfloor = a_0+b_0+c_0\] and \[\Big\lfloor \frac {a+b+c}k\Big\rfloor = a_0 + b_0 + c_0 + \Big\lfloor \frac {a_1+b_1+c_1}k\Big\rfloor \leq a_0 + b_0 + c_0 + 2\]
Hence we get that for any positive integers $a,b,c,k$ we have \[\Big\lfloor \frac a{k}\Big\rfloor + \Big\lfloor \frac b{k}\Big\rfloor + \Big\lfloor \frac c{k}\Big\rfloor \quad \geq \quad \Big\lfloor \frac {a+b+c}k\Big\rfloor - 2\]
Therefore for any $a,b,c$ the result is at least $\left\lfloor \frac n{5}\right\rfloor + \left\lfloor \frac n{25}\right\rfloor + \left\lfloor \frac n{125}\right\rfloor + \left\lfloor \frac n{625}\right\rfloor - 8 = 401 + 80 + 16 + 3 - 8 = 500 - 8 = 492$
If we now show how to pick $a,b,c$ so that we'll get the result $492$ , we will be done.
Consider the row with $625$ in the denominator. We need to achieve sum $1$ in this row,
hence we need to make two of the numbers smaller than $625$ . Choosing $a=b=624$ does this, and it will give us the largest possible remainders for $a$ and $b$ in
the other three rows, so this is a pretty good candidate. We can compute $c=2006-a-b=758$ and verify that this triple gives the desired result $\boxed{492}$


Answer: 200.0

Suppose $a$ is $150\%$ of $b$ . What percent of $a$ is $3b$
$\textbf{(A) } 50 \qquad \textbf{(B) } 66+\frac{2}{3} \qquad \textbf{(C) } 150 \qquad \textbf{(D) } 200 \qquad \textbf{(E) } 450$

Solution: Since $a=1.5b$ , that means $b=\frac{a}{1.5}$ . We multiply by $3$ to get a $3b$ term, yielding $3b=2a$ , and $2a$ is $\boxed{200}$ of $a$

Solution: Without loss of generality, let $b=100$ . Then, we have $a=150$ and $3b=300$ . Thus, $\frac{3b}{a}=\frac{300}{150}=2$ , so $3b$ is $200\%$ of $a$ . Hence the answer is $\boxed{200}$

Solution: As before, $a = 1.5b$ . Multiply by 2 to obtain $2a = 3b$ . Since $2 = 200\%$ , the answer is $\boxed{200}$

Solution: Without loss of generality, let $b=2$ . Then, we have $a=3$ and $3b=6$ . This gives $\frac{3b}{a}=\frac{6}{3}=2$ , so $3b$ is $200\%$ of $a$ , so the answer is $\boxed{200}$


Answer: 4.0

Suppose $a$ is a real number such that the equation \[a\cdot(\sin{x}+\sin{(2x)}) = \sin{(3x)}\] has more than one solution in the interval $(0, \pi)$ . The set of all such $a$ that can be written
in the form \[(p,q) \cup (q,r),\] where $p, q,$ and $r$ are real numbers with $p < q< r$ . What is $p+q+r$
$\textbf{(A) } {-}4 \qquad \textbf{(B) } {-}1 \qquad \textbf{(C) } 0 \qquad \textbf{(D) } 1 \qquad \textbf{(E) } 4$

Solution:
We are given that $a\cdot(\sin{x}+\sin{(2x)})=\sin{(3x)}$
Using the sine double angle formula combine with the fact that $\sin{(3x)} = \sin{x}\cdot(4\cos^2{x}-1)$ , which can be derived using sine angle addition with $\sin{(2x + x)}$ , we have \[a\cdot(\sin{x}+2\sin{x}\cos{x})=\sin{x}\cdot(4\cos^2{x}-1)\] Since $\sin{x} \ne 0$ as it is on the open interval $(0, \pi)$ , we can divide out $\sin{x}$ from both sides, leaving us with \[a\cdot(1+2\cos{x})=4\cos^2{x}-1\] Now, distributing $a$ and rearranging, we achieve the equation \[4\cos^2{x} - 2a\cos{x} - (1+a) = 0\] which is a quadratic in $\cos{x}$
Applying the quadratic formula to solve for $\cos{x}$ , we get \[\cos{x} =\frac{2a\pm\sqrt{4a^2+4(4)(1+a)}}{8}\] and expanding the terms under the radical, we get \[\cos{x} =\frac{2a\pm\sqrt{4a^2+16a+16}}{8}\] Factoring, since $4a^2+16a+16 = (2a+4)^2$ , we can simplify our expression even further to \[\cos{x} =\frac{a\pm(a+2)}{4}\]
Now, solving for our two solutions, $\cos{x} = -\frac{1}{2}$ and $\cos{x} = \frac{a+1}{2}$
Since $\cos{x} = -\frac{1}{2}$ yields a solution that is valid for all $a$ , that being $x = \frac{2\pi}{3}$ , we must now solve for the case where $\frac{a+1}{2}$ yields a valid value.
As $x\in (0, \pi)$ $\cos{x}\in (-1, 1)$ , and therefore $\frac{a+1}{2}\in (-1, 1)$ , and $a\in(-3,1)$
There is one more case we must consider inside this interval though, the case where $\frac{a+1}{2} = -\frac{1}{2}$ , as this would lead to a double root for $\cos{x}$ , yielding only one valid solution for $x$ . Solving for this case, $a \ne -2$
Therefore, combining this fact with our solution interval, $a\in(-3, -2) \cup (-2, 1)$ , so the answer is $-3-2+1 = \boxed{4}$

Solution:
We can optimize from the step from \[a\cdot(1+2\cos{x})=4\cos^2{x}-1\] in solution 1 by writing
\[a = \frac{4\cos^2{x}-1}{1+2\cos{x}} = 2\cos x - 1\]
and then get \[\cos x = \frac{a+1}{2}.\]
Now, solving for our two solutions, $\cos{x} = -\frac{1}{2}$ and $\cos{x} = \frac{a+1}{2}$
Since $\cos{x} = -\frac{1}{2}$ yields a solution that is valid for all $a$ , that being $x = \frac{2\pi}{3}$ , we must now solve for the case where $\frac{a+1}{2}$ yields a valid value.
As $x\in (0, \pi)$ $\cos{x}\in (-1, 1)$ , and therefore $\frac{a+1}{2}\in (-1, 1)$ , and $a\in(-3,1)$
There is one more case we must consider inside this interval though, the case where $\frac{a+1}{2} = -\frac{1}{2}$ , as this would lead to a double root for $\cos{x}$ , yielding only one valid solution for $x$ . Solving for this case, $a \ne -2$
Therefore, combining this fact with our solution interval, $a\in(-3, -2) \cup (-2, 1)$ , so the answer is $-3-2+1 = \boxed{4}$

Solution: Use the sum to product formula to obtain $2a\cdot\sin{\frac{3x}{2}}\cos{\frac{x}{2}}=\sin{3x}$ . Use the double angle formula on the RHS to obtain $a\cdot\sin{\frac{3x}{2}}\cos{\frac{x}{2}}=\sin{\frac{3x}{2}}\cos{\frac{3x}{2}}$ . From here, it is obvious that $x=\frac{2\pi}{3}$ is always a solution, and thus we divide by $\sin{\frac{3x}{2}}$ to get \[a\cdot\cos{\frac{x}{2}}=\cos{\frac{3x}{2}}\] We wish to find all $a$ such that there is at least one more solution to this equation distinct from $x=\frac{2\pi}{3}$ . Letting $y=\cos{\frac{x}{2}}$ , and noting that $\cos{\frac{3x}{2}}=4y^3-3y$ , we can rearrange our equation to $4y^3=y(3+a)$ The smallest value $x$ where $y=0$ is $\pi$ , which is not in our domain so we divide by $y$ to obtain $4y^2=a+3$ . By the trivial inequality, $a+3\ge{0}$ . Furthermore, $y\neq{0}$ , so $a+3>0$ . Also, if $a=-2$ , then the solution to this equation would be shared with $x=\frac{2\pi}{3}$ , so there would only be one distinct solution. Finally, because $y\le{1}$ due to the restrictions of a sine wave, and that $y\neq{1}$ due to the restrictions on $x$ , we have $-3<a<1$ with $a\neq{-2}$ . Thus, $p=-3,q=-2, r=1$ , so our final answer is $-3+(-2)+1=\boxed{4}$


Answer: 5.0

Suppose $d$ is a digit. For how many values of $d$ is $2.00d5 > 2.005$
$\textbf{(A)}\ 0\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 10$

Solution: We see that $2.0055$ works but $2.0045$ does not. The digit $d$ can be from $5$ through $9$ , which is $\boxed{5}$ values.


Answer: 750.0

Suppose $n$ is a positive integer and $d$ is a single digit in base 10 . Find $n$ if

Solution: Repeating decimals represent rational numbers .  To figure out which rational number, we sum an infinite geometric series $0.d25d25d25\ldots = \sum_{n = 1}^\infty \frac{d25}{1000^n} = \frac{100d + 25}{999}$ .  Thus $\frac{n}{810} = \frac{100d + 25}{999}$ so $n = 30\frac{100d + 25}{37} =750\frac{4d + 1}{37}$ .  Since 750 and 37 are relatively prime $4d + 1$ must be divisible by 37, and the only digit for which this is possible is $d = 9$ .  Thus $4d + 1 = 37$ and $n = \boxed{750}$

Solution: To get rid of repeating decimals, we multiply the equation by 1000. We get $\frac{1000n}{810} = d25.d25d25...$ We subtract the original equation from the second to get $\frac{999n}{810}=d25$ We simplify to $\frac{37n}{30} = d25$ Since $\frac{37n}{30}$ is an integer, $n=(30)(5)(2k+1)$ because $37$ is relatively prime to $30$ , and d25 is divisible by $5$ but not $10$ . The only odd number that yields a single digit $d$ and 25 at the end of the three digit number is $k=2$ , so the answer is $\boxed{750}$

Solution:
Similar to Solution 2, we start off by writing that $\frac{1000n}{810} = d25.d25d25 \dots$ .Then we subtract this from the original equation to get:
\[\frac{999n}{810} =d25 \Longrightarrow \frac{37n}{30} = d25 \Longrightarrow 37n = d25 \cdot 30\]
Since n is an integer, we have that $37 \mid d25 \cdot 30$
Since $37$ is prime, we can apply Euclid's Lemma (which states that if $p$ is a prime and if $a$ and $b$ are integers and if $p \mid ab$ , then $p \mid a$ or $p \mid b$ ) to realize that $37 \mid d25$ , since $37 \nmid 30$ . Then we can expand $d25$ as $25 \cdot (4d +1)$ . Since $37 \nmid 25$ , by Euclid, we can arrive at $37 \mid 4d+1 \Longrightarrow d=9$ . From this we know that $n= 25 \cdot 30 = \boxed{750}$ . (This is true because $37n = 925 \cdot 30 \rightarrow n= 25 \cdot 30 = 750$

Solution:
Write out these equations:
$\frac{n}{810} = \frac{d25}{999}$
$\frac{n}{30} = \frac{d25}{37}$
$37n = 30(d25)$
Thus $n$ divides 25 and 30. The only solution for this under 1000 is $\boxed{750}$


Answer: 2.0

Suppose $n^{*}$ means $\frac{1}{n}$ , the reciprocal of $n$ .  For example, $5^{*}=\frac{1}{5}$ .  How many of the following statements are true?
$\text{(A)}\ 0 \qquad \text{(B)}\ 1 \qquad \text{(C)}\ 2 \qquad \text{(D)}\ 3 \qquad \text{(E)}\ 4$

Solution:
We can just test all of these statements: \begin{align*} 3^*+6^* &= \frac{1}{3}+\frac{1}{6} \\ &= \frac{1}{2} \neq 9^* \\ 6^*-4^* &= \frac{1}{6}-\frac{1}{4} \\ &= \frac{-1}{12} \neq 2^* \\ 2^*\cdot 6^* &= \frac{1}{2}\cdot \frac{1}{6} \\ &= \frac{1}{12} = 12^* \\ 10^* \div 2^* &= \frac{1}{10}\div \frac{1}{2} \\ &= \frac{1}{5} = 5^*  \end{align*}
The last two statements are true and the first two aren't, so $\boxed{2}$


Answer: 743.0

Suppose $r^{}_{}$ is a real number for which
Find $\lfloor 100r \rfloor$ . (For real $x^{}_{}$ $\lfloor x \rfloor$ is the greatest integer less than or equal to $x^{}_{}$ .)

Solution: There are $91 - 19 + 1 = 73$ numbers in the sequence . Since the terms of the sequence can be at most $1$ apart, all of the numbers in the sequence can take one of two possible values. Since $\frac{546}{73} = 7 R 35$ , the values of each of the terms of the sequence must be either $7$ or $8$ . As the remainder is $35$ $8$ must take on $35$ of the values, with $7$ being the value of the remaining $73 - 35 = 38$ numbers. The 39th number is $\lfloor r+\frac{19 + 39 - 1}{100}\rfloor= \lfloor r+\frac{57}{100}\rfloor$ , which is also the first term of this sequence with a value of $8$ , so $8 \le r + \frac{57}{100} < 8.01$ . Solving shows that $\frac{743}{100} \le r < \frac{744}{100}$ , so $743\le 100r < 744$ , and $\lfloor 100r \rfloor = \boxed{743}$

Solution:
Recall by Hermite's Identity that $\lfloor x\rfloor +\lfloor x+\frac{1}{n}\rfloor +...+\lfloor x+\frac{n-1}{n}\rfloor = \lfloor nx\rfloor$ for positive integers $n$ , and real $x$ . Similar to above, we quickly observe that the last 35 take the value of 8, and remaining first ones take a value of 7. So, $\lfloor r\rfloor \le ...\le \lfloor r+\frac{18}{100}\rfloor \le 7$ and $\lfloor r+\frac{92}{100}\rfloor \ge ...\ge \lfloor r+1\rfloor \ge 8$ . We can see that $\lfloor r\rfloor +1=\lfloor r+1\rfloor$ . Because $\lfloor r\rfloor$ is at most 7, and $\lfloor r+1\rfloor$ is at least 8, we can clearly see their values are $7$ and $8$ respectively.
So, $\lfloor r\rfloor = ... = \lfloor r+\frac{18}{100}\rfloor = 7$ , and $\lfloor r+\frac{92}{100}\rfloor = ...= \lfloor r+1\rfloor = 8$ . Since there are 19 terms in the former equation and 8 terms in the latter, our answer is $\lfloor nx\rfloor = 546+19\cdot 7+8\cdot 8=\boxed{743}$


Answer: 192.0

Suppose $x$ is in the interval $[0, \pi/2]$ and $\log_{24\sin x} (24\cos x)=\frac{3}{2}$ . Find $24\cot^2 x$

Solution:
We can rewrite the given expression as \[\sqrt{24^3\sin^3 x}=24\cos x\] Square both sides and divide by $24^2$ to get \[24\sin ^3 x=\cos ^2 x\] Rewrite $\cos ^2 x$ as $1-\sin ^2 x$ \[24\sin ^3 x=1-\sin ^2 x\] \[24\sin ^3 x+\sin ^2 x - 1=0\] Testing values using the rational root theorem gives $\sin x=\frac{1}{3}$ as a root, $\sin^{-1} \frac{1}{3}$ does fall in the first quadrant so it satisfies the interval.
There are now two ways to finish this problem.
First way: Since $\sin x=\frac{1}{3}$ , we have \[\sin ^2 x=\frac{1}{9}\] Using the Pythagorean Identity gives us $\cos ^2 x=\frac{8}{9}$ . Then we use the definition of $\cot ^2 x$ to compute our final answer. $24\cot ^2 x=24\frac{\cos ^2 x}{\sin ^2 x}=24\left(\frac{\frac{8}{9}}{\frac{1}{9}}\right)=24(8)=\boxed{192}$

Solution:
Like Solution 1, we can rewrite the given expression as \[24\sin^3x=\cos^2x\] Divide both sides by $\sin^3x$ \[24 = \cot^2x\csc x\] Square both sides. \[576 = \cot^4x\csc^2x\] Substitute the identity $\csc^2x = \cot^2x + 1$ \[576 = \cot^4x(\cot^2x + 1)\] Let $a = \cot^2x$ . Then \[576 = a^3 + a^2\] .
Since $\sqrt[3]{576} \approx 8$ , we can easily see that $a = 8$ is a solution. Thus, the answer is $24\cot^2x = 24a = 24 \cdot 8 = \boxed{192}$


Answer: 3.0

Suppose m and n are positive odd integers. Which of the following must also be an odd integer?
$\textbf{(A)}\ m+3n\qquad\textbf{(B)}\ 3m-n\qquad\textbf{(C)}\ 3m^2 + 3n^2\qquad\textbf{(D)}\ (nm + 3)^2\qquad\textbf{(E)}\ 3mn$

Solution: Assume WLOG that $m$ and $n$ are both $1$ . Plugging into each of the choices, we get $4, 2, 6, 16,$ and $3$ . The only odd integer is $\boxed{3}$


Answer: 6.0

Solution:
The four squares we already have assemble nicely into four sides of the cube. Let the central one be the bottom, and fold the other three upwards to get the front, right, and back side. Currently, our box is missing its left side and its top side. We have to count the possibilities that would fold to one of these two places.
In total, there are $6\rightarrow\boxed{6}$ good possibilities.

Solution: Fold the four squares into the four sides of a cube. Then, there are six edges "open" (for lack of better term). For each open edge, we can add a square/side, so the answer is $6\rightarrow\boxed{6}$


Answer: 197.0

Suppose that $(a_1, b_1), (a_2, b_2), \ldots , (a_{100}, b_{100})$ are distinct ordered pairs of nonnegative integers. Let $N$ denote the number of pairs of integers $(i, j)$ satisfying $1 \le i < j \le 100$ and $|a_ib_j - a_j b_i|=1$ . Determine the largest possible value of $N$ over all possible choices of the $100$ ordered pairs.

Solution:
Let's start off with just $(a_1, b_1), (a_2, b_2)$ and suppose that it satisfies the given condition. We could use $(1, 1), (1, 2)$ for example. We should maximize the number of conditions that the third pair satisfies. We find out that the third pair should equal $(a_1+a_2, b_1+b_2)$
We know this must be true: \[|a_1b_2-a_2b_1| = 1\]
So \[a_1b_2-a_2b_1 = 1\]
We require the maximum conditions for $(a_3, b_3)$ \[|a_3b_2-a_2b_3| = 1\] \[|a_3b_1-a_1b_3| = 1\]
Then one case can be: \[a_3b_2-a_2b_3 = 1\] \[a_3b_1-a_1b_3 = -1\]
We try to do some stuff such as solving for $a_3$ with manipulations: \[a_3b_2a_1-a_2b_3a_1 = a_1\] \[a_3b_1a_2-a_1b_3a_2 = -a_2\] \[a_3(a_1b_2-a_2b_1) = a_1+a_2\] \[a_3 = a_1+a_2\] \[a_3b_2b_1-a_2b_3b_1 = b_1\] \[a_3b_1b_2-a_1b_3b_2 = -b_2\] \[b_3(a_1b_2-a_2b_1) = b_1+b_2\] \[b_3 = b_1+b_2\]
We showed that 3 pairs are a complete graph; however, 4 pairs are not a complete graph. We will now show that: \[a_4 = a_1+2a_2\] \[b_4 = b_1+2b_2\] \[|a_1b_1+2a_2b_1-a_1b_1-2a_1b_2| = 1\] \[2|a_2b_1-a_1b_2| = 1\]
This is clearly impossible because $1$ is not even and also $|a_2b_1-a_1b_2| = 1$ .
The answer is as follows: \[0+1+2+\ldots+2\] $a_1$ has $0$ subtractions that follow condition while $a_2$ has $1$ and then the rest has $2$ .
There are $n$ terms, so our answer be $2n-3$ and in case of $n=100$ that means \[\boxed{197}.\] ~Lopkiloinm

Solution:
We claim the answer is $197$
Study the points $(0, 0), (a_i, b_i), (a_j, b_j)$ . If we let these be the vertices of a triangle, applying shoelace theorem gives us an area of $\frac{1}{2}|0\times{b_i}+{a_i}\times{b_j}+{b_i}\times{0}-0\times{a_i}-{b_i}\times{a_j}-{b_j}\times{0} = \frac{1}{2}|a_ib_j - a_j b_i| = \frac{1}{2}$ . Therefore, the triangle formed by the points $(0, 0), (a_i, b_i), (a_j, b_j)$ must have an area of $\frac{1}{2}$
Two cases follow.
Case 1: Both $(a_i, b_i), (a_j, b_j)$ have exactly one coordinate equal to $0$ .
Here, one point must be on the $x$ axis and the other on the $y$ axis in order for the triangle to have a positive area. For the area of the triangle to be $\frac{1}{2}$ , it follows that the points must be $(1, 0), (0, 1)$ in some order.
Case 2: At least one of $(a_i, b_i), (a_j, b_j)$ does not have exactly one coordinate equal to $0$ . Define $S[l]$ to be a list of lines such that each line in the list has some two lattice points that, with $(0, 0)$ , form a triangle with area $\frac{1}{2}$ . Note that for any such line that passes through such two lattice points, we may trivially generate infinite lattice points on the line that have nonnegative coordinates.
Note that lines $y=1$ and $x=1$ are included in $S[l]$ , because the points $(1, 1), (2, 1)$ serve as examples for $y=1$ and $(1, 1), (1, 2)$ serve as examples for $x=1$ . For the optimal construction, include the points $(1, 0)$ and all the points $(0, 1), (0, 2), (0, 3), ... , (0, 99)$ , in that order. In this case, every adjacent pair of points would count ( $98$ ), as well as picking $(0, 1)$ and a nonadjacent point ( $99$ ), so this would be $98+99=197$
To prove that this is the maximum, consider the case where some $n$ number of points were neither on $x=1$ nor on $y=1$ . In this case, we would be removing $n$ adjacent pairs and $n$ options to choose from after choosing $(0, 0)$ , resulting in a net loss of $2n$ . By having $n$ points on some other combination of lines in $S[l]$ , we would trivially have a maximum gain of $n-1$ pairs of points on the lines such that there are no lattice points between those pairs. Because these points are not on $x=1$ or $y=1$ , the altitude from a given point to the line formed by $(0, 0)$ and $(0, 1)$ and $(1, 0)$ is not $1$ , and so the area of the triangle cannot be $\frac{1}{2}$ . Thus, by not having all points on lines $x=1$ and $y=1$ , we cannot exceed the maximum of $197$ . Thus, $\boxed{197}$ is our answer.


Answer: 197.0

Suppose that $(a_1,b_1),$ $(a_2,b_2),$ $\dots,$ $(a_{100},b_{100})$ are distinct ordered pairs of nonnegative integers. Let $N$ denote the number of pairs of integers $(i,j)$ satisfying $1\leq i<j\leq 100$ and $|a_ib_j-a_jb_i|=1$ . Determine the largest possible value of $N$ over all possible choices of the $100$ ordered pairs.

Solution:
Call the pair $(i, j)$ good if $1\leq i < j \leq 100$ and $|a_ib_j-a_jb_i|=1$ . Note that we can reorder the pairs $(a_1, b_1), (a_2, b_2), \ldots, (a_{100}, b_{100})$ without changing the number of good pairs. Thus, we can reorder them so that $a_1\leq a_2\leq\ldots\leq a_{100}$ . Furthermore, reorder them so that if $a_i=a_j$ for some $i<j$ , then $b_i<b_j$
Now I claim the maximum value of $N$ is $\boxed{197}$ . First, we will show $N\leq 197$


Answer: 53.0

Suppose that $(u_n)$ is a sequence of real numbers satifying $u_{n+2}=2u_{n+1}+u_n$
and that $u_3=9$ and $u_6=128$ . What is $u_5$
$\mathrm{(A)}\ 40\qquad\mathrm{(B)}\ 53\qquad\mathrm{(C)}\ 68\qquad\mathrm{(D)}\ 88\qquad\mathrm{(E)}\ 104$

Solution:
If we plug in $n=4$ , we get
By plugging in $n=3$ , we get
This is a system of two equations with two unknowns. Multiplying the second equation by 2 and substituting into the first equation gives $128=5u_4+18 \Longrightarrow u_4=22$ , therefore $u_5=\frac{128-22}{2}=53 \longrightarrow \textbf{\boxed{53}$ .
~ Mathkiddie


Answer: 8178.0

Solution:
For $1\leq k\leq 12,$ suppose that cards $1, 2, \ldots, k$ are picked up on the first pass. It follows that cards $k+1,k+2,\ldots,13$ are picked up on the second pass.
Once we pick the spots for the cards on the first pass, there is only one way to arrange all $\boldsymbol{13}$ cards.
For each value of $k,$ there are $\binom{13}{k}-1$ ways to pick the $k$ spots for the cards on the first pass: We exclude the arrangement  in which the first pass consists of all $13$ cards.
Therefore, the answer is \[\sum_{k=1}^{12}\left[\binom{13}{k}-1\right] = \left[\sum_{k=1}^{12}\binom{13}{k}\right]-12 = \left[\sum_{k=0}^{13}\binom{13}{k}\right]-14 = 2^{13} - 14 = \boxed{8178}.\]

Solution:
Since the $13$ cards are picked up in two passes, the first pass must pick up the first $n$ cards and the second pass must pick up the remaining cards $m$ through $13$ .
Also note that if $m$ , which is the card that is numbered one more than $n$ , is placed before $n$ , then $m$ will not be picked up on the first pass since cards are picked up in order. Therefore we desire $m$ to be placed before $n$ to create a second pass, and that after the first pass, the numbers $m$ through $13$ are lined up in order from least to greatest.
To construct this, $n$ cannot go in the $n$ th position because all cards $1$ to $n-1$ will have to precede it and there will be no room for $m$ . Therefore $n$ must be in slots $n+1$ to $13$ .
Let's do casework on which slot $n$ goes into to get a general idea for how the problem works.
Case 1: With $n$ in spot $n+1$ , there are $n$ available slots before $n$ , and there are $n-1$ cards preceding $n$ . Therefore the number of ways to reserve these slots for the $n-1$ cards is $\binom{n}{n-1}$ . Then there is only $1$ way to order these cards (since we want them in increasing order). Then card $m$ goes into whatever slot is remaining, and the $13-m$ cards are ordered in increasing order after slot $n+1$ , giving only $1$ way. Therefore in this case there are $\binom{n}{n-1}$ possibilities.
Case 2: With $n$ in spot $n+2$ , there are $n+1$ available slots before $n$ , and there are $n-1$ cards preceding $n$ . Therefore the number of ways to reserve slots for these cards are $\binom{n+1}{n-1}$ . Then there is one way to order these cards. Then cards $m$ and $m+1$ must go in the remaining two slots, and there is only one way to order them since they must be in increasing order. Finally, cards $m+2$ to $13$ will be ordered in increasing order after slot $n+1$ , which yields $1$ way. Therefore, this case has $\binom{n+1}{n-1}$ possibilities.
I think we can see a general pattern now. With $n$ in slot $x$ , there are $x-1$ slots to distribute to the previous $n-1$ cards, which can be done in $\binom{x-1}{n-1}$ ways. Then the remaining cards fill in in just $1$ way. Since the cases of $n$ start in slot $n+1$ and end in slot $13$ , this sum amounts to: \[\binom{n}{n-1}+\binom{n+1}{n-1}+\binom{n+2}{n-1} + \cdots + \binom{12}{n-1}\] for any $n$
Hmmm ... where have we seen this before?
We use wishful thinking to add a term of $\binom{n-1}{n-1}$ \[\binom{n-1}{n-1}+\binom{n}{n-1}+\binom{n+1}{n-1}+\binom{n+2}{n-1} + \cdots + \binom{12}{n-1}\]
This is just the hockey stick identity! Applying it, this expression is equal to $\binom{13}{n}$ . However, we added an extra term, so subtracting it off, the total number of ways to order the $13$ cards for any $n$ is \[\binom{13}{n}-1\]
Finally, to calculate the total for all $n$ , we sum from $n=0$ to $13$ . This yields us:
\[\sum_{n=0}^{13} \binom{13}{n}-1 \implies \sum_{n=0}^{13} \binom{13}{n} - \sum_{n=0}^{13} 1\] \[\implies 2^{13} - 14 = 8192 - 14 = 8178 = \boxed{8178}.\]

Solution:
To solve this problem, we can use recursion on $n$ . Let $A_n$ be the number of arrangements for $n$ numbers. Now, let's look at how these arrangements are formed by case work on the first number $a_1$
If $a_1 = 1$ , the remaining $n-1$ numbers from $2$ to $n$ are arranged in the same way just like number 1 to $n-1$ in the case of $n-1$ numbers. So there are $A_{n-1}$ arrangements.
If $a_1 = 2$ , then we need to choose 1 position from position 2 to $n-1$ to put 1, and all remaining numbers must be arranged in increasing order, so there are $\binom{n-1}{1}$ such arrangements.
If $a_1 = k$ , then we need to choose $k-1$ positions from position 2 to $n-1$ to put $1, 2,\cdots k-1$ , and all remaining numbers must be arranged in increasing order, so there are $\binom{n-1}{k-1}$ such arrangements.
So we can write \[A_n = A_{n-1} + \binom{n-1}{1} + \binom{n-1}{2} + \cdots + \binom{n-1}{n-1}\] which can be simplified to \[A_n = A_{n-1} + 2^{n-1} - 1\] We can solve this recursive sequence by summing up $n-1$ lines of the recursive formula \[A_n - A_{n-1} = 2^{n-1} - 1\] \[A_{n-1} - A_{n-2} = 2^{n-2} - 1\] \[\cdots\] \[A_2 - A_{1} = 2^{1} - 1\] to get \[A_n - A_1 = \sum_{k=1}^{n-1} (2^k - 1) = 2^n - 2 - (n-1) = 2^n - n - 1\] since $A_1=0$ , we have \[A_n = 2^n - n - 1\] and $A_{13} = 2^{13} - 14 = \boxed{8178}$

Solution: When we have $3$ cards arranged in a row, after listing out all possible arrangements, we see that we have $4$ ones: $(1, 3, 2), (2, 1, 3), (2, 3, 1),$ and $(3, 1, 2)$ . When we have $4$ cards, we find $11$ possible arrangements: $(1, 2, 4, 3), (1, 3, 2, 4), (1, 3, 4, 2), (1, 4, 2, 3), (2, 1, 3, 4), (2, 3, 1, 4), (2, 3, 4, 1), (3, 1, 2, 4), (3, 1, 4, 2), (3, 4, 1, 2),$ and $(4, 1, 2, 3).$ Hence, we recognize the pattern that for $n$ cards, we have $2^n - n - 1$ valid arrangements, so our answer is $2^{13} - 13 - 1 = \boxed{8178}.$ ~eibc

Solution: Notice that for each card "position", we can choose for it to be picked up on the first or second pass, for a total of $2^{13}$ options. However, if all of the cards selected to be picked up first are before all of the cards to be picked up second, then this means that the list is in consecutive ascending order (and thus all cards will be picked up on the first pass instead). This can happen in 14 ways, so our answer is $2^{13}-14=\boxed{8178}$


Answer: 8178.0

Solution:
For $1\leq k\leq 12,$ suppose that cards $1, 2, \ldots, k$ are picked up on the first pass. It follows that cards $k+1,k+2,\ldots,13$ are picked up on the second pass.
Once we pick the spots for the cards on the first pass, there is only one way to arrange all $\boldsymbol{13}$ cards.
For each value of $k,$ there are $\binom{13}{k}-1$ ways to pick the $k$ spots for the cards on the first pass: We exclude the arrangement  in which the first pass consists of all $13$ cards.
Therefore, the answer is \[\sum_{k=1}^{12}\left[\binom{13}{k}-1\right] = \left[\sum_{k=1}^{12}\binom{13}{k}\right]-12 = \left[\sum_{k=0}^{13}\binom{13}{k}\right]-14 = 2^{13} - 14 = \boxed{8178}.\]

Solution:
Since the $13$ cards are picked up in two passes, the first pass must pick up the first $n$ cards and the second pass must pick up the remaining cards $m$ through $13$ .
Also note that if $m$ , which is the card that is numbered one more than $n$ , is placed before $n$ , then $m$ will not be picked up on the first pass since cards are picked up in order. Therefore we desire $m$ to be placed before $n$ to create a second pass, and that after the first pass, the numbers $m$ through $13$ are lined up in order from least to greatest.
To construct this, $n$ cannot go in the $n$ th position because all cards $1$ to $n-1$ will have to precede it and there will be no room for $m$ . Therefore $n$ must be in slots $n+1$ to $13$ .
Let's do casework on which slot $n$ goes into to get a general idea for how the problem works.
Case 1: With $n$ in spot $n+1$ , there are $n$ available slots before $n$ , and there are $n-1$ cards preceding $n$ . Therefore the number of ways to reserve these slots for the $n-1$ cards is $\binom{n}{n-1}$ . Then there is only $1$ way to order these cards (since we want them in increasing order). Then card $m$ goes into whatever slot is remaining, and the $13-m$ cards are ordered in increasing order after slot $n+1$ , giving only $1$ way. Therefore in this case there are $\binom{n}{n-1}$ possibilities.
Case 2: With $n$ in spot $n+2$ , there are $n+1$ available slots before $n$ , and there are $n-1$ cards preceding $n$ . Therefore the number of ways to reserve slots for these cards are $\binom{n+1}{n-1}$ . Then there is one way to order these cards. Then cards $m$ and $m+1$ must go in the remaining two slots, and there is only one way to order them since they must be in increasing order. Finally, cards $m+2$ to $13$ will be ordered in increasing order after slot $n+1$ , which yields $1$ way. Therefore, this case has $\binom{n+1}{n-1}$ possibilities.
I think we can see a general pattern now. With $n$ in slot $x$ , there are $x-1$ slots to distribute to the previous $n-1$ cards, which can be done in $\binom{x-1}{n-1}$ ways. Then the remaining cards fill in in just $1$ way. Since the cases of $n$ start in slot $n+1$ and end in slot $13$ , this sum amounts to: \[\binom{n}{n-1}+\binom{n+1}{n-1}+\binom{n+2}{n-1} + \cdots + \binom{12}{n-1}\] for any $n$
Hmmm ... where have we seen this before?
We use wishful thinking to add a term of $\binom{n-1}{n-1}$ \[\binom{n-1}{n-1}+\binom{n}{n-1}+\binom{n+1}{n-1}+\binom{n+2}{n-1} + \cdots + \binom{12}{n-1}\]
This is just the hockey stick identity! Applying it, this expression is equal to $\binom{13}{n}$ . However, we added an extra term, so subtracting it off, the total number of ways to order the $13$ cards for any $n$ is \[\binom{13}{n}-1\]
Finally, to calculate the total for all $n$ , we sum from $n=0$ to $13$ . This yields us:
\[\sum_{n=0}^{13} \binom{13}{n}-1 \implies \sum_{n=0}^{13} \binom{13}{n} - \sum_{n=0}^{13} 1\] \[\implies 2^{13} - 14 = 8192 - 14 = 8178 = \boxed{8178}.\]

Solution:
To solve this problem, we can use recursion on $n$ . Let $A_n$ be the number of arrangements for $n$ numbers. Now, let's look at how these arrangements are formed by case work on the first number $a_1$
If $a_1 = 1$ , the remaining $n-1$ numbers from $2$ to $n$ are arranged in the same way just like number 1 to $n-1$ in the case of $n-1$ numbers. So there are $A_{n-1}$ arrangements.
If $a_1 = 2$ , then we need to choose 1 position from position 2 to $n-1$ to put 1, and all remaining numbers must be arranged in increasing order, so there are $\binom{n-1}{1}$ such arrangements.
If $a_1 = k$ , then we need to choose $k-1$ positions from position 2 to $n-1$ to put $1, 2,\cdots k-1$ , and all remaining numbers must be arranged in increasing order, so there are $\binom{n-1}{k-1}$ such arrangements.
So we can write \[A_n = A_{n-1} + \binom{n-1}{1} + \binom{n-1}{2} + \cdots + \binom{n-1}{n-1}\] which can be simplified to \[A_n = A_{n-1} + 2^{n-1} - 1\] We can solve this recursive sequence by summing up $n-1$ lines of the recursive formula \[A_n - A_{n-1} = 2^{n-1} - 1\] \[A_{n-1} - A_{n-2} = 2^{n-2} - 1\] \[\cdots\] \[A_2 - A_{1} = 2^{1} - 1\] to get \[A_n - A_1 = \sum_{k=1}^{n-1} (2^k - 1) = 2^n - 2 - (n-1) = 2^n - n - 1\] since $A_1=0$ , we have \[A_n = 2^n - n - 1\] and $A_{13} = 2^{13} - 14 = \boxed{8178}$

Solution: When we have $3$ cards arranged in a row, after listing out all possible arrangements, we see that we have $4$ ones: $(1, 3, 2), (2, 1, 3), (2, 3, 1),$ and $(3, 1, 2)$ . When we have $4$ cards, we find $11$ possible arrangements: $(1, 2, 4, 3), (1, 3, 2, 4), (1, 3, 4, 2), (1, 4, 2, 3), (2, 1, 3, 4), (2, 3, 1, 4), (2, 3, 4, 1), (3, 1, 2, 4), (3, 1, 4, 2), (3, 4, 1, 2),$ and $(4, 1, 2, 3).$ Hence, we recognize the pattern that for $n$ cards, we have $2^n - n - 1$ valid arrangements, so our answer is $2^{13} - 13 - 1 = \boxed{8178}.$ ~eibc

Solution: Notice that for each card "position", we can choose for it to be picked up on the first or second pass, for a total of $2^{13}$ options. However, if all of the cards selected to be picked up first are before all of the cards to be picked up second, then this means that the list is in consecutive ascending order (and thus all cards will be picked up on the first pass instead). This can happen in 14 ways, so our answer is $2^{13}-14=\boxed{8178}$


Answer: 2.0

Suppose that $P = 2^m$ and $Q = 3^n$ . Which of the following is equal to $12^{mn}$ for every pair of integers $(m,n)$
$\textbf{(A)}\ P^2Q \qquad \textbf{(B)}\ P^nQ^m \qquad \textbf{(C)}\ P^nQ^{2m} \qquad \textbf{(D)}\ P^{2m}Q^n \qquad \textbf{(E)}\ P^{2n}Q^m$

Solution: We have $12^{mn} = (2\cdot 2\cdot 3)^{mn} = 2^{2mn} \cdot 3^{mn} = (2^m)^{2n} \cdot (3^n)^m = \boxed{2}$


Answer: 2.0

Solution: We have $12^{mn} = (2\cdot 2\cdot 3)^{mn} = 2^{2mn} \cdot 3^{mn} = (2^m)^{2n} \cdot (3^n)^m = \boxed{2}$


Answer: 1.0

Suppose that $P(z), Q(z)$ , and $R(z)$ are polynomials with real coefficients, having degrees $2$ $3$ , and $6$ , respectively, and constant terms $1$ $2$ , and $3$ , respectively. Let $N$ be the number of distinct complex numbers $z$ that satisfy the equation $P(z) \cdot Q(z)=R(z)$ . What is the minimum possible value of $N$
$\textbf{(A)}\: 0\qquad\textbf{(B)} \: 1\qquad\textbf{(C)} \: 2\qquad\textbf{(D)} \: 3\qquad\textbf{(E)} \: 5$

Solution:
The answer cannot be $0,$ as every nonconstant polynomial has at least $1$ distinct complex root (Fundamental Theorem of Algebra). Since $P(z) \cdot Q(z)$ has degree $2 + 3 = 5,$ we conclude that $R(z) - P(z)\cdot Q(z)$ has degree $6$ and is thus nonconstant.
It now suffices to illustrate an example for which $N = 1$ : Take \begin{align*} P(z)&=z^2+1, \\ Q(z)&=z^3+2, \\ R(z)&=(z+1)^6 + P(z) \cdot Q(z). \end{align*} Note that $R(z)$ has degree $6$ and constant term $3,$ so it satisfies the conditions.
We need to find the solutions to \begin{align*} P(z) \cdot Q(z) &= (z+1)^6 + P(z) \cdot Q(z) \\ 0 &= (z+1)^6. \end{align*} Clearly, the only distinct complex root is $-1,$ so our answer is $N=\boxed{1}.$


Answer: 36.8

Suppose that $S$ is a finite set of positive integers. If the greatest integer in $S$ is removed from $S$ , then the average value (arithmetic mean) of the integers remaining is $32$ . If the least integer in $S$ is also removed, then the average value of the integers remaining is $35$ . If the greatest integer is then returned to the set, the average value of the integers rises to $40$ . The greatest integer in the original set $S$ is $72$ greater than the least integer in $S$ . What is the average value of all the integers in the set $S$
$\textbf{(A) }36.2 \qquad \textbf{(B) }36.4 \qquad \textbf{(C) }36.6\qquad \textbf{(D) }36.8 \qquad \textbf{(E) }37$

Solution: Let the lowest value be $L$ and the highest $G$ , and let the sum be $Z$ and the amount of numbers $n$ . We have $\frac{Z-G}{n-1}=32$ $\frac{Z-L-G}{n-2}=35$ $\frac{Z-L}{n-1}=40$ , and $G=L+72$ . Clearing denominators gives $Z-G=32n-32$ $Z-L-G=35n-70$ , and $Z-L=40n-40$ . We use $G=L+72$ to turn the first equation into $Z-L=32n+40$ . Since $Z-L=40(n-1)$ we substitute it into the equation which gives $n=10$ . Turning the second into $Z-2L=35n+2$ using $G=L+72$ we see $L=8$ and $Z=368$ so the average is $\frac{Z}{n}=\boxed{36.8}$ ~aop2014

Solution:
Let $x$ be the greatest integer, $y$ be the smallest, $z$ be the sum of the numbers in S excluding $x$ and $y$ , and $k$ be the number of elements in S.
Then, $S=x+y+z$
First, when the greatest integer is removed, $\frac{S-x}{k-1}=32$
When the smallest integer is also removed, $\frac{S-x-y}{k-2}=35$
When the greatest integer is added back, $\frac{S-y}{k-1}=40$
We are given that $x=y+72$
After you substitute $x=y+72$ , you have 3 equations with 3 unknowns $S,$ $y$ and $k$
$S-y-72=32k-32$
$S-2y-72=35k-70$
$S-y=40k-40$
This can be easily solved to yield $k=10$ $y=8$ $S=368$
$\therefore$ average value of all integers in the set $=S/k = 368/10 = \boxed{36.8}$

Solution: We should plug in $36.2$ and assume everything is true except the $35$ part. We then calculate that part and end up with $35.75$ . We also see with the formulas we used with the plug in that when you increase by $0.2$ the $35.75$ part decreases by $0.25$ . The answer is then $\boxed{36.8}$ . You can work backwards because it is multiple choice and you don't have to do critical thinking. ~Lopkiloinm

Solution: Let $S = \{a_1, a_2, a_3, \hdots, a_n\}$ with $a_1 < a_2 < a_3 < \hdots < a_n.$ We are given the following: \[{\begin{cases} \sum_{i=1}^{n-1} a_i = 32(n-1) = 32n-32, \\ \sum_{i=2}^n a_i = 40(n-1) = 40n-40, \\ \sum_{i=2}^{n-1} a_i = 35(n-2) = 35n-70, \\ a_n-a_1 = 72 \implies a_1 + 72 = a_n. \end{cases}}\] Subtracting the third equation from the sum of the first two, we find that \[\sum_{i=1}^n a_i = \left(32n-32\right) + \left(40n-40\right) - \left(35n-70\right) = 37n - 2.\] Furthermore, from the fourth equation, we have \[\sum_{i=2}^{n} a_i - \sum_{i=1}^{n-1} a_i = \left[\left(a_1 + 72\right) + \sum_{i=2}^{n-1} a_i\right] - \left[\left(a_1\right) + \sum_{i=2}^{n-1} a_i\right] = \left(40n-40\right)-\left(32n-32\right).\] Combining like terms and simplifying, we have \[72 = 8n-8 \implies 8n = 80 \implies n=10.\] Thus, the sum of the elements in $S$ is $37 \cdot 10 - 2 = 368,$ and since there are 10 elements in $S,$ the average of the elements in $S$ is $\tfrac{368}{10}=\boxed{36.8}$


Answer: 36.8

Solution: Let the lowest value be $L$ and the highest $G$ , and let the sum be $Z$ and the amount of numbers $n$ . We have $\frac{Z-G}{n-1}=32$ $\frac{Z-L-G}{n-2}=35$ $\frac{Z-L}{n-1}=40$ , and $G=L+72$ . Clearing denominators gives $Z-G=32n-32$ $Z-L-G=35n-70$ , and $Z-L=40n-40$ . We use $G=L+72$ to turn the first equation into $Z-L=32n+40$ . Since $Z-L=40(n-1)$ we substitute it into the equation which gives $n=10$ . Turning the second into $Z-2L=35n+2$ using $G=L+72$ we see $L=8$ and $Z=368$ so the average is $\frac{Z}{n}=\boxed{36.8}$ ~aop2014

Solution:
Let $x$ be the greatest integer, $y$ be the smallest, $z$ be the sum of the numbers in S excluding $x$ and $y$ , and $k$ be the number of elements in S.
Then, $S=x+y+z$
First, when the greatest integer is removed, $\frac{S-x}{k-1}=32$
When the smallest integer is also removed, $\frac{S-x-y}{k-2}=35$
When the greatest integer is added back, $\frac{S-y}{k-1}=40$
We are given that $x=y+72$
After you substitute $x=y+72$ , you have 3 equations with 3 unknowns $S,$ $y$ and $k$
$S-y-72=32k-32$
$S-2y-72=35k-70$
$S-y=40k-40$
This can be easily solved to yield $k=10$ $y=8$ $S=368$
$\therefore$ average value of all integers in the set $=S/k = 368/10 = \boxed{36.8}$

Solution: We should plug in $36.2$ and assume everything is true except the $35$ part. We then calculate that part and end up with $35.75$ . We also see with the formulas we used with the plug in that when you increase by $0.2$ the $35.75$ part decreases by $0.25$ . The answer is then $\boxed{36.8}$ . You can work backwards because it is multiple choice and you don't have to do critical thinking. ~Lopkiloinm

Solution: Let $S = \{a_1, a_2, a_3, \hdots, a_n\}$ with $a_1 < a_2 < a_3 < \hdots < a_n.$ We are given the following: \[{\begin{cases} \sum_{i=1}^{n-1} a_i = 32(n-1) = 32n-32, \\ \sum_{i=2}^n a_i = 40(n-1) = 40n-40, \\ \sum_{i=2}^{n-1} a_i = 35(n-2) = 35n-70, \\ a_n-a_1 = 72 \implies a_1 + 72 = a_n. \end{cases}}\] Subtracting the third equation from the sum of the first two, we find that \[\sum_{i=1}^n a_i = \left(32n-32\right) + \left(40n-40\right) - \left(35n-70\right) = 37n - 2.\] Furthermore, from the fourth equation, we have \[\sum_{i=2}^{n} a_i - \sum_{i=1}^{n-1} a_i = \left[\left(a_1 + 72\right) + \sum_{i=2}^{n-1} a_i\right] - \left[\left(a_1\right) + \sum_{i=2}^{n-1} a_i\right] = \left(40n-40\right)-\left(32n-32\right).\] Combining like terms and simplifying, we have \[72 = 8n-8 \implies 8n = 80 \implies n=10.\] Thus, the sum of the elements in $S$ is $37 \cdot 10 - 2 = 368,$ and since there are 10 elements in $S,$ the average of the elements in $S$ is $\tfrac{368}{10}=\boxed{36.8}$


Answer: 13.0

Suppose that $S$ is a subset of $\left\{ 1, 2, 3, \cdots , 25 \right\}$ such that the sum of any two (not necessarily distinct) elements of $S$ is never an element of $S.$ What is the maximum number of elements $S$ may contain?
$\textbf{(A)}\ 12 \qquad\textbf{(B)}\ 13 \qquad\textbf{(C)}\ 14 \qquad\textbf{(D)}\ 15 \qquad\textbf{(E)}\ 16$

Solution:
Let $M$ be the largest number in $S$ .
We categorize numbers $\left\{ 1, 2, \ldots , M-1 \right\}$ (except $\frac{M}{2}$ if $M$ is even) into $\left\lfloor \frac{M-1}{2} \right\rfloor$ groups, such that the $i$ th group contains two numbers $i$ and $M-i$
Recall that $M \in S$ and the sum of two numbers in $S$ cannot be equal to $M$ , and the sum of numbers in each group above is equal to $S$ . Thus, each of the above $\left\lfloor \frac{M-1}{2} \right\rfloor$ groups can have at most one number in $S$ .
Therefore, \begin{align*} |S| & \leq 1 + \left\lfloor \frac{M-1}{2} \right\rfloor \\ & \leq 1 + \left\lfloor \frac{25}{2} \right\rfloor \\ & = 13. \end{align*}
Next, we construct an instance of $S$ with $|S| = 13$ .
Let $S = \left\{ 13, 14, \ldots , 25 \right\}$ .
Thus, this set is feasible.
Therefore, the most number of elements in $S$ is $\boxed{13}$

Solution: We know that two odd numbers sum to an even number, so we can easily say that odd numbers $1-25$ can be included in the list, making for $13$ elements. But, how do we know we can't include even numbers for a higher element value? Well, to get a higher element value than $13$ , odd numbers as well as even numbers would have to be included in the list (since there are only $12$ even numbers from $1-25$ , and many of those even numbers are the sum of even numbers). However, for every even value we add to our odd list, we have to take away an odd number because there are either two odd numbers that sum to that even value, or that even value and another odd number will sum to an odd number later in the list. So, $\boxed{13}$ elements is the highest we can go.

Solution: The smallest sum of a number $a + b$ where $b \geq a$ is $a + a = 2a$ as we are using the smallest value of $b$ . Using this, we can say that if $12$ were an element of $S$ , then one of the sums (the smallest) would be $12 + 12 = 24 < 25$ . Thus $13$ must be the smallest element. So the largest amount of elements that could be in $S$ is the list of numbers from $13$ to $25$ as they all work. Because it is inclusive we have, $25 - 13 + 1 =   \boxed{13}$

Solution:
We construct a possible subset $S$ with $13$ elements by including all odd integers from $1$ to $25$ , inclusive. $S=\left\{ 1, 3, 5, \cdots , 25 \right\}$ . The sum of any $2$ elements is even, and thus cannot be an element of $S$
To show that $S$ cannot have more than $13$ elements, assume for sake of contradiction that $|S| \geq 14$ . Let $S=\left\{ x_1, x_2, \cdots , x_n \right\}$ where $n \geq 14$ and $x_1 < x_2 < \cdots < x_n$ . Because the sums of any $2$ (not necessarily distinct) elements do not appear in $S$ $x_1+x_i$ is not an element of $S$ for all $1 \leq i \leq n$ . So, $x_1, x_2, \cdots , x_n , x_1+x_1, x_1+x_2, \cdots , x_1+x_n$ are all distinct integers. Let these integers be elements of the set $T$ $|T|=2n$ , and because $n \geq 14$ $|T| \geq 28$ . But all elements of $T$ must be $\geq x_1$ and $\leq x_1+x_n \leq x_1+25$ , leaving only 26 possible values for the elements in $T$ . By the Pigeonhole Principle, the elements cannot be distinct, and we have a contradiction.
Thus, $\boxed{13}$ is the maximum possible size of $S$

Solution:
We can start by building a list of the elements of $S$ ,and see if we can find a pattern. Let's start with $1$ . If we include 1, that means we cannot include $2$ (which is $1$ $1$ ), so we write the next valid number, $3$ . Similarly, we cannot include $4$ or $6$ , so we write $5$ . Proceeding, our list looks like this:
$S$ = { $1$ $3$ $5$ $7$ ....
We've found a pattern! It's easy understand why this pattern of odd numbers will continue, seeing as all the even numbers can be written as sums between odds. Calculating how many odd numbers fit into the range $1$ $25$ , we conclude that the answer is $\boxed{13}$


Answer: 8.0

Suppose that $\left|x+y\right|+\left|x-y\right|=2$ . What is the maximum possible value of $x^2-6x+y^2$
$\textbf{(A)}\ 5 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$

Solution:
Plugging in some values, we see that the  graph of the equation $|x+y|+|x-y| = 2$ is a square bounded by $x= \pm 1$ and $y = \pm 1$
Notice that $x^2 - 6x + y^2 = (x-3)^2 + y^2 - 9$ means the square of the distance from a point $(x,y)$ to point $(3,0)$ minus 9. To maximize that value, we need to choose the point in the feasible region farthest from point $(3,0)$ , which is $(-1, \pm 1)$ . Either one, when substituting into the function, yields $\boxed{8}$

Solution: Since the equation $|x+y|+|x-y| = 2$ is dealing with absolute values, the following could be deduced: $(x+y)+(x-y)=2$ $(x+y)-(x-y)=2$ $-(x+y)+(x-y)=2$ , and $-(x+y)-(x-y)=2$ . Simplifying would give $x=1$ $y=1$ $y=-1$ , and $x=-1$ . In $x^2-6x+y^2$ , we care most about $-6x,$ since both $x^2$ and $y^2$ are non-negative. To maximize $-6x$ , though, $x$ would have to be -1. Therefore, when $x=-1$ and $y=-1$ or $y=1$ , the equation evaluates to $\boxed{8}$


Answer: 44.0

Suppose that $\sec x+\tan x=\frac{22}7$ and that $\csc x+\cot x=\frac mn,$ where $\frac mn$ is in lowest terms.  Find $m+n^{}_{}.$

Solution:
Use the two trigonometric Pythagorean identities $1 + \tan^2 x = \sec^2 x$ and $1 + \cot^2 x = \csc^2 x$
If we square the given $\sec x = \frac{22}{7} - \tan x$ , we find that
\begin{align*} \sec^2 x &= \left(\frac{22}7\right)^2 - 2\left(\frac{22}7\right)\tan x + \tan^2 x \\ 1 &= \left(\frac{22}7\right)^2 - \frac{44}7 \tan x \end{align*}
This yields $\tan x = \frac{435}{308}$
Let $y = \frac mn$ . Then squaring,
\[\csc^2 x = (y - \cot x)^2 \Longrightarrow 1 = y^2 - 2y\cot x.\]
Substituting $\cot x = \frac{1}{\tan x} = \frac{308}{435}$ yields a quadratic equation $0 = 435y^2 - 616y - 435 = (15y - 29)(29y + 15)$ . It turns out that only the positive root will work, so the value of $y = \frac{29}{15}$ and $m + n = \boxed{044}$

Solution: We are given that $\frac{1+\sin x}{\cos x}=\frac{22}7\implies\frac{1+\sin x}{\cos x}\cdot\frac{1-\sin x}{1-\sin x}=\frac{1-\sin^2x}{\cos x(1-\sin x)}=\frac{\cos^2x}{\cos x(1-\sin x)}$ $=\frac{\cos x}{1-\sin x}$ , or equivalently, $\cos x=\frac{7+7\sin x}{22}=\frac{22-22\sin x}7\implies\sin x=\frac{22^2-7^2}{22^2+7^2}$ $\implies\cos x=\frac{2\cdot22\cdot7}{22^2+7^2}$ . Note that what we want is just $\frac{1+\cos x}{\sin x}=\frac{1+\frac{2\cdot22\cdot7}{22^2+7^2}}{\frac{22^2-7^2}{22^2+7^2}}=\frac{22^2+7^2+2\cdot22\cdot7}{22^2-7^2}=\frac{(22+7)^2}{(22-7)(22+7)}=\frac{22+7}{22-7}$ $=\frac{29}{15}\implies m+n=29+15=\boxed{044}$

Solution:
Assign a right triangle with angle $x$ , hypotenuse $c$ , adjacent side $a$ , and opposite side $b$ .
Then, through the given information above, we have that..
$\frac{c}{a}+\frac{b}{a}=\frac{22}{7}\implies \frac{c+b}{a}=\frac{22}{7}$
$\frac{c}{b}+\frac{a}{b}=\frac{m}{n}\implies \frac{a+c}{b}=\frac{m}{n}$
Hence, because similar right triangles can be scaled up by a factor, we can assume that this particular right triangle is indeed in simplest terms.
Hence, $a=7$ $b+c=22$
Furthermore, by the Pythagorean Theorem, we have that
$a^2+b^2=c^2\implies 49+b^2=c^2$
Solving for $c$ in the first equation and plugging in into the second equation...
$49+b^2=(22-b)^2\implies 49+b^2=484-44b+b^2\implies 44b=435\implies b=\frac{435}{44}$
Hence, $c=22-\frac{435}{44}=\frac{533}{44}$
Now, we want $\frac{a+c}{b}$
Plugging in, we find the answer is $\frac{\frac{7\cdot{44}}{44}+\frac{533}{44}}{\frac{435}{44}}=\frac{841}{435}=\frac{29}{15}$
Hence, the answer is $29+15=\boxed{044}$

Solution: We know that $\sec(x) = \frac{h}{a}$ and that $\tan(x) = \frac{o}{a}$ where $h$ $a$ $o$ represent the hypotenuse, adjacent, and opposite (respectively) to angle $x$ in a right triangle. Thus we have that $\sec(x) + \tan(x) = \frac{h+o}{a}$ . We also have that $\csc(x) + \cot(x) = \frac{h}{o} + \frac{a}{o} = \frac{h+a}{o}$ . Set $\sec(x) + \tan(x) = \alpha$ and csc(x)+cot(x) = $\beta$ . Then, notice that $\alpha + \beta = \frac{h+o}{a} + \frac{h+a}{o} = \frac{oh+ah+o^2 + a^2}{oa} = \frac{h(o+a+h)}{oa}$ ( This is because of the Pythagorean Theorem, recall $o^2 +a^2 = h^2$ ). But then notice that $\alpha \cdot \beta = \frac{(o+h)(a+h)}{oa} = \frac{oa +oh +ha +h^2}{oa} = 1+ \frac{h(o+a+h)}{oa} = 1+ \alpha + \beta$ . From the information provided in the question, we can substitute $\alpha$ for $\frac{22}{7}$ . Thus, $\frac{22 \beta}{7}= \beta + \frac{29}{7} \Longrightarrow 22 \beta = 7 \beta + 29 \Longrightarrow 15 \beta = 29 \Longrightarrow \beta = \frac{29}{15}$ . Since, essentially we are asked to find the sum of the numerator and denominator of $\beta$ , we have $29 + 15 = \boxed{044}$

Solution: Firstly, we write $\sec x+\tan x=a/b$ where $a=22$ and $b=7$ . This will allow us to spot factorable expressions later. Now, since $\sec^2x-\tan^2x=1$ , this gives us \[\sec x-\tan x=\frac{b}{a}\] Adding this to our original expressions gives us \[2\sec x=\frac{a^2+b^2}{ab}\] or \[\cos x=\frac{2ab}{a^2+b^2}\] Now since $\sin^2x+\cos^2x=1$ $\sin x=\sqrt{1-\cos^2x}$ So we can write \[\sin x=\sqrt{1-\frac{4a^2b^2}{(a^2+b^2)^2}}\] Upon simplification, we get \[\sin x=\frac{a^2-b^2}{a^2+b^2}\] We are asked to find $1/\sin x+\cos x/\sin x$ so we can write that as \[\csc x+\cot x=\frac{1}{\sin x}+\frac{\cos x}{\sin x}\] \[\csc x+\cot x=\frac{a^2+b^2}{a^2-b^2}+\frac{2ab}{a^2+b^2}\frac{a^2+b^2}{a^2-b^2}\] \[\csc x+\cot x=\frac{a^2+b^2+2ab}{a^2-b^2}\] \[\csc x+\cot x=\frac{(a+b)^2}{(a-b)(a+b)}\] \[\csc x+\cot x=\frac{a+b}{a-b}\] Now using the fact that $a=22$ and $b=7$ yields, \[\csc x+\cot x=\frac{29}{15}=\frac{p}{q}\] so $p+q=15+29=\boxed{44}$

Solution:
Rewriting $\sec{x}$ and $\tan{x}$ in terms of $\sin{x}$ and $\cos{x}$ , we know that $\frac{1+\sin{x}}{\cos{x}}=\frac{22}{7}.$
Clearing fractions, \[22\cos{x}=7+7\sin{x}.\]
Squaring to get an expression in terms of $\sin^2{x}$ and $\cos^2{x}$ \[484\cos^2{x}=49+49\sin^2{x}+98\sin{x}.\]
Substituting $\cos^2{x}=1-\sin^2{x},$
\[484(1-\sin^2{x})=49+49\sin^2{x}+98\sin{x}.\]
Expanding then collecting terms yields a quadratic in $\sin{x}:$
\[533\sin^2{x}+98\sin{x}-435=0.\]
To make calculations easier, let $y=\sin{x}.$
\[533y^2+98y-435=0.\]
Upon inspection, $y=-1$ is a root. Dividing by $y+1$
\[533y^2+98y-435=(533y-435)(y+1).\]
Substituting $y=\sin{x},$ we see that $\sin{x}=-1$ doesn't work, as $\cos{x}=0$ , leaving $\tan{x}$ undefined.
We conclude that $\sin{x}=\frac{435}{533}.$
Since $\sin^2{x}+\cos^2{x}=1,$
\[\cos{x}=\pm \sqrt{\frac{533^2-435^2}{533^2}}.\] \[=\pm \frac{308}{533}.\]
After checking via the given equation, we know that only the positive solution works.
Therefore,
\[\csc{x}+\cot{x}=\frac{1}{\sin{x}}+\frac{\cos{x}}{\sin{x}}\] \[=\frac{533}{435}+\frac{308}{435}\] \[=\frac{29}{15}=\frac{m}{n}.\]
Adding $m$ and $n$ , our answer is $\boxed{044}.$


Answer: 7.0

Suppose that $\triangle{ABC}$ is an equilateral triangle of side length $s$ , with the property that there is a unique point $P$ inside the triangle such that $AP=1$ $BP=\sqrt{3}$ , and $CP=2$ . What is $s$
$\textbf{(A) } 1+\sqrt{2} \qquad \textbf{(B) } \sqrt{7} \qquad \textbf{(C) } \frac{8}{3} \qquad \textbf{(D) } \sqrt{5+\sqrt{5}} \qquad \textbf{(E) } 2\sqrt{2}$

Solution: We begin by rotating $\triangle{ APB}$ counterclockwise by $60^{\circ}$ about $A$ , such that $P\mapsto Q$ and $B\mapsto C$ . We see that $\triangle{ APQ}$ is equilateral with side length $1$ , meaning that $\angle APQ = 60^{\circ}$ . We also see that $\triangle{CPQ}$ is a $30$ $60$ $90$ right triangle, meaning that $\angle CPQ= 60^{\circ}$ . Thus, by adding the two together, we see that $\angle APC = 120^{\circ}$  We can now use the law of cosines as following: \begin{align*} s^2 &= (AP)^2 + (CP)^2 - 2\cdot AP\cdot CP\cdot \cos{\angle{APC}} \\ &= 1 + 4 - 2\cdot 1\cdot 2\cdot \cos{120^{\circ}} \\ &= 5 - 4\left(-\frac{1}{2}\right) \\ &= 7, \end{align*} giving us that $s = \boxed{7}$

Solution: Rotate $\triangle CPA$ counterclockwise $60^\circ$ around point $C$ to $\triangle CQB$ . Then $CP=CQ, \angle PCQ=60^\circ$ , so $\triangle CPQ$ is an equilateral triangle.  Note that $\triangle PQB$ is a $30^\circ$ $60^\circ$ $90^\circ$ triangle, hence $\angle BPQ=30^\circ$ , and $\angle BPC=90^\circ$ , so \[BC^2=PC^2+PB^2=2^2+3=7,\] and the answer is $\boxed{7}$

Solution: Rotate $\triangle BPC$ counterclockwise by $60^\circ$ around point $B$ to $\triangle BQA$ . Then $BP=BQ$ , and $\angle PBQ=60^\circ$ , so $\triangle BPQ$ is an equilateral triangle.  Note that $\triangle QAP$ is a $30^\circ$ $60^\circ$ $90^\circ$ triangle, hence $\angle PQA=30^\circ$ , and $\angle BQA=90^\circ$ , so \[AB^2=PQ^2+AQ^2=2^2+3=7,\] and the answer is $\boxed{7}$

Solution:
Suppose that triangle $ABC$ had three segments of length $2$ , emanating from each of its vertices, making equal angles with each of its sides, and going into its interior. Suppose each of these segments intersected the segment clockwise to it precisely at its other endpoint and inside $ABC$ (as pictured in the diagram above). Clearly $s > 2$ and the triangle defined by these intersection points will be equilateral (pictured by the blue segments).
Take this equilateral triangle to have side length $1$ . The portions of each segment outside this triangle (in red) have length $1$ . Take $P'$ to be the intersection of the segments emanating from $A$ and $C$ . By Law of Cosines, \[BP' = \sqrt{1 + 1 - 2\cos{120^\circ}} = \sqrt{3}.\] So, $P'$ actually satisfies the conditions of the problem, and we can obtain again by Law of Cosines \[s = \sqrt{4 + 1 - 4\cos{120^\circ}} = \boxed{7}.\]

Solution:
We begin by dropping altitudes from point $P$ down to all three sides of the triangle as shown above. We can therefore make equations regarding the areas of triangles $\triangle{APC}$ $\triangle{APB}$ , and $\triangle{BPC}$ . Let $s$ be the side of the equilateral triangle, we use the Heron's formula:
\[\triangle{APC} = \frac{s\cdot PF}{2} = \sqrt{\frac{s+3}{2}\left(\frac{s+3}{2}-s\right)\left(\frac{s+3}{2}-1\right)\left(\frac{s+3}{2}-2\right)}\] \[\implies PF = \frac{\sqrt{10s^2-s^4-9}}{2s}\]
Similarly, we obtain:
\[PE = \frac{\sqrt{8s^2-s^4-4}}{2s}\] \[PG = \frac{\sqrt{14s^2-s^4-1}}{2s}\]
By Viviani's theorem, \[\frac{\sqrt{10s^2-s^4-9}}{2s}+\frac{\sqrt{8s^2-s^4-4}}{2s}+\frac{\sqrt{14s^2-s^4-1}}{2s} = \frac{\sqrt{3}}{2}s\] \[\sqrt{10s^2-s^4-9}+\sqrt{8s^2-s^4-4}+\sqrt{14s^2-s^4-1} = \sqrt{3}s^2\]
Note that from now on, the algebra will get extremely ugly and almost impossible to do by hand within the time frame. However, we do see that it's extremely easy to check the answer choices with the equation in this form. Testing $s = \sqrt{7}$ , We obtain $7\sqrt{3}$ on both sides, revealing that our answer is in fact $\boxed{7}$

Solution:
Instead of directly finding the side length of the equilateral triangle, we instead find the area and use it to find the side length.
Begin by reflecting $P$ over each of the sides. Label these reflected points $P', P'', P'''$ . Connect these points to the vertices of the equilateral triangle, as well as to each other.

Observe that the area of the equilateral triangle $ABC$ is half that of the hexagon $AP''CP'BP'''$
Note that $AP=AP''=AP'''$ . The same goes for the other vertices. This means that $AP''P'''$ is isosceles. Using either the Law of Cosines or simply observing that $AP''P'''$ is comprised of two 30-60-90 triangles, we find that $P''P'''= \sqrt{3}$ . Similarly (pun intended), $P'P'''=3$ and $P'P''=2\sqrt{3}$ . Using the previous observation that $AP''P'''$ is two 30-60-90 triangles (as are the others) we find the areas of $AP''P''$ to be $\frac{\sqrt{3}}{4}$ . Again, using similarity we find the area of $BP'P'''$ to be $\frac{3\sqrt{3}}{4}$ and the area of $CP'P''$ to be $\sqrt{3}$
Next, observe that $P'P''P'''$ is a 30-60-90 right triangle. This right triangle therefore has an area of $\frac{3\sqrt{3}}{2}$
Adding these areas together, we get the area of the hexagon as $\frac{7\sqrt{3}}{2}$ . This means that the area of $ABC$ is $\frac{7\sqrt{3}}{4}$
The formula for the area of an equilateral triangle with side length $s$ is $\frac{s^2\sqrt{3}}{4}$ (if you don't have this memorized it's not hard to derive). Comparing this formula to the area of $ABC$ , we can easily find that $s^2=7$ , which means that the side length of $ABC$ is $\boxed{7}$

Solution: Suppose $A(0,\sqrt{3}a)$ $B(-a,0)$ $C(a,0)$ and $P(x,y)$ . So $s=2a$ . Since $BP = \sqrt{3}$ and $CP = 2$ , we have \[(x+a)^2+y^2=3\] \[(x-a)^2+y^2=4\] Solving the equations, we have \[x=-\frac{1}{4a},~~y=\sqrt{\frac72-a^2-\frac{1}{16a^2}}\] From $AP=1$ (and a fair amount of algebra), we can have $a=\sqrt{7}/2$ . The answer is $\boxed{7}$

Solution: Drawing out a rough sketch, it appears that $\angle BPC = 90^{\circ}$ . By Pythagorean, our answer is $\sqrt{\sqrt{3}^2 + 2^2} = \boxed{7}$


Answer: 0.01

Suppose that $\{a_n\}$ is an arithmetic sequence with \[a_1+a_2+\cdots+a_{100}=100 \text{ and } a_{101}+a_{102}+\cdots+a_{200}=200.\] What is the value of $a_2 - a_1 ?$
$\mathrm{(A) \ } 0.0001\qquad \mathrm{(B) \ } 0.001\qquad \mathrm{(C) \ } 0.01\qquad \mathrm{(D) \ } 0.1\qquad \mathrm{(E) \ } 1$

Solution:
We should realize that the two equations are 100 terms apart, so by subtracting the two equations in a form like...
\[(a_{101} - a_1) + (a_{102} - a_2) +... + (a_{200} - a_{100}) = 200-100 = 100\]
...we get the value of the common difference of every hundred terms one hundred times. So we have to divide the answer by one hundred to get ...
$\frac{100}{100} = 1$
...the common difference of every hundred terms. Then we have to simply divide the answer by hundred again to find the common difference between one term, therefore...
$\frac{1}{100} =\boxed{0.01}$

Solution:
Adding the two given equations together gives
$a_1+a_2+...+a_{200}=300$
Now, let the common difference be $d$ . Notice that $a_2-a_1=d$ , so we merely need to find $d$ to get the answer. The formula for an arithmetic sum is
$\frac{n}{2}(2a_1+d(n-1))$
where $a_1$ is the first term, $n$ is the number of terms, and $d$ is the common difference. Now we use this formula to find a closed form for the first given equation and the sum of the given equations. For the first equation, we have $n=100$ . Therefore, we have
$50(2a_1+99d)=100$
or
$2a_1+99d=2$ .          * (1)
For the sum of the equations (shown at the beginning of the solution) we have $n=200$ , so
$100(2a_1+199d)=300$
or
$2a_1+199d=3$ (2)
Now we have a system of equations in terms of $a_1$ and $d$ .
Subtracting (1) from (2) eliminates $a_1$ , yielding $100d=1$ , and $d=a_2-a_1=\frac{1}{100}=\boxed{0.01}$

Solution:
Subtracting the 2 given equations yields
$(a_{101}-a_1)+(a_{102}-a_2)+(a_{103}-a_3)+...+(a_{200}-a_{100})=100$
Now express each $a_n$ in terms of first term $a_1$ and common difference $x$ between consecutive terms
$((a_1+100x)-(a_1))+((a_1+101x)-(a_1+x))+((a_1+102x)-(a_1+2x))+...+((a_1+199x)-(a_1+99x))=100$
Simplifying and canceling $a_1$ and $x$ terms gives
$100x+100x+100x+...+100x=100$
$100x\times100=100$
$100x=1$
$x=0.01=\boxed{0.01}$


Answer: 10.0

Suppose that $a * b$ means $3a-b.$ What is the value of $x$ if \[2 * (5 * x)=1\] $\textbf{(A) }\frac{1}{10} \qquad\textbf{(B) }2\qquad\textbf{(C) }\frac{10}{3} \qquad\textbf{(D) }10\qquad \textbf{(E) }14$

Solution: Let us plug in $(5 * x)=1$ into $3a-b$ . Thus it would be $3(5)-x$ . Now we have $2*(15-x)=1$ . Plugging $2*(15-x)$ into $3a-b$ , we have $6-15+x=1$ . Solving for $x$ we have \[-9+x=1\] \[x=\boxed{10}\]

Solution: Let us set a variable $y$ equal to $5 * x$ . Solving for y in the equation $3(2)-y=1$ , we see that y is equal to five. By substitution, we see that $5 * x$ = 5. Solving for x in the equation $5(3)-x = 5$ we get \[x=\boxed{10}\]


Answer: 3.0

Suppose that $a$ $b$ $c$ and $d$ are positive integers satisfying all of the following relations.
\[abcd=2^6\cdot 3^9\cdot 5^7\] \[\text{lcm}(a,b)=2^3\cdot 3^2\cdot 5^3\] \[\text{lcm}(a,c)=2^3\cdot 3^3\cdot 5^3\] \[\text{lcm}(a,d)=2^3\cdot 3^3\cdot 5^3\] \[\text{lcm}(b,c)=2^1\cdot 3^3\cdot 5^2\] \[\text{lcm}(b,d)=2^2\cdot 3^3\cdot 5^2\] \[\text{lcm}(c,d)=2^2\cdot 3^3\cdot 5^2\]
What is $\text{gcd}(a,b,c,d)$
$\textbf{(A)}~30\qquad\textbf{(B)}~45\qquad\textbf{(C)}~3\qquad\textbf{(D)}~15\qquad\textbf{(E)}~6$

Solution:
Denote by $\nu_p (x)$ the number of prime factor $p$ in number $x$
We index Equations given in this problem from (1) to (7).
First, we compute $\nu_2 (x)$ for $x \in \left\{ a, b, c, d \right\}$
Equation (5) implies $\max \left\{ \nu_2 (b), \nu_2 (c) \right\} = 1$ .
Equation (2) implies $\max \left\{ \nu_2 (a), \nu_2 (b) \right\} = 3$ .
Equation (6) implies $\max \left\{ \nu_2 (b), \nu_2 (d) \right\} = 2$ .
Equation (1) implies $\nu_2 (a) + \nu_2 (b) + \nu_2 (c) + \nu_2 (d) = 6$
Therefore, all above jointly imply $\nu_2 (a) = 3$ $\nu_2 (d) = 2$ , and $\left( \nu_2 (b), \nu_2 (c) \right) = \left( 0 , 1 \right)$ or $\left( 1, 0 \right)$
Second, we compute $\nu_3 (x)$ for $x \in \left\{ a, b, c, d \right\}$
Equation (2) implies $\max \left\{ \nu_3 (a), \nu_3 (b) \right\} = 2$ .
Equation (3) implies $\max \left\{ \nu_3 (a), \nu_3 (c) \right\} = 3$ .
Equation (4) implies $\max \left\{ \nu_3 (a), \nu_3 (d) \right\} = 3$ .
Equation (1) implies $\nu_3 (a) + \nu_3 (b) + \nu_3 (c) + \nu_3 (d) = 9$
Therefore, all above jointly imply $\nu_3 (c) = 3$ $\nu_3 (d) = 3$ , and $\left( \nu_3 (a), \nu_3 (b) \right) = \left( 1 , 2 \right)$ or $\left( 2, 1 \right)$
Third, we compute $\nu_5 (x)$ for $x \in \left\{ a, b, c, d \right\}$
Equation (5) implies $\max \left\{ \nu_5 (b), \nu_5 (c) \right\} = 2$ .
Equation (2) implies $\max \left\{ \nu_5 (a), \nu_5 (b) \right\} = 3$ .
Thus, $\nu_5 (a) = 3$
From Equations (5)-(7), we have either $\nu_5 (b) \leq 1$ and $\nu_5 (c) = \nu_5 (d) = 2$ , or $\nu_5 (b) = 2$ and $\max \left\{ \nu_5 (c), \nu_5 (d) \right\} = 2$
Equation (1) implies $\nu_5 (a) + \nu_5 (b) + \nu_5 (c) + \nu_5 (d) = 7$ .
Thus, for $\nu_5 (b)$ $\nu_5 (c)$ $\nu_5 (d)$ , there must be two 2s and one 0.
Therefore, \begin{align*} {\rm gcd} (a,b,c,d) & = \Pi_{p \in \{ 2, 3, 5\}} p^{\min\{ \nu_p (a), \nu_p(b) , \nu_p (c), \nu_p(d) \}} \\ & = 2^0 \cdot 3^1 \cdot 5^0 \\ & = \boxed{3}


Answer: 469.0

Solution:
First, we have: \[x^{(\log_y z)^2} = x^{\left( (\log_y z)^2 \right) } = x^{(\log_y z) \cdot (\log_y z) } = \left( x^{\log_y z} \right)^{\log_y z}\]
Now, let $x=y^w$ , then we have: \[x^{\log_y z}  = \left( y^w \right)^{\log_y z}  = y^{w\log_y z}  = y^{\log_y (z^w)}  = z^w\]
This is all we need to evaluate the given formula. Note that in our case we have $27=3^3$ $49=7^2$ , and $\sqrt{11}=11^{1/2}$ . We can now compute:
\[a^{(\log_3 7)^2} = \left( a^{\log_3 7} \right)^{\log_3 7} = 27^{\log_3 7} = (3^3)^{\log_3 7} = 7^3 = 343\]
Similarly, we get \[b^{(\log_7 11)^2}  = (7^2)^{\log_7 11} = 11^2  = 121\]
and \[c^{(\log_{11} 25)^2} = (11^{1/2})^{\log_{11} 25} = 25^{1/2} = 5\]
and therefore the answer is $343+121+5 = \boxed{469}$

Solution:
We know from the first three equations that $\log_a27 = \log_37$ $\log_b49 = \log_711$ , and $\log_c\sqrt{11} = \log_{11}25$ . Substituting, we find
\[a^{(\log_a27)(\log_37)} + b^{(\log_b49)(\log_711)} + c^{(\log_c\sqrt {11})(\log_{11}25)}.\]
We know that $x^{\log_xy} =y$ , so we find
\[27^{\log_37} + 49^{\log_711} + \sqrt {11}^{\log_{11}25}\]
\[(3^{\log_37})^3 + (7^{\log_711})^2 + ({11^{\log_{11}25}})^{1/2}.\]
The $3$ and the $\log_37$ cancel to make $7$ , and we can do this for the other two terms. Thus, our answer is
\[7^3 + 11^2 + 25^{1/2}\] \[= 343 + 121 + 5\] \[= \boxed{469}.\]


Answer: 5.0

Suppose that $a$ and $b$ are digits, not both nine and not both zero, and the repeating decimal $0.\overline{ab}$ is expressed as a fraction in lowest terms. How many different denominators are possible?
$\text{(A) }3 \qquad \text{(B) }4 \qquad \text{(C) }5 \qquad \text{(D) }8 \qquad \text{(E) }9$

Solution:
The repeating decimal $0.\overline{ab}$ is equal to \[\frac{10a+b}{100} + \frac{10a+b}{10000} + \cdots = (10a+b)\cdot\left(\frac 1{10^2} + \frac 1{10^4} + \cdots \right) =  (10a+b) \cdot \frac 1{99} = \frac{10a+b}{99}\]
When expressed in the lowest terms, the denominator of this fraction will always be a divisor of the number $99 = 3\cdot 3\cdot 11$ . This gives us the possibilities $\{1,3,9,11,33,99\}$ . As $a$ and $b$ are not both nine and not both zero, the denominator $1$ can not be achieved, leaving us with $\boxed{5}$ possible denominators.

Solution: Another way to convert the decimal into a fraction (simplifying, I guess?). We have \[100(0.\overline{ab}) = ab.\overline{ab}\] \[99(0.\overline{ab}) = 100(0.\overline{ab}) - 0.\overline{ab} = ab.\overline{ab} - 0.\overline{ab} = ab\] \[0.\overline{ab} = \frac{ab}{99}\] where $a, b$ are digits. Continuing in the same way by looking at the factors of 99, we have 5 different possibilities for the denominator. $\boxed{5}$


Answer: 5.0

Solution: Since $\frac{1}{99}=0.\overline{01}$ , we know that $0.\overline{ab} = \frac{ab}{99}$ . From here, we wish to find the number of factors of $99$ , which is $6$ . However, notice that $1$ is not a possible denominator, so our answer is $6-1=\boxed{5}$ \[\] ~AopsUser101

Solution:
Since $0.\overline{ab} = \frac{ab}{99}$ , the denominator must be a factor of $99 = 3^2 \cdot 11$ . The factors of $99$ are $1,$ $3,$ $9,$ $11,$ $33,$ and $99$ . Since $a$ and $b$ are not both nine, the denominator cannot be $1$ . By choosing $a$ and $b$ appropriately, we can make fractions with each of the other denominators.
Thus, the answer is $\boxed{5}$