Answer: 200.0

Last year 100 adult cats, half of whom were female, were brought into the Smallville Animal Shelter. Half of the adult female cats were accompanied by a litter of kittens. The average number of kittens per litter was 4. What was the total number of cats and kittens received by the shelter last year?
$\textbf{(A)}\ 150\qquad\textbf{(B)}\ 200\qquad\textbf{(C)}\ 250\qquad\textbf{(D)}\ 300\qquad\textbf{(E)}\ 400$

Solution: Half of the 100 adult cats are female, so there are $\frac{100}{2}$ $50$ female cats.  Half of those female adult cats have a litter of kittens, so there would be $\frac{50}{2}$ $25$ litters.  Since the average number of kittens per litter is 4, this implies that there are $25 \times 4$ $100$ kittens.  So the total number of cats and kittens would be $100 + 100$ $\boxed{200}$


Answer: 100.0

Last year Isabella took $7$ math tests and received $7$ different scores, each an integer between $91$ and $100$ , inclusive. After each test she noticed that the average of her test scores was an integer. Her score on the seventh test was $95$ . What was her score on the sixth test?
$\textbf{(A)}\ 92\qquad\textbf{(B)}\ 94\qquad\textbf{(C)}\ 96\qquad\textbf{(D)}\ 98\qquad\textbf{(E)}\ 100$

Solution: Let the sum of the scores of Isabella's first $6$ tests be $S$ . Since the mean of her first $7$ scores is an integer, then $S + 95 \equiv 0 \text{ (mod 7)}$ , or $S \equiv3 \text{ (mod 7)}$ . Also, $S \equiv 0 \text{ (mod 6)}$ , so by the CRT $S \equiv 24 \text{ (mod 42)}$ . We also know that $91 \cdot 6 \leq S \leq 100 \cdot 6$ , so by inspection, $S = 570$ . However, we also have that the mean of the first $5$ test scores must be an integer, so the sum of the first $5$ test scores must be an multiple of $5$ , which implies that the $6$ th test score is $\boxed{100}$

Solution: First, we find the largest sum of scores which is $100+99+98+97+96+95+94$ which equals $7(97)$ . Then we find the smallest sum of scores which is $91+92+93+94+95+96+97$ which is $7(94)$ . So the possible sums for the 7 test scores so that they provide an integer average are $7(97), 7(96), 7(95)$ and $7(94)$ which are $679, 672, 665,$ and $658$ respectively.  Now in order to get the sum of the first 6 tests, we subtract $95$ from each sum producing $584, 577, 570,$ and $563$ . Notice only $570$ is divisible by $6$ so, therefore, the sum of the first $6$ tests is $570$ . We need to find her score on the $6th$ test so we have to find which number will give us a number divisible by $5$ when subtracted from $570.$ Since $95$ is the $7th$ test score and all test scores are distinct that only leaves $\boxed{100}$

Solution: Since all of the scores are from $91 - 100$ , we can subtract 90 from all of the scores. Since the last score was a 95, the sum of the scores from the first six tests must be $3 \pmod 7$ and $0 \pmod 6$ . Trying out a few cases, the only solution possible is 30 (this is from adding numbers 1-10). The sixth test score must be $0 \pmod 5$ because $30\equiv 0\pmod5$ . The only possible test scores are $95$ and $100$ , and $95$ is already used, so the answer is $\boxed{100}$

Solution:
We work backwards to solve this problem. In the $n^{th}$ test, $\sum_{i=1}^{n} i$ (mod n) = 0. In the following table, the tests already taken are in bold, the latest test is underlined. We work from the row of (mod 7), (mod 6), and (mod 5) to determine the test order by trial and error.
\[\begin{tabular}{|c|c|c|c|c|c|c|c|c|c|c|} \hline  & 91 & 92 & 93 & 94 & 95 & 96 & 97 & 98 & 99 & 100 \\ \hline mod 7 & \textbf{0} & \textbf{1} & 2 & \textbf{3} & \underline{\textbf{4}} & \textbf{5} & \textbf{6} & 0 & 1 & \textbf{2} \\ \hline mod 6 & \textbf{1} & \textbf{2} & 3 & \textbf{4} & 5 & \textbf{0} & \textbf{1} & 2 & 3 & \underline{\textbf{4}} \\ \hline mod 5 & \textbf{1} & \textbf{2} & 3 & \underline{\textbf{4}} & 0 & \textbf{1} & \textbf{2} & 3 & 4 & 0 \\ \hline mod 4 & \underline{\textbf{3}} & \textbf{0} & 1 & 2 & 3 & \textbf{0} & \textbf{1} & 2 & 3 & 0 \\ \hline mod 3 & 1 & \textbf{2} & 0 & 1 & 2 & \textbf{0} & \underline{\textbf{1}} & 2 & 0 & 1 \\ \hline mod 2 & 1 & \underline{\textbf{0}} & 1 & 0 & 1 & \textbf{0} & 1 & 0 & 1 & 0 \\ \hline \end{tabular}\]
In the $4^{th}$ test, the test score could be 91 or 97.
As you can see, the test score of the $6^{th}$ test is $\boxed{100}$

Solution: Let's denote $x$ as $a_1+a_2+a_3+a_4+a_5+a_6$ , where $a_n$ is her $n$ th test score. We start by saying $\frac{x+95}{7} = [91,92,...100]$ . This results from the fact that her test averages are integers and her test scores are in the range of $91$ to $100$ . So $x+95=[637,644,...700] \implies x=[542,549,...605]$ . Next, we also see that $\frac{x}{6}=[91,92,...100]$ which becomes $x=[546,552,...600]$ . The only point of intersection of $[542,549,...605]$ and $[546,552,...600]$ is $570$ so $x=570$ . Now we can also see that $\frac{x-a_6}{5}=[91,92,...100]$ , so $x-a_6=[455,460,...500]$ , and since $x=570$ $570-a_6=[455,460,...500] \implies a_6=570-[455,460,...500]$ $a_6$ has to be in the range of $91$ and $100$ , so the only values in the set $[455,460,...500]$ that work are $470$ and $475$ which result in $a_6 = 100 \text{ or } 95$ respectively. But since her test scores are all distinct, and $95$ is already used for $a_7$ , our answer is $\boxed{100}$


Answer: 100.0

Last year, Isabella took 7 math tests and received 7 different scores, each an integer between 91 and 100, inclusive. After each test she noticed that the average of her test scores was an integer. Her score on the seventh test was 95. What was her score on the sixth test?
$\textbf{(A)}\ 92\qquad\textbf{(B)}\ 94\qquad\textbf{(C)}\ 96\qquad\textbf{(D)}\ 98\qquad\textbf{(E)}\ 100$

Solution: First, remove all the 90s, since they make no impact. So, we have numbers from $1$ to $10$ . Then, $5$ is the 7th number. Let the sum of the first $6$ numbers be $k$ . Then, $k\equiv 0 \mod 6$ and $k\equiv 3 \mod 7$ . We easily solve this as $k \equiv 24 \mod 42$ . Clearly, the sum of the first $6$ numbers must be $570$ . In order for the first $5$ numbers to sum to a multiple of $5$ , the sixth number must also be a multiple of $5$ , since $30$ is a multiple of $5$ . Thus, the only option is the sixth number is $10$ , which gives $10+90=  \boxed{100}$

Solution:
Let us simplify the problem. Since all of Isabella's test scores can be expressed as the sum of $90$ and an integer between $1$ and $10$ , we rewrite the problem into receiving scores between $1$ and $10$ . Later, we can add $90$ to her score to obtain the real answer.
From this point of view, the problem states that Isabella's score on the seventh test was $5$ . We note that Isabella received $7$ integer scores out of $1$ to $10$ . Since $5$ is already given as the seventh test score, the possible scores for Isabella on the other six tests are $S={1,2,3,4,6,7,8,9,10}$
The average score for the seven tests must be an integer. In other words, six distinct integers must be picked from set $S$ above, and their sum with $5$ must be a multiple of $7$ . The interval containing the possible sums of the six numbers in S are from $1 +2+3+4+6+7=23$ to $4+6+7+8+9+10=44$ . We must now find multiples of $7$ from the interval $23+5 = 28$ to $44+5=49$ . There are four possibilities: $28$ $35$ $42$ $49$ .
However, we also note that the sum of the six numbers (besides $5$ ) must be a multiple of $6$ as well. Thus, $35$ is the only valid choice.(The six numbers sum to $30$ .)
Thus the sum of the six numbers equals to $30$ . We apply the logic above in a similar way for the sum of the scores from the first test to the fifth test. The sum must be a multiple of $5$ . The possible interval is from $1+2+3+4+6=16$ to $6+7+8+9+10=40$ . Since the sum of the five scores must be less than $30$ , the only possibilities are $20$ and $25$ . However, we notice that $25$ does not work because the seventh score turns out to be $5$ from the calculation. Therefore, the sum of Isabella's scores from test $1$ to $5$ is $20$ . Therefore, her score on the sixth test is $10$ .
Our final answer is $10+90=  \boxed{100}$

Solution: Let $n$ be Isabella's average after $6$ tests. $6n+95 \equiv 0 \pmod{7}$ , so $n \equiv 4 \pmod{7}$ . The only integer between $90$ and $100$ that satisfies this condition is $95$ . Let $m$ be Isabella's average after $5$ tests, and let $a$ be her sixth test score. $5m+a= 6\cdot95 \equiv 0 \pmod{5}$ , so $a$ is a multiple of $5$ . Since $100$ is the only choice that is a multiple of $5$ , the answer is $\boxed{100}$

Solution:
Let $T$ be the total sum of Isabella's first five test scores, and let $S$ be her score on the sixth test. It follows that $T\equiv 0\pmod {5}$ $T+S\equiv 0\pmod {6}$ , and $T+S+95\equiv 0\pmod {7}$ , since at each step, her average score was an integer. Using the last equivalence, $T+S\equiv -95\equiv 3\pmod{7}$ , so we have a system of equivalences for $T+S$ . Solving this using the Chinese Remainder Theorem, we get $T+S\equiv (0)(7)(1)+(3)(6)(-1) \equiv -18 \equiv 24 \pmod{42}$
Now let's put a bound on $T$ . Using the given information that each test score was a distinct integer from $91$ to $100$ inclusive and that the seventh score was 95, we get $91+92+93+94+96\leq T\leq 100+99+98+97+96$ . Since $T\equiv 0 \pmod{5}$ , we get $T=470,475,480,485,490$ . Therefore, $T\equiv 8,13,18,23,28\pmod{42}$
The last preparation step will involve calculating all the possible test scores $\pmod {42}$ . Here they are: $91\equiv 7\pmod{42},92\equiv 8\pmod{42},93\equiv 9\pmod{42},94\equiv 10\pmod{42},95\equiv 11\pmod{42},96\equiv 12\pmod{42},97\equiv 13\pmod{42},98\equiv 14\pmod{42},99\equiv 15\pmod{42},100\equiv 16\pmod{42}$ . This means that $S\equiv 7,8,9,10,12,13,14,15,16\pmod{42}$ . Note that $11$ is not in the previous list because it corresponds to a score of $95$ , which we cannot have.
We must have $T+S\equiv 24\pmod{42}$ , and using the possible values we found for $T$ and $S$ , the only two that sum to $24$ are $T\equiv 8\pmod{42}$ and $S\equiv 16\pmod{42}$ . This corresponds to an $S$ value of $100$ , so the answer is $\boxed{100}$

Solution: We know that Isabella's score on the 7th test is 95, and we work backwards. Let $a_n$ denote the average of the first $n$ scores. We are given that all $a_n$ are integers. If the $a_6$ is different from the $a_7$ , then the last score must be a multiple of 7 away from $a_6$ . However, $95-7=88$ and $95+7=102$ clearly cannot be $a_6$ since they are outside the range of 91 to 100. Thus, $a_6$ must be 95. Additionally, $a_5$ cannot be 95 since that would mean the sixth score is 95, which isn't possible since scores can't repeat (also, it's not an answer choice). Intuitively, $a_5$ should be close to 95 due to the constraint on the range of scores. We can try 94 and 96 for $a_5$ . Again, the sixth score must be a multiple of 6 (preferably only one multiple) away from $a_5$ . The only one that works is $94+6=100$ , and we can check that the rest don't work since they exceed the range. The answer is $\boxed{100}$

Solution:
Say the sum of the first 6 scores is $n$ . Then, we know that $n + 95 \equiv 0 \pmod{7}$ . Thus, $n \equiv 3 \pmod{7}$ . Additionally, since the average of these 6 scores was an integer, we know that $n \equiv 0 \pmod{6}$ . We find that the smallest $n$ to satisfy both of these inequalities is 24 (series below). \[3, 10, 17, 24, ...\] To get to the next one, we have to add $6 \cdot 7 = 42$ so as not to ruin the moduli.
Next, we know that $n$ is between $91 \cdot 6 = 546$ and $100 \cdot 6 = 600$ . It can't take on either value as all the scores have to be different. Now, we calculate the first $n$ that satisfies both moduli equations:
\[546 < 42 + 24x\] \[91 < 7 + 4x\] \[84 < 4x\] \[21 < x\]
$x = 22$ works while $x = 23$ does not (as it hits the upper limit of 600), and we find that $n = 42 + 24 \cdot 22 = 570$ . So, the sum of the first 6 scores is 570. We also know that the sum of the first 5 scores is a multiple of 5. Since $5~\mid~570$ , the 6th score must be a multiple of 5. 95 is taken, so the only possibility $\boxed{100}$


Answer: 3.0

Laszlo went online to shop for black pepper and found thirty different black pepper options varying in weight and price, shown in the scatter plot below. In ounces, what is the weight of the pepper that offers the lowest price per ounce?
[asy] //diagram by pog size(5.5cm); usepackage("mathptmx"); defaultpen(mediumgray*0.5+gray*0.5+linewidth(0.63)); add(grid(6,6)); label(scale(0.7)*"$1$", (1,-0.3), black); label(scale(0.7)*"$2$", (2,-0.3), black); label(scale(0.7)*"$3$", (3,-0.3), black); label(scale(0.7)*"$4$", (4,-0.3), black); label(scale(0.7)*"$5$", (5,-0.3), black); label(scale(0.7)*"$1$", (-0.3,1), black); label(scale(0.7)*"$2$", (-0.3,2), black); label(scale(0.7)*"$3$", (-0.3,3), black); label(scale(0.7)*"$4$", (-0.3,4), black); label(scale(0.7)*"$5$", (-0.3,5), black); label(scale(0.8)*rotate(90)*"Price (dollars)", (-1,3.2), black); label(scale(0.8)*"Weight (ounces)", (3.2,-1), black); dot((1,1.2),black); dot((1,1.7),black); dot((1,2),black); dot((1,2.8),black);  dot((1.5,2.1),black); dot((1.5,3),black); dot((1.5,3.3),black); dot((1.5,3.75),black);  dot((2,2),black); dot((2,2.9),black); dot((2,3),black); dot((2,4),black); dot((2,4.35),black); dot((2,4.8),black);  dot((2.5,2.7),black); dot((2.5,3.7),black); dot((2.5,4.2),black); dot((2.5,4.4),black);  dot((3,2.5),black); dot((3,3.4),black); dot((3,4.2),black);  dot((3.5,3.8),black); dot((3.5,4.5),black); dot((3.5,4.8),black);  dot((4,3.9),black); dot((4,5.1),black);  dot((4.5,4.75),black); dot((4.5,5),black);  dot((5,4.5),black); dot((5,5),black); [/asy]
$\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }5$

Solution: We are looking for a black point, that when connected to the origin, yields the lowest slope. The slope represents the price per ounce. We can visually find that the point with the lowest slope is the blue point. Furthermore, it is the only one with a price per ounce significantly less than $1$ . Finally, we see that the blue point is in the category with a weight of $\boxed{3}$ ounces.

Solution:
By the answer choices, we can disregard the points that do not have integer weights. As a result, we obtain the following diagram:

We then proceed in the same way that we had done in Solution 1. Following the steps, we figure out the blue dot that yields the lowest slope, along with passing the origin. We then can look at the x-axis(in this situation, the weight) and figure out it has $\boxed{3}$ ounces.

Solution:
We can find the lowest point in each line ( $1$ $2$ $3$ $4$ , or $5$ ) and find the price per pound. (Note that we don't need to find the points higher than the points below since we are finding the lowest price per pound.)

The red dot has a price per pound of something that is larger than $1$ . The green dot has a price per pound of $1$ . The blue dot has a price per pound of something like $\frac{2.5}{3}$ . The orange dot has a price per pound that is less than $1$ , but is very close to it. The purple dot has a price per pound of something like $\frac{4.5}{5}$ . We see that choices $\textbf{(A)}$ $\textbf{(B)}$ ,and $\textbf{(D)}$ are eliminated. Also, $\frac{4.5}{5} > \frac{2.5}{3}$ thus the answer is $\boxed{3}$


Answer: 4.0

Laura added two three-digit positive integers. All six digits in these numbers are different. Laura's sum is a three-digit number $S$ . What is the smallest possible value for the sum of the digits of $S$
$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 15\qquad\textbf{(E)}\ 20$

Solution:
Let the two three-digit numbers she added be $a$ and $b$ with $a+b=S$ and $a<b$ . The hundreds digits of these numbers must be at least $1$ and $2$ , so $a\ge 100$ and $b\ge 200$
Say $a=100+p$ and $b=200+q$ ; then we just need $p+q=100$ with $p$ and $q$ having different digits which aren't $1$ or $2$ .There are many solutions, but $p=3$ and $q=97$ give $103+297=400$ which proves that $\boxed{4}$ is attainable.

Solution:
For this problem, to find the $3$ -digit integer with the smallest sum of digits, one should make the units and tens digit add to $0$ . To do that, we need to make sure the digits are all distinct. For the units digit, we can have a variety of digits that work. $7$ works best for the top number which makes the bottom digit $3$ . The tens digits need to add to $9$ because of the $1$ that needs to be carried from the addition of the units digits. We see that $5$ and $4$ work the best as we can't use $6$ and $3$ . Finally, we use $2$ and $1$ for our hundreds place digits.
Adding the numbers $257$ and $143$ , we get $400$ which means our answer is $\boxed{4}$


Answer: 2.0

LeRoy and Bernardo went on a week-long trip together and agreed to share the costs equally. Over the week, each of them paid for various joint expenses such as gasoline and car rental. At the end of the trip it turned out that LeRoy had paid $A$ dollars and Bernardo had paid $B$ dollars, where $A < B$ . How many dollars must LeRoy give to Bernardo so that they share the costs equally?
$\textbf{(A)}\ \frac{A + B}{2} \qquad\textbf{(B)}\ \dfrac{A - B}{2}\qquad\textbf{(C)}\ \dfrac{B - A}{2}\qquad\textbf{(D)}\ B - A \qquad\textbf{(E)}\ A + B$

Solution: The difference in how much LeRoy and Bernardo paid is $B-A$ . To share the costs equally, LeRoy must give Bernardo half of the difference, which is $\boxed{2}$

Solution: Since there are no restrictions on cost paid besides $A<B$ , we can use an example where $A = 40$ and $B = 50$ . Quickly, we realize the only way they could pay the same amount of money is if they both pay 45 dollars. This means LeRoy must give Bernardo $50 - 45 = 5$ . Looking at the answer choices we see only $\frac{50-40}{2} = 5$ works. $\boxed{2}$


Answer: 2.0

LeRoy and Bernardo went on a week-long trip together and agreed to share the costs equally. Over the week, each of them paid for various joint expenses such as gasoline and car rental. At the end of the trip it turned out that LeRoy had paid A dollars and Bernardo had paid B dollars, where $A < B.$ How many dollars must LeRoy give to Bernardo so that they share the costs equally?
$\textbf{(A)}\ \frac{A+B}{2} \qquad \textbf{(B)}\ \frac{A-B}{2} \qquad \textbf{(C)}\ \frac{B-A}{2} \qquad \textbf{(D)}\ B-A \qquad \textbf{(E)}\ A+B$

Solution: The total amount of money that was spent during the trip was \[A + B\] So each person should pay \[\frac{A+B}{2}\] if they were to share the costs equally. Because LeRoy has already paid $A$ dollars of his part, he still has to pay \[\frac{A+B}{2} - A =\] \[= \boxed{2}\]


Answer: 37.0

Leah has $13$ coins, all of which are pennies and nickels. If she had one more nickel than she has now, then she would have the same number of pennies and nickels. In cents, how much are Leah's coins worth?
$\textbf {(A) } 33 \qquad \textbf {(B) } 35 \qquad \textbf {(C) } 37 \qquad \textbf {(D) } 39 \qquad \textbf {(E) } 41$

Solution: If Leah has $1$ more nickel, she has $14$ total coins. Because she has the same number of nickels and pennies, she has $7$ nickels and $7$ pennies. This is after the nickel has been added, so we must subtract $1$ nickel to get $6$ nickels and $7$ pennies. Therefore, Leah has $6\cdot5+7=\boxed{37}$ cents.


Answer: 37.0

Leah has $13$ coins, all of which are pennies and nickels. If she had one more nickel than she has now, then she would have the same number of pennies and nickels. In cents, how much are Leah's coins worth?
$\textbf{(A)}\ 33\qquad\textbf{(B)}\ 35\qquad\textbf{(C)}\ 37\qquad\textbf{(D)}\ 39\qquad\textbf{(E)}\ 41$

Solution: She has $p$ pennies and $n$ nickels, where $n + p = 13$ . If she had $n+1$ nickels then $n+1 = p$ , so $2n+ 1 = 13$ and $n=6$ . So she has 6 nickels and 7 pennies, which clearly have a value of $\boxed{37}$ cents.


Answer: 40.0

Let
\[p(x,y) = a_0 + a_1x + a_2y + a_3x^2 + a_4xy + a_5y^2 + a_6x^3 + a_7x^2y + a_8xy^2 + a_9y^3.\]
Suppose that
\[p(0,0) = p(1,0) = p( - 1,0) = p(0,1) = p(0, - 1)\\ = p(1,1) = p(1, - 1) = p(2,2) = 0.\]
There is a point $\left(\frac {a}{c},\frac {b}{c}\right)$ for which $p\left(\frac {a}{c},\frac {b}{c}\right) = 0$ for all such polynomials, where $a$ $b$ , and $c$ are positive integers, $a$ and $c$ are relatively prime, and $c > 1$ .  Find $a + b + c$

Solution:
\begin{align*} p(0,0) &= a_0 \\ &= 0 \\ p(1,0) &= a_0 + a_1 + a_3 + a_6 \\ &= a_1 + a_3 + a_6 \\ &= 0 \\ p(-1,0) &= -a_1 + a_3 - a_6 \\ &= 0 \end{align*}
Adding the above two equations gives $a_3 = 0$ , and so we can deduce that $a_6 = -a_1$
Similarly, plugging in $(0,1)$ and $(0,-1)$ gives $a_5 = 0$ and $a_9 = -a_2$ . Now, \begin{align*} p(1,1) &= a_0 + a_1 + a_2 + a_3 + a_4 + a_5 + a_6 + a_7 + a_8 + a_9 \\ &= 0 + a_1 + a_2 + 0 + a_4 + 0 - a_1 + a_7 + a_8 - a_2 \\ &= a_4 + a_7 + a_8 \\ &= 0 \\ p(1,-1) &= a_0 + a_1 - a_2 + 0 - a_4 + 0 - a_1 - a_7 + a_8 + a_2 \\ &= -a_4 - a_7 + a_8 \\ &= 0 \end{align*} Therefore $a_8 = 0$ and $a_7 = -a_4$ . Finally, \begin{align*} p(2,2) &= 0 + 2a_1 + 2a_2 + 0 + 4a_4 + 0 - 8a_1 - 8a_4 +0 - 8a_2 \\ &= -6 a_1 - 6 a_2 - 4 a_4 \\ &= 0 \end{align*} So, $3a_1 + 3a_2 + 2a_4 = 0$ , or equivalently $a_4 = -\frac{3(a_1 + a_2)}{2}$
Substituting these equations into the original polynomial $p$ , we find that at $\left(\frac{a}{c}, \frac{b}{c}\right)$ \[a_1x + a_2y + a_4xy - a_1x^3 - a_4x^2y - a_2y^3 = 0 \iff\] \[a_1x + a_2y - \frac{3(a_1 + a_2)}{2}xy - a_1x^3 + \frac{3(a_1 + a_2)}{2}x^2y - a_2y^3 = 0 \iff\] \[a_1x(x - 1)\left(x + 1 - \frac{3}{2}y\right) + a_2y\left(y^2 - 1 - \frac{3}{2}x(x - 1)\right) = 0\] .
The remaining coefficients $a_1$ and $a_2$ are now completely arbitrary because the original equations impose no more restrictions on them. Hence, for the final equation to hold for all possible $p$ , we must have $x(x - 1)\left(x + 1 - \frac{3}{2}y\right) = y\left(y^2 - 1 - \frac{3}{2}x(x - 1)\right) = 0$
As the answer format implies that the $x$ -coordinate of the root is non-integral, $x(x - 1)\left(x + 1 - \frac{3}{2}y\right) = 0 \iff x + 1 - \frac{3}{2}y = 0 \iff y = \frac{2}{3}(x + 1)\ (1)$ . The format also implies that $y$ is positive, so $y\left(y^2 - 1 - \frac{3}{2}x(x - 1)\right) = 0 \iff y^2 - 1 - \frac{3}{2}x(x - 1) = 0\ (2)$ . Substituting $(1)$ into $(2)$ and reducing to a quadratic yields $(19x - 5)(x - 2) = 0$ , in which the only non-integral root is $x = \frac{5}{19}$ , so $y = \frac{16}{19}$
The answer is $5 + 16 + 19 = \boxed{040}$

Solution:
Consider the cross section of $z = p(x, y)$ on the plane $z = 0$ . We realize that we could construct the lines/curves in the cross section such that their equations multiply to match the form of $p(x, y)$ and they go over the eight given points. A simple way to do this would be to use the equations $x = 0$ $x = 1$ , and $y = \frac{2}{3}x + \frac{2}{3}$ , giving us
$p_1(x, y) = x\left(x - 1\right)\left( \frac{2}{3}x - y + \frac{2}{3}\right) = \frac{2}{3}x + xy + \frac{2}{3}x^3-x^2y$
Another way to do this would to use the line $y = x$ and the ellipse, $x^2 + xy + y^2 = 1$ . This would give
$p_2(x, y) = \left(x - y\right)\left(x^2 + xy + y^2 - 1\right) = -x + y + x^3 - y^3$
At this point, we see that $p_1$ and $p_2$ both must have $\left(\frac{a}{c}, \frac{b}{c}\right)$ as a zero. A quick graph of the 4 lines and the ellipse used to create $p_1$ and $p_2$ gives nine intersection points. Eight of them are the given ones, and the ninth is $\left(\frac{5}{9}, \frac{16}{9}\right)$ . The last intersection point can be found by finding the intersection points of $y = \frac{2}{3}x + \frac{2}{3}$ and $x^2 + xy + y^2 = 1$ .
Finally, just add the values of $a$ $b$ , and $c$ to get $5 + 16 + 19 = \boxed{040}$


Answer: 158.0

Let $(a,b,c)$ be the real solution of the system of equations $x^3 - xyz = 2$ $y^3 - xyz = 6$ $z^3 - xyz = 20$ . The greatest possible value of $a^3 + b^3 + c^3$ can be written in the form $\frac {m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$

Solution: This is almost the same as solution 1. Note $a^3 + b^3 + c^3 = 28 + 3abc$ . Next, let $k = a^3$ . Note that $b = \sqrt [3]{k + 4}$ and $c = \sqrt [3]{k + 18}$ , so we have $28 + 3\sqrt [3]{k(k+4)(k+18)} = 28+3abc=a^3+b^3+c^3=3k+22$ . Move 28 over, divide both sides by 3, then cube to get $k^3-6k^2+12k-8 = k^3+22k^2+18k$ . The $k^3$ terms cancel out, so solve the quadratic to get $k = -2, -\frac{1}{7}$ . We maximize $abc$ by choosing $k = -\frac{1}{7}$ , which gives us $a^3+b^3+c^3 = 3k + 22 = \frac{151}{7}$ . Thus, our answer is $151+7=\boxed{158}$


Answer: 96.0

Let $(a,b,c,d)$ be an ordered quadruple of not necessarily distinct integers, each one of them in the set $\{0,1,2,3\}.$ For how many such quadruples is it true that $a\cdot d-b\cdot c$ is odd? (For example, $(0,3,1,1)$ is one such quadruple, because $0\cdot 1-3\cdot 1 = -3$ is odd.)
$\textbf{(A) } 48 \qquad \textbf{(B) } 64 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 128 \qquad \textbf{(E) } 192$

Solution: In order for $a\cdot d-b\cdot c$ to be odd, consider parity. We must have (even)-(odd) or (odd)-(even). There are $2(2 + 4) = 12$ ways to pick numbers to obtain an even product. There are $2 \cdot 2 = 4$ ways to obtain an odd product. Therefore, the total amount of ways to make $a\cdot d-b\cdot c$ odd is $2 \cdot (12 \cdot 4) = \boxed{96}$

Solution: Consider parity. We need exactly one term to be odd, one term to be even. Because of symmetry, we can set $ad$ to be odd and $bc$ to be even, then multiply by $2.$ If $ad$ is odd, both $a$ and $d$ must be odd, therefore there are $2\cdot2=4$ possibilities for $ad.$ Consider $bc.$ Let us say that $b$ is even. Then there are $2\cdot4=8$ possibilities for $bc.$ However, $b$ can be odd, in which case we have $2\cdot2=4$ more possibilities for $bc.$ Thus there are $12$ ways for us to choose $bc$ and $4$ ways for us to choose $ad.$ Therefore, also considering symmetry, we have $2 \cdot 4 \cdot 12= \boxed{96}$ total values of $ad-bc.$

Solution:
There are 4 ways to choose any number independently and 2 ways to choose any odd number independently.
To get an even products, we count: $\text{P(any number)} \cdot \text{P(any number)}-\text{P(odd)}\cdot\text{P(odd)}$ , which is $4 \cdot 4 - 2 \cdot 2=12$ .
The number of ways to get an odd product can be counted like so: $\text{P(odd)}\cdot\text{P(odd)}$ , which is $2 \cdot 2$ , or $4$ .
So, for one product to be odd the other to be even: $2 \cdot 4 \cdot 12=\boxed{96}$ (order matters).
~ Anonymous and Arctic_Bunny

Solution: For parity reasons, if $ad - bc$ is to be odd, we must have $ad$ odd and $bc$ even or $ad$ even and $bc$ odd. By symmetry, these cases are identical, so we consider the first one and multiply by two at the end. For $ad$ to be odd, we must have both $a$ and $d$ odd, and there are $2 \cdot 2$ ways to do so. To count the cases where $bc$ is odd, we use PIE. there are $2 \cdot 4 = 8$ ways for $b$ to be odd and $4 \cdot 2 = 8$ ways for $c$ to be odd, and there are $2 \cdot 2 = 4$ ways for both to be odd. Thus, there are $8 + 8 - 4 = 12$ ways for $bc$ to be even. Multiplying out, there are $2 \cdot 4 \cdot 12$ ways to have $ad - bc$ odd for a total of $\boxed{96}$


Answer: 512.0

Let $(a_1,a_2, \dots ,a_{10})$ be a list of the first 10 positive integers such that for each $2 \le i \le 10$ either $a_i+1$ or $a_i-1$ or both appear somewhere before $a_i$ in the list. How many such lists are there?
$\textbf{(A)}\ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ 362,880$

Solution:
This problem is worded awkwardly. More simply, it asks: “How many ways can you order numbers 1-10 so that each number is one above or below some previous term?”
Then, the method becomes clear. For some initial number, WLOG examine the numbers greater than it. They always must appear in ascending order later in the list, though not necessarily as adjacent terms. Then, for some initial number, the number of possible lists is just the number of combination where this number of terms can be placed in 9 slots. For 9, that’s 1 number in 9 potential slots. For 8, that’s 2 numbers in 9 potential slots.
\[\binom{9}{0} + \binom{9}{1} + \cdots + \binom{9}{9} =512 \implies \boxed{512}\]

Solution:
For a list ${a_1, a_2, \dots, a_k}$ with $k$ terms, $2$ valid lists with $k+1$ terms can be created by $2$ ways:
1. Add $a_{k+1}$ to the end of the list, making a new list ${a_1, a_2, \dots, a_k, a_{k+1} }$
2. Increase the value of all existing terms by one, making a new list ${a_2, a_3, \dots, a_{k+1}}$ . Then add $a_1$ to the end of the list, making a new list ${a_2, a_3, \dots, a_{k+1}, a_1}$
Let $F(n)$ be the number of lists with $n$ elements, $F(n) = 2 \cdot F(n-1)$ . As $F(2) = 2$ $F(n) = 2^{n-1}$ $F(10) = 2^9 = \boxed{512}$


Answer: 462.0

Let $(a_1,a_2,a_3,\ldots,a_{12})$ be a permutation of $(1,2,3,\ldots,12)$ for which
An example of such a permutation is $(6,5,4,3,2,1,7,8,9,10,11,12).$ Find the number of such permutations.

Solution: Clearly, $a_6=1$ .  Now, consider selecting $5$ of the remaining $11$ values.  Sort these values in descending order, and sort the other $6$ values in ascending order.  Now, let the $5$ selected values be $a_1$ through $a_5$ , and let the remaining $6$ be $a_7$ through ${a_{12}}$ .  It is now clear that there is a bijection between the number of ways to select $5$ values from $11$ and ordered 12-tuples $(a_1,\ldots,a_{12})$ .  Thus, there will be ${11 \choose 5}=\boxed{462}$ such ordered 12-tuples.

Solution:
Clearly, $a_6=1$ , and either $a_1$ or $a_{12}$ is 12.
Case 1: $a_1 = 12$
In this case, there are 4 empty spaces between $a_1$ and $a_6$ , and 6 empty spaces between $a_6$ and $a_{12}$ $\binom{10}{4}$ is 210. This splits the remaining 10 numbers into two distinct sets that are automatically ordered. For this reason, there is no need to multiply by two to count doubles or treat as a permutation.
Case 2: $a_{12} = 12$
In this case, there are 5 empty spaces between $a_1$ and $a_6$ , and 5 empty spaces between $a_6$ and $a_{12}$ $\binom{10}{5}$ is 252. Like last time, this splits the remaining 10 numbers into two distinct sets that are automatically ordered. It is important to realize that the two sets are distinct because one side has 12 and the other does not. There is no need to multiply by two.
$210 + 252 = \boxed{462}$ ordered 12-tuples.


Answer: 3722.0

Let $1$ $4$ $\ldots$ and $9$ $16$ $\ldots$ be two arithmetic progressions. The set $S$ is the union of the first $2004$ terms of each sequence. How many distinct numbers are in $S$
$\mathrm{(A) \ } 3722 \qquad \mathrm{(B) \ } 3732 \qquad \mathrm{(C) \ } 3914 \qquad \mathrm{(D) \ } 3924 \qquad \mathrm{(E) \ } 4007$

Solution:
The two sets of terms are $A=\{ 3k+1 : 0\leq k < 2004 \}$ and $B=\{ 7l+9 : 0\leq l<2004\}$
Now $S=A\cup B$ . We can compute $|S|=|A\cup B|=|A|+|B|-|A\cap B|=4008-|A\cap B|$ . We will now find $|A\cap B|$
Consider the numbers in $B$ . We want to find out how many of them lie in $A$ . In other words, we need to find out the number of valid values of $l$ for which $7l+9\in A$
The fact " $7l+9\in A$ " can be rewritten as " $1\leq 7l+9 \leq 3\cdot 2003 + 1$ , and $7l+9\equiv 1\pmod 3$ ".
The first condition gives $0\leq l\leq 857$ , the second one gives $l\equiv 1\pmod 3$
Thus the good values of $l$ are $\{1,4,7,\dots,856\}$ , and their count is $858/3 = 286$
Therefore $|A\cap B|=286$ , and thus $|S|=4008-|A\cap B|=\boxed{3722}$

Solution:
We can start by finding the first non-distinct term from both sequences. We find that that number is $16$ . Now, to find every
other non-distinct terms, we can just keep adding $21$ . We know that the last terms of both sequences are $1+3\cdot 2003$ and
$9+7\cdot 2003$ . Clearly, $1+3\cdot 2003$ is smaller and that is the last possible common term of both sequences. Now, we can
create the inequality $16+21k \leq 1+3\cdot 2003$ . Using the inequality, we find that there are $286$ common terms. There are 4008
terms in total. $4008-286=\boxed{3722}$


Answer: 51.0

Let $A = (0,0)$ and $B = (b,2)$ be points on the coordinate plane. Let $ABCDEF$ be a convex equilateral hexagon such that $\angle FAB = 120^\circ,$ $\overline{AB}\parallel \overline{DE},$ $\overline{BC}\parallel \overline{EF,}$ $\overline{CD}\parallel \overline{FA},$ and the y-coordinates of its vertices are distinct elements of the set $\{0,2,4,6,8,10\}.$ The area of the hexagon can be written in the form $m\sqrt {n},$ where $m$ and $n$ are positive integers and n is not divisible by the square of any prime. Find $m + n.$

Solution:
The y-coordinate of $F$ must be $4$ .  All other cases yield non-convex and/or degenerate hexagons, which violate the problem statement.
Letting $F = (f,4)$ , and knowing that $\angle FAB = 120^\circ$ , we can use rewrite $F$ using complex numbers: $f + 4 i = (b + 2 i)\left(e^{i(2 \pi / 3)}\right) = (b + 2 i)\left(-1/2 + \frac{\sqrt{3}}{2} i\right) = -\frac{b}{2}-\sqrt{3}+\left(\frac{b\sqrt{3}}{2}-1\right)i$ .  We solve for $b$ and $f$ and find that $F = \left(-\frac{8}{\sqrt{3}}, 4\right)$ and that $B = \left(\frac{10}{\sqrt{3}}, 2\right)$
The area of the hexagon can then be found as the sum of the areas of two congruent triangles ( $EFA$ and $BCD$ , with height $8$ and base $\frac{8}{\sqrt{3}}$ ) and a parallelogram ( $ABDE$ , with height $8$ and base $\frac{10}{\sqrt{3}}$ ).
$A = 2 \times \frac{1}{2} \times 8 \times \frac{8}{\sqrt{3}} + 8 \times \frac{10}{\sqrt{3}} = \frac{144}{\sqrt{3}} = 48\sqrt{3}$
Thus, $m+n = \boxed{051}$

Solution:
 From this image, we can see that the y-coordinate of F is 4, and from this, we can gather that the coordinates of E, D, and C, respectively, are 8, 10, and 6.

Let the angle between the $x$ -axis and segment $AB$ be $\theta$ , as shown above. Thus, as $\angle FAB=120^\circ$ , the angle between the $x$ -axis and segment $AF$ is $60-\theta$ , so $\sin{(60-\theta)}=2\sin{\theta}$ . Expanding, we have
Isolating $\sin{\theta}$ we see that $\frac{\sqrt{3}\cos{\theta}}{2}=\frac{5\sin{\theta}}{2}$ , or $\cos{\theta}=\frac{5}{\sqrt{3}}\sin{\theta}$ . Using the fact that $\sin^2{\theta}+\cos^2{\theta}=1$ , we have $\frac{28}{3}\sin^2{\theta}=1$ , or $\sin{\theta}=\sqrt{\frac{3}{28}}$ . Letting the side length of the hexagon be $y$ , we have $\frac{2}{y}=\sqrt{\frac{3}{28}}$ . After simplification we find that that $y=\frac{4\sqrt{21}}{3}$
In particular, note that by the Pythagorean theorem, $b^2+2^2=y^2$ , hence $b=10\sqrt{3}/3$ . Also, if $C=(c,6)$ , then $y^2=BC^2=4^2+(c-b)^2$ , hence $c-b=8\sqrt{3}/3,$ and thus $c=18\sqrt{3}/3$ . Using similar methods (or symmetry), we determine that $D=(10\sqrt{3}/3,10)$ $E=(0,8)$ , and $F=(-8\sqrt{3}/3,4)$ . By the Shoelace theorem, \[[ABCDEF]=\frac12\left|\begin{array}{cc} 0&0\\ 10\sqrt{3}/3&2\\ 18\sqrt{3}/3&6\\ 10\sqrt{3}/3&10\\ 0&8\\ -8\sqrt{3}/3&4\\ 0&0\\ \end{array}\right|=\frac12|60+180+80-36-60-(-64)|\sqrt{3}/3=48\sqrt{3}.\]
Hence the answer is $\boxed{51}$

Solution:
This is similar to solution 2 but faster and easier.
First off we see that the y coordinate of F must be 4, the y coordinate of E must be 8, the y coordinate of D must be 10, and the y coordinate of C must be 6 (from the parallel sides of the hexagon).
We then use the sine sum angle formula to find the x coordinate of B (lets call it $x$ ): $2\cdot\cos(120)+x\sin(120)=\frac{x\sqrt3}{2}-1=4\rightarrow x=\frac{10\sqrt3}{3}$ .
Now that we know $x$ we can find the x coordinate of F in multiple ways, including using the cosine sum angle formula or using the fact that triangle AFE is isosceles and AE is on the y axis.  Either way, we find that the x coordinate of F is $-\frac{8\sqrt3}{3}$ .
Now, divide ABCDEF into two congruent triangles and a parallelogram:  AFE, BCD, and ABDE.  The areas of AFE and BCD are each $\frac12\cdot\frac{8\sqrt3}{3}\cdot8=\frac{32\sqrt3}{3}$ .  The area of ABDE is $\frac12\cdot8\cdot\frac{10\sqrt3}{3}=\frac{80\sqrt3}3$ .
The total area of the hexagon is $2\cdot\frac{32\sqrt3}3+\frac{80\sqrt3}3=\frac{144\sqrt3}{3}=48\sqrt3\rightarrow48+3=\boxed{051}$

Solution:
First, we see that the y-coordinates of F, E, D, and C must be 4, 8, and 10, and 6, respectively, as in the previous solutions. We can draw a rectangle around the hexagon ABCDEF and use negative space to find the area of the hexagon. If we call the distance from the foot of the perpendiculars of B and F to A $x$ and $z$ , respectively, and the distance from the bottom left vertex of the rectangle to the foot of the perpendicular from B $y$ . This tells us that the area of the entire rectangle is $10(x+y+z)$ , since the opposite sides are parallel and thus the length of the rectangle is $4+4+2=10$ . Then,
if we find the area of the extra triangles and subtract, we find that the area of hexagon ABCDEF as $6x+8z+2y$ . However, noticing that $x=y$ , the area of ABCDEF can also be expressed as $8(x+z)$ . Now we just need to find $x+z$ . Since $AB=AF$ and $\angle BAF = 120$ degrees, $BF=AB\sqrt{3}$ . However, we can find AB by using the Pythagorean Theorem on either of the right triangles formed by dropping perpendiculars from B and F to the x-axis (let's call them ABX and AFY).
From triangle ABX we have that $AB=\sqrt{4+x^2}$ , so $BF=\sqrt{3x^2+12}$ . Since AB=AF, we can also form the equation $4+x^2=16+z^2$ .
We can also find BF by dropping a perpendicular from B to line FY and using the Pythagorean Theorem on the right triangle formed. This gives us $BF=\sqrt{4+(x+z)^2}$ . Setting our two values of BF equal and substituting $x^2$ as $12+z^2$ and simplifying, we get the equation $3z^4-16z^2-1024=0$ . Now we can use the quadratic formula to get that $z^2=\frac{64}{3}$ or $-18$ , so $z^2=\frac{64}{3}$ . Plugging this value back into the equation $x^2=12+z^2$ , we get that $x^2=\frac{100}{3}$ . Now we get that $x+z$ is $6\sqrt{3}$ , so the area of the hexagon is $8 \cdot 6\sqrt{3}=48\sqrt{3}$ , so the answer is $48+3=\boxed{051}$


Answer: 399.0

Let $A = \{1, 2, 3, 4, 5, 6, 7\}$ , and let $N$ be the number of functions $f$ from set $A$ to set $A$ such that $f(f(x))$ is a constant function. Find the remainder when $N$ is divided by $1000$

Solution:
Any such function can be constructed by distributing the elements of $A$ on three tiers.
The bottom tier contains the constant value, $c=f(f(x))$ for any $x$ . (Obviously $f(c)=c$ .)
The middle tier contains $k$ elements $x\ne c$ such that $f(x)=c$ , where $1\le k\le 6$
The top tier contains $6-k$ elements such that $f(x)$ equals an element on the middle tier.
There are $7$ choices for $c$ . Then for a given $k$ , there are $\tbinom6k$ ways to choose the elements on the middle tier, and then $k^{6-k}$ ways to draw arrows down from elements on the top tier to elements on the middle tier.
Thus $N=7\cdot\sum_{k=1}^6\tbinom6k\cdot k^{6-k}=7399$ , giving the answer $\boxed{399}$

Solution:
Define the three layers as domain $x$ codomain $f(x)$ , and codomain $f(f(x))$ . Each one of them is contained in the set $A$ . We know that $f(f(x))$ is a constant function , or in other words, can only take on one value. So, we can start off by choosing that value $c$ in $7$ ways. So now, we choose the values that can be $f(x)$ for all those values should satisfy $f(f(x))=c$ . Let's $S$ be that set of values. First things first, we must have $c$ to be part of $S$ , for the $S$ is part of the domain of $x$ . Since the values in $i\in S$ all satisfy $f(i) = c$ , we have $c$ to be a value that $f(x)$ can be. Now, for the elements other than $5$
If we have $k$ elements other than $5$ that can be part of $S$ , we will have $\binom{6}{k}$ ways to choose those values. There will also be $k$ ways for each of the elements in $A$ other than $c$ and those in set $S$ (for when function $f$ is applied on those values, we already know it would be $c$ ). There are $6-k$ elements in $A$ other than $c$ and those in set $S$ . Thus, there should be $6^{6-k}$ ways to match the domain $x$ to the values of $f(x)$ . Summing up all possible values of $k$ $[1,6]$ ), we have
\[\sum_{k=1}^6 k^{6-k} = 6\cdot 1 + 15\cdot 16 + 20\cdot 27 + 15\cdot 16 + 6\cdot 5 + 1) = 1057\]
Multiplying that by the original $7$ for the choice of $c$ , we have $7 \cdot 1057 = 7\boxed{399}.$


Answer: 480.0

Let $A$ $B$ $C$ , and $D$ be point on the hyperbola $\frac{x^2}{20}- \frac{y^2}{24} = 1$ such that $ABCD$ is a rhombus whose diagonals intersect at the origin. Find the greatest real number that is less than $BD^2$ for all such rhombi.

Solution:
A quadrilateral is a rhombus if and only if its two diagonals bisect each other and are perpendicular to each other. The first condition is automatically satisfied because of the hyperbola's symmetry about the origin. To satisfy the second condition, we set $BD$ as the line $y = mx$ and $AC$ as $y = -\frac{1}{m}x.$ Because the hyperbola has asymptotes of slopes $\pm \frac{\sqrt6}{\sqrt5},$ we have $m, -\frac{1}{m} \in \left(-\frac{\sqrt6}{\sqrt5}, \frac{\sqrt6}{\sqrt5}\right).$ This gives us $m^2 \in \left(\frac{5}{6}, \frac{6}{5}\right).$
Plugging $y = mx$ into the equation for the hyperbola yields $x^2 = \frac{120}{6-5m^2}$ and $y^2 = \frac{120m^2}{6-5m^2}.$ By symmetry of the hyperbola, we know that $\left(\frac{BD}{2}\right)^2 = x^2 + y^2,$ so we wish to find a lower bound for $x^2 + y^2 = 120\left(\frac{1+m^2}{6-5m^2}\right).$ This is equivalent to minimizing $\frac{1+m^2}{6-5m^2} = -\frac{1}{5} + \frac{11}{5(6-5m^2)}$ . It's then easy to see that this expression increases with $m^2,$ so we plug in $m^2 = \frac{5}{6}$ to get $x^2+y^2 > 120,$ giving $BD^2 > \boxed{480}.$

Solution: Assume $AC$ is the asymptope of the hyperbola, $BD$ in that case is the smallest. The expression of $BD$ is $y=-\sqrt{\frac{5}{6}}x$ . Thus, we could get $\frac{x^2}{20}-\frac{y^2}{24}=1\implies x^2=\frac{720}{11}$ . The desired value is $4\cdot \frac{11}{6}x^2=480$ . This case wouldn't achieve, so all $BD^2$ would be greater than $\boxed{480}$

Solution:
$\textbf{warning: this solution is wrong}$
The pythagorean theorem in the last step is missing a factor of 2 - this was a lucky "solve".
A square is a rhombus. Take B to have coordinates $(x,x)$ and D to have coordinates $(-x,-x)$ . This means that $x$ satisfies the equations $\frac{x^2}{20}-\frac{x^2}{24}=1 \rightarrow x^2=120$ . This means that the distance from $B$ to $D$ is $\sqrt{2x^2+2x^2}\rightarrow 2x = \sqrt{480}$ . So $BD^2 = \boxed{480}$ . We use a square because it minimizes the length of the long diagonal (also because it's really easy).
~amcrunner

Solution: The only "numbers" provided in this problem are $24$ and $20$ , so the answer must be a combination of some operations on these numbers. If you're lucky, you could figure the most likely option is $24\cdot 20$ , as this yields $\boxed{480}$ and seems like a plausible answer for this question.


Answer: 182.0

Let $A$ $B$ $C$ and $D$ be the vertices of a regular tetrahedron, each of whose edges measures $1$ meter. A bug, starting from vertex $A$ , observes the following rule: at each vertex it chooses one of the three edges meeting at that vertex, each edge being equally likely to be chosen, and crawls along that edge to the vertex at its opposite end. Let $p = \frac{n}{729}$ be the probability that the bug is at vertex $A$ when it has crawled exactly $7$ meters. Find the value of $n$

Solution: We evaluate $P(7)$ recursively: \begin{alignat*}{6} P(0)&=1, \\ P(1)&=\frac13(1-P(0))&&=0, \\ P(2)&=\frac13(1-P(1))&&=\frac13, \\ P(3)&=\frac13(1-P(2))&&=\frac29, \\ P(4)&=\frac13(1-P(3))&&=\frac{7}{27}, \\ P(5)&=\frac13(1-P(4))&&=\frac{20}{81}, \\ P(6)&=\frac13(1-P(5))&&=\frac{61}{243},\\ P(7)&=\frac13(1-P(6))&&=\frac{182}{729}. \end{alignat*} Therefore, the answer is $n=\boxed{182}.$

Solution:
Let $P(k)=Q(k)+c$ for some function $Q(k)$ and constant $c.$ For all $k\geq1,$ the recursive formula for $P(k)$ becomes \[Q(k)+c=\frac13(1-(Q(k-1)+c))=\frac13-\frac13Q(k-1)-\frac13c.\] Solving for $Q(k),$ we get \[Q(k)=\frac13-\frac13Q(k-1)-\frac43c.\] For simplicity purposes, we set $c=\frac14,$ which gives \[Q(k)=-\frac13Q(k-1).\] Clearly, $Q(0),Q(1),Q(2),\ldots$ is a geometric sequence with the common ratio $\frac{Q(k)}{Q(k-1)}=-\frac13.$ Substituting $P(0)=1$ and $c=\frac14$ into $P(0)=Q(0)+c$ produces $Q(0)=\frac34,$ the first term of the geometric sequence.
For all nonnegative integers $k,$ the explicit formula for $Q(k)$ is \[Q(k)=\frac34\left(-\frac13\right)^k,\] and the explicit formula for $P(k)$ is \[P(k)=\frac34\left(-\frac13\right)^k+\frac14.\] Finally, the requested probability is $p=P(7)=\frac{182}{729},$ from which $n=\boxed{182}.$

Solution:
Denominator
There are $3^7$ ways for the bug to make $7$ independent crawls without restrictions.
Numerator
Let $V_k$ denote the number of ways for the bug to crawl exactly $k$ meters starting from vertex $V$ and ending at vertex $A,$ where $V\in\{A,B,C,D\}$ and $k$ is a positive integer. We wish to find $A_7.$
Since the bug must crawl to vertex $B,C,$ or $D$ on the first move, we have \begin{align*} A_7&=B_6+C_6+D_6 \\ &=(A_5+C_5+D_5)+(A_5+B_5+D_5)+(A_5+B_5+C_5) \\ &=A_5+2(A_5+B_5+C_5+D_5) \\ &=A_5+2S_5, \end{align*} where $S_k=A_k+B_k+C_k+D_k.$
More generally, we get \[A_{k+2}=A_k+2S_k. \qquad\qquad (\spadesuit)\] For $S_k,$ note that
Clearly, $S_1,S_2,S_3,\ldots$ is a geometric sequence with the first term $S_1=3$ and the common ratio $\frac{S_{k+1}}{S_k}=3.$ Therefore, its explicit formula is \[S_k=3^k. \qquad\qquad (\clubsuit)\] Recall that $A_1=0.$ By $(\spadesuit)$ and $(\clubsuit),$ we rewrite $A_7$ recursively: \begin{align*} A_7 &= A_5+2S_5 \\ &=\left(A_3+2S_3\right)+2S_5 \\ &=\left(\left(A_1+2S_1\right)+2S_3\right)+2S_5 \\ &=2S_1+2S_3+2S_5 \\ &=2(3)+2\left(3^3\right)+2\left(3^5\right). \end{align*} Answer
The requested probability is \[p=\frac{A_7}{3^7}=\frac{2(3)+2\left(3^3\right)+2\left(3^5\right)}{3^7}=\frac{2(1)+2\left(3^2\right)+2\left(3^4\right)}{3^6}=\frac{182}{729},\] from which $n=\boxed{182}.$

Solution:
Define notation $V_k$ as Solution 2 does.
In fact, we can generalize the following relationships for all nonnegative integers $k:$ \begin{align*} A_0&=1, \\ B_0&=0, \\ C_0&=0, \\ D_0&=0, \\ A_{k+1}&=B_k+C_k+D_k, \\ B_{k+1}&=A_k+C_k+D_k, \\ C_{k+1}&=A_k+B_k+D_k, \\ D_{k+1}&=A_k+B_k+C_k. \\ \end{align*} Using these equations, we recursively fill out the table below: \[\begin{array}{c||c|c|c|c|c|c|c|c}    \hspace{7mm}&\hspace{6mm}&\hspace{6mm}&\hspace{6mm}&\hspace{6mm}&\hspace{6mm}&\hspace{6mm}&& \\ [-2.5ex] \boldsymbol{k} & \boldsymbol{0} & \boldsymbol{1} & \boldsymbol{2} & \boldsymbol{3} & \boldsymbol{4} & \boldsymbol{5} & \boldsymbol{6} & \boldsymbol{7} \\  \hline \hline &&&&&&&& \\ [-2.25ex] \boldsymbol{A_k} &1&0&3&6&21&60&183&546 \\ \hline   &&&&&&&& \\ [-2.25ex] \boldsymbol{B_k} &0&1&2&7&20&61&182&547 \\ \hline  &&&&&&&& \\ [-2.25ex] \boldsymbol{C_k} &0&1&2&7&20&61&182&547 \\ \hline    &&&&&&&& \\ [-2.25ex] \boldsymbol{D_k} &0&1&2&7&20&61&182&547 \\ \end{array}\] Note that the paths from $V$ to $A$ and the paths from $A$ to $V$ have one-to-one correspondence. So, we must get \[A_k+B_k+C_k+D_k=3^k\] for all values of $k.$
The requested probability is \[p=\frac{A_7}{3^7}=\frac{546}{2187}=\frac{182}{729},\] from which $n=\boxed{182}.$

Solution:
Let $a_n$ denotes the number of ways that the bug arrives at $A$ after crawling $n$ meters, then we have $a_1=0$
Notice that there is respectively $1$ way to arrive at $A$ for each of the different routes after the previous $n-1$ crawls, excluding the possibility that the bug ends up at $A$ after the $(n-1)$ th crawl (as it will be forced to move somewhere else.). Thus, we get the recurrence relation \[a_n=3^{n-1}-a_{n-1}.\] Quick calculations yield \begin{align*} a_7&=3^6-a_6\\ &=3^6-\left(3^5-3^4+3^3-3^2+3-a_1\right)\\ &=546. \end{align*} Thus, $p=\frac{546}{3^7}=\frac{182}{729}\Longrightarrow n=\boxed{182}$

Solution:
Let $A(n)$ be the probability the bug lands on vertex $A$ after crawling $n$ meters, $B(n)$ be the probability the bug lands on vertex $B$ after crawling $n$ meters, and etc.
Note that $A(1)=0$ and $B(1)=C(1)=D(1)=\frac13.$ For $n\geq2,$ the probability that the bug land on each vertex after $n$ meters is $\frac13$ the sum of the probability the bug land on other vertices after crawling $n-1$ meters. So, we have \begin{align*} A(n) &= \frac13 \cdot [B(n-1) + C(n-1) + D(n-1)], \\ B(n) &= \frac13 \cdot [A(n-1) + C(n-1) + D(n-1)], \\ C(n) &= \frac13 \cdot [A(n-1) + B(n-1) + D(n-1)], \\ D(n) &= \frac13 \cdot [A(n-1) + B(n-1) + C(n-1)]. \end{align*} It follows that $A(n) = B(n-1) = C(n-1) = D(n-1).$
We construct the following table: \[\begin{array}{c|cccc}  &  &  &  & \\ [-2ex] n & A(n) & B(n) & C(n) & D(n) \\ [1ex] \hline  &  &  &  & \\ [-1ex] 1 & 0 & \frac13 & \frac13 & \frac13 \\  &  &  &  & \\ 2 & \frac13 & \frac29 & \frac29 & \frac29 \\  &  &  &  & \\ 3 & \frac29 & \frac{7}{27} & \frac{7}{27} & \frac{7}{27} \\  &  &  &  & \\ 4 & \frac{7}{27} & \frac{20}{81} & \frac{20}{81} & \frac{20}{81}\\  &  &  &  & \\ 5 & \frac{20}{81} & \frac{61}{243} & \frac{61}{243} & \frac{61}{243} \\  &  &  &  & \\ 6 & \frac{61}{243} & \frac{182}{729} & \frac{182}{729} & \frac{182}{729} \\  &  &  &  & \\ 7 & \frac{182}{729} & \frac{547}{2187} & \frac{547}{2187} & \frac{547}{2187} \\ [1ex] \end{array}\] Therefore, the answer is $n = \boxed{182}.$

Solution: Let $\omega = e^{i\pi / 2}$ . We have that if $G(x) = (x+x^2+x^3)^7$ , then \[\frac{G(1) + G(\omega) + G(\omega^2) + G(\omega^3)}{4} = \frac{2187-1-1-1}{4} = 546.\] From here, the desired probability is $\frac{546}{2187} = \frac{182}{729}$ . Therefore, the answer is $n=\boxed{182}$

Solution: We can factor $(x+x^2+x^3)^7$ as $x^7(1+x+x^2)^7.$ The $x^{4n}$ coefficients of $(x+x^2+x^3)^7$ will be the same as the $x^{4n+1}$ coefficients of $(1+x+x^2)^7.$ The possible values for $4n+1$ would then be $1,$ $5,$ $9,$ and $13.$ Because $1+13=5+9=14,$ the coefficients of $x^1$ and $x^{13}$ are equal and so are the coefficients of $x^5$ and $x^9.$ To make an $x$ term, we need $6$ $1$ " terms and one " $x$ " term multiplied together. There are $7$ ways to arrange these numbers. The coefficient of the $x^5$ term will be the sum of the number of the possible arrangements for these numbers: \begin{align*} 0000122&=105\text{ arrangements}, \\ 0001112&=140\text{ arrangements}, \\ 0011111&=21\text{ arrangements}. \end{align*} Thus, the coefficient of the $x^5$ term is $105+140+21=266.$ From here, the desired probability is $\frac{2(7+266)}{2187}=\frac{546}{2187}=\frac{182}{729}.$ Thus, our answer is $\boxed{182}.$

Solution:
We can find the number of different times the bug reaches vertex $A$ before the $7$ th move, and use these smaller cycles to calculate the number of different ways the bug can end up back at $A.$
Define $f(x)$ to be the number of paths of length $x$ which start and end at $A$ but do not pass through $A$ otherwise. Obviously $f(1) = 0.$ In general for $f(x),$ the bug has three initial edges to pick from. From there, since the bug cannot return to $A$ by definition, the bug has exactly two choices. This continues from the $2$ nd move up to the $(x-1)$ th move. The last move must be a return to $A,$ so this move is determined. So $f(x) = 2^{x-2}3.$
Now we need to find the number of cycles by which the bug can reach $A$ at the end. Since $f(1) = 0,$ we know that $f(6)$ cannot be used, as on the $7$ th move the bug cannot move from $A$ to $A.$ So we need to find the number of partitions of $7$ using only $2,3,4,5,$ and $7.$ These are $f(2)f(2)f(3),f(2)f(5),f(3)f(4),$ and $f(7).$ We can calculate these and sum them up using our formula. Also, order matters, so we need to find the number of ways to arrange each partition: \[{3\choose1}f(2)f(2)f(3) + {2\choose1}f(2)f(5) + {2\choose1}f(3)f(4) + f(7) = 3(3)(3)(2\cdot3) + 2(3)(2^33) + 2(2\cdot3)(2^23) + (2^53) = 546.\] Finally, this is a probability question, so we divide by $3^7,$ or $\frac{546}{3^7} = \frac{182}{3^6}.$ The answer is $n=\boxed{182}.$

Solution:
Note that this problem is basically equivalent to the following:
How many distinct sequences of $8$ integers $a_1, a_2, a_3, \ldots, a_8$ are there such that $a_1 = a_8 = 1,$ $a_i \in \{1, 2, 3, 4\}$ for all $2 \leq i\leq 8,$ and $a_i \neq a_{i+1}$ for all $1 \leq i \leq 7$
Now consider the $8$ integers modulo $4.$ Let $b_1, b_2, b_3, \ldots, b_7$ be a new sequence of integers such that $b_i = a_{i+1} - a_i \mod 4$ for all $1 \leq i \leq 7.$
Note that the condition is equivalent to that $b_i \in \{1, 2, 3\}$ for all $1 \leq i \leq 7,$ and since $a_1 \mod 4 = a_8 \mod 4,$ $b_1 + b_2 + \cdots + b_7$ must be a multiple of $4.$
Thus, our desired number of paths is equivalent to the number of ordered septuples of positive integers $(b_1, b_2, \ldots, b_7)$ such that $b_i \in \{1, 2, 3\}$ for all $1 \leq i \leq 7$ and $b_1 + b_2 + \cdots + b_7$ is congruent to $0 \mod 4.$
We will now proceed with casework on the number of $2$ s in the septuple.
One $2$ : There are $\dbinom{7}{1} = 7$ ways to arrange the $2$ , and $\dbinom{6}{0} + \dbinom{6}{2} + \dbinom{6}{4} + \dbinom{6}{6} = 2^5$ valid ways (the proof of this combinatorial identity is left as an exercise to the reader) to arrange the $1$ s and $3$ s.
Three $2$ s: There are $\dbinom{7}{3} = 35$ ways to arrange the $2$ s, and $\dbinom{4}{1} + \dbinom{4}{3} = 2^3$ valid ways to arrange the $1$ s and $3$ s.
Five $2$ s: There are $\dbinom{7}{5} = 21$ ways to arrange the $2$ s, and $\dbinom{2}{0} + \dbinom{2}{2} = 2$ valid ways to arrange the $1$ s and $3$ s.
Adding up our cases, we obtain $7 \cdot 32 + 35 \cdot 8 + 21 \cdot 2 = 546$ valid sequences.
Dividing by the total number of paths without restrictions, $3^7 = 2187,$ our desired probability is $\frac{546}{2187} = \frac{182}{729},$ giving an answer of $\boxed{182}.$

Solution: We instead find the probability that the bug is NOT at vertex $A$ after crawling $n$ meters (equivalent to moving $n$ times). Call $A_n$ the probability that the bug IS at vertex $A$ after $n$ moves; call $O_n$ the probability that the bug is on some other vertex. We have the following recurrence relations. \[A_n = \frac{1}{3}O_{n-1}\] \[O_n = A_{n-1} + \frac{2}{3}O_{n-1}\] However, we can calculate $A_{n-1}$ in terms of $O_n$ ; take $n = k-1$ , and we have \[A_{k-1} = \frac{1}{3}O_{k-2}\] . Substituting this into our equation for $O$ , we have that \[O_n = \frac{1}{3}O_{n-2} + \frac{2}{3}O_{n-1}\] . We also have the conditions that $O_0 = 0$ (the bug will not be at vertex other than $A$ on the "0th" move) and $O_1 = 1$ (the bug will be at a vertex other than $A$ after the $1st$ move). Iteratively calculating $O_7$ , we find that it is equal to $\frac{547}{729}$ (I will not do this calculation here; you can do it manually if you wish to check). However, this is the probability that the ant is NOT at vertex $A$ after $7$ moves; then its complement, $\frac{182}{729}$ is the probability that the ant IS at vertex $A$ after $7$ moves, so our answer is $\boxed{182}$


Answer: 69.0

Let $A$ $M$ , and $C$ be nonnegative integers such that $A+M+C=10$ .  What is the maximum value of $A\cdot M\cdot C+A\cdot M+M\cdot C+C\cdot A$
$\textbf{(A)}\ 49 \qquad\textbf{(B)}\ 59 \qquad\textbf{(C)}\ 69 \qquad\textbf{(D)}\ 79 \qquad\textbf{(E)}\ 89$

Solution:
The trick is to realize that the sum $AMC+AM+MC+CA$ is similar to the product $(A+1)(M+1)(C+1)$ . If we multiply $(A+1)(M+1)(C+1)$ , we get \[(A+1)(M+1)(C+1) = AMC + AM + AC + MC + A + M + C + 1.\] We know that $A+M+C=10$ , therefore $(A+1)(M+1)(C+1) = (AMC + AM + MC + CA) + 11$ and \[AMC + AM + MC + CA = (A+1)(M+1)(C+1) - 11.\] Now consider the maximal value of this expression. Suppose that some two of $A$ $M$ , and $C$ differ by at least $2$ .  Then this triple $(A,M,C)$ is not optimal. (To see this, WLOG let $A\geq C+2.$ We can then increase the value of $(A+1)(M+1)(C+1)$ by changing $A \to A-1$ and $C \to C+1$ .)
Therefore the maximum is achieved when $(A,M,C)$ is a rotation of $(3,3,4)$ . The value of $(A+1)(M+1)(C+1)$ in this case is $4\cdot 4\cdot 5=80,$ and thus the maximum of $AMC + AM + MC + CA$ is $80-11 = \boxed{69}.$

Solution: Notice that if we want to maximize $AMC + AM + MC + AC$ , we want A, M, and C to be as close as possible. For example, if $A = 7, B = 2,$ and $C=1,$ then the expression would have a much smaller value than if we were to substitute $A = 4, B = 5$ , and $C = 1$ . So to make A, B, and C as close together as possible, we divide $\frac{10}{3}$ to get $3$ . Therefore, A must be 3, M must be 3, and C must be 4. $AMC + AM + MC + AC = 36 + 12 + 12 + 9 = 69$ . So the answer is $\boxed{69.}$

Solution: According to our knowledge in AM-GM, the closer numbers are, the value of their product is bigger. Assume that $A=B<C$ , we can get the set $A=3,B=3,C=4$ which the answer is $\boxed{69.}$ ~bluesoul


Answer: 672.0

Let $A$ and $B$ be the endpoints of a semicircular arc of radius $2$ . The arc is divided into seven congruent arcs by six equally spaced points $C_1$ $C_2$ $\dots$ $C_6$ . All chords of the form $\overline {AC_i}$ or $\overline {BC_i}$ are drawn. Let $n$ be the product of the lengths of these twelve chords. Find the remainder when $n$ is divided by $1000$

Solution:
Let the radius be 1 instead. All lengths will be halved so we will multiply by $2^{12}$ at the end. Place the semicircle on the complex plane, with the center of the circle being 0 and the diameter being the real axis. Then $C_1,\ldots, C_6$ are 6 of the 14th roots of unity. Let $\omega=\text{cis}\frac{360^{\circ}}{14}$ ; then $C_1,\ldots, C_6$ correspond to $\omega,\ldots, \omega^6$ . Let $C_1',\ldots, C_6'$ be their reflections across the diameter. These points correspond to $\omega^8\ldots, \omega^{13}$ . Then the lengths of the segments are $|1-\omega|,\ldots, |1-\omega^6|,|1-\omega^8|,\ldots |1-\omega^{13}|$ . Noting that $B$ represents 1 in the complex plane, the desired product is \begin{align*} BC_1\cdots BC_6 \cdot AC_1\cdots AC_6&= BC_1\cdots BC_6 \cdot BC_1'\cdots BC_6'\\ &= |(x-\omega^1)\ldots(x-\omega^6)(x-\omega^8)\ldots(x-\omega^{13})| \end{align*}
for $x=1$ .
However, the polynomial $(x-\omega^1)\ldots(x-\omega^6)(x-\omega^8)\ldots(x-\omega^{13})$ has as its zeros all 14th roots of unity except for $-1$ and $1$ . Hence \[(x-\omega^1)\ldots(x-\omega^6)(x-\omega^8)\ldots(x-\omega^{13})=\frac{x^{14}-1}{(x-1)(x+1)}=x^{12}+x^{10}+\cdots +x^2+1.\] Thus the product is $|x^{12}+\cdots +x^2+1|=7$ when the radius is 1, and the product is $2^{12}\cdot 7=28672$ . Thus the answer is $\boxed{672}$

Solution:
Let $O$ be the midpoint of $A$ and $B$ . Assume $C_1$ is closer to $A$ instead of $B$ $\angle AOC_1$ $\frac {\pi}{7}$ . Using the Law of Cosines
$\overline {AC_1}^2$ $8 - 8 \cos \frac {\pi}{7}$ $\overline {AC_2}^2$ $8 - 8 \cos \frac {2\pi}{7}$ ,
.
.
. $\overline {AC_6}^2$ $8 - 8 \cos \frac {6\pi}{7}$
So $n$ $(8^6)(1 - \cos \frac {\pi}{7})(1 - \cos \frac {2\pi}{7})\dots(1 - \cos \frac{6\pi}{7})$ . It can be rearranged to form
$n$ $(8^6)(1 - \cos \frac {\pi}{7})(1 - \cos \frac {6\pi}{7})\dots(1 - \cos \frac {3\pi}{7})(1 - \cos \frac {4\pi}{7})$
Since $\cos a = - \cos (\pi - a)$ , we have
$n$ $(8^6)(1 - \cos \frac {\pi}{7})(1 + \cos \frac {\pi}{7}) \dots (1 - \cos \frac {3\pi}{7})(1 + \cos \frac {3\pi}{7})$
$(8^6)(1 - \cos^2 \frac {\pi}{7})(1 - \cos^2 \frac {2\pi}{7})(1 - \cos^2 \frac {3\pi}{7})$
$(8^6)(\sin^2 \frac {\pi}{7})(\sin^2 \frac {2\pi}{7})(\sin^2 \frac {3\pi}{7})$
It can be shown that $\sin \frac {\pi}{7} \sin \frac {2\pi}{7} \sin \frac {3\pi}{7}$ $\frac {\sqrt {7}}{8}$ , so $n$ $8^6(\frac {\sqrt {7}}{8})^2$ $7(8^4)$ $28672$ , so the answer is $\boxed{672}$


Answer: 167.0

Let $A$ be an acute angle such that $\tan A = 2 \cos A.$ Find the number of positive integers $n$ less than or equal to $1000$ such that $\sec^n A + \tan^n A$ is a positive integer whose units digit is $9.$

Solution:
Denote $a_n = \sec^n A + \tan^n A$ .
For any $k$ , we have \begin{align*} a_n & = \sec^n A + \tan^n A \\ & = \left( \sec^{n-k} A + \tan^{n-k} A \right) \left( \sec^k A + \tan^k A \right) - \sec^{n-k} A \tan^k A - \tan^{n-k} A \sec^k A \\ & = a_{n-k} a_k - 2^k \sec^{n-k} A \cos^k A - 2^k \tan^{n-k} A \cot^k A \\ & = a_{n-k} a_k - 2^k a_{n-2k} . \end{align*}
Next, we compute the first several terms of $a_n$
By solving equation $\tan A = 2 \cos A$ , we get $\cos A = \frac{\sqrt{2 \sqrt{17} - 2}}{4}$ .
Thus, $a_0 = 2$ $a_1 = \sqrt{\sqrt{17} + 4}$ $a_2 = \sqrt{17}$ $a_3 = \sqrt{\sqrt{17} + 4} \left( \sqrt{17} - 2 \right)$ $a_4 = 9$
In the rest of analysis, we set $k = 4$ .
Thus, \begin{align*} a_n & = a_{n-4} a_4 - 2^4 a_{n-8}  \\ & = 9 a_{n-4} - 16 a_{n-8} . \end{align*}
Thus, to get $a_n$ an integer, we have $4 | n$ .
In the rest of analysis, we only consider such $n$ . Denote $n = 4 m$ and $b_m = a_{4n}$ .
Thus, \begin{align*} b_m & = 9 b_{m-1} - 16 b_{m-2} \end{align*} with initial conditions $b_0 = 2$ $b_1 = 9$
To get the units digit of $b_m$ to be 9, we have \begin{align*} b_m \equiv -1 & \pmod{2} \\ b_m \equiv -1 & \pmod{5} \end{align*}
Modulo 2, for $m \geq 2$ , we have \begin{align*} b_m & \equiv 9 b_{m-1} - 16 b_{m-2} \\ & \equiv b_{m-1} . \end{align*}
Because $b_1 \equiv -1 \pmod{2}$ , we always have $b_m \equiv -1 \pmod{2}$ for all $m \geq 2$
Modulo 5, for $m \geq 5$ , we have \begin{align*} b_m & \equiv 9 b_{m-1} - 16 b_{m-2} \\ & \equiv - b_{m-1} - b_{m-2} . \end{align*}
We have $b_0 \equiv 2 \pmod{5}$ $b_1 \equiv -1 \pmod{5}$ $b_2 \equiv -1 \pmod{5}$ $b_3 \equiv 2 \pmod{5}$ $b_4 \equiv -1 \pmod{5}$ $b_5 \equiv -1 \pmod{5}$ $b_6 \equiv 2 \pmod{5}$ .
Therefore, the congruent values modulo 5 is cyclic with period 3.
To get $b_m \equiv -1 \pmod{5}$ , we have $3 \nmid m \pmod{3}$
From the above analysis with modulus 2 and modulus 5, we require $3 \nmid m \pmod{3}$
For $n \leq 1000$ , because $n = 4m$ , we only need to count feasible $m$ with $m \leq 250$ .
The number of feasible $m$ is \begin{align*} 250 - \left\lfloor \frac{250}{3} \right\rfloor & = 250 - 83 \\ & = \boxed{167}

Solution:
\[\tan A = 2 \cos A \implies \sin A = 2 \cos^2 A \implies  \sin^2 A + \cos^2 A = 4  \cos^4 A + \cos^2 A = 1\] \[\implies   \cos^2 A = \frac {\sqrt {17} - 1}{8}.\] \[c_n = \sec^n A + \tan^n A = \frac {1}{\cos^n A} + 2^n \cos^n A = (4\cos^2 A +1)^{\frac {n}{2}}+(4 \cos^2 A)^{\frac {n}{2}} =\] \[= \left(\frac {\sqrt {17} + 1}{2}\right)^{\frac {n}{2}}+ \left(\frac {\sqrt {17} - 1}{2}\right)^{\frac {n}{2}}.\]
It is clear, that $c_n$ is not integer if $n \ne 4k, k > 0.$
Denote $x = \frac {\sqrt {17} + 1}{2}, y = \frac {\sqrt {17} - 1}{2} \implies$ \[x \cdot y = 4, x + y = \sqrt{17}, x - y = 1 \implies x^2 + y^2 = (x - y)^2 + 2xy = 9 = c_4.\]
\[c_8 = x^4 + y^4 = (x^2 + y^2)^2 - 2x^2 y^2 = 9^2 - 2 \cdot 16 = 49.\] \[c_{4k+4} = x^{4k+4} + y^{4k+4} = (x^{4k} + y^{4k})(x^2+y^2)- (x^2 y^2)(x^{4k-2}+y^{4k-2}) = 9 c_{4k}- 16 c_{4k – 4} \implies\] \[c_{12} = 9 c_8 - 16 c_4 = 9 \cdot 49 - 16 \cdot 9 = 9 \cdot 33 = 297.\] \[c_{16} = 9 c_{12} - 16 c_8 = 9 \cdot 297 - 16 \cdot 49 = 1889.\] \[c_{12m + 4} \pmod{10} = 9 \cdot c_{12m} \pmod{10} - 16 \pmod{10} \cdot c_{12m - 4}  \pmod{10} =\] \[= (9 \cdot 7 - 6 \cdot 9)  \pmod{10} = (3 - 4)  \pmod{10} = 9.\] \[c_{12m + 8}\pmod{10} = 9 \cdot c_{12m+4} \pmod{10} - 16 \pmod{10} \cdot c_{12m } \pmod{10} =\] \[= (9 \cdot 9 - 6 \cdot 7) \pmod{10} = (1 - 2)\pmod{10} = 9.\] \[c_{12m + 12} \pmod{10} = 9 \cdot c_{12m + 8} \pmod{10} - 16 \pmod{10} \cdot c_{12m + 4} \pmod{10} =\] \[= (9 \cdot 9 - 6 \cdot 9) \pmod{10} = (1 - 4) \pmod{10} = 7 \implies\]
The condition is satisfied iff $n = 12 k + 4$ or $n = 12k + 8.$
If $n \le N$ then the number of possible n is $\left\lfloor \frac{N}{4} \right\rfloor - \left\lfloor \frac{N}{12} \right\rfloor.$
For $N = 1000$ we get $\left\lfloor \frac{1000}{4} \right\rfloor - \left\lfloor \frac{1000}{12} \right\rfloor = 250 - 83 = \boxed{167}.$


Answer: 19.0

Let $A$ be the set of positive integers that have no prime factors other than $2$ $3$ , or $5$ . The infinite sum \[\frac{1}{1} + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \frac{1}{5} + \frac{1}{6} + \frac{1}{8} + \frac{1}{9} + \frac{1}{10} + \frac{1}{12} + \frac{1}{15} + \frac{1}{16} + \frac{1}{18} + \frac{1}{20} + \cdots\] of the reciprocals of the elements of $A$ can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. What is $m+n$
$\textbf{(A) } 16 \qquad \textbf{(B) } 17 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 23 \qquad \textbf{(E) } 36$

Solution:
Note that the fractions of the form $\frac{1}{2^a3^b5^c},$ where $a,b,$ and $c$ are nonnegative integers, span all terms of the infinite sum.
Therefore, the infinite sum becomes \begin{align*} \sum_{a=0}^{\infty}\sum_{b=0}^{\infty}\sum_{c=0}^{\infty}\frac{1}{2^a3^b5^c} &= \left(\sum_{a=0}^{\infty}\frac{1}{2^a}\right)\cdot\left(\sum_{b=0}^{\infty}\frac{1}{3^b}\right)\cdot\left(\sum_{c=0}^{\infty}\frac{1}{5^c}\right) \\ &= \frac{1}{1-\frac12}\cdot\frac{1}{1-\frac13}\cdot\frac{1}{1-\frac15} \\ &= 2\cdot\frac32\cdot\frac54 \\ &= \frac{15}{4} \end{align*} by a product of geometric series, from which the answer is $15+4=\boxed{19}.$

Solution:
This solution is the same as Solution 1 but potentially clearer.
Clearly this is just summing over the reciprocals of the numbers of the form $2^i3^j5^k$ , where $i,j,k\in [0,\infty)$ . SO our desired sum is $\sum_{k=0}^{\infty}\sum_{j=0}^{\infty}\sum_{i=0}^{\infty}\frac{1}{2^i3^j5^k}$ . By the infinite geometric series formula, $\sum_{i=0}^{\infty}\frac{1}{2^i3^j5^k}$ is just $\frac{\frac{1}{3^j5^k}}{1-\frac{1}{2}}=\frac{2}{3^j5^k}$ . Applying the infinite geometric series formula again gives that $\sum_{j=0}^{\infty}\frac{2}{3^j5^k}=\frac{\frac{2}{5^k}}{1-\frac{1}{3}}=\frac{3}{5^k}$ . Applying the infinite geometric series formula again yields $\sum_{k=0}^{\infty}\frac{3}{5^k}=\frac{3}{1-\frac{1}{5}}=\frac{15}{4}$ . Hence our final answer is $15+4=\boxed{19}$

Solution:
Separate into $7$ separate infinite series's so we can calculate each and find the original sum:
The first infinite sequence shall be all the reciprocals of the powers of $2$ , the second shall be reciprocals of the powers of $3$ , and the third will consist of reciprocals of the powers of $5$ . We can easily calculate these to be $1, \frac{1}{2}, \frac{1}{4}$ respectively.
The fourth infinite series shall be all real numbers in the form $\frac{1}{2^a3^b}$ , where $a,b\geq1$
The fifth is all real numbers in the form $\frac{1}{2^a5^b}$ , where $a,b\geq1$
The sixth is all real numbers in the form $\frac{1}{3^a5^b}$ , where $a,b\geq1$
The seventh infinite series is all real numbers in the form $\frac{1}{2^a3^b5^c}$ , where $a,b,c\geq1$
Let us denote the first sequence as $a_{1}$ , the second as $a_{2}$ , etc. We know $a_{1}=1$ $a_{2}=\frac{1}{2}$ $a_{3}=\frac{1}{4}$ , let us find $a_{4}$ . factoring out $\frac{1}{6}$ from the terms in this subsequence, we would get $a_{4}=\frac{1}{6}(1+a_{1}+a_{2}+a_{4})$
Knowing $a_{1}$ and $a_{2}$ , we can substitute and solve for $a_{4}$ , and we get $\frac{1}{2}$ . If we do similar procedures for the fifth and sixth sequences, we can solve for them too, and we get after solving them $\frac{1}{4}$ and $\frac{1}{8}$
Finally, for the seventh sequence, we see $a_{7}=\frac{a_{8}}{30}$ , where $a_{8}$ is the infinite series the problem is asking us to solve for. The sum of all seven subsequences will equal the one we are looking for, and we need to add the $\frac11$ term back: $1+1+\frac{1}{2}+\frac{1}{4}+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\frac{a_{8}}{30}=a_{8}$ . We solve this to get $\frac{29}{8}=\frac{29a_{8}}{30}$ , or $\frac{15}{4}=a_{8}$ . So our answer is $\frac{15}{4}$ , but we are asked to add the numerator and denominator, which sums up to $\boxed{19}$


Answer: 51.0

Let $A(2,2)$ and $B(7,7)$ be points in the plane. Define $R$ as the region in the first quadrant consisting of those points $C$ such that $\triangle ABC$ is an acute triangle. What is the closest integer to the area of the region $R$
$\mathrm{(A)}\ 25     \qquad \mathrm{(B)}\ 39     \qquad \mathrm{(C)}\ 51     \qquad \mathrm{(D)}\ 60      \qquad \mathrm{(E)}\ 80$

Solution: For angle $A$ and $B$ to be acute, $C$ must be between the two lines that are perpendicular to $\overline{AB}$ and contain points $A$ and $B$ . For angle $C$ to be acute, first draw a $45-45-90$ triangle with $\overline{AB}$ as the hypotenuse. Note $C$ cannot be inside this triangle's circumscribed circle or else $\angle C > 90^\circ$ . Hence, the area of $R$ is the area of the large triangle minus the area of the small triangle minus the area of the circle, which is $\frac{14^2}{2}-\frac{4^2}{2}-(\frac{5\sqrt{2}}{2})^2\pi=98-8-\frac{25\pi}{2}$ , which is approximately $51$ . The answer is $\boxed{51}$


Answer: 222.0

Let $A,B,C$ be angles of a triangle with \begin{align*} \cos^2 A + \cos^2 B + 2 \sin A \sin B \cos C &= \frac{15}{8} \text{ and} \\ \cos^2 B + \cos^2 C + 2 \sin B \sin C \cos A &= \frac{14}{9} \end{align*} There are positive integers $p$ $q$ $r$ , and $s$ for which \[\cos^2 C + \cos^2 A + 2 \sin C \sin A \cos B = \frac{p-q\sqrt{r}}{s},\] where $p+q$ and $s$ are relatively prime and $r$ is not divisible by the square of any prime.  Find $p+q+r+s$

Solution:
Let's draw the triangle. Since the problem only deals with angles, we can go ahead and set one of the sides to a convenient value. Let $BC = \sin{A}$
By the Law of Sines, we must have $CA = \sin{B}$ and $AB = \sin{C}$
Now let us analyze the given:
\begin{align*} \cos^2A + \cos^2B + 2\sin A\sin B\cos C &= 1-\sin^2A + 1-\sin^2B + 2\sin A\sin B\cos C \\ &= 2-(\sin^2A + \sin^2B - 2\sin A\sin B\cos C) \end{align*}
Now we can use the Law of Cosines to simplify this:
\[= 2-\sin^2C\]
Therefore: \[\sin C = \sqrt{\dfrac{1}{8}},\cos C = \sqrt{\dfrac{7}{8}}.\] Similarly, \[\sin A = \sqrt{\dfrac{4}{9}},\cos A = \sqrt{\dfrac{5}{9}}.\] Note that the desired value is equivalent to $2-\sin^2B$ , which is $2-\sin^2(A+C)$ . All that remains is to use the sine addition formula and, after a few minor computations, we obtain a result of $\dfrac{111-4\sqrt{35}}{72}$ . Thus, the answer is $111+4+35+72 = \boxed{222}$

Solution:
Let \begin{align*} \cos^2 A + \cos^2 B + 2 \sin A \sin B \cos C &= \frac{15}{8} \text{     ------ (1)}\\ \cos^2 B + \cos^2 C + 2 \sin B \sin C \cos A &= \frac{14}{9} \text{     ------ (2)}\\ \cos^2 C + \cos^2 A + 2 \sin C \sin A \cos B &= x \text{                        ------ (3)}\\ \end{align*}
Adding (1) and (3) we get: \[2 \cos^2 A + \cos^2 B + \cos^2 C + 2 \sin A( \sin B \cos C +  \sin C \cos B)  = \frac{15}{8} + x\] or \[2 \cos^2 A + \cos^2 B + \cos^2 C + 2 \sin A \sin (B+C)  = \frac{15}{8} + x\] or \[2 \cos^2 A + \cos^2 B + \cos^2 C + 2 \sin ^2 A = \frac{15}{8} + x\] or \[\cos^2 B + \cos^2 C =  x - \frac{1}{8}     \text{     ------ (4)}\]
Similarly adding (2) and (3) we get: \[\cos^2 A + \cos^2 B =  x - \frac{4}{9}     \text{     ------ (5)}\] Similarly adding (1) and (2) we get: \[\cos^2 A + \cos^2 C =  \frac{14}{9}  - \frac{1}{8}     \text{     ------ (6)}\]
And (4) - (5) gives: \[\cos^2 C - \cos^2 A =  \frac{4}{9}  - \frac{1}{8}    \text{     ------ (7)}\]
Now (6) - (7) gives: $\cos^2 A  =  \frac{5}{9}$ or $\cos A = \sqrt{\dfrac{5}{9}}$ and $\sin A = \frac{2}{3}$ so $\cos C$ is $\sqrt{\dfrac{7}{8}}$ and therefore $\sin C$ is $\sqrt{\dfrac{1}{8}}$
Now $\sin B = \sin(A+C)$ can be computed first and then $\cos^2 B$ is easily found.
Thus $\cos^2 B$ and $\cos^2 C$ can be plugged into (4) above to give x = $\dfrac{111-4\sqrt{35}}{72}$
Hence the answer is = $111+4+35+72 = \boxed{222}$

Solution:
Let's take the first equation $\cos^2 A + \cos^2 B + 2 \sin A \sin B \cos C = \frac{15}{8}$ . Substituting $180 - A - B$ for C, given A, B, and C form a triangle, and that $\cos C = \cos(A + B)$ , gives us:
$\cos^2 A + \cos^2 B + 2 \sin A \sin B \cos (A+B) = \frac{15}{8}$
Expanding out gives us $\cos^2 A + \cos^2 B + 2 \sin^2 A \sin^2 B - 2 \sin A \sin B \cos A \cos B = \frac{15}{8}$
Using the double angle formula $\cos^2 k = \frac{\cos (2k) + 1}{2}$ , we can substitute for each of the squares $\cos^2 A$ and $\cos^2 B$ . Next we can use the Pythagorean identity on the $\sin^2 A$ and $\sin^2 B$ terms. Lastly we can use the sine double angle to simplify.
$\cos^2 A + \cos^2 B + 2(1 - \cos^2 A)(1 - \cos^2 B) - \frac{1}{2} \cdot \sin 2A \sin 2B = \frac{15}{8}$
Expanding and canceling yields, and again using double angle substitution,
$1 + 2 \cdot \frac{\cos (2A) + 1}{2} \cdot \frac{\cos (2B) + 1}{2} - \frac{1}{2} \cdot \sin 2A \sin 2B = \frac{15}{8}$
Further simplifying yields:
$\frac{3}{2} + \frac{\cos 2A \cos 2B - \sin 2A \sin 2B}{2} = \frac{15}{8}$
Using cosine angle addition formula and simplifying further yields, and applying the same logic to Equation $2$ yields:
$\cos (2A + 2B) = \frac{3}{4}$ and $\cos (2B + 2C) = \frac{1}{9}$
Substituting the identity $\cos (2A + 2B) = \cos(2C)$ , we get:
$\cos (2C) = \frac{3}{4}$ and $\cos (2A) = \frac{1}{9}$
Since the third expression simplifies to the expression $\frac{3}{2} + \frac{\cos (2A + 2C)}{2}$ , taking inverse cosine and using the angles in angle addition formula yields the answer, $\frac{111 - 4\sqrt{35}}{72}$ , giving us the answer $\boxed{222}$

Solution:
We will use the sum to product formula to simply these equations. Recall \[2\sin{\frac{\alpha+\beta}{2}}\sin{\frac{\alpha-\beta}{2}} = \cos{\alpha}+\cos{\beta}.\] Using this, let's rewrite the first equation: \[\cos^2(A) + \cos^2(B) + 2 \sin(A) \sin(B) \cos(C) = \frac{15}{8}\] \[\cos^2(A) + \cos^2(B) + (\cos(A+B)+\cos(A-B))\cos(C).\] Now, note that $\cos(C)=-\cos(A+B)$ \[\cos^2(A) + \cos^2(B) + (\cos(A+B)+\cos(A-B))(-\cos(A+B))\] \[\cos^2(A) + \cos^2(B) - \cos(A+B)\cos(A-B)+cos^2(A+B)=\frac{15}{8}.\] We apply the sum to product formula again. \[\cos^2(A) + \cos^2(B) - \frac{\cos(2A)+\cos(2B)}{2}+cos^2(A+B)=\frac{15}{8}.\] Now, recall that $\cos(2\alpha)=2\cos^2(\alpha)-1$ . We apply this and simplify our expression to get: \[\cos^2(A+B)=\frac{7}{8}\] \[\cos^2(C)=\frac{7}{8}.\] Analogously, \[\cos^2(A)=\frac{5}{9}.\] \[\cos^2(A+C)=\frac{p-q\sqrt{r}}{s}-1.\] We can find this value easily by angle sum formula. After a few calculations, we get $\frac{111 - 4\sqrt{35}}{72}$ , giving us the answer $\boxed{222}$ .
~superagh

Solution: According to LOC $a^2+b^2-2ab\cos{\angle{c}}=c^2$ , we can write it into $\sin^2{\angle{A}}+\sin^2{\angle{B}}-2\sin{\angle{A}}\sin{\angle{B}}\cos{\angle{C}}=\sin^2{\angle{C}}$ $\sin^2{\angle{A}}+\sin^2{\angle{B}}-2\sin{\angle{A}}\sin{\angle{B}}\cos{\angle{C}}+cos^2A+cos^2B+2sinAsinBcosC=\frac{15}{8}+sin^2C$ We can simplify to $2=sin^2C+\frac{15}{8}$ . Similarly, we can generalize $2=sin^2A+\frac{14}{9}$ . After solving, we can get that $sinA=\frac{2}{3}; cosA=\frac{\sqrt{5}}{3}; sinC=\frac{\sqrt{2}}{4}; cosC=\frac{\sqrt{14}}{4}$ Assume the value we are looking for is $x$ , we get $sin^2B+x=2$ , while $sinB=sin(180^{\circ}-A-C)=sin(A+C)$ which is $\frac{2\sqrt{14}+\sqrt{10}}{12}$ , so $x=\frac{111 - 4\sqrt{35}}{72}$ , giving us the answer $\boxed{222}$ .~bluesoul


Answer: 453.0

Let $A=\{1,2,3,4\}$ , and $f$ and $g$ be randomly chosen (not necessarily distinct) functions from $A$ to $A$ . The probability that the range of $f$ and the range of $g$ are disjoint is $\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$

Solution:
The natural way to go is casework. And the natural process is to sort $f$ and $g$ based on range size! Via Pigeonhole Principle, we see that the only real possibilities are: $f 1 g 1; f 1 g 2; f 1 g 3; f 2 g 2$ . Note that the $1, 2$ and $1, 3$ cases are symmetrical and we need just a $*2$ . Note also that the total number of cases is $4^4*4^4=4^8$
$f 1 g 1$ : clearly, we choose one number as the range for $f$ , one for $g$ , yielding $12$ possibilities.
$f 1 g 2$ with symmetry (WLOG $f$ has 1 element): start by selecting numbers for the ranges. This yields $4$ for the one number in $f$ , and $3$ options for the two numbers for $g$ . Afterwards, note that the function with 2 numbers in the range can have $4+6+4=14$ arrangements of these two numbers (1 of one, 3 of the other *2 and 2 of each). Therefore, we have $2*12*14$ possibilities, the 2 from symmetry.
$f 2 g 2$ : no symmetry, still easy! Just note that we have $6$ choices of which numbers go to $f$ and $g$ , and within each, $14*14=196$ choices for the orientation of each of the two numbers. That's $6*196$ possibilities.
$f 1 g 3$ : again, symmetrical (WLOG $f$ has one element): $4$ ways to select the single element for $f$ , and then find the number of ways to distribute the $3$ distinct numbers in the range for $g$ . The only arrangement for the frequency of each number is ${1, 1, 2}$ in some order. Therefore, we have $3$ ways to choose which number is the one represented twice, and then note that there are $12$ ways to arrange these! The number of possibilities in this situation is $2 * 4 * 3 * 12$
Total, divided by $4^8$ , gets $\frac{3 * (1 + 2 * 7^2 + 2^2 * 7 + 2^3 * 3)}{4^7}$ , with numerator $\boxed{453}$

Solution:
We note there are $4^4 = 256$ possibilities for each of $f$ and $g$ from $A$ to $A$ since the input of the four values of each function has four options each for an output value.
We proceed with casework to determine the number of possible $f$ with range 1, 2, etc.
There are 4 possibilities: all elements output to 1, 2, 3, or 4.
We have ${{4}\choose {2}} = 6$ ways to choose the two output elements for $f$ . At this point we have two possibilities: either $f$ has 3 of 1 element and 1 of the other, or 2 of each element. In the first case, there are 2 ways to pick the element which there are 3 copies of, and ${{4}\choose {1}} = 4$ ways to rearrange the 4 elements, for a total of $6 * 4 * 2 = 48$ ways for this case. For the second case, there are ${{4}\choose {2}} = 6$ ways to rearrange the 4 elements, for a total of $6 * 6 = 36$ ways for this case. Adding these two, we get a total of $36 + 48 = 84$ total possibilities.
We have ${{4}\choose {3}} = 4$ ways to choose the three output elements for $f$ . We know we must have 2 of 1 element and 1 of each of the others, so there are 3 ways to pick this element. Finally, there are ${{4}\choose{1}}*{{3}\choose{1}} = 12$ ways to rearrange these elements (since we can pick the locations of the 2 single elements in this many ways), and our total is $4 * 3 * 12 = 144$ ways.
Since we know the elements present, we have $4!$ ways to arrange them, or 24 ways.
(To check, $4 + 84 + 144 + 24 = 256$ , which is the total number of possibilities).
We now break $f$ down by cases, and count the number of $g$ whose ranges are disjoint from $f$ 's.
We know that there are 3 possibilities for $g$ with 1 element. Since half the possibilities for $g$ with two elements will contain the element in $f$ , there are $84/2 = 42$ possibilities for $g$ with 2 elements. Since $3/4$ the possibilities for $g$ with 3 elements will contain the element in $f$ , there are $144/4 = 36$ possibilities for $g$ with 3 elements. Clearly, no 4-element range for $g$ is possible, so the total number of ways for this case to happen is $4(3 + 42 + 36) = 324$
We know that there are 2 possibilities for $g$ with 1 element. If $g$ has 2 elements in its range, they are uniquely determined, so the total number of sets with a range of 2 elements that work for $g$ is $84/6 = 14$ . No 3-element or 4-element ranges for $g$ are possible. Thus, the total number of ways for this to happen is $84(2 + 14) = 1344$
In this case, there is only 1 possibility for $g$ - all the output values are the element that does not appear in $f$ 's range. Thus, the total number of ways for this to happen is $144$
We find that the probability of $f$ and $g$ having disjoint ranges is equal to:
$\dfrac{324 + 1344 + 144}{256^2}=\dfrac{1812}{2^{16}}= \dfrac{453}{2^{14}}$
Thus, our final answer is $\boxed{453}$


Answer: 113.0

Let $ABC$ be a triangle inscribed in circle $\omega$ . Let the tangents to $\omega$ at $B$ and $C$ intersect at point $D$ , and let $\overline{AD}$ intersect $\omega$ at $P$ . If $AB=5$ $BC=9$ , and $AC=10$ $AP$ can be written as the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime integers. Find $m + n$

Solution: From the tangency condition we have $\let\angle BCD = \let\angle CBD = \let\angle A$ . With LoC we have $\cos(A) = \frac{25+100-81}{2*5*10} = \frac{11}{25}$ and $\cos(B) = \frac{81+25-100}{2*9*5} = \frac{1}{15}$ . Then, $CD = \frac{\frac{9}{2}}{\cos(A)} = \frac{225}{22}$ . Using LoC we can find $AD$ $AD^2 = AC^2 + CD^2 - 2(AC)(CD)\cos(A+C) = 10^2+(\frac{225}{22})^2 + 2(10)\frac{225}{22}\cos(B) = 100 + \frac{225^2}{22^2} + 2(10)\frac{225}{22}*\frac{1}{15} = \frac{5^4*13^2}{484}$ . Thus, $AD = \frac{5^2*13}{22}$ . By Power of a Point, $DP*AD = CD^2$ so $DP*\frac{5^2*13}{22} = (\frac{225}{22})^2$ which gives $DP = \frac{5^2*9^2}{13*22}$ . Finally, we have $AP = AD - DP = \frac{5^2*13}{22} - \frac{5^2*9^2}{13*22} = \frac{100}{13} \rightarrow \boxed{113}$

Solution: We know $AP$ is the symmedian, which implies $\triangle{ABP}\sim \triangle{AMC}$ where $M$ is the midpoint of $BC$ . By Appolonius theorem, $AM=\frac{13}{2}$ . Thus, we have $\frac{AP}{AC}=\frac{AB}{AM}, AP=\frac{100}{13}\implies \boxed{113}$

Solution: Extend sides $\overline{AB}$ and $\overline{AC}$ to points $E$ and $F$ , respectively, such that $B$ and $C$ are the feet of the altitudes in $\triangle AEF$ . Denote the feet of the altitude from $A$ to $\overline{EF}$ as $X$ , and let $H$ denote the orthocenter of $\triangle AEF$ . Call $M$ the midpoint of segment $\overline{EF}$ . By the Three Tangents Lemma, we have that $MB$ and $MC$ are both tangents to $(ABC)$ $\implies$ $M = D$ , and since $M$ is the midpoint of $\overline{EF}$ $MF = MB$ . Additionally, by angle chasing, we get that: \[\angle ABC \cong \angle AHC \cong \angle EHX\] Also, \[\angle EHX = 90 ^\circ - \angle HEF = 90 ^\circ - (90 ^\circ - \angle AFE) = \angle AFE\] Furthermore, \[AB = AF \cdot \cos(A)\] From this, we see that $\triangle ABC \sim \triangle AFE$ with a scale factor of $\cos(A)$ . By the Law of Cosines, \[\cos(A) = \frac{10^2 + 5^2 - 9^2}{2 \cdot 10 \cdot 5} = \frac{11}{25}\] Thus, we can find that the side lengths of $\triangle AEF$ are $\frac{250}{11}, \frac{125}{11}, \frac{225}{11}$ . Then, by Stewart's theorem, $AM = \frac{13 \cdot 25}{22}$ . By Power of a Point, \[\overline{MB} \cdot \overline{MB} = \overline{MA} \cdot \overline{MP}\] \[\frac{225}{22} \cdot \frac{225}{22} = \overline{MP} \cdot \frac{13 \cdot 25}{22} \implies \overline{MP} = \frac{225 \cdot 9}{22 \cdot 13}\] Thus, \[AP = AM - MP = \frac{13 \cdot 25}{22} - \frac{225 \cdot 9}{22 \cdot 13} = \frac{100}{13}\] Therefore, the answer is $\boxed{113}$

Solution:
Connect lines $\overline{PB}$ and $\overline{PC}$ . From the angle by tanget formula, we have $\angle PBD = \angle DAB$ . Therefore by AA similarity, $\triangle PBD \sim \triangle BAD$ . Let $\overline{BP} = x$ . Using ratios, we have \[\frac{x}{5}=\frac{BD}{AD}.\] Similarly, using angle by tangent, we have $\angle PCD = \angle DAC$ , and by AA similarity, $\triangle CPD \sim \triangle ACD$ . By ratios, we have \[\frac{PC}{10}=\frac{CD}{AD}.\] However, because $\overline{BD}=\overline{CD}$ , we have \[\frac{x}{5}=\frac{PC}{10},\] so $\overline{PC}=2x.$ Now using Law of Cosines on $\angle BAC$ in triangle $\triangle ABC$ , we have \[9^2=5^2+10^2-100\cos(\angle BAC).\] Solving, we find $\cos(\angle BAC)=\frac{11}{25}$ . Now we can solve for $x$ . Using Law of Cosines on $\triangle BPC,$ we have
\begin{align*}
81&=x^2+4x^2-4x^2\cos(180-\angle BAC) \\
&= 5x^2+4x^2\cos(BAC). \\
\end{align*}
Solving, we get $x=\frac{45}{13}.$ Now we have a system of equations using Law of Cosines on $\triangle BPA$ and $\triangle CPA$ \[AP^2=5^2+\left(\frac{45}{13}\right)^2 -(10) \left(\frac{45}{13} \right)\cos(ABP)\] \[AP^2=10^2+4 \left(\frac{45}{13} \right)^2 + (40) \left(\frac{45}{13} \right)\cos(ABP).\]
Solving, we find $\overline{AP}=\frac{100}{13}$ , so our desired answer is $100+13=\boxed{113}$

Solution:
Following from the law of cosines, we can easily get $\cos A = \frac{11}{25}$ $\cos B = \frac{1}{15}$ $\cos C = \frac{13}{15}$
Hence, $\sin A = \frac{6 \sqrt{14}}{25}$ $\cos 2C = \frac{113}{225}$ $\sin 2C = \frac{52 \sqrt{14}}{225}$ .
Thus, $\cos \left( A + 2C \right) = - \frac{5}{9}$
Denote by $R$ the circumradius of $\triangle ABC$ .
In $\triangle ABC$ , following from the law of sines, we have $R = \frac{BC}{2 \sin A} = \frac{75}{4 \sqrt{14}}$
Because $BD$ and $CD$ are tangents to the circumcircle $ABC$ $\triangle OBD \cong \triangle OCD$ and $\angle OBD = 90^\circ$ .
Thus, $OD = \frac{OB}{\cos \angle BOD} = \frac{R}{\cos A}$
In $\triangle AOD$ , we have $OA = R$ and $\angle AOD = \angle BOD + \angle AOB = A + 2C$ .
Thus, following from the law of cosines, we have
\begin{align*}
AD & = \sqrt{OA^2 + OD^2 - 2 OA \cdot OD \cos \angle AOD} \\
& = \frac{26 \sqrt{14}}{33} R.
\end{align*}
Following from the law of cosines,
\begin{align*}
\cos \angle OAD & = \frac{AD^2 + OA^2 - OD^2}{2 AD \cdot OA} \\
& = \frac{8 \sqrt{14}}{39} .
\end{align*}
Therefore,
\begin{align*}
AP & = 2 OA \cos \angle OAD \\
& = \frac{100}{13} .
\end{align*}
Therefore, the answer is $100 + 13 = \boxed{113}$


Answer: 35.0

Let $ABC$ be a triangle with sides 3, 4, and 5, and $DEFG$ be a 6-by-7 rectangle . A segment is drawn to divide triangle $ABC$ into a triangle $U_1$ and a trapezoid $V_1$ and another segment is drawn to divide rectangle $DEFG$ into a triangle $U_2$ and a trapezoid $V_2$ such that $U_1$ is similar to $U_2$ and $V_1$ is similar to $V_2.$ The minimum value of the area of $U_1$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Solution:
We let $AB=3, AC=4, DE=6, DG=7$ for the purpose of labeling. Clearly, the dividing segment in $DEFG$ must go through one of its vertices, without loss of generality $D$ . The other endpoint ( $D'$ ) of the segment can either lie on $\overline{EF}$ or $\overline{FG}$ $V_2$ is a trapezoid with a right angle then, from which it follows that $V_1$ contains one of the right angles of $\triangle ABC$ , and so $U_1$ is similar to $ABC$ . Thus $U_1$ , and hence $U_2$ , are $3-4-5\,\triangle$ s.
Suppose we find the ratio $r$ of the smaller base to the larger base for $V_2$ , which consequently is the same ratio for $V_1$ . By similar triangles, it follows that $U_1 \sim \triangle ABC$ by the same ratio $r$ , and since the ratio of the areas of two similar figures is equal to the square of the ratio of their corresponding lengths, it follows that $[U_1] = r^2 \cdot [ABC] = 6r^2$
Of the two cases, the second is smaller; the answer is $\frac{3}{32}$ , and $m+n = \boxed{035}$


Answer: 989.0

Let $ABC$ be an equilateral triangle , and let $D$ and $F$ be points on sides $BC$ and $AB$ , respectively, with $FA = 5$ and $CD = 2$ .  Point $E$ lies on side $CA$ such that angle $DEF = 60^{\circ}$ .  The area of triangle $DEF$ is $14\sqrt{3}$ .  The two possible values of the length of side $AB$ are $p \pm q \sqrt{r}$ , where $p$ and $q$ are rational, and $r$ is an integer not divisible by the square of a prime .  Find $r$

Solution:
AIME I 2007-15.png
Denote the length of a side of the triangle $x$ , and of $\overline{AE}$ as $y$ . The area of the entire equilateral triangle is $\frac{x^2\sqrt{3}}{4}$ . Add up the areas of the triangles using the $\frac{1}{2}ab\sin C$ formula (notice that for the three outside triangles, $\sin 60 = \frac{\sqrt{3}}{2}$ ): $\frac{x^2\sqrt{3}}{4} = \frac{\sqrt{3}}{4}(5 \cdot y + (x - 2)(x - 5) + 2(x - y)) + 14\sqrt{3}$ . This simplifies to $\frac{x^2\sqrt{3}}{4} = \frac{\sqrt{3}}{4}(5y + x^2 - 7x + 10 + 2x - 2y + 56)$ . Some terms will cancel out, leaving $y = \frac{5}{3}x - 22$
$\angle FEC$ is an exterior angle to $\triangle AEF$ , from which we find that $60 + \angle CED = 60 + \angle AFE$ , so $\angle CED = \angle AFE$ . Similarly, we find that $\angle EDC = \angle AEF$ . Thus, $\triangle AEF \sim \triangle CDE$ . Setting up a ratio of sides, we get that $\frac{5}{x-y} = \frac{y}{2}$ . Using the previous relationship between $x$ and $y$ , we can solve for $x$
Use the quadratic formula , though we only need the root of the discriminant . This is $\sqrt{(7 \cdot 66)^2 - 4 \cdot 10 \cdot (66^2 + 90)} = \sqrt{49 \cdot 66^2 - 40 \cdot 66^2 - 4 \cdot 9 \cdot 100}$ $= \sqrt{9 \cdot 4 \cdot 33^2 - 9 \cdot 4 \cdot 100} = 6\sqrt{33^2 - 100}$ . The answer is $\boxed{989}$

Solution:
First of all, assume $EC=x,BD=m, ED=a, EF=b$ , then we can find $BF=m-3, AE=2+m-x$ It is not hard to find $ab*sin60^{\circ}*\frac{1}{2}=14\sqrt{3}, ab=56$ , we apply LOC on $\triangle{DEF}, \triangle{BFD}$ , getting that $(m-3)^2+m^2-m(m-3)=a^2+b^2-ab$ , leads to $a^2+b^2=m^2-3m+65$ Apply LOC on $\triangle{CED}, \triangle{AEF}$ separately, getting $4+x^2-2x=a^2; 25+(2+m-x)^2-5(2+m-x)=b^2.$ Add those terms together and use the equality $a^2+b^2=m^2-3m+65$ , we can find: $2x^2-(2m+1)x+2m-42=0$
According to basic angle chasing, $\angle{A}=\angle{C}; \angle{AFE}=\angle{CED}$ , so $\triangle{AFE}\sim \triangle{CED}$ , the ratio makes $\frac{5}{x}=\frac{2+m-x}{2}$ , getting that $x^2-(2+m)x+10=0$ Now we have two equations with $m$ , and $x$ values for both equations must be the same, so we can solve for $x$ in two equations. $x=\frac{2m+1 \pm \sqrt{4m^2+4m+1-16m+336}}{4}; x=\frac{4+2m \pm \sqrt{4m^2+16m-144}}{4}$ , then we can just use positive sign to solve, simplifies to $3+\sqrt{4m^2+16m-144}=\sqrt{4m^2-12m+337}$ , getting $m=\frac{211-3\sqrt{989}}{10}$ , since the triangle is equilateral, $AB=BC=2+m=\frac{231-3\sqrt{989}}{10}$ , and the desired answer is $\boxed{989}$


Answer: 37.0

Let $ABC$ be an equilateral triangle. Extend side $\overline{AB}$ beyond $B$ to a point $B'$ so that $BB'=3 \cdot AB$ . Similarly, extend side $\overline{BC}$ beyond $C$ to a point $C'$ so that $CC'=3 \cdot BC$ , and extend side $\overline{CA}$ beyond $A$ to a point $A'$ so that $AA'=3 \cdot CA$ . What is the ratio of the area of $\triangle A'B'C'$ to the area of $\triangle ABC$
$\textbf{(A)}\ 9\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 25\qquad\textbf{(D)}\ 36\qquad\textbf{(E)}\ 37$

Solution: Note that by symmetry, $\triangle A'B'C'$ is also equilateral. Therefore, we only need to find one of the sides of $A'B'C'$ to determine the area ratio. WLOG, let $AB = BC = CA = 1$ . Therefore, $BB' = 3$ and $BC' = 4$ . Also, $\angle B'BC' = 120^{\circ}$ , so by the Law of Cosines, $B'C' = \sqrt{37}$ . Therefore, the answer is $(\sqrt{37})^2 : 1^2 = \boxed{37}$

Solution: As mentioned in the first solution, $\triangle A'B'C'$ is equilateral. WLOG, let $AB=2$ . Let $D$ be on the line passing through $AB$ such that $A'D$ is perpendicular to $AB$ . Note that $\triangle A'DA$ is a 30-60-90 with right angle at $D$ . Since $AA'=6$ $AD=3$ and $A'D=3\sqrt{3}$ . So we know that $DB'=11$ . Note that $\triangle A'DB'$ is a right triangle with right angle at $D$ . So by the Pythagorean theorem, we find $A'B'= \sqrt{(3\sqrt{3})^2 + 11^2} = 2\sqrt{37}.$ Therefore, the answer is $(2\sqrt{37})^2 : 2^2 = \boxed{37}$

Solution:
Let $AB=BC=CA=x$ . We start by noting that we can just write $AB'$ as just $AB+BB'=4AB$ .
Similarly $BC'=4BC$ , and $CA'=4CA$ . We can evaluate the area of triangle $ABC$ by simply using Heron's formula, $[ABC]=\sqrt{\frac{3x}{2}\cdot {\left(\frac{3x}{2}-x\right)}^3}=\frac{x^2\sqrt{3}}{4}$ .
Next in order to evaluate $A'B'C'$ we need to evaluate the area of the larger triangles $AA'B',BB'C', \text{ and } CC'A'$ .
In this solution we shall just compute $1$ of these as the others are trivially equivalent.
In order to compute the area of $\Delta{AA'B'}$ we can use the formula $[XYZ]=\frac{1}{2}xy\cdot\sin{z}$ .
Since $ABC$ is equilateral and $A$ $B$ $B'$ are collinear, we already know $\angle{A'AB'}=180-60=120$ Similarly from above we know $AB'$ and $A'A$ to be $4x$ , and $3x$ respectively. Thus the area of $\Delta{AA'B'}$ is $\frac{1}{2}\cdot 4x\cdot 3x \cdot \sin{120}=3x^2\cdot\sqrt{3}$ . Likewise we can find $BB'C', \text{ and } CC'A'$ to also be $3x^2\cdot\sqrt{3}$ $[A'B'C']=[AA'B']+[BB'C']+[CC'A']+[ABC]=3\cdot3x^2\cdot\sqrt{3}+\frac{x^2\sqrt{3}}{4}=\sqrt{3}\cdot\left(9x^2+\frac{x^2}{4}\right)$ .
Therefore the ratio of $[A'B'C']$ to $[ABC]$ is $\frac{\sqrt{3}\cdot\left(9x^2+\frac{x^2}{4}\right)}{\frac{x^2\sqrt{3}}{4}}=\boxed{37}$

Solution: Looking at the answer choices, we see that all but ${\textbf{(E)}}$ has a perfect square in the ratio. With some intuition, we can guess that the sidelength of the new triangle formed is not an integer, thus we pick $\boxed{37}$

Solution: We use barycentric coordinates wrt $\triangle ABC$ , to which we can easily obtain that $A'=(4,0,-3)$ $B'=(-3,4,0)$ , and $C'=(0,-3,4)$ . Now, since the coordinates are homogenized ( $-3+4=1$ ), we can directly apply the area formula to obtain that \[[A'B'C']=[ABC]\cdot\left| \begin{array}{ccc} 4 & 0 & -3 \\ -3 & 4 & 0 \\ 0 & -3 & 4 \end{array} \right| = (64-27)[ABC]=37[ABC],\] so the answer is $\boxed{37}$

Solution: First, comparing bases yields that $[BA'B']=3[AA'B]=9[ABC]\implies [AA'B']=12$ . By congruent triangles, \[[AA'B']=[BB'C']=[CC'A']\implies [A'B'C']=(12+12+12+1)[ABC],\] so $[A'B'C']:[ABC]=\boxed{37}$

Solution:
Scale down the figure so that the area formulas for the $120^\circ$ and equilateral triangles become proportional with proportionality constant equivalent to the product of the corresponding sides. By the proportionality, it becomes clear that the answer is $3*4*3+1*1=37, \boxed{37}$ .
~ Solution by mathchampion1

Solution: Drawing the diagram, we see that the large triangle, $A'B'C'$ , is composed of three congruent triangles with the triangle $ABC$ at the center. Let each of the sides of triangle $ABC$ be $x$ . Therefore, using the equilateral triangle area formula, the $[ABC] = \frac{x^2\sqrt{3}}{4}$ . We also know now that the sides of the triangles are $3x$ and $3x + x$ , or $4x$ . We also know that since $BB'$ are collinear, as are the others, angle $C'BB'$ is $180 - 60$ , which is $120$ degrees. Because that angle is an included angle, we get the area of all three congruent triangle's are $\frac{12x^2\sin120}{2} \cdot 3$ . Simplifying that yields $\frac{36x^2\sqrt{3}}{4}$ . Adding that to the $[ABC]$ yields $\frac{37x^2\sqrt{3}}{4}$ . From this, we can compare the ratios by canceling everything out except for the $37$ , so the answer is $\boxed{37}$

Solution:
Solution by HydroQuantum
Let $AB=BC=CA=x$
Recall The Law of Cosines. Letting $A'B'=B'C'=C'A'=y$ \[y^2=(3x)^2+(x+3x)^2-2(3x)(x+3x)(\cos 120) =\] \[(3x)^2+(4x)^2-2(3x)(4x)(\cos 120)=9x^2+16x^2-24x(\cos 120)=25x^2+12x^2=37x^2.\] Since both $\triangle ABC$ and $\triangle A'B'C'$ are both equilateral triangles, they must be similar due to $AA$ similarity. This means that $\frac{A'B'}{AB}$ $=$ $\frac{B'C'}{BC}$ $=$ $\frac{C'A'}{CA}$ $=$ $\frac{[\triangle A'B'C']}{[\triangle ABC]}$ $=$ $\frac{37}{1}$
Therefore, our answer is $\boxed{37}$

Solution:
Note that the height and base of $\triangle A'CC'$ are respectively 4 times and 3 times that of $\triangle ABC$ . Therefore the area of $\triangle A'CC'$ is 12 times that of $\triangle ABC$
By symmetry, $\triangle A'CC' \cong \triangle B'AA' \cong \triangle C'BB'$ . Adding the areas of these three triangles and $\triangle ABC$ for the total area of $\triangle A'B'C'$ gives a ratio of $(12 + 12 + 12 + 1) : 1$ , or $\boxed{37}$

Solution: First we note that $A'B'C'\sim ABC$ due to symmetry. WLOG, let $B = (0, 0)$ and $AB = 1$ Therefore, $C = (1, 0), A = \frac{1}{2}, \left(\frac{\sqrt{3}}{2}\right)$ . Using the condition that $CC' = 3$ , we get $C' = (4, 0)$ and $B' = \left(\frac{-3}{2}, \frac{-3\sqrt{3}}{2}\right)$ . It is easy to check that $B'C' = \sqrt{37}$ . Since the area ratios of two similar figures is the square of the ratio of their lengths, the ratio is $\boxed{37}$

Solution: Note that angle $C'BB'$ is $120$ °, as it is supplementary to the equilateral triangle. Then, using area $= \frac{1}{2}ab\sin\theta$ and letting side $AB = 1$ for ease, we get: $4\cdot3\cdot\frac{\sin120}{2} = 3\sqrt{3}$ as the area of $C'BB'$ . Then, the area of $ABC$ is $\frac{\sqrt{3}}{4}$ , so the ratio is $\frac{3(3\sqrt{3})+\frac{\sqrt{3}}{4}}{\frac{\sqrt{3}}{4}} = \boxed{37}$


Answer: 83.0

Let $ABC$ be equilateral , and $D, E,$ and $F$ be the midpoints of $\overline{BC}, \overline{CA},$ and $\overline{AB},$ respectively.  There exist points $P, Q,$ and $R$ on $\overline{DE}, \overline{EF},$ and $\overline{FD},$ respectively, with the property that $P$ is on $\overline{CQ}, Q$ is on $\overline{AR},$ and $R$ is on $\overline{BP}.$ The ratio of the area of triangle $ABC$ to the area of triangle $PQR$ is $a + b\sqrt {c},$ where $a, b$ and $c$ are integers, and $c$ is not divisible by the square of any prime .  What is $a^{2} + b^{2} + c^{2}$

Solution:
1998 AIME-12.png
We let $x = EP = FQ$ $y = EQ$ $k = PQ$ . Since $AE = \frac {1}{2}AB$ and $AD = \frac {1}{2}AC$ $\triangle AED \sim \triangle ABC$ and $ED \parallel BC$
By alternate interior angles, we have $\angle PEQ = \angle BFQ$ and $\angle EPQ = \angle FBQ$ . By vertical angles, $\angle EQP = \angle FQB$
Thus $\triangle EQP \sim \triangle FQB$ , so $\frac {EP}{EQ} = \frac {FB}{FQ}\Longrightarrow\frac {x}{y} = \frac {1}{x}\Longrightarrow x^{2} = y$
Since $\triangle EDF$ is equilateral, $EQ + FQ = EF = BF = 1\Longrightarrow x + y = 1$ . Solving for $x$ and $y$ using $x^{2} = y$ and $x + y = 1$ gives $x = \frac {\sqrt {5} - 1}{2}$ and $y = \frac {3 - \sqrt {5}}{2}$
Using the Law of Cosines , we get
We want the ratio of the squares of the sides, so $\frac {(2)^{2}}{k^{2}} = \frac {4}{7 - 3\sqrt {5}} = 7 + 3\sqrt {5}$ so $a^{2} + b^{2} + c^{2} = 7^{2} + 3^{2} + 5^{2} = \boxed{083}$

Solution:
WLOG, let $\Delta ABC$ have side length $2.$ Then, $DE = EF = FD = 1.$ We also notice that $\angle CEP = \angle DEF = 60^{\circ},$ meaning $\angle CEF = \angle CEP + \angle DEF = 120^{\circ}.$
Let $EP = x.$ Since $FQ = x$ by congruent triangles $\Delta EPC$ and $\Delta FQA,$ $EQ = EF - FQ = 1-x.$ We can now apply Law of Cosines to $\Delta CEP, \Delta PEQ,$ and $\Delta CEQ.$
By LoC on $\Delta CEP,$ we get \[CP^2 = 1^2 + x^2 - 2\cdot 1\cdot x\cdot \left(\frac{1}{2}\right) = x^2 - x + 1.\]
In a similar vein, using LoC on $\Delta PEQ$ and $\Delta CEQ,$ respectively, earns \[PQ^2 = x^2 + (1-x)^2 - 2\cdot x\cdot (1-x)\cdot \left(\frac{1}{2}\right) = 3x^2 - 3x + 1\] \[CQ^2 = 1^2 + (1-x)^2 - 2\cdot 1\cdot (1-x)\cdot \left(-\frac{1}{2}\right) = x^2 - 3x + 3\]
We have $CP^2, PQ^2,$ and $CQ^2.$ Additionally, by segment addition, $CP + PQ = CQ.$ Solving for $CP, PQ,$ and $CQ$ from the Law of Cosines expressions and plugging them into the segment addition gets the (admittedly-ugly) equation \[\sqrt{x^2-3x+3} = \sqrt{x^2-x+1} + \sqrt{3x^2-3x+1}.\]
Since the equation is ugly, we look at what the problem is asking for us to solve. We want $\frac{[ABC]}{[PQR]}.$ We see that $[ABC] = \sqrt{3}$ and $[PQR] = [DEF] - [PDR] - [RFQ] - [QEP] = \frac{\sqrt{3}}{4} - \frac{3}{2}\left(\frac{\sqrt{3}}{2}x(1-x)\right),$ since $[PDR] = [RFQ] = [QEP] = \frac{1}{2}x(1-x)\frac{\sqrt{3}}{2}$ from the sine area formula. Simplifying $\frac{[ABC]}{[PQR]}$ gets us wanting to find $\frac{4}{3x^2-3x+1}.$
We see $3x^2-3x+1$ in both the denominator of what we want and under a radicand in our algebraic expression, which leads us to think the calculations may not be that bad. Isolate $\sqrt{3x^2-3x+1}$ and square to get \[3x^2-3x+1 = 2x^2-4x+4-2\sqrt{(x^2-3x+3)(x^2-x+1)}\]
Isolate the radicand and square and expand to get $x^4+2x^3-5x^2-6x+9=4x^4-16x^3+28x^2-24x+12,$ and moving terms to one side and dividing by $3,$ we get \[x^4-6x^3+11x^2-6x+1=0.\]
This can be factored into $(x^2-3x+1)^2 = 0 \rightarrow x^2-3x+1 = 0 \rightarrow x = \frac{3 \pm \sqrt{5}}{2}.$ From the equation $x^2-3x+1=0,$ we have $x^2=3x+1,$ so plugging that value into the expression we want to find, we get $\frac{4}{3(3x+1)-3x+1} = \frac{4}{6x+2}.$
Substituting $x = \frac{3-\sqrt{5}}{2}$ into $\frac{4}{6x+2}$ gets an expression of $7+3\sqrt{5},$ so $a^2+b^2+c^2 = \boxed{083}$