Navvye/Olympiad-Problems-CSV huggingface dataset:
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: If we draw a diagram as given, but then add point $G$ on $\overline{BC}$ such that $\overline{FG}\perp\overline{BC}$ in order to use the Pythagorean theorem, we end up with similar triangles $\triangle{DFG}$ and $\triangle{DCE}$ . Thus, $FG=\tfrac35x$ and $DG=\tfrac45x$ , where $x$ is the length of $\overline{DF}$ . Using the Pythagorean theorem, we now get \[BF = \sqrt{\left(\frac45x+ 5\right)^2 + \left(\frac35x\right)^2}\] and $AF$ can be found out noting that $AE$ is just $\tfrac{48}5$ through base times height (since $12\cdot 9 = 15 \cdot \tfrac{36}5$ , similar triangles gives $AE = \tfrac{48}5$ ), and that $EF$ is just $\tfrac{36}5 - x$ .  From there, \[AF = \sqrt{\left(\frac{36}5 - x\right)^2 + \left(\frac{48}5\right)^2}.\] Now, $BF^2 + AF^2 = 169$ , and squaring and adding both sides and subtracting a 169 from both sides gives $2x^2 - \tfrac{32}5x = 0$ , so $x = \tfrac{16}5$ . Thus, the 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: First, we find $BD = 5$ $DC = 9$ , and $AD = 12$ via the Pythagorean Theorem or by using similar triangles. Next, because $DE$ is an altitude of triangle $ADC$ $DE = \frac{AD\cdot DC}{AC} = \frac{36}{5}$ . Using that, we can use the Pythagorean Theorem and similar triangles to find $EC = \frac{27}{5}$ and $AE = \frac{48}{5}$
Points $A$ $B$ $D$ , and $F$ all lie on a circle whose diameter is $AB$ . Let the point where the circle intersects $AC$ be $G$ . Using power of a point, we can write the following equation to solve for $AG$ \[DC\cdot BC = CG\cdot AC\] \[9\cdot 14 = CG\cdot 15\] \[CG = 126/15\] Using that, we can find $AG = \frac{99}{15}$ , and using $AG$ , we can find that $GE = 3$
We can use power of a point again to solve for $DF$ \[FE\cdot DE = GE\cdot AE\] \[(\frac{36}{5} - DF)\cdot \frac{36}{5} = 3 \cdot \frac{48}{5}\] \[\frac{36}{5} - DF = 4\] \[DF = \frac{16}{5} = \frac{m}{n}\] Thus, $m+n = 16+5 = 21$ $\boxed{21}$

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

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

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

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

Answer: A 1
Problem: Bernardo chooses a three-digit positive integer $N$ and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer $S$ . For example, if $N = 749$ , Bernardo writes the numbers $10,\!444$ and $3,\!245$ , and LeRoy obtains the sum $S = 13,\!689$ . For how many choices of $N$ are the two rightmost digits of $S$ , in order, the same as those of $2N$
$\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 15 \qquad\textbf{(D)}\ 20 \qquad\textbf{(E)}\ 25$

Solution: First, we can examine the units digits of the number base 5 and base 6 and eliminate some possibilities.
Say that $N \equiv a \pmod{6}$
also that $N \equiv b \pmod{5}$
Substituting these equations into the question and setting the units digits of $2N$ and $S$ equal to each other, it can be seen that $b < 5$ (because otherwise $a$ and $b$ will have different parities), and thus $a=b$ $N \equiv a \pmod{6}$ $N \equiv  a \pmod{5}$ $\implies N=a \pmod{30}$ $0 \le a \le 4$
Therefore, $N$ can be written as $30x+y$ and $2N$ can be written as $60x+2y$
Just keep in mind that $y$ can be one of five choices: $0, 1, 2, 3,$ or $4$ , ;
Also, we have already found which digits of $y$ will add up into the units digits of $2N$
Now, examine the tens digit, $x$ by using $\mod{25}$ and $\mod{36}$ to find the tens digit (units digits can be disregarded because $y=0,1,2,3,4$ will always work)
Then we take $N=30x+y$ $\mod{25}$ and $\mod{36}$ to find the last two digits in the base $5$ and $6$ representation. \[N \equiv 30x \pmod{36}\] \[N \equiv 30x \equiv 5x \pmod{25}\] Both of those must add up to \[2N\equiv60x \pmod{100}\]
$33 \ge x \ge 4$
Now, since $y=0,1,2,3,4$ will always work if $x$ works, then we can treat $x$ as a units digit instead of a tens digit in the respective bases and decrease the mods so that $x$ is now the units digit. \[N \equiv 5x \pmod{6}\] \[N \equiv 6x \equiv x \pmod{5}\] \[2N\equiv 6x \pmod{10}\]
Say that $x=5m+n$ (m is between 0-6, n is 0-4 because of constraints on x)
Then
\[N \equiv 5m+n \pmod{5}\] \[N \equiv 25m+5n \pmod{6}\] \[2N\equiv30m + 6n \pmod{10}\]
and this simplifies to
\[N \equiv n \pmod{5}\] \[N \equiv m+5n \pmod{6}\] \[2N\equiv 6n \pmod{10}\]
From careful inspection, this is true when
$n=0, m=6$
$n=1, m=6$
$n=2, m=2$
$n=3, m=2$
$n=4, m=4$
This gives you $5$ choices for $x$ , and $5$ choices for $y$ , so the answer is $5* 5 = \boxed{25}$

Answer: E 25
Problem: Bernardo chooses a three-digit positive integer $N$ and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer $S$ . For example, if $N = 749$ , Bernardo writes the numbers $10,\!444$ and $3,\!245$ , and LeRoy obtains the sum $S = 13,\!689$ . For how many choices of $N$ are the two rightmost digits of $S$ , in order, the same as those of $2N$
$\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 15 \qquad\textbf{(D)}\ 20 \qquad\textbf{(E)}\ 25$

Solution: Notice that there are exactly $1000-100=900=5^2\cdot 6^2$ possible values of $N$ . This means, in $100\le N\le 999$ , every possible combination of $2$ digits will happen exactly once. We know that $N=900,901,902,903,904$ works because $900\equiv\dots00_5\equiv\dots00_6$
We know for sure that the units digit will add perfectly every $30$ added or subtracted, because $\text{lcm }5,6=30$ . So we only have to care about cases of $N$ every $30$ subtracted. In each case, $2N$ subtracts $6$ /adds $4$ $N_5$ subtracts $1$ and $N_6$ adds $1$ for the $10$ 's digit.
\[\textbf{5 }\textcolor{red}{\text{ 0}}\text{ 4 3 2 1 0 }\textcolor{red}{\text{4}}\text{ 3 2 1 0 4 3 2 1 0 4 }\textcolor{red}{\text{3 2}}\text{ 1 0 4 3 2 1 0 4 3 2 }\textcolor{red}{\text{1}}\]
\[\textbf{6 }\textcolor{red}{\text{ 0}}\text{ 1 2 3 4 5 }\textcolor{red}{\text{0}}\text{ 1 2 3 4 5 0 1 2 3 4 }\textcolor{red}{\text{5 0}}\text{ 1 2 3 4 5 0 1 2 3 4 }\textcolor{red}{\text{5}}\]
\[\textbf{10}\textcolor{red}{\text{ 0}}\text{ 4 8 2 6 0 }\textcolor{red}{\text{4}}\text{ 8 2 6 0 4 8 2 6 0 4 }\textcolor{red}{\text{8 2}}\text{ 6 0 4 8 2 6 0 4 8 2 }\textcolor{red}{\text{6}}\]
As we can see, there are $5$ cases, including the original, that work. These are highlighted in $\textcolor{red}{\text{red}}$ . So, thus, there are $5$ possibilities for each case, and $5\cdot 5=\boxed{25}$

Answer: E 25
Problem: Bernardo chooses a three-digit positive integer $N$ and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer $S$ . For example, if $N = 749$ , Bernardo writes the numbers $10,\!444$ and $3,\!245$ , and LeRoy obtains the sum $S = 13,\!689$ . For how many choices of $N$ are the two rightmost digits of $S$ , in order, the same as those of $2N$
$\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 15 \qquad\textbf{(D)}\ 20 \qquad\textbf{(E)}\ 25$

Solution: Notice that $N_5$ ranges from $3$ to $5$ digits and $N_6$ ranges from $3$ to $4$ digits.
Then let $a_i$ $b_i$ denotes the digits of $N_5$ $N_6$ , respectively such that \[0\le a_i<5,0\le b_i<6\] Thus we have \[N=5^4a_1+5^3a_2+5^2a_3+5a_4+a_5=6^3b_1+6^2b_2+6b_3+b_4\] \[625a_1+125a_2+25a_3+5a_4+a_5=216b_1+36b_2+6b_3+b_4\] Now we are given \[2N \equiv S \equiv N_5+N_6\pmod{100}\] \[2(625a_1+125a_2+25a_3+5a_4+a_5) \equiv (10000a_1+1000a_2+100a_3+10a_4+a_5)+(1000b_1+100b_2+10b_3+b_4)\pmod{100}\] \[1250a_1+250a_2+50a_3+10a_4+2a_5 \equiv 10000a_1+1000a_2+1000b_1+100a_3+100b_2+10a_4+10b_3+a_5+b_4\pmod{100}\] \[50a_1+50a_2+50a_3+10a_4+2a_5 \equiv 10a_4+10b_3+a_5+b_4\pmod{100}\] Canceling out $a_5$ left with \[50a_1+50a_2+50a_3+10a_4+a_5 \equiv 10a_4+10b_3+b_4\pmod{100}\]
Since $a_5$ $b_4$ determine the unit digits of the two sides of the congruence equation, we have $a_5=b_4=0,1,2,3,4$ . Thus,
\[50a_1+50a_2+50a_3+10a_4 \equiv 10a_4+10b_3\pmod{100}\] canceling out $10a_4$ , we have \[50a_1+50a_2+50a_3 \equiv 10b_3\pmod{100}\] \[5a_1+5a_2+5a_3 \equiv b_3\pmod{10}\] \[5(a_1+a_2+a_3) \equiv b_3\pmod{10}\]
Thus $b_3$ is a multiple of $5$
Now going back to our original equation \[625a_1+125a_2+25a_3+5a_4+a_5=216b_1+36b_2+6b_3+b_4\] Since $a_5=b_4$ \[625a_1+125a_2+25a_3+5a_4=216b_1+36b_2+6b_3\] \[5(125a_1+25a_2+5a_3+a_4)=6(36b_1+6b_2+b_3)\] \[5(125a_1+25a_2+5a_3+a_4)=6[6(6b_1+b_2)+b_3]\]
Since the left side is a multiple of $5$ , then so does the right side. Thus $5\mid6(6b_1+b_2)+b_3$
Since we already know that $5\mid b_3$ , then $5\mid6(6b_1+b_2)$ , from where we also know that $5\mid6b_1+b_2$
For $b_1,b_2<6$ , there is a total of 7 ordered pairs that satisfy the condition. Namely,
\[(b_1,b_2)=(0,0),(0,5),(1,4),(2,3),(3,2),(4,1),(5,0)\]
Since $N_6$ has at least $3$ digits, $(b_1,b_2)=(0,0)$ doesn't work. Furthermore, when $b_1=5$ $216b_1$ exceeds $1000$ which is not possible as $N$ is a three digit number, thus $(b_1,b_2)=(5,0)$ won't work as well.
Since we know that $a_i<5$ , for each of the ordered pairs $(b_1,b_2)$ , there is respectively one and only one solution $(a_1,a_2,a_3,a_4)$ that satisfies the equation
\[625a_1+125a_2+25a_3+5a_4=216b_1+36b_2+6b_3\]
Thus there are five solutions to the equation. Also since we have 5 possibilities for $a_5=b_4$ , we have a total of $5\cdot5=25$ values for $N$ $\boxed{25}$

Answer: E 25
Problem: Bernardo chooses a three-digit positive integer $N$ and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer $S$ . For example, if $N = 749$ , Bernardo writes the numbers $10,\!444$ and $3,\!245$ , and LeRoy obtains the sum $S = 13,\!689$ . For how many choices of $N$ are the two rightmost digits of $S$ , in order, the same as those of $2N$
$\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 15 \qquad\textbf{(D)}\ 20 \qquad\textbf{(E)}\ 25$

Solution: Observe that the maximum possible value of the sum of the last two digits of the base $5$ number and the base $6$ number is $44+55=99$ . 
Let $N \equiv a \pmod {25}$ and $N \equiv b \pmod {36}$
If $a < \frac{25}{2}$ $2N \equiv 2a \pmod {25}$ and if $a > \frac{25}{2}$ $2N \equiv 2a - 25 \pmod {25}$
Using the same logic for $b$ , if $b < 18$ $2N \equiv 2b \pmod {36}$ , and in the other case $2N \equiv 2b - 36 \pmod {36}$
We can do four cases:
Case 1: $a + b = 2a - 25 + 2b - 36 \implies a + b = 61$
For this case, there is trivially only one possible solution, $(a, b) = (25, 36)$ , which is equivalent to $(a, b) = (0, 0)$
Case 2: $a + b = 2a - 25 + 2b \implies a + b = 25$
Note that in this case, $a \geq 13$ must hold, and $b < 18$ must hold. 
We find the possible ordered pairs to be: $(13, 12), (14, 11), (15, 10), ..., (24, 1)$ for a total of $12$ ordered pairs.
Case 3: $a + b = 2a + 2b - 36 \implies a + b = 36$
Note that in this case, $b \geq 18$ must hold, and $a < 13$ must hold.
We find the possible ordered pairs to be: $(24, 12), (25, 11), (26, 10), ..., (35, 1)$ for a total of $12$ ordered pairs.
Case 4: $a + b = 2a + 2b$
Trivially no solutions except $(a, b) = (0, 0)$ , which matches the solution in Case 1, which makes this an overcount.
By CRT, each solution $(a, b)$ corresponds exactly one positive integer in a set of exactly $\text{lcm} (25, 36) = 900$ consecutive positive integers, and since there are $900$ positive integers between $100$ and $999$ , our induction is complete, and our answer is $1 + 12 + 12 = \boxed{25}$

Answer: E 25
Problem: Cagney can frost a cupcake every 20 seconds and Lacey can frost a cupcake every 30 seconds. Working together, how many cupcakes can they frost in 5 minutes?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 15\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 25\qquad\textbf{(E)}\ 30$

Solution: Cagney can frost one in $20$ seconds, and Lacey can frost one in $30$ seconds. Working together, they can frost one in $\frac{20\cdot30}{20+30} = \frac{600}{50} = 12$ seconds. In $300$ seconds ( $5$ minutes), they can frost $\boxed{25}$ cupcakes.

Answer: D 25
Problem: Cagney can frost a cupcake every 20 seconds and Lacey can frost a cupcake every 30 seconds. Working together, how many cupcakes can they frost in 5 minutes?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 15\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 25\qquad\textbf{(E)}\ 30$

Solution: In $300$ seconds ( $5$ minutes), Cagney will frost $\dfrac{300}{20} = 15$ cupcakes, and Lacey will frost $\dfrac{300}{30} = 10$ cupcakes. Therefore, working together they will frost $15 + 10 = \boxed{25}$ cupcakes.

Answer: D 25
Problem: Cagney can frost a cupcake every 20 seconds and Lacey can frost a cupcake every 30 seconds. Working together, how many cupcakes can they frost in 5 minutes?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 15\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 25\qquad\textbf{(E)}\ 30$

Solution: Since Cagney frosts $3$ cupcakes a minute, and Lacey frosts $2$ cupcakes a minute, they together frost $3+2=5$ cupcakes a minute. Therefore, in $5$ minutes, they frost $5\times5 = 25 \Rightarrow \boxed{25}$

Answer: D 25
Problem: A bug crawls along a number line, starting at $-2$ . It crawls to $-6$ , then turns around and crawls to $5$ . How many units does the bug crawl altogether?
$\textbf{(A)}\ 9\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 13\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ 15$

Solution: [asy] draw((-2,1)--(-6,1),red+dashed,EndArrow); draw((-6,2)--(5,2),blue+dashed,EndArrow); dot((-2,0)); dot((-6,0)); dot((5,0)); label("$-2$",(-2,0),dir(270)); label("$-6$",(-6,0),dir(270)); label("$5$",(5,0),dir(270)); label("$4$",(-4,0.9),dir(270)); label("$11$",(-1.5,2.5),dir(90)); [/asy]
Crawling from $-2$ to $-6$ takes it a distance of $4$ units. Crawling from $-6$ to $5$ takes it a distance of $11$ units. Add $4$ and $11$ to get $\boxed{15}$

Answer: E 15
Problem: Let $\angle ABC = 24^\circ$ and $\angle ABD = 20^\circ$ . What is the smallest possible degree measure for $\angle CBD$
$\textbf{(A)}\ 0\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 12$

Solution: $\angle ABD$ and $\angle ABC$ share ray $AB$ . In order to minimize the value of $\angle CBD$ $D$ should be located between $A$ and $C$
$\angle ABC = \angle ABD + \angle CBD$ , so $\angle CBD = 4$ . The answer is $\boxed{4}$

Answer: C 4
Problem: 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: B 200
Problem: The sums of three whole numbers taken in pairs are 12, 17, and 19. What is the middle number?
$\textbf{(A)}\ 4\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 8$

Solution: Let the three numbers be equal to $a$ $b$ , and $c$ . We can now write three equations:
$a+b=12$
$b+c=17$
$a+c=19$
Adding these equations together, we get that
$2(a+b+c)=48$ and
$a+b+c=24$
Substituting the original equations into this one, we find
$c+12=24$
$a+17=24$
$b+19=24$
Therefore, our numbers are 12, 7, and 5. The middle number is $\boxed{7}$

Answer: D 7
Problem: The sums of three whole numbers taken in pairs are 12, 17, and 19. What is the middle number?
$\textbf{(A)}\ 4\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 8$

Solution: Let the three numbers be $a$ $b$ and $c$ and $a<b<c$ . We get the three equations:
$a+b=12$
$a+c=17$
$b+c=19$
To isolate $b$ , We add the first and last equations and then subtract the second one.
$(a+b)+(b+c)-(a+c) = 12+19-17 \Rightarrow 2b=14 \Rightarrow b = 7$
Because $b$ is the middle number, the middle number is $\boxed{7}$

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

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

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

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

Answer: D 13
Problem: Mary divides a circle into 12 sectors. The central angles of these sectors, measured in degrees, are all integers and they form an arithmetic sequence. What is the degree measure of the smallest possible sector angle?
$\textbf{(A)}\ 5\qquad\textbf{(B)}\ 6\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 12$

Solution: Let $a_1$ be the first term of the arithmetic progression and $a_{12}$ be the last term of the arithmetic progression. From the formula of the sum of an arithmetic progression (or arithmetic series), we have $12*\frac{a_1+a_{12}}{2}=360$ , which leads us to $a_1 + a_{12} = 60$ $a_{12}$ , the largest term of the progression, can also be expressed as $a_1+11d$ , where $d$ is the common difference. Since each angle measure must be an integer, $d$ must also be an integer. We can isolate $d$ by subtracting $a_1$ from $a_{12}$ like so: $a_{12}-a_1=a_1+11d-a_1=11d$ . Since $d$ is an integer, the difference between the first and last terms, $11d$ , must be divisible by $11.$ Since the total difference must be less than $60$ , we can start checking multiples of $11$ less than $60$ for the total difference between $a_1$ and $a_{12}$ . We start with the largest multiple, because the maximum difference will result in the minimum value of the first term. If  the difference is $55$ $a_1=\frac{60-55}{2}=2.5$ , which is not an integer, nor is it one of the five options given. If the difference is $44$ $a_1=\frac{60-44}{2}$ , or $\boxed{8}$

Answer: C 8
Problem: Mary divides a circle into 12 sectors. The central angles of these sectors, measured in degrees, are all integers and they form an arithmetic sequence. What is the degree measure of the smallest possible sector angle?
$\textbf{(A)}\ 5\qquad\textbf{(B)}\ 6\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 12$

Solution: If we let $a$ be the smallest sector angle and $r$ be the difference between consecutive sector angles, then we have the angles $a, a+r, a+2r, \cdots. a+11r$ . Use the formula for the sum of an arithmetic sequence and set it equal to 360, the number of degrees in a circle.
\begin{align*} \frac{a+a+11r}{2}\cdot 12 &= 360\\ 2a+11r &= 60\\ a &= \frac{60-11r}{2} \end{align*}
All sector angles are integers so $r$ must be a multiple of 2. Plug in even integers for $r$ starting from 2 to minimize $a.$ We find this value to be 4 and the minimum value of $a$ to be $\frac{60-11(4)}{2} = \boxed{8}$

Answer: C 8