Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: Triangle $ABC$ has $AB=21$ $AC=22$ and $BC=20$ . Points $D$ and $E$ are located on $\overline{AB}$ and $\overline{AC}$ , respectively, such that $\overline{DE}$ is parallel to $\overline{BC}$ and contains the center of the inscribed circle of triangle $ABC$ . Then $DE=m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: Label $P$ the point the angle bisector of $A$ intersects ${BC}$ . First we find ${BP}$ and ${PC}$ . By the Angle Bisector Theorem, $\frac{BP}{PC} = \frac{21}{22}$ and solving for each using the fact that ${BC} = 20$ , we see that ${BP} = \frac{420}{43}$ and $PC = \frac{440}{43}$
\[{AP} = 21*22 - \frac{440}{43}\cdot\frac{420}{43}\] \[{AP} = 21*22 - \frac{440\cdot420}{43^2}\]
Now we can calculate what ${AO}$ is. Using the formula to find the distance from a vertex to the incenter, ${AO} = \frac{43}{63} \cdot[21\cdot22 - \frac{420*440}{43^2}] = \frac{43^2\cdot22 - 20\cdot440}{43\cdot3}$
Now because $\triangle{APE} ~ \triangle{ABC}$ , we can find ${DE}$ by $\frac{AO}{AP} \cdot 20$ . Dividing and simplifying, we see that $\frac{1}{21}\cdot\frac{43}{3}\cdot20 = \frac{860}{63}$ . So the answer is $\boxed{923}$

Answer:  923
Problem: Call a positive integer $N$ 7-10 double if the digits of the base- $7$ representation of $N$ form a base- $10$ number that is twice $N$ . For example, $51$ is a 7-10 double because its base- $7$ representation is $102$ . What is the largest 7-10 double?

Solution: Let $A$ be the base $10$ representation of our number, and let $B$ be its base $7$ representation.
Given this is an AIME problem, $A<1000$ . If we look at $B$ in base $10$ , it must be equal to $2A$ , so $B<2000$ when $B$ is looked at in base $10.$
If $B$ in base $10$ is less than $2000$ , then $B$ as a number in base $7$ must be less than $2*7^3=686$
$686$ is non-existent in base $7$ , so we're gonna have to bump that down to $666_7$
This suggests that $A$ is less than $\frac{666}{2}=333$
Guess and check shows that $A<320$ , and checking values in that range produces $\boxed{315}$

Answer:  315
Problem: Call a positive integer $N$ 7-10 double if the digits of the base- $7$ representation of $N$ form a base- $10$ number that is twice $N$ . For example, $51$ is a 7-10 double because its base- $7$ representation is $102$ . What is the largest 7-10 double?

Solution: Since this is an AIME problem, the maximum number of digits the 7-10 double can have is 3.  Let the number be \[abc\] in base 7. Then the number in expanded form is \[49a+7b+c\] in base 7 and \[100a+10b+c\] in base 10.  Since the number in base 7 is half the number in base 10, we get the following equation. \[98a+14b+2c=100a+10b+c\] which simplifies to \[2a=4b+c.\] The largest possible value of a is 6 because the number is in base 7.  Then to maximize the number, $b$ is $3$ and $c$ is $0$ .  Therefore, the largest 7-10 double is 630 in base 7, or $\boxed{315}$ in base 10.

Answer:  315
Problem: In triangle $ABC$ $AB=13$ $BC=15$ and $CA=17$ . Point $D$ is on $\overline{AB}$ $E$ is on $\overline{BC}$ , and $F$ is on $\overline{CA}$ . Let $AD=p\cdot AB$ $BE=q\cdot BC$ , and $CF=r\cdot CA$ , where $p$ $q$ , and $r$ are positive and satisfy $p+q+r=2/3$ and $p^2+q^2+r^2=2/5$ . The ratio of the area of triangle $DEF$ to the area of triangle $ABC$ can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: We let $[\ldots]$ denote area; then the desired value is
Using the formula for the area of a triangle $\frac{1}{2}ab\sin C$ , we find that
and similarly that $\frac{[BDE]}{[ABC]} = q(1-p)$ and $\frac{[CEF]}{[ABC]} = r(1-q)$ . Thus, we wish to find \begin{align*}\frac{[DEF]}{[ABC]} &= 1 - \frac{[ADF]}{[ABC]} - \frac{[BDE]}{[ABC]} - \frac{[CEF]}{[ABC]}  \\ &= 1 - p(1-r) - q(1-p) - r(1-q)\\ &= (pq + qr + rp) - (p + q + r) + 1 \end{align*} We know that $p + q + r = \frac 23$ , and also that $(p+q+r)^2 = p^2 + q^2 + r^2 + 2(pq + qr + rp) \Longleftrightarrow pq + qr + rp = \frac{\left(\frac 23\right)^2 - \frac 25}{2} = \frac{1}{45}$ . Substituting, the answer is $\frac 1{45} - \frac 23 + 1 = \frac{16}{45}$ , and $m+n = \boxed{061}$

Answer:  061
Problem: In triangle $ABC$ $AB=13$ $BC=15$ and $CA=17$ . Point $D$ is on $\overline{AB}$ $E$ is on $\overline{BC}$ , and $F$ is on $\overline{CA}$ . Let $AD=p\cdot AB$ $BE=q\cdot BC$ , and $CF=r\cdot CA$ , where $p$ $q$ , and $r$ are positive and satisfy $p+q+r=2/3$ and $p^2+q^2+r^2=2/5$ . The ratio of the area of triangle $DEF$ to the area of triangle $ABC$ can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: By the barycentric area formula, our desired ratio is equal to \begin{align*} \begin{vmatrix} 1-p & p & 0 \\  0 & 1-q & q  \\  r & 0 & 1-r \notag \end{vmatrix} &=1-p-q-r+pq+qr+pr\\ &=1-(p+q+r)+\frac{(p+q+r)^2-(p^2+q^2+r^2)}{2}\\ &=1-\frac{2}{3}+\frac{\frac{4}{9}-\frac{2}{5}}{2}\\ &=\frac{16}{45} \end{align*}, so the answer is $\boxed{061}$

Answer:  061
Problem: In triangle $ABC$ $AB=13$ $BC=15$ and $CA=17$ . Point $D$ is on $\overline{AB}$ $E$ is on $\overline{BC}$ , and $F$ is on $\overline{CA}$ . Let $AD=p\cdot AB$ $BE=q\cdot BC$ , and $CF=r\cdot CA$ , where $p$ $q$ , and $r$ are positive and satisfy $p+q+r=2/3$ and $p^2+q^2+r^2=2/5$ . The ratio of the area of triangle $DEF$ to the area of triangle $ABC$ can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: Since the only conditions are that $p + q + r = \frac{2}{3}$ and $p^2 + q^2 + r^2 = \frac{2}{5}$ , we can simply let one of the variables be equal to 0. In this case, let $p = 0$ . Then, $q + r = \frac{2}{3}$ and $q^2 + r^2$ $\frac{2}{5}$ . Note that the ratio between the area of $DEF$ and $ABC$ is equivalent to $(1-q)(1-r)$ . Solving this system of equations, we get $q = \frac{1}{3} \pm \sqrt{\frac{4}{45}}$ , and $r = \frac{1}{3} \mp \sqrt{\frac{4}{45}}$ . Plugging back into $(1-q)(1-r)$ , we get $\frac{16}{45}$ , so the answer is $\boxed{061}$

Answer:  061
Problem: Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers.  Find $m + n.$

Solution: The distance between the $x$ $y$ , and $z$ coordinates must be even so that the midpoint can have integer coordinates. Therefore,
However, we have $3\cdot 4\cdot 5 = 60$ cases where we have simply taken the same point twice, so we subtract those. Therefore, our answer is $\frac {5\cdot 8\cdot 13 - 60}{60\cdot 59} = \frac {23}{177}\Longrightarrow m+n = \boxed{200}$

Answer:  200
Problem: Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers.  Find $m + n.$

Solution: There are $(2 + 1)(3 + 1)(4 + 1) = 60$ points in total. We group the points by parity of each individual coordinate -- that is, if $x$ is even or odd, $y$ is even or odd, and $z$ is even or odd. Note that to have something that works, the two points must have this same type of classification (otherwise, if one doesn't match, the resulting sum for the coordinates will be odd at that particular spot).
There are $12$ EEEs (the first position denotes the parity of $x,$ the second $y,$ and the third $z.$ ), $8$ EEOs, $12$ EOEs, $6$ OEEs, $8$ EOOs, $4$ OEOs, $6$ OOEs, and $4$ OOOs. Doing a sanity check, $12 + 8 + 12 + 6 + 8 + 4 + 6 + 4 = 60,$ which is the total number of points.
Now, we can see that there are $12 \cdot 11$ ways to choose two EEEs (respective to order), $8 \cdot 7$ ways to choose two EEOs, and so on. Therefore, we get \[12\cdot11 + 8\cdot7 + 12\cdot11 + 6\cdot5 + 8\cdot7 + 4\cdot3 + 6\cdot5 + 4\cdot3 = 460\] ways to choose two points where order matters. There are $60 \cdot 59$ total ways to do this, so we get a final answer of \[\dfrac{460}{60 \cdot 59} = \dfrac{23}{3 \cdot 59} = \dfrac{23}{177},\] for our answer of $23 + 177 = \boxed{200}.$

Answer:  200
Problem: Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers.  Find $m + n.$

Solution: Similarly to Solution 2, we note that there are $60$ points and that the parities of the two points' coordinates must be the same in order for the midpoint to be in $S$
Ignore the distinct points condition. The probability that the midpoint is in $S$ is then \[\left(\left(\frac 23\right)^2+\left(\frac 13\right)^2\right)\left(\left(\frac 24\right)^2+\left(\frac 24\right)^2\right)\left(\left(\frac 35\right)^2+\left(\frac 25\right)^2\right)=\frac{13}{90}.\]
Note that $\frac{13}{90}=\frac{520}{3600}$ . Since there are $3600$ total ways to choose $2$ points from $S$ , there must be $520$ pairs of points that have their midpoint in $S$ . Of these pairs, $60$ of them contain identical points (not distinct).
Subtracting these cases, our answer is $\frac{520-60}{3600-60}=\frac{23}{177}\implies\boxed{200}$

Answer:  200
Problem: In a rectangular array of points, with 5 rows and $N$ columns, the points are numbered consecutively from left to right beginning with the top row.  Thus the top row is numbered 1 through $N,$ the second row is numbered $N + 1$ through $2N,$ and so forth.  Five points, $P_1, P_2, P_3, P_4,$ and $P_5,$ are selected so that each $P_i$ is in row $i.$ Let $x_i$ be the number associated with $P_i.$ Now renumber the array consecutively from top to bottom, beginning with the first column.  Let $y_i$ be the number associated with $P_i$ after the renumbering.  It is found that $x_1 = y_2,$ $x_2 = y_1,$ $x_3 = y_4,$ $x_4 = y_5,$ and $x_5 = y_3.$ Find the smallest possible value of $N.$

Solution: Let each point $P_i$ be in column $c_i$ . The numberings for $P_i$ can now be defined as follows. \begin{align*}x_i &= (i - 1)N + c_i\\ y_i &= (c_i - 1)5 + i \end{align*}
We can now convert the five given equalities. \begin{align}x_1&=y_2 & \Longrightarrow & & c_1 &= 5 c_2-3\\ x_2&=y_1 & \Longrightarrow & & N+c_2 &= 5 c_1-4\\ x_3&=y_4 & \Longrightarrow & & 2 N+c_3 &= 5 c_4-1\\ x_4&=y_5 & \Longrightarrow & & 3 N+c_4 &= 5 c_5\\ x_5&=y_3 & \Longrightarrow & & 4 N+c_5 &= 5 c_3-2 \end{align} Equations $(1)$ and $(2)$ combine to form \[N = 24c_2 - 19\] Similarly equations $(3)$ $(4)$ , and $(5)$ combine to form \[117N +51 = 124c_3\] Take this equation modulo 31 \[24N+20\equiv 0 \pmod{31}\] And substitute for N \[24 \cdot 24 c_2 - 24 \cdot 19 +20\equiv 0 \pmod{31}\] \[18 c_2 \equiv 2 \pmod{31}\]
Thus the smallest $c_2$ might be is $7$ and by substitution $N = 24 \cdot 7 - 19 = 149$
The column values can also easily be found by substitution \begin{align*}c_1&=32\\ c_2&=7\\ c_3&=141\\ c_4&=88\\ c_5&=107 \end{align*} As these are all positive and less than $N$ $\boxed{149}$ is the solution.

Answer:  149
Problem: In a rectangular array of points, with 5 rows and $N$ columns, the points are numbered consecutively from left to right beginning with the top row.  Thus the top row is numbered 1 through $N,$ the second row is numbered $N + 1$ through $2N,$ and so forth.  Five points, $P_1, P_2, P_3, P_4,$ and $P_5,$ are selected so that each $P_i$ is in row $i.$ Let $x_i$ be the number associated with $P_i.$ Now renumber the array consecutively from top to bottom, beginning with the first column.  Let $y_i$ be the number associated with $P_i$ after the renumbering.  It is found that $x_1 = y_2,$ $x_2 = y_1,$ $x_3 = y_4,$ $x_4 = y_5,$ and $x_5 = y_3.$ Find the smallest possible value of $N.$

Solution: If we express all the $c_i$ in terms of $N$ , we have \[24c_1=5N+23\] \[24c_2=N+19\] \[124c_3=117N+51\] \[124c_4=73N+35\] \[124c_5=89N+7\]
It turns out that there exists such an array satisfying the problem conditions if and only if \[N\equiv 149 \pmod{744}\]
In addition, the first two equation can be written $n = 5mod24$ , and chasing variables in the last three equation gives us $89n + 7 = 124e$ . With these two equations you may skip a lot of rewriting and testing. $\boxed{149}$ still appears as our answer.

Answer:  149
Problem: sphere is inscribed in the tetrahedron whose vertices are $A = (6,0,0), B = (0,4,0), C = (0,0,2),$ and $D = (0,0,0).$ The radius of the sphere is $m/n,$ where $m$ and $n$ are relatively prime positive integers.  Find $m + n.$

Solution: [asy] import three;  currentprojection = perspective(-2,9,4); triple A = (6,0,0), B = (0,4,0), C = (0,0,2), D = (0,0,0); triple E = (2/3,0,0), F = (0,2/3,0), G = (0,0,2/3), L = (0,2/3,2/3), M = (2/3,0,2/3), N = (2/3,2/3,0); triple I = (2/3,2/3,2/3); triple J = (6/7,20/21,26/21); draw(C--A--D--C--B--D--B--A--C); draw(L--F--N--E--M--G--L--I--M--I--N--I--J); label("$I$",I,W); label("$A$",A,S); label("$B$",B,S); label("$C$",C,W*-1); label("$D$",D,W*-1); [/asy]
The center $I$ of the insphere must be located at $(r,r,r)$ where $r$ is the sphere's radius. $I$ must also be a distance $r$ from the plane $ABC$
The signed distance between a plane and a point $I$ can be calculated as $\frac{(I-G) \cdot P}{|P|}$ , where G is any point on the plane, and P is a vector perpendicular to ABC.
A vector $P$ perpendicular to plane $ABC$ can be found as $V=(A-C)\times(B-C)=\langle 8, 12, 24 \rangle$
Thus $\frac{(I-C) \cdot P}{|P|}=-r$ where the negative comes from the fact that we want $I$ to be in the opposite direction of $P$
\begin{align*}\frac{(I-C) \cdot P}{|P|}&=-r\\ \frac{(\langle r, r, r \rangle-\langle 0, 0, 2 \rangle) \cdot P}{|P|}&=-r\\ \frac{\langle r, r, r-2 \rangle \cdot \langle 8, 12, 24 \rangle}{\langle 8, 12, 24 \rangle}&=-r\\ \frac{44r -48}{28}&=-r\\ 44r-48&=-28r\\ 72r&=48\\ r&=\frac{2}{3} \end{align*}
Finally $2+3=\boxed{005}$

Answer:  005
Problem: sphere is inscribed in the tetrahedron whose vertices are $A = (6,0,0), B = (0,4,0), C = (0,0,2),$ and $D = (0,0,0).$ The radius of the sphere is $m/n,$ where $m$ and $n$ are relatively prime positive integers.  Find $m + n.$

Solution: Notice that we can split the tetrahedron into $4$ smaller tetrahedrons such that the height of each tetrahedron is $r$ and the base of each tetrahedron is one of the faces of the original tetrahedron. This is because the bases of the tetrahedrons are tangent to the sphere, so the line from the center to the foot of the perpendicular to the bases hits the tangency points. Letting volume be $V$ and surface area be $F$ , using the volume formula for each pyramid(base times height divided by 3) we have $\dfrac{rF}{3}=V$ . The surface area of the pyramid is $\dfrac{6\cdot{4}+6\cdot{2}+4\cdot{2}}{2}+[ABC]=22+[ABC]$ . We know triangle ABC's side lengths, $\sqrt{2^{2}+4^{2}}, \sqrt{2^{2}+6^{2}},$ and $\sqrt{4^{2}+6^{2}}$ , so using the expanded form of heron's formula, \begin{align*}[ABC]&=\sqrt{\dfrac{2(a^{2}b^{2}+b^{2}c^{2}+a^{2}c^{2})-a^{4}-b^{4}-c^{4}}{16}}\\ &=\sqrt{2(5\cdot{13}+10\cdot{5}+13\cdot{10})-5^{2}-10^{2}-13^{2}}\\ &=\sqrt{196}\\ &=14\end{align*} Therefore, the surface area is $14+22=36$ , and the volume is $\dfrac{[BCD]\cdot{6}}{3}=\dfrac{4\cdot{2}\cdot{6}}{3\cdot{2}}=8$ , and using the formula above that $\dfrac{rF}{3}=V$ , we have $12r=8$ and thus $r=\dfrac{2}{3}$ , so the desired answer is $2+3=\boxed{005}$

Answer:  005
Problem: sphere is inscribed in the tetrahedron whose vertices are $A = (6,0,0), B = (0,4,0), C = (0,0,2),$ and $D = (0,0,0).$ The radius of the sphere is $m/n,$ where $m$ and $n$ are relatively prime positive integers.  Find $m + n.$

Solution: First let us find the equation of the plane passing through $(6,0,0), (0,0,2), (0,4,0)$ .  The "point-slope form" is $A(6-x1)+B(0-y1)+C(0-z1)=0.$ Plugging in $(0,0,2)$ gives $A(6)+B(0)+C(-2)=0.$ Plugging in $(0,4,0)$ gives $A(6)+B(-4)+C(0)=0.$ We can then use Cramer's rule/cross multiplication to get $A/(0-8)=-B/(0+12)=C/(-24)=k.$ Solve for A, B, C to get $2k, 3k, 6k$ respectively.  We can then get $2k(x-x1)+3k(y-y1)+6k(z-z1)=0.$ Cancel out k on both sides. Next, let us substitute $(0,0,2)$ .  We can then get $2x+3y+6z=12$ as the equation of the plane.  We can divide the equation by its magnitude to get the normal form of the plane.  We get $2x/7+2y/7+6z/7=12/7$ to be the normal form.  Note that the point is going to be at $(r,r,r).$ We find the distance from $(r,r,r)$ to the plane as $2/7r+3/7r+6/7r-12/7/(\sqrt{(4/49+9/49+36/49)})$ , which is $+/-(11r/7-12/7)$ .  We take the negative value of this because if we plug in $(0,0,0)$ to the equation of the plane we get a negative value.  We equate that value to r and we get the equation $-(11r/7-12/7)=r$ to solve $r={2/3}$ , so the answer is $\boxed{005}$

Answer:  005
Problem: sphere is inscribed in the tetrahedron whose vertices are $A = (6,0,0), B = (0,4,0), C = (0,0,2),$ and $D = (0,0,0).$ The radius of the sphere is $m/n,$ where $m$ and $n$ are relatively prime positive integers.  Find $m + n.$

Solution: Clearly, if the radius of the sphere is $r$ , the center of the sphere lies on $(r, r, r)$
We find the equation of plane $ABC$ to be $\frac16 x+\frac14 y+\frac12 z=1$ . From the definition of the insphere, it must be true that the distance from the center of the sphere to plane $ABC$ is equal to the length of the radius of the sphere. By point-to-plane, we have \[r=\frac{|\frac16 r+\frac14 r+\frac12 r-1|}{\sqrt{\left(\frac16\right)^2+\left(\frac14\right)^2+\left(\frac12\right)^2}} \implies r=\frac23,\] so the answer is $\boxed{005}$

Answer:  005
Problem: In a certain circle , the chord of a $d$ -degree arc is $22$ centimeters long, and the chord of a $2d$ -degree arc is $20$ centimeters longer than the chord of a $3d$ -degree arc, where $d < 120.$ The length of the chord of a $3d$ -degree arc is $- m + \sqrt {n}$ centimeters, where $m$ and $n$ are positive integers.  Find $m + n.$

Solution: Note that a cyclic quadrilateral in the form of an isosceles trapezoid can be formed from three chords of three $d$ -degree arcs and one chord of one $3d$ -degree arc. The diagonals of this trapezoid turn out to be two chords of two $2d$ -degree arcs. Let $AB$ $AC$ , and $BD$ be the chords of the $d$ -degree arcs, and let $CD$ be the chord of the $3d$ -degree arc. Also let $x$ be equal to the chord length of the $3d$ -degree arc. Hence, the length of the chords, $AD$ and $BC$ , of the $2d$ -degree arcs can be represented as $x + 20$ , as given in the problem.
Using Ptolemy's theorem,
\[AB(CD) + AC(BD) = AD(BC)\] \[22x + 22(22)  = (x + 20)^2\] \[22x + 484 = x^2 + 40x + 400\] \[0 = x^2 + 18x - 84\]
We can then apply the quadratic formula to find the positive root to this equation since polygons obviously cannot have sides of negative length. \[x = \frac{-18 + \sqrt{18^2 + 4(84)}}{2}\] \[x = \frac{-18 + \sqrt{660}}{2}\]
$x$ simplifies to $\frac{-18 + 2\sqrt{165}}{2},$ which equals $-9 + \sqrt{165}.$ Thus, the answer is $9 + 165 = \boxed{174}$

Answer:  174
Problem: In a certain circle , the chord of a $d$ -degree arc is $22$ centimeters long, and the chord of a $2d$ -degree arc is $20$ centimeters longer than the chord of a $3d$ -degree arc, where $d < 120.$ The length of the chord of a $3d$ -degree arc is $- m + \sqrt {n}$ centimeters, where $m$ and $n$ are positive integers.  Find $m + n.$

Solution: Let $z=\frac{d}{2},$ and $R$ be the circumradius. From the given information, \[2R\sin z=22\] \[2R(\sin 2z-\sin 3z)=20\] Dividing the latter by the former, \[\frac{2\sin z\cos z-(3\cos^2z\sin z-\sin^3 z)}{\sin z}=2\cos z-(3\cos^2z-\sin^2z)=1+2\cos z-4\cos^2z=\frac{10}{11}\] \[4\cos^2z-2\cos z-\frac{1}{11}=0 (1)\] We want to find \[\frac{22\sin (3z)}{\sin z}=22(3-4\sin^2z)=22(4\cos^2z-1).\] From $(1),$ this is equivalent to $44\cos z-20.$ Using the quadratic formula, we find that the desired length is equal to $\sqrt{165}-9,$ so our answer is $\boxed{174}$

Answer:  174
Problem: In a certain circle , the chord of a $d$ -degree arc is $22$ centimeters long, and the chord of a $2d$ -degree arc is $20$ centimeters longer than the chord of a $3d$ -degree arc, where $d < 120.$ The length of the chord of a $3d$ -degree arc is $- m + \sqrt {n}$ centimeters, where $m$ and $n$ are positive integers.  Find $m + n.$

Solution: Let $z=\frac{d}{2}$ $R$ be the circumradius, and $a$ be the length of 3d degree chord. Using the extended sine law, we obtain: \[22=2R\sin(z)\] \[20+a=2R\sin(2z)\] \[a=2R\sin(3z)\] Dividing the second from the first we get $\cos(z)=\frac{20+a}{44}$ By the triple angle formula we can manipulate the third equation as follows: $a=2R\times \sin(3z)=\frac{22}{\sin(z)} \times (3\sin(z)-4\sin^3(z)) = 22(3-4\sin^2(z))=22(4\cos^2(z)-1)=\frac{(20+a)^2}{22}-22$ Solving the quadratic equation gives the answer to be $\boxed{174}$

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

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

Answer:  351