Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1.$ Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b.$ Find the sum of all possible values of $(a+b)^2.$

Solution: Either $P(3) = P(4)$ or not. We first see that if $P(3) = P(4)$ it's easy to obtain by Vieta's that $(a+b)^2 = 49$ . Now, take $P(3) \neq P(4)$ and WLOG $P(3) = P(a), P(4) = P(b)$ . Now, consider the parabola formed by the graph of $P$ . It has vertex $\frac{3+a}{2}$ . Now, say that $P(x) = x^2 - (3+a)x + c$ . We note $P(3)P(4) = c = P(3)\left(4 - 4a + \frac{8a - 1}{2}\right) \implies a = \frac{7P(3) + 1}{8}$ . Now, we note $P(4) = \frac{7}{2}$ by plugging in again. Now, it's easy to find that $a = -2.5, b = -3.5$ , yielding a value of $36$ . Finally, we add $49 + 36 = \boxed{085}$ . ~awang11, charmander3333

Answer:  085
Problem: Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1.$ Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b.$ Find the sum of all possible values of $(a+b)^2.$

Solution: Let the roots of $P(x)$ be $m$ and $n$ , then we can write \[P(x)=x^2-(m+n)x+mn\] The fact that $P(P(x))=0$ has solutions $x=3,4,a,b$ implies that some combination of $2$ of these are the solution to $P(x)=m$ , and the other $2$ are the solution to $P(x)=n$ . It's fairly easy to see there are only $2$ possible such groupings: $P(3)=P(4)=m$ and $P(a)=P(b)=n$ , or $P(3)=P(a)=m$ and $P(4)=P(b)=n$ (Note that $a,b$ are interchangeable, and so are $m$ and $n$ ). We now casework: 
If $P(3)=P(4)=m$ , then \[9-3(m+n)+mn=16-4(m+n)+mn=m \implies m+n=7\] \[a^2-a(m+n)+mn=b^2-b(m+n)+mn=n \implies a+b=m+n=7\] so this gives $(a+b)^2=7^2=49$ . 
Next, if $P(3)=P(a)=m$ , then \[9-3(m+n)+mn=a^2-a(m+n)+mn=m \implies a+3=m+n\] \[16-4(m+n)+mn=b^2-b(m+n)+mn=n \implies b+4=m+n\] Subtracting the first part of the first equation from the first part of the second equation gives \[7-(m+n)=n-m \implies 2n=7 \implies n=\frac{7}{2} \implies m=-3\] Hence, $a+b=2(m+n)-7=2\cdot \frac{1}{2}-7=-6$ , and so $(a+b)^2=(-6)^2=36$ . 
Therefore, the solution is $49+36=\boxed{085}$ ~ktong

Answer:  085
Problem: Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1.$ Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b.$ Find the sum of all possible values of $(a+b)^2.$

Solution: Write $P(x) = x^2+wx+z$ . Split the problem into two cases: $P(3)\ne P(4)$ and $P(3) = P(4)$
Case 1: We have $P(3) \ne P(4)$ . We must have \[w=-P(3)-P(4) = -(9+3w+z)-(16+4w+z) = -25-7w-2z.\] Rearrange and divide through by $8$ to obtain \[w = \frac{-25-2z}{8}.\] Now, note that \[z = P(3)P(4) = (9+3w+z)(16+4w+z) = \left(9 + 3\cdot \frac{-25-2z}{8} + z\right)\left(16 + 4 \cdot \frac{-25-2z}{8} + z\right) =\] \[\left(-\frac{3}{8} + \frac{z}{4}\right)\left(\frac{7}{2}\right) = -\frac{21}{16} + \frac{7z}{8}.\] Now, rearrange to get \[\frac{z}{8} = -\frac{21}{16}\] and thus \[z = -\frac{21}{2}.\] Substituting this into our equation for $w$ yields $w = -\frac{1}{2}$ . Then, it is clear that $P$ does not have a double root at $P(3)$ , so we must have $P(a) = P(3)$ and $P(b) = P(4)$ or vice versa. This gives $3+a = \frac{1}{2}$ and $4+b = \frac{1}{2}$ or vice versa, implying that $a+b = 1-3-4 = -6$ and $(a+b)^2 = 36$
Case 2: We have $P(3) = P(4)$ . Then, we must have $w = -7$ . It is clear that $P(a) = P(b)$ (we would otherwise get $P(a)=P(3)=P(4)$ implying $a \in \{3,4\}$ or vice versa), so $a+b=-w=7$ and $(a+b)^2 = 49$
Thus, our final answer is $49+36=\boxed{085}$ . ~GeronimoStilton

Answer:  085
Problem: Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1.$ Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b.$ Find the sum of all possible values of $(a+b)^2.$

Solution: Note that because $P\big(P(3)\big)=P\big(P(4)\big)= 0$ $P(3)$ and $P(4)$ are roots of $P(x)$ . There are two cases.
CASE 1: $P(3) = P(4)$ . Then $P(x)$ is symmetric about $x=\tfrac72$ ; that is to say, $P(r) = P(7-r)$ for all $r$ . Thus the remaining two roots must sum to $7$ . Indeed, the polynomials $P(x) = \left(x-\frac72\right)^2 + \frac{11}4 \pm i\sqrt3$ satisfy the conditions.
CASE 2: $P(3)\neq P(4)$ . Then $P(3)$ and $P(4)$ are the two distinct roots of $P(x)$ , so \[P(x) = \big(x-P(3)\big)\big(x-P(4)\big)\] for all $x$ . Note that any solution to $P\big(P(x)\big) = 0$ must satisfy either $P(x) = P(3)$ or $P(x) = P(4)$ . Because $P(x)$ is quadratic, the polynomials $P(x) - P(3)$ and $P(x) - P(4)$ each have the same sum of roots as the polynomial $P(x)$ , which is $P(3) + P(4)$ . Thus the answer in this case is $2\big(P(3) + P(4)\big)-7$ , and so it suffices to compute the value of $P(3)+P(4)$
Let $P(3)=u$ and $P(4) = v$ . Substituting $x=3$ and $x=4$ into the above quadratic polynomial yields the system of equations \begin{align*} u &= (3-u)(3-v) = 9 - 3u - 3v + uv\\ v &= (4-u)(4-v) = 16 - 4u - 4v + uv. \end{align*} Subtracting the first equation from the second gives $v - u = 7 - u - v$ , yielding $v = \frac72.$ Substituting this value into the second equation gives \[\dfrac72 = \left(4 - u\right)\left(4 - \dfrac72\right),\] yielding $u = -3.$ The sum of the two solutions is $2\left(\tfrac72-3\right)-7 = -6$ . In this case, $P(x)= (x+3)\left(x-\frac72\right)$
The requested sum of squares is $7^2+(-6)^2 = \boxed{085}$

Answer:  085
Problem: Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1.$ Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b.$ Find the sum of all possible values of $(a+b)^2.$

Solution: Let $P(x) = (x-c)^2 - d$ for some $c$ $d$
Then, we can write $P(P(x)) = ((x-c)^2 - d - c)^2 - d$ . Setting the expression equal to $0$ and solving for $x$ gives:
$x = \pm \sqrt{ \pm \sqrt{d} + d + c} + c$
Therefore, we have that $x$ takes on the four values $\sqrt{\sqrt{d} + d + c} + c$ $-\sqrt{\sqrt{d} + d + c} + c$ $\sqrt{-\sqrt{d} + d + c} + c$ , and $-\sqrt{-\sqrt{d} + d + c} + c$ . Two of these values are $3$ and $4$ , and the other two are $a$ and $b$
We can split these four values into two "groups" based on the radicand in the expression - for example, the first group consists of the first two values listed above, and the second group consists of the other two values.
$\textbf{Case 1}$ : Both the 3 and 4 values are from the same group.
In this case, the $a$ and $b$ values are both from the other group. The sum of this is just $2c$ because the radical cancels out. Because of this, we can see that $c$ is just the average of $3$ and $4$ , so we have $2c = 3 + 4 = 7$ , so $(a+b)^2 = 7^2 = 49$
$\textbf{Case 2}$ : The 3 and 4 values come from different groups.
It is easy to see that all possibilities in this case are basically symmetric and yield the same value for $(a+b)^2$ . Without loss of generality, assume that $\sqrt{\sqrt{d} + d + c} + c = 4$ and $\sqrt{-\sqrt{d} + d + c} + c = 3$ . Note that we can't switch the values of these two expressions since the first one is guaranteed to be larger.
We can write $\sqrt{\sqrt{d} + d + c} + c = 1 + \sqrt{-\sqrt{d} + d + c} + c$
Moving most terms to the left side and simplifying gives $\sqrt{\sqrt{d} + d + c} - \sqrt{-\sqrt{d} + d + c} = 1$
We can square both sides and simplify:
$\sqrt{d} + d + c - \sqrt{d} + d + c - 2\sqrt{(d + c + \sqrt{d})(d + c - \sqrt{d})} = 1$
$2d + 2c - 2\sqrt{(d + c + \sqrt{d})(d + c - \sqrt{d})} = 1$
$\sqrt{(d + c + \sqrt{d})(d + c - \sqrt{d})} = (d+c) - \frac{1}{2}$
$\sqrt{(d+c)^2 - (\sqrt{d})^2} = (d+c) - \frac{1}{2}$
$\sqrt{d^2 + 2dc + c^2 - d} = (d+c) - \frac{1}{2}$
Squaring both sides again gives the following:
$d^2 + 2dc + c^2 - d = d^2 + 2dc + c^2 - d - c + \frac{1}{4}$
Nearly all terms cancel out, yielding $c = \frac{1}{4}$
By substituting this back in, we obtain $\sqrt{\sqrt{d} + d + c} = \frac{15}{4}$ and $\sqrt{-\sqrt{d} + d + c} = \frac{11}{4}$
The sum of $a$ and $b$ is equal to $-\sqrt{\sqrt{d} + d + c} - \sqrt{-\sqrt{d} + d + c} + 2c = -\frac{15}{4} - \frac{11}{4} + \frac{1}{2} = -6$ , so $(a+b)^2 = 36$
Adding up both values gives $49 + 36 = \boxed{085}$ as our final answer.

Answer:  085
Problem: Let $\triangle ABC$ be an acute triangle with circumcircle $\omega,$ and let $H$ be the intersection of the altitudes of $\triangle ABC.$ Suppose the tangent to the circumcircle of $\triangle HBC$ at $H$ intersects $\omega$ at points $X$ and $Y$ with $HA=3,HX=2,$ and $HY=6.$ The area of $\triangle ABC$ 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 following is a power of a point solution to this menace of a problem:
[asy] defaultpen(fontsize(12)+0.6); size(250); pen p=fontsize(10)+gray+0.4;  var phi=75.5, theta=130, r=4.8; pair A=r*dir(270-phi-57), C=r*dir(270+phi-57), B=r*dir(theta-57), H=extension(A,foot(A,B,C),B,foot(B,C,A)); path omega=circumcircle(A,B,C), c=circumcircle(H,B,C); pair O=circumcenter(H,B,C), Op=2*H-O, Z=bisectorpoint(O,Op), X=IP(omega,L(H,Z,0,50)), Y=IP(omega,L(H,Z,50,0)), D=2*H-A, K=extension(B,C,X,Y), E=extension(A,origin,X,Y), L=foot(H,B,C);  draw(K--C^^omega^^c^^L(A,D,0,1)); draw(Y--K^^L(A,origin,0,1.5)^^L(X,D,0.7,3.5),fuchsia+0.4);  draw(CR(H,length(H-L)),royalblue);  draw(C--K,p); dot("$A$",A,dir(120)); dot("$B$",B,down); dot("$C$",C,down); dot("$H$",H,down); dot("$X$",X,up); dot("$Y$",Y,down); dot("$O$",origin,down); dot("$O'$",O,down); dot("$K$",K,up); dot("$L$",L,dir(H-X));  dot("$D$",D,down); dot("$E$",E,down);   //draw(O--origin,p); //draw(origin--4*dir(57),fuchsia); //draw(Arc(H,3,160,200),royalblue); //draw(Arc(H,2,30,70),heavygreen); //draw(Arc(H,6,220,240),fuchsia); [/asy] Let points be what they appear as in the diagram below. Note that $3HX = HY$ is not insignificant; from here, we set $XH = HE = \frac{1}{2} EY = HL = 2$ by PoP and trivial construction. Now, $D$ is the reflection of $A$ over $H$ . Note $AO \perp XY$ , and therefore by Pythagorean theorem we have $AE = XD = \sqrt{5}$ . Consider $HD = 3$ . We have that $\triangle HXD \cong HLK$ , and therefore we are ready to PoP with respect to $(BHC)$ . Setting $BL = x, LC = y$ , we obtain $xy = 10$ by PoP on $(ABC)$ , and furthermore, we have $KH^2 = 9 = (KL - x)(KL + y) = (\sqrt{5} - x)(\sqrt{5} + y)$ . Now, we get $4 = \sqrt{5}(y - x) - xy$ , and from $xy = 10$ we take \[\frac{14}{\sqrt{5}} = y - x.\] However, squaring and manipulating with $xy = 10$ yields that $(x + y)^2 = \frac{396}{5}$ and from here, since $AL = 5$ we get the area to be $3\sqrt{55} \implies \boxed{058}$ . ~awang11's sol

Answer:  058
Problem: Let $\triangle ABC$ be an acute triangle with circumcircle $\omega,$ and let $H$ be the intersection of the altitudes of $\triangle ABC.$ Suppose the tangent to the circumcircle of $\triangle HBC$ at $H$ intersects $\omega$ at points $X$ and $Y$ with $HA=3,HX=2,$ and $HY=6.$ The area of $\triangle ABC$ 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: Note that $\overline{BC}$ bisects $\overline{OO'}$ . Using the same method from Solution 3 we find $R = \frac{21}{2\sqrt{5}}$ . Let the midpoint of $\overline{BC}$ be $N$ , then by the Pythagorean Theorem we have $BN^2 = OB^2 - ON^2 = R^2 - \frac{3}{2}^2$ , so $BN = \frac{3\sqrt{11}}{\sqrt{5}}$ . Since $h_a = 5$ we have that the area of ABC is $3\sqrt{55}$ so the answer is $3 + 55 = \boxed{58}$

Answer:  58
Problem: Find the number of ordered pairs of positive integers $(m,n)$ such that ${m^2n = 20 ^{20}}$

Solution: In this problem, we want to find the number of ordered pairs $(m, n)$ such that $m^2n = 20^{20}$ . Let $x = m^2$ . Therefore, we want two numbers, $x$ and $n$ , such that their product is $20^{20}$ and $x$ is a perfect square. Note that there is exactly one valid $n$ for a unique $x$ , which is $\tfrac{20^{20}}{x}$ . This reduces the problem to finding the number of unique perfect square factors of $20^{20}$
$20^{20} = 2^{40} \cdot 5^{20} = \left(2^2\right)^{20}\cdot\left(5^2\right)^{10}.$ Therefore, the answer is $21 \cdot 11 = \boxed{231}.$

Answer:  231
Problem: Let $P$ be a point chosen uniformly at random in the interior of the unit square with vertices at $(0,0), (1,0), (1,1)$ , and $(0,1)$ . The probability that the slope of the line determined by $P$ and the point $\left(\frac58, \frac38 \right)$ is greater than or equal to $\frac12$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: The areas bounded by the unit square and alternately bounded by the lines through $\left(\frac{5}{8},\frac{3}{8}\right)$ that are vertical or have a slope of $1/2$ show where $P$ can be placed to satisfy the condition. One of the areas is a trapezoid with bases $1/16$ and $3/8$ and height $5/8$ . The other area is a trapezoid with bases $7/16$ and $5/8$ and height $3/8$ . Then, \[\frac{\frac{1}{16}+\frac{3}{8}}{2}\cdot\frac{5}{8}+\frac{\frac{7}{16}+\frac{5}{8}}{2}\cdot\frac{3}{8}=\frac{86}{256}=\frac{43}{128}\implies43+128=\boxed{171}\] ~mn28407

Answer:  171
Problem: The value of $x$ that satisfies $\log_{2^x} 3^{20} = \log_{2^{x+3}} 3^{2020}$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: Let $\log _{2^x}3^{20}=\log _{2^{x+3}}3^{2020}=n$ . Based on the equation, we get $(2^x)^n=3^{20}$ and $(2^{x+3})^n=3^{2020}$ . Expanding the second equation, we get $8^n\cdot2^{xn}=3^{2020}$ . Substituting the first equation in, we get $8^n\cdot3^{20}=3^{2020}$ , so $8^n=3^{2000}$ . Taking the 100th root, we get $8^{\frac{n}{100}}=3^{20}$ . Therefore, $(2^{\frac{3}{100}})^n=3^{20}$ , and using the our first equation( $2^{xn}=3^{20}$ ), we get $x=\frac{3}{100}$ and the answer is $\boxed{103}$ .
~rayfish

Answer:  103
Problem: The value of $x$ that satisfies $\log_{2^x} 3^{20} = \log_{2^{x+3}} 3^{2020}$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: Recall the identity $\log_{a^n} b^{m} = \frac{m}{n}\log_{a} b$ (which is easily proven using exponents or change of base).
Then this problem turns into \[\frac{20}{x}\log_{2} 3 = \frac{2020}{x+3}\log_{2} 3\] Divide $\log_{2} 3$ from both sides. And we are left with $\frac{20}{x}=\frac{2020}{x+3}$ .Solving this simple equation we get \[x = \tfrac{3}{100} \Rightarrow \boxed{103}\] ~mlgjeffdoge21

Answer:  103
Problem: The value of $x$ that satisfies $\log_{2^x} 3^{20} = \log_{2^{x+3}} 3^{2020}$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: $\log_{2^x} 3^{20} = 2^{xy} = 3^{20}$
$\log_{2^{x+3}} 3^{2020} = (2^{x+3})^y = 3^{2020}$
$3^{2020} = (3^{20})^{101}$
$(2^{xy})^{101} = (2^{x+3})^y = 3^{2020}$
$(2^{xy})^{101} = (2^{x+3})^y \Rightarrow 2^{101xy} = 2^{xy+3y} \Rightarrow 101xy = xy + 3y \Rightarrow 101xy = y(x+3)$
$101x = x + 3$
$100x = 3$
$x = \frac{3}{100}$
$100 + 3 = \boxed{103}$ ~Airplanes2007

Answer:  103
Problem: Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$ $B(0,12)$ $C(16,0)$ $A'(24,18)$ $B'(36,18)$ $C'(24,2)$ . A rotation of $m$ degrees clockwise around the point $(x,y)$ where $0<m<180$ , will transform $\triangle ABC$ to $\triangle A'B'C'$ . Find $m+x+y$

Solution: After sketching, it is clear a $90^{\circ}$ rotation is done about $(x,y)$ . Looking between $A$ and $A'$ $x+y=18$ . Thus $90+18=\boxed{108}$ .
~mn28407

Answer:  108
Problem: Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$ $B(0,12)$ $C(16,0)$ $A'(24,18)$ $B'(36,18)$ $C'(24,2)$ . A rotation of $m$ degrees clockwise around the point $(x,y)$ where $0<m<180$ , will transform $\triangle ABC$ to $\triangle A'B'C'$ . Find $m+x+y$

Solution: For the above reasons, the transformation is simply a $90^\circ$ rotation. Proceed with complex numbers on the points $C$ and $C'$ . Let $(x, y)$ be the origin. Thus, $C \rightarrow (16-x)+(-y)i$ and $C' \rightarrow (24-x)+(2-y)i$ . The transformation from $C'$ to $C$ is a multiplication of $i$ , which yields $(16-x)+(-y)i=(y-2)+(24-x)i$ . Equating the real and complex terms results in the equations $16-x=y-2$ and $-y=24-x$ . Solving, $(x, y) : (21, -3) \rightarrow 90+21-3=\boxed{108}$

Answer:  108
Problem: Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$ $B(0,12)$ $C(16,0)$ $A'(24,18)$ $B'(36,18)$ $C'(24,2)$ . A rotation of $m$ degrees clockwise around the point $(x,y)$ where $0<m<180$ , will transform $\triangle ABC$ to $\triangle A'B'C'$ . Find $m+x+y$

Solution: We know that the rotation point $P$ has to be equidistant from both $A$ and $A'$ so it has to lie on the line that is on the midpoint of the segment $AA'$ and also the line has to be perpendicular to $AA'$ . Solving, we get the line is $y=\frac{-4}{3}x+25$ . Doing the same for $B$ and $B'$ , we get that $y=-6x+123$ . Since the point $P$ of rotation must lie on both of these lines, we set them equal, solve and get: $x=21$ $y=-3$ . We can also easily see that the degree of rotation is $90$ since $AB$ is initially vertical, and now it is horizontal. Also, we can just sketch this on a coordinate plane and easily realize the same. Hence, the answer is $21-3+90 = \boxed{108}$

Answer:  108
Problem: Define a sequence recursively by $t_1 = 20$ $t_2 = 21$ , and \[t_n = \frac{5t_{n-1}+1}{25t_{n-2}}\] for all $n \ge 3$ . Then $t_{2020}$ can be expressed as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$

Solution: Let $t_n=\frac{s_n}{5}$ . Then, we have $s_n=\frac{s_{n-1}+1}{s_{n-2}}$ where $s_1 = 100$ and $s_2 = 105$ . By substitution, we find $s_3 = \frac{53}{50}$ $s_4=\frac{103}{105\cdot50}$ $s_5=\frac{101}{105}$ $s_6=100$ , and $s_7=105$ . So $s_n$ has a period of $5$ . Thus $s_{2020}=s_5=\frac{101}{105}$ . So, $\frac{101}{105\cdot 5}\implies 101+525=\boxed{626}$ .
~mn28407

Answer:  626
Problem: Define a sequence recursively by $t_1 = 20$ $t_2 = 21$ , and \[t_n = \frac{5t_{n-1}+1}{25t_{n-2}}\] for all $n \ge 3$ . Then $t_{2020}$ can be expressed as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$

Solution: Let us examine the first few terms of this sequence and see if we can find a pattern. We are obviously given $t_1 = 20$ and $t_2 = 21$ , so now we are able to determine the numerical value of $t_3$ using this information: \[t_3 = \frac{5t_{3-1}+1}{25t_{3-2}} = \frac{5t_{2}+1}{25t_{1}} = \frac{5(21) + 1}{25(20)} = \frac{105 + 1}{500}t_3 = \frac{106}{500}  = \frac{53}{250}\] \[t_4 = \frac{5t_{4-1}+1}{25t_{4-2}} = \frac{5t_{3}+1}{25t_{2}} = \frac{5(\frac{53}{250}) + 1}{25(21)} = \frac{\frac{53}{50} + 1}{525} = \frac{\frac{103}{50}}{525} = \frac{103}{26250}\] \[t_5 = \frac{5t_{5-1}+1}{25t_{5-2}} = \frac{5t_{4}+1}{25t_{3}} = \frac{5(\frac{103}{26250}) + 1}{25(\frac{53}{250})} = \frac{\frac{103}{5250} + 1}{\frac{53}{10}} = \frac{\frac{5353}{5250}}{\frac{53}{10}} = \frac{101}{525}\] \[t_6 = \frac{5t_{6-1}+1}{25t_{6-2}} = \frac{5t_{5}+1}{25t_{4}} = \frac{5(\frac{101}{525}) + 1}{25(\frac{103}{26250})} = \frac{\frac{101}{105} + 1}{\frac{103}{1050}} = \frac{\frac{206}{105}}{\frac{103}{1050}} \implies t_6 = 20\]
Alas, we have figured this sequence is period 5! But since $2020 \equiv 5 \pmod 5$ , we can state that $t_{2020} = t_5 = \frac{101}{525}$ . According to the original problem statement, our answer is $\boxed{626}$ . ~ nikenissan

Answer:  626
Problem: Two congruent right circular cones each with base radius $3$ and height $8$ have the axes of symmetry that intersect at right angles at a point in the interior of the cones a distance $3$ from the base of each cone. A sphere with radius $r$ lies within both cones. The maximum possible value of $r^2$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: Using the diagram above, we notice that the desired length is simply the distance between the point $C$ and $\overline{AB}$ . We can mark $C$ as $(3,3)$ since it is $3$ units away from each of the bases. Point $B$ is $(8,3)$ . Thus, line $\overline{AB}$ is $y = \frac{3}{8}x \Rightarrow 3x + 8y = 0$ . We can use the distance from point to line formula $\frac{|Ax_0 + By_0 + C|}{\sqrt{A^2 + B^2}}$ , where $x_0$ and $y_0$ are the coordinates of the point, and A, B, and C are the coefficients of the line in form $Ax + By + C = 0$ . Plugging everything in, we get \[\frac{|3(3) - 8(3)|}{\sqrt{8^2 + 3^2}} = \frac{15}{\sqrt{73}} \Rightarrow \frac{225}{73} \Rightarrow \boxed{298}\]

Answer:  298
Problem: Define a sequence recursively by $f_1(x)=|x-1|$ and $f_n(x)=f_{n-1}(|x-n|)$ for integers $n>1$ . Find the least value of $n$ such that the sum of the zeros of $f_n$ exceeds $500,000$

Solution: First it will be shown by induction that the zeros of $f_n$ are the integers $a, {a+2,} {a+4,} \dots, {a + n(n-1)}$ , where $a = n - \frac{n(n-1)}2.$
This is certainly true for $n=1$ . Suppose that it is true for $n = m-1 \ge 1$ , and note that the zeros of $f_m$ are the solutions of $|x - m| = k$ , where $k$ is a nonnegative zero of $f_{m-1}$ . Because the zeros of $f_{m-1}$ form an arithmetic sequence with common difference $2,$ so do the zeros of $f_m$ . The greatest zero of $f_{m-1}$ is \[m-1+\frac{(m-1)(m-2)}2 =\frac{m(m-1)}2,\] so the greatest zero of $f_m$ is $m+\frac{m(m-1)}2$ and the least is $m-\frac{m(m-1)}2$
It follows that the number of zeros of $f_n$ is $\frac{n(n-1)}2+1=\frac{n^2-n+2}2$ , and their average value is $n$ . The sum of the zeros of $f_n$ is \[\frac{n^3-n^2+2n}2.\] Let $S(n)=n^3-n^2+2n$ , so the sum of the zeros exceeds $500000$ if and only if $S(n) > 1000000 = 100^3\!.$ Because $S(n)$ is increasing for $n > 2$ , the values $S(100) = 1000000 - 10000 + 200 = 990200$ and $S(101)=1030301 - 10201 + 202 = 1020302$ show that the requested value of $n$ is $\boxed{101}$

Answer:  101
Problem: Define a sequence recursively by $f_1(x)=|x-1|$ and $f_n(x)=f_{n-1}(|x-n|)$ for integers $n>1$ . Find the least value of $n$ such that the sum of the zeros of $f_n$ exceeds $500,000$

Solution: Starting from $f_1(x)=|x-1|$ , we can track the solutions, the number of solutions, and their sum.
\[\begin{array}{c|c|c|c} n&Solutions&number&sum\\  1&1&1&1\\   2&1,3&2&4\\    3&0,2,4,6&4&12\\ 4&-2,0,2...10&7&28\\ 5&-5,-3,-1...15&11&55\\ \end{array}\]
It is clear that the solutions form arithmetic sequences with a difference of 2, and the negative solutions cancel out all but $n$ of the $1+\frac{n(n-1)}{2}$ solutions. Thus, the sum of the solutions is $n \cdot [1+\frac{n(n-1)}{2}]$ , which is a cubic function.
$n \cdot [1+\frac{n(n-1)}{2}]>500,000$
Multiplying both sides by $2$
$n \cdot [2+n(n-1)]>1,000,000$
1 million is $10^6=100^3$ , so the solution should be close to $100$
100 is slightly too small, so $\boxed{101}$ works.

Answer:  101