Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: Real numbers $x$ and $y$ satisfy the equation $x^2+y^2=10x-6y-34$ . What is $x+y$
$\text{(A)}\ 1 \qquad \text{(B)}\ 2 \qquad \text{(C)}\ 3 \qquad \text{(D)}\ 6 \qquad \text{(E)}\ 8$

Solution: If we move every term including $x$ or $y$ to the LHS, we get \[x^2 - 10x + y^2 + 6y = -34.\] We can complete the square to find that this equation becomes \[(x - 5)^2 + (y + 3)^2 = 0.\] Since the square of any real number is nonnegative, we know that the sum is greater than or equal to $0$ .  Equality holds when the value inside the parhentheses is equal to $0$ .  We find that \[(x,y) = (5,-3)\] and the sum we are looking for is \[5+(-3)=2 \implies \boxed{2}.\] - Honestly

Answer: B 2
Problem: Let $S$ be the set of sides and diagonals of a regular pentagon. A pair of elements of $S$ are selected at random without replacement. What is the probability that the two chosen segments have the same length?
$\textbf{(A) }\frac{2}5\qquad\textbf{(B) }\frac{4}9\qquad\textbf{(C) }\frac{1}2\qquad\textbf{(D) }\frac{5}9\qquad\textbf{(E) }\frac{4}5$

Solution: The problem is simply asking how many ways are there to choose two sides or two diagonals. Hence, the probability is \[\dfrac{\binom{5}{2} + \binom{5}{2}}{\binom{10}{2}} = \dfrac{10+10}{45} = \dfrac{20}{45}=\boxed{49}\]

Answer: B 49
Problem: Jo and Blair take turns counting from $1$ to one more than the last number said by the other person. Jo starts by saying $``1"$ , so Blair follows by saying $``1, 2"$ . Jo then says $``1, 2, 3"$ , and so on. What is the $53^{\text{rd}}$ number said?
$\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 8$

Solution: We notice that the number of numbers said is incremented by one each time; that is, Jo says one number, then Blair says two numbers, then Jo says three numbers, etc.  Thus, after nine "turns", $1+2+3+4+5+6+7+8+9=45$ numbers have been said.  In the tenth turn, the eighth number will be the 53rd number said, because $53-45=8$ .  Since we are starting from 1 every turn, the 53rd number said will be $\boxed{8}$

Answer: E 8
Problem: Jo and Blair take turns counting from $1$ to one more than the last number said by the other person. Jo starts by saying $``1"$ , so Blair follows by saying $``1, 2"$ . Jo then says $``1, 2, 3"$ , and so on. What is the $53^{\text{rd}}$ number said?
$\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 8$

Solution: We notice that the number of numbers said is incremented by one each time; that is, Jo says one number, then Blair says two numbers, then Jo says three numbers, etc.  We notice that the number of numbers is $1 + 2 + 3 + 4 ...$ every time we finish a "turn" we notice the sum of these would be the largest number $\frac{n(n+1)}{2}$ under 53, we can easily see that if we double this it's $n^2 + n \simeq 106$ , and we immediately note that 10 is too high, but 9 is perfect, meaning that at 9, 45 numbers have been said so far, $\frac{9(9+1)}{2} = 45$ and $53 - 45 = \boxed{8}$

Answer: E 8
Problem: Jo and Blair take turns counting from $1$ to one more than the last number said by the other person. Jo starts by saying $``1"$ , so Blair follows by saying $``1, 2"$ . Jo then says $``1, 2, 3"$ , and so on. What is the $53^{\text{rd}}$ number said?
$\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 8$

Solution: Let $T(n)$ denote the $n$ th triangle number. Then, observe that the $T(n)$ th number said is $n$ . It follows that the $55$ th number is $10$ (as $55 = T(10)$ ). Thus, the $53$ rd number is $10 - 2 = 8$ , which is answer choice $\boxed{8}$

Answer: E 8
Problem: In triangle $ABC$ , medians $AD$ and $CE$ intersect at $P$ $PE=1.5$ $PD=2$ , and $DE=2.5$ .  What is the area of $AEDC$
[asy] unitsize(0.2cm); pair A,B,C,D,E,P; A=(0,0); B=(80,0); C=(20,40); D=(50,20); E=(40,0); P=(33.3,13.3); draw(A--B); draw(B--C); draw(A--C); draw(C--E); draw(A--D); draw(D--E); dot(A); dot(B); dot(C); dot(D); dot(E); dot(P); label("A",A,SW); label("B",B,SE); label("C",C,N); label("D",D,NE); label("E",E,SSE); label("P",P,SSW); [/asy]
$\textbf{(A) }13 \qquad \textbf{(B) }13.5 \qquad \textbf{(C) }14 \qquad \textbf{(D) }14.5 \qquad \textbf{(E) }15$

Solution: Let us use mass points:
Assign $B$ mass $1$ .  Thus, because $E$ is the midpoint of $AB$ $A$ also has a mass of $1$ .  Similarly, $C$ has a mass of $1$ $D$ and $E$ each have a mass of $2$ because they are between $B$ and $C$ and $A$ and $B$ respectively.  Note that the mass of $D$ is twice the mass of $A$ , so $AP$ must be twice as long as $PD$ .  PD has length $2$ , so $AP$ has length $4$ and $AD$ has length $6$ .  Similarly, $CP$ is twice $PE$ and $PE=1.5$ , so $CP=3$ and $CE=4.5$ .  Now note that triangle $PED$ is a $3-4-5$ right triangle with the right angle $DPE$ . Since the diagonals of quadrilaterals $AEDC$ $AD$ and $CE$ , are perpendicular, the area of $AEDC$ is $\frac{6 \times 4.5}{2}=\boxed{13.5}$

Answer: B 13.5
Problem: In triangle $ABC$ , medians $AD$ and $CE$ intersect at $P$ $PE=1.5$ $PD=2$ , and $DE=2.5$ .  What is the area of $AEDC$
[asy] unitsize(0.2cm); pair A,B,C,D,E,P; A=(0,0); B=(80,0); C=(20,40); D=(50,20); E=(40,0); P=(33.3,13.3); draw(A--B); draw(B--C); draw(A--C); draw(C--E); draw(A--D); draw(D--E); dot(A); dot(B); dot(C); dot(D); dot(E); dot(P); label("A",A,SW); label("B",B,SE); label("C",C,N); label("D",D,NE); label("E",E,SSE); label("P",P,SSW); [/asy]
$\textbf{(A) }13 \qquad \textbf{(B) }13.5 \qquad \textbf{(C) }14 \qquad \textbf{(D) }14.5 \qquad \textbf{(E) }15$

Solution: Note that triangle $DPE$ is a right triangle, and that the four angles (angles $APC, CPD, DPE,$ and $EPA$ ) that have point $P$ are all right angles. Using the fact that the centroid ( $P$ ) divides each median in a $2:1$ ratio, $AP=4$ and $CP=3$ . Quadrilateral $AEDC$ is now just four right triangles. The area is $\frac{4\cdot 1.5+4\cdot 3+3\cdot 2+2\cdot 1.5}{2}=\boxed{13.5}$

Answer: B 13.5
Problem: In triangle $ABC$ , medians $AD$ and $CE$ intersect at $P$ $PE=1.5$ $PD=2$ , and $DE=2.5$ .  What is the area of $AEDC$
[asy] unitsize(0.2cm); pair A,B,C,D,E,P; A=(0,0); B=(80,0); C=(20,40); D=(50,20); E=(40,0); P=(33.3,13.3); draw(A--B); draw(B--C); draw(A--C); draw(C--E); draw(A--D); draw(D--E); dot(A); dot(B); dot(C); dot(D); dot(E); dot(P); label("A",A,SW); label("B",B,SE); label("C",C,N); label("D",D,NE); label("E",E,SSE); label("P",P,SSW); [/asy]
$\textbf{(A) }13 \qquad \textbf{(B) }13.5 \qquad \textbf{(C) }14 \qquad \textbf{(D) }14.5 \qquad \textbf{(E) }15$

Solution: From the solution above, we can find that the lengths of the diagonals are $6$ and $4.5$ . Now, since the diagonals of AEDC are perpendicular, we use the area formula to find that the total area is $\frac{6\times4.5}{2} = \frac{27}{2} = 13.5 = \boxed{13.5}$

Answer: B 13.5
Problem: In triangle $ABC$ , medians $AD$ and $CE$ intersect at $P$ $PE=1.5$ $PD=2$ , and $DE=2.5$ .  What is the area of $AEDC$
[asy] unitsize(0.2cm); pair A,B,C,D,E,P; A=(0,0); B=(80,0); C=(20,40); D=(50,20); E=(40,0); P=(33.3,13.3); draw(A--B); draw(B--C); draw(A--C); draw(C--E); draw(A--D); draw(D--E); dot(A); dot(B); dot(C); dot(D); dot(E); dot(P); label("A",A,SW); label("B",B,SE); label("C",C,N); label("D",D,NE); label("E",E,SSE); label("P",P,SSW); [/asy]
$\textbf{(A) }13 \qquad \textbf{(B) }13.5 \qquad \textbf{(C) }14 \qquad \textbf{(D) }14.5 \qquad \textbf{(E) }15$

Solution: We know that $[AEDC]=\frac{3}{4}[ABC]$ , and $[ABC]=3[PAC]$ using median properties. So Now we try to find $[PAC]$ . Since $\triangle PAC\sim \triangle PDE$ , then the side lengths of $\triangle PAC$ are twice as long as $\triangle PDE$ since $D$ and $E$ are midpoints. Therefore, $\frac{[PAC]}{[PDE]}=2^2=4$ . It suffices to compute $[PDE]$ . Notice that $(1.5, 2, 2.5)$ is a Pythagorean Triple, so $[PDE]=\frac{1.5\times 2}{2}=1.5$ . This implies $[PAC]=1.5\cdot 4=6$ , and then $[ABC]=3\cdot 6=18$ . Finally, $[AEDC]=\frac{3}{4}\times 18=\boxed{13.5}$

Answer:  13.5
Problem: In triangle $ABC$ , medians $AD$ and $CE$ intersect at $P$ $PE=1.5$ $PD=2$ , and $DE=2.5$ .  What is the area of $AEDC$
[asy] unitsize(0.2cm); pair A,B,C,D,E,P; A=(0,0); B=(80,0); C=(20,40); D=(50,20); E=(40,0); P=(33.3,13.3); draw(A--B); draw(B--C); draw(A--C); draw(C--E); draw(A--D); draw(D--E); dot(A); dot(B); dot(C); dot(D); dot(E); dot(P); label("A",A,SW); label("B",B,SE); label("C",C,N); label("D",D,NE); label("E",E,SSE); label("P",P,SSW); [/asy]
$\textbf{(A) }13 \qquad \textbf{(B) }13.5 \qquad \textbf{(C) }14 \qquad \textbf{(D) }14.5 \qquad \textbf{(E) }15$

Solution: As from Solution 4, we find the area of $\triangle DPE$ to be $\frac{3}{2}$ . Because $DE = \frac{5}{2}$ , the altitude perpendicular to $DE = \frac{6}{5}$ . Also, because $DE || AC$ $\triangle ABC$ is similar to $\triangle{DBE}$ with side length ratio $2:1$ , so $AC=5$ and the altitude perpendicular to $AC = \frac{12}{5}$ . The altitude of trapezoid $ACDE$ is then $\frac{18}{5}$ and the bases are $\frac{5}{2}$ and $5$ . So, we use the formula for the area of a trapezoid to find the area of $ACDE = \boxed{13.5}$

Answer:  13.5
Problem: Alex has $75$ red tokens and $75$ blue tokens. There is a booth where Alex can give two red tokens and receive in return a silver token and a blue token and another booth where Alex can give three blue tokens and receive in return a silver token and a red token. Alex continues to exchange tokens until no more exchanges are possible. How many silver tokens will Alex have at the end?
$\textbf{(A)}\ 62 \qquad \textbf{(B)}\ 82 \qquad \textbf{(C)}\ 83 \qquad \textbf{(D)}\ 102 \qquad \textbf{(E)}\ 103$

Solution: If Alex goes to the red booth 3 times, then goes to the blue booth once, Alex can exchange 6 red tokens for 4 silver tokens and one red token. Similarly, if Alex goes to the blue booth 2 times, then goes to the red booth once, Alex can exchange 6 blue tokens for 3 silver tokens and one blue token. Let's call the first combination Combo 1, and the second combination Combo 2.
In other words, Alex can exchange 5 red tokens for 4 silver tokens as long as he has at least 6 red tokens, and Alex can exchange 5 blue tokens for 3 silver tokens as long as he has at least 6 blue tokens. Hence after performing 14 Combo 1's and 14 Combo 2's, we end up with 5 red, 5 blue, and 98 silver tokens.
Finally, Alex can visit the blue booth once, then do Combo 1, then visit the blue booth once more to end up with 1 red token, 2 blue tokens, and $\boxed{103}$ silver tokens, at which point it is clear he cannot use the booths anymore.

Answer: E 103
Problem: Alex has $75$ red tokens and $75$ blue tokens. There is a booth where Alex can give two red tokens and receive in return a silver token and a blue token and another booth where Alex can give three blue tokens and receive in return a silver token and a red token. Alex continues to exchange tokens until no more exchanges are possible. How many silver tokens will Alex have at the end?
$\textbf{(A)}\ 62 \qquad \textbf{(B)}\ 82 \qquad \textbf{(C)}\ 83 \qquad \textbf{(D)}\ 102 \qquad \textbf{(E)}\ 103$

Solution: We can approach this problem by assuming he goes to the red booth first. You start with $75 \text{R}$ and $75 \text{B}$ and at the end of the first booth, you will have $1 \text{R}$ and $112 \text{B}$ and $37 \text{S}$ . We now move to the blue booth, and working through each booth until we have none left, we will end up with: $1 \text{R}$ $2 \text{B}$ and $103 \text{S}$ . So, the answer is $\boxed{103}$

Answer: E 103
Problem: Alex has $75$ red tokens and $75$ blue tokens. There is a booth where Alex can give two red tokens and receive in return a silver token and a blue token and another booth where Alex can give three blue tokens and receive in return a silver token and a red token. Alex continues to exchange tokens until no more exchanges are possible. How many silver tokens will Alex have at the end?
$\textbf{(A)}\ 62 \qquad \textbf{(B)}\ 82 \qquad \textbf{(C)}\ 83 \qquad \textbf{(D)}\ 102 \qquad \textbf{(E)}\ 103$

Solution: Let $x$ denote the number of visits to the first booth and $y$ denote the number of visits to the second booth. Then we can describe the quantities of his red and blue coins as follows: \[R(x,y)=-2x+y+75\] \[B(x,y)=x-3y+75\] There are no legal exchanges when he has fewer than $2$ red coins and fewer than $3$ blue coins, namely when he has a red coin and $2$ blue coins. We can then create a system of equations: \[1=-2x+y+75\] \[2=x-3y+75\] Solving yields $x=59$ and $y=44$ . Since he gains one silver coin per visit to each booth, he has $x+y=44+59=\boxed{103}$ silver coins in total.

Answer: E 103
Problem: The number $2013$ has the property that its units digit is the sum of its other digits, that is $2+0+1=3$ . How many integers less than $2013$ but greater than $1000$ have this property?
$\textbf{(A)}\ 33\qquad\textbf{(B)}\ 34\qquad\textbf{(C)}\ 45\qquad\textbf{(D)}\ 46\qquad\textbf{(E)}\ 58$

Solution: We take cases on the thousands digit, which must be either $1$ or $2$ :
If the number is of the form $\overline{1bcd},$ where $b, c, d$ are digits, then we must have $d = 1 + b + c.$ Since $d \le 9,$ we must have $b + c \le 9 - 1 = 8.$ By casework on the value of $b$ , we find that there are $1 + 2 + \dots + 9 = 45$ possible pairs $(b, c)$ , and each pair uniquely determines the value of $d$ , so we get $45$ numbers with the given property.
If the number is of the form $\overline{2bcd},$ then it must be one of the numbers $2000, 2001, \dots, 2012.$ Checking all these numbers, we find that only $2002$ has the given property.
Therefore, the number of numbers with the property is $45 + 1 = \boxed{46}$

Answer: D 46
Problem: The number $2013$ has the property that its units digit is the sum of its other digits, that is $2+0+1=3$ . How many integers less than $2013$ but greater than $1000$ have this property?
$\textbf{(A)}\ 33\qquad\textbf{(B)}\ 34\qquad\textbf{(C)}\ 45\qquad\textbf{(D)}\ 46\qquad\textbf{(E)}\ 58$

Solution: Let's start with the case that starts with $200$ . We have only one number, which is $2002$ . If we look at the $1900s$ , we have no solutions because $1+9 = 10$ , and because we can only use digits from $1$ through $9$ , it is impossible. If we looks at the $1800s$ , we do have one solution, which is $1809$ . If we look a the $1700s$ , we have $2$ solutions, namely, $1708$ and $1719$
We can see a pattern here. The pattern is every hundred you go down, you have $1$ more solution. Therefore, we have $1+0+1+2+3+4+5+6+7+8+9$ which is = $\boxed{46}$

Answer: D 46
Problem: The number $2013$ is expressed in the form
where $a_1 \ge a_2 \ge \cdots \ge a_m$ and $b_1 \ge b_2 \ge \cdots \ge b_n$ are positive integers and $a_1 + b_1$ is as small as possible. What is $|a_1 - b_1|$
$\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Solution: The prime factorization of $2013$ is $61\cdot11\cdot3$ . To have a factor of $61$ in the numerator and to minimize $a_1,$ $a_1$ must equal $61$ . Now we notice that there can be no prime $p$ which is not a factor of $2013$ such that $b_1<p<61,$ because this prime will not be canceled out in the denominator, and will lead to an extra factor in the numerator. The highest prime less than $61$ is $59$ , so there must be a factor of $59$ in the denominator. It follows that $b_1 = 59$ (to minimize $b_1$ as well), so the answer is $|61-59| = \boxed{2}.\]

Answer: B 2
Problem: Two non-decreasing sequences of nonnegative integers have different first terms. Each sequence has the property that each term beginning with the third is the sum of the previous two terms, and the seventh term of each sequence is $N$ . What is the smallest possible value of $N$
$\textbf{(A)}\ 55 \qquad \textbf{(B)}\ 89 \qquad \textbf{(C)}\ 104 \qquad \textbf{(D)}\ 144 \qquad \textbf{(E)}\ 273$

Solution: Let the first two terms of the first sequence be $x_{1}$ and $x_{2}$ and the first two of the second sequence be $y_{1}$ and $y_{2}$ .  Computing the seventh term, we see that $5x_{1} + 8x_{2} = 5y_{1} + 8y_{2}$ .  Note that this means that $x_{1}$ and $y_{1}$ must have the same value modulo $8$ .  To minimize, let one of them be $0$ WLOG , assume that $x_{1} = 0$ .  Thus, the smallest possible value of $y_{1}$ is $8$ ; and since the sequences are non-decreasing we get $y_{2} \ge 8$ .  To minimize, let $y_{2} = 8$ .  Thus, $5y_{1} + 8y_{2} = 40 + 64 = \boxed{104}$

Answer: C 104
Problem: Two non-decreasing sequences of nonnegative integers have different first terms. Each sequence has the property that each term beginning with the third is the sum of the previous two terms, and the seventh term of each sequence is $N$ . What is the smallest possible value of $N$
$\textbf{(A)}\ 55 \qquad \textbf{(B)}\ 89 \qquad \textbf{(C)}\ 104 \qquad \textbf{(D)}\ 144 \qquad \textbf{(E)}\ 273$

Solution: WLOG, let $a_i$ $b_i$ be the sequences with $a_1<b_1$ . Then \[N=5a_1+8a_2=5b_1+8b_2\] or \[5a_1+8a_2=5(a_1+c)+8(a_2-d)\] for some natural numbers $c$ $d$ . Thus $5c=8d$ . To minimize $c$ and $d$ , we have $(c,d)=(8,5)$ , or \[5a_1+8a_2=5(a_1+8)+8(a_2-5).\] To minimize $a_1$ and $b_1$ , we have $(a_1,b_1)=(0,0+c)=(0,8)$ . Using the same method, since $b_2\ge b_1$ , we have $b_2\ge8$
Thus the minimum $N=5b_1+8b_2=104\boxed{104}$

Answer: C 104
Problem: The regular octagon $ABCDEFGH$ has its center at $J$ .  Each of the vertices and the center are to be associated with one of the digits $1$ through $9$ , with each digit used once, in such a way that the sums of the numbers on the lines $AJE$ $BJF$ $CJG$ , and $DJH$ are all equal.  In how many ways can this be done?
$\textbf{(A)}\ 384 \qquad\textbf{(B)}\ 576  \qquad\textbf{(C)}\ 1152 \qquad\textbf{(D)}\ 1680 \qquad\textbf{(E)}\ 3456$
[asy] pair A,B,C,D,E,F,G,H,J; A=(20,20(2+sqrt(2))); B=(20(1+sqrt(2)),20(2+sqrt(2))); C=(20(2+sqrt(2)),20(1+sqrt(2))); D=(20(2+sqrt(2)),20); E=(20(1+sqrt(2)),0); F=(20,0); G=(0,20); H=(0,20(1+sqrt(2))); J=(10(2+sqrt(2)),10(2+sqrt(2))); draw(A--B); draw(B--C); draw(C--D); draw(D--E); draw(E--F); draw(F--G); draw(G--H); draw(H--A); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(H); dot(J); label("A",A,NNW); label("B",B,NNE); label("C",C,ENE); label("D",D,ESE); label("E",E,SSE); label("F",F,SSW); label("G",G,WSW); label("H",H,WNW); label("J",J,SE); [/asy]

Solution: First of all, note that $J$ must be $1$ $5$ , or $9$ to preserve symmetry, since the sum of 1 to 9 is 45, and we need the remaining 8 to be divisible by 4 (otherwise we will have uneven sums). So, we have:
[asy] pair A,B,C,D,E,F,G,H,J; A=(20,20(2+sqrt(2))); B=(20(1+sqrt(2)),20(2+sqrt(2))); C=(20(2+sqrt(2)),20(1+sqrt(2))); D=(20(2+sqrt(2)),20); E=(20(1+sqrt(2)),0); F=(20,0); G=(0,20); H=(0,20(1+sqrt(2))); J=(10(2+sqrt(2)),10(2+sqrt(2))); draw(A--B); draw(B--C); draw(C--D); draw(D--E); draw(E--F); draw(F--G); draw(G--H); draw(H--A); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(H); dot(J); label("A",A,NNW); label("B",B,NNE); label("C",C,ENE); label("D",D,ESE); label("E",E,SSE); label("F",F,SSW); label("G",G,WSW); label("H",H,WNW); label("J $(1, 5, 9)$",J,SE); [/asy]
We also notice that $A+E = B+F = C+G = D+H$
WLOG, assume that $J = 1$ .  Thus the pairs of vertices must be $9$ and $2$ $8$ and $3$ $7$ and $4$ , and $6$ and $5$ .  There are $4! = 24$ ways to assign these to the vertices.  Furthermore, there are $2^{4} = 16$ ways to switch them (i.e. do $2$ $9$ instead of $9$ $2$ ).
Thus, there are $16(24) = 384$ ways for each possible J value.  There are $3$ possible J values that still preserve symmetry: $384(3) = \boxed{1152}$

Answer: C 1152
Problem: The regular octagon $ABCDEFGH$ has its center at $J$ .  Each of the vertices and the center are to be associated with one of the digits $1$ through $9$ , with each digit used once, in such a way that the sums of the numbers on the lines $AJE$ $BJF$ $CJG$ , and $DJH$ are all equal.  In how many ways can this be done?
$\textbf{(A)}\ 384 \qquad\textbf{(B)}\ 576  \qquad\textbf{(C)}\ 1152 \qquad\textbf{(D)}\ 1680 \qquad\textbf{(E)}\ 3456$
[asy] pair A,B,C,D,E,F,G,H,J; A=(20,20(2+sqrt(2))); B=(20(1+sqrt(2)),20(2+sqrt(2))); C=(20(2+sqrt(2)),20(1+sqrt(2))); D=(20(2+sqrt(2)),20); E=(20(1+sqrt(2)),0); F=(20,0); G=(0,20); H=(0,20(1+sqrt(2))); J=(10(2+sqrt(2)),10(2+sqrt(2))); draw(A--B); draw(B--C); draw(C--D); draw(D--E); draw(E--F); draw(F--G); draw(G--H); draw(H--A); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(H); dot(J); label("A",A,NNW); label("B",B,NNE); label("C",C,ENE); label("D",D,ESE); label("E",E,SSE); label("F",F,SSW); label("G",G,WSW); label("H",H,WNW); label("J",J,SE); [/asy]

Solution: As in solution 1, $J$ must be $1$ $5$ , or $9$ giving us 3 choices. Additionally $A+E = B+F = C+G = D+H$ .  This means once we choose $J$ there are $8$ remaining choices. Going clockwise from $A$ we count, $8$ possibilities for $A$ . Choosing $A$ also determines $E$ which leaves $6$ choices for $B$ , once $B$ is chosen it also determines $F$ leaving $4$ choices for $C$ . Once $C$ is chosen it determines $G$ leaving $2$ choices for $D$ . Choosing $D$ determines $H$ , exhausting the numbers. Additionally, there are three possible values for $J$ . To get the answer we multiply $2\cdot4\cdot6\cdot8\cdot3=\boxed{1152}$

Answer: C 1152
Problem: In triangle $ABC$ $AB=13$ $BC=14$ , and $CA=15$ . Distinct points $D$ $E$ , and $F$ lie on segments $\overline{BC}$ $\overline{CA}$ , and $\overline{DE}$ , respectively, such that $\overline{AD}\perp\overline{BC}$ $\overline{DE}\perp\overline{AC}$ , and $\overline{AF}\perp\overline{BF}$ . The length of segment $\overline{DF}$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. What is $m+n$
$\textbf{(A)}\ 18\qquad\textbf{(B)}\ 21\qquad\textbf{(C)}\ 24\qquad\textbf{(D)}\ 27\qquad\textbf{(E)}\ 30$

Solution: Since $\angle{AFB}=\angle{ADB}=90^{\circ}$ , quadrilateral $ABDF$ is cyclic. It follows that $\angle{ADE}=\angle{ABF}$ , so $\triangle ABF \sim \triangle ADE$ are similar. In addition, $\triangle ADE \sim \triangle ACD$ . We can easily find $AD=12$ $BD = 5$ , and $DC=9$ using Pythagorean triples.
So, the ratio of the longer leg to the hypotenuse of all three similar triangles is $\tfrac{12}{15} = \tfrac{4}{5}$ , and the ratio of the shorter leg to the hypotenuse is $\tfrac{9}{15} = \tfrac{3}{5}$ . It follows that $AF=(\tfrac{4}{5}\cdot 13), BF=(\tfrac{3}{5}\cdot 13)$
Let $x=DF$ . By Ptolemy's Theorem , we have \[13x+\left(5\cdot 13\cdot \frac{4}{5}\right)= 12\cdot 13\cdot \frac{3}{5} \qquad \Leftrightarrow \qquad 13x+52=93.6.\] Dividing by $13$ we get $x+4=7.2\implies x=\frac{16}{5}$ so our answer is $\boxed{21}$

Answer: B 21
Problem: In triangle $ABC$ $AB=13$ $BC=14$ , and $CA=15$ . Distinct points $D$ $E$ , and $F$ lie on segments $\overline{BC}$ $\overline{CA}$ , and $\overline{DE}$ , respectively, such that $\overline{AD}\perp\overline{BC}$ $\overline{DE}\perp\overline{AC}$ , and $\overline{AF}\perp\overline{BF}$ . The length of segment $\overline{DF}$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. What is $m+n$
$\textbf{(A)}\ 18\qquad\textbf{(B)}\ 21\qquad\textbf{(C)}\ 24\qquad\textbf{(D)}\ 27\qquad\textbf{(E)}\ 30$

Solution: From solution 1, we know that $AD = 12$ and $DC = 9$ . Since $\triangle ADC \sim \triangle DEC$ , we can figure out that $DE = \frac{36}{5}$ . We also know what $AC$ is so we can figure what $AE$ is: $AE = 15 - \frac{27}{5} = \frac{48}{5}$ . Quadrilateral $ABDF$ is cyclic, implying that $\angle{B} + \angle{DFA}$ = 180°. Therefore, $\angle{B} = 180 - \angle{DFA} = \angle{EFA}$ , and triangles $\triangle AEF \sim \triangle ADB$ . Solving the resulting proportion gives $EF = 4$ . Therefore, $DF = ED - EF = \frac{16}{5}$ $m + n = 16 + 5 = 21$ and our answer is $\boxed{21}$

Answer: B 21