Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: The coordinates of the vertices of isosceles trapezoid $ABCD$ are all integers, with $A=(20,100)$ and $D=(21,107)$ . The trapezoid has no horizontal or vertical sides, and $\overline{AB}$ and $\overline{CD}$ are the only parallel sides. The sum of the absolute values of all possible slopes for $\overline{AB}$ is $m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: For simplicity, we translate the points so that $A$ is on the origin and $D = (1,7)$ . Suppose $B$ has integer coordinates; then $\overrightarrow{AB}$ is a vector with integer parameters (vector knowledge is not necessary for this solution). We construct the perpendicular from $A$ to $\overline{CD}$ , and let $D' = (a,b)$ be the reflection of $D$ across that perpendicular. Then $ABCD'$ is a parallelogram , and $\overrightarrow{AB} = \overrightarrow{D'C}$ . Thus, for $C$ to have integer coordinates, it suffices to let $D'$ have integer coordinates.
Let the slope of the perpendicular be $m$ . Then the midpoint of $\overline{DD'}$ lies on the line $y=mx$ , so $\frac{b+7}{2} = m \cdot \frac{a+1}{2}$ . Also, $AD = AD'$ implies that $a^2 + b^2 = 1^2 + 7^2 = 50$ . Combining these two equations yields
\[a^2 + \left(7 - (a+1)m\right)^2 = 50\]
Since $a$ is an integer, then $7-(a+1)m$ must be an integer. There are $12$ pairs of integers whose squares sum up to $50,$ namely $( \pm 1, \pm 7), (\pm 7, \pm 1), (\pm 5, \pm 5)$ . We exclude the cases $(\pm 1, \pm 7)$ because they lead to degenerate trapezoids (rectangle, line segment, vertical and horizontal sides). Thus we have
\[7 - 8m = \pm 1, \quad 7 + 6m = \pm 1, \quad 7 - 6m = \pm 5, 7 + 4m = \pm 5\]
These yield $m = 1, \frac 34, -1, -\frac 43, 2, \frac 13, -3, - \frac 12$ . Therefore, the corresponding slopes of $\overline{AB}$ are $-1, -\frac 43, 1, \frac 34, -\frac 12, -3, \frac 13$ , and $2$ .  The sum of their absolute values is $\frac{119}{12}$ . The answer is $m+n= \boxed{131}$

Answer:  131
Problem: The coordinates of the vertices of isosceles trapezoid $ABCD$ are all integers, with $A=(20,100)$ and $D=(21,107)$ . The trapezoid has no horizontal or vertical sides, and $\overline{AB}$ and $\overline{CD}$ are the only parallel sides. The sum of the absolute values of all possible slopes for $\overline{AB}$ is $m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Solution: A very natural solution:
. Shift $A$ to the origin. Suppose point $B$ was $(x, kx)$ . Note $k$ is the slope we're looking for. Note that point $C$ must be of the form: $(x \pm 1, kx \pm 7)$ or $(x \pm 7, kx \pm 1)$ or $(x \pm 5, kx \pm 5)$ . Note that we want the slope of the line connecting $D$ and $C$ so also be $k$ , since $AB$ and $CD$ are parallel.
Instead of dealing with the 12 cases, we consider 
point $C$ of the form $(x \pm Y, kx \pm Z)$ where 
we plug in the necessary values for $Y$ and $Z$ after simplifying.
Since the slopes of $AB$ and $CD$ must both be $k$ $\frac{7 - kx \pm Z}{1 - x \pm Y} = k \implies k = \frac{7 \pm Z}{1 \pm Y}$ . Plugging in the possible values of $\pm 7, \pm 1, \pm 5$ in their respective pairs and ruling out degenerate cases, we find the sum is $\frac{119}{12} \implies m + n = \boxed{131}$ - whatRthose

Answer:  131
Problem: The points $A$ $B$ and $C$ lie on the surface of a sphere with center $O$ and radius $20$ . It is given that $AB=13$ $BC=14$ $CA=15$ , and that the distance from $O$ to $\triangle ABC$ is $\frac{m\sqrt{n}}k$ , where $m$ $n$ , and $k$ are positive integers, $m$ and $k$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+k$

Solution: Let $D$ be the foot of the perpendicular from $O$ to the plane of $ABC$ . By the Pythagorean Theorem on triangles $\triangle OAD$ $\triangle OBD$ and $\triangle OCD$ we get:
\[DA^2=DB^2=DC^2=20^2-OD^2\]
It follows that $DA=DB=DC$ , so $D$ is the circumcenter of $\triangle ABC$
By Heron's Formula the area of $\triangle ABC$ is (alternatively, a $13-14-15$ triangle may be split into $9-12-15$ and $5-12-13$ right triangles ):
\[K = \sqrt{s(s-a)(s-b)(s-c)} = \sqrt{21(21-15)(21-14)(21-13)} = 84\]
From $R = \frac{abc}{4K}$ , we know that the circumradius of $\triangle ABC$ is:
\[R = \frac{abc}{4K} = \frac{(13)(14)(15)}{4(84)} = \frac{65}{8}\]
Thus by the Pythagorean Theorem again,
\[OD = \sqrt{20^2-R^2} = \sqrt{20^2-\frac{65^2}{8^2}} = \frac{15\sqrt{95}}{8}.\]
So the final answer is $15+95+8=\boxed{118}$

Answer:  118
Problem: The points $A$ $B$ and $C$ lie on the surface of a sphere with center $O$ and radius $20$ . It is given that $AB=13$ $BC=14$ $CA=15$ , and that the distance from $O$ to $\triangle ABC$ is $\frac{m\sqrt{n}}k$ , where $m$ $n$ , and $k$ are positive integers, $m$ and $k$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+k$

Solution: We know the radii to $A$ $B$ , and $C$ form a triangular pyramid $OABC$ . We know the lengths of the edges $OA = OB = OC = 20$ . First we can break up $ABC$ into its two component right triangles $5-12-13$ and $9-12-15$ . Let the $y$ axis be perpendicular to the base and $x$ axis run along $BC$ , and $z$ occupy the other dimension, with the origin as $C$ . We look at vectors $OA$ and $OC$ . Since $OAC$ is isoceles we know the vertex is equidistant from $A$ and $C$ , hence it is $7$ units along the $x$ axis. Hence for vector $OC$ , in form $<x,y,z>$ it is $<7, h, l>$ where $h$ is the height (answer) and $l$ is the component of the vertex along the $z$ axis. Now on vector $OA$ , since $A$ is $9$ along $x$ , and it is $12$ along $z$ axis, it is $<-2, h, 12- l>$ . We know both vector magnitudes are $20$ . Solving for $h$ yields $\frac{15\sqrt{95} }{8}$ , so Answer = $\boxed{118}$

Answer:  118
Problem: The equation $2000x^6+100x^5+10x^3+x-2=0$ has exactly two real roots, one of which is $\frac{m+\sqrt{n}}r$ , where $m$ $n$ and $r$ are integers, $m$ and $r$ are relatively prime, and $r>0$ . Find $m+n+r$

Solution: We may factor the equation as:
\begin{align*} 2000x^6+100x^5+10x^3+x-2&=0\\ 2(1000x^6-1) + x(100x^4+10x^2+1)&=0\\ 2[(10x^2)^3-1]+x[(10x^2)^2+(10x^2)+1]&=0\\ 2(10x^2-1)[(10x^2)^2+(10x^2)+1]+x[(10x^2)^2+(10x^2)+1]&=0\\ (20x^2+x-2)(100x^4+10x^2+1)&=0\\ \end{align*}
Now $100x^4+10x^2+1\ge 1>0$ for real $x$ . Thus the real roots must be the roots of the equation $20x^2+x-2=0$ . By the quadratic formula the roots of this are:
\[x=\frac{-1\pm\sqrt{1^2-4(-2)(20)}}{40} = \frac{-1\pm\sqrt{1+160}}{40} = \frac{-1\pm\sqrt{161}}{40}.\]
Thus $r=\frac{-1+\sqrt{161}}{40}$ , and so the final answer is $-1+161+40 = \boxed{200}$

Answer:  200
Problem: The equation $2000x^6+100x^5+10x^3+x-2=0$ has exactly two real roots, one of which is $\frac{m+\sqrt{n}}r$ , where $m$ $n$ and $r$ are integers, $m$ and $r$ are relatively prime, and $r>0$ . Find $m+n+r$

Solution: It would be really nice if the coefficients were symmetrical. What if we make the substitution, $x = -\frac{i}{\sqrt{10}}y$ . The the polynomial becomes
$-2y^6 - (\frac{i}{\sqrt{10}})y^5 + (\frac{i}{\sqrt{10}})y^3 - (\frac{i}{\sqrt{10}})y - 2$
It's symmetric! Dividing by $y^3$ and rearranging, we get
$-2(y^3 + \frac{1}{y^3}) - (\frac{i}{\sqrt{10}})(y^2 + \frac{1}{y^2}) + (\frac{i}{\sqrt{10}})$
Now, if we let $z = y + \frac{1}{y}$ , we can get the equations
$z = y + \frac{1}{y}$
$z^2 - 2 = y^2 + \frac{1}{y^2}$
and
$z^3 - 3z = y^3 + \frac{1}{y^3}$
(These come from squaring $z$ and subtracting $2$ , then multiplying that result by $z$ and subtracting $z$ ) 
Plugging this into our polynomial, expanding, and rearranging, we get
$-2z^3 - (\frac{i}{\sqrt{10}})z^2 + 6z + (\frac{3i}{\sqrt{10}})$
Now, we see that the two $i$ terms must cancel in order to get this polynomial equal to $0$ , so what squared equals 3? Plugging in $z = \sqrt{3}$ into the polynomial, we see that it works! Is there something else that equals 3 when squared? Trying $z = -\sqrt{3}$ , we see that it also works! Great, we use long division on the polynomial by
$(z - \sqrt{3})(z + \sqrt{3}) = (z^2 - 3)$ and we get
$2z -(\frac{i}{\sqrt{10}}) = 0$
We know that the other two solutions for z wouldn't result in real solutions for $x$ since we have to solve a quadratic with a negative discriminant, then multiply by $-(\frac{i}{\sqrt{10}})$ . We get that $z = (\frac{i}{-2\sqrt{10}})$ . Solving for $y$ (using $y + \frac{1}{y} = z$ ) we get that $y = \frac{-i \pm \sqrt{161}i}{4\sqrt{10}}$ , and multiplying this by $-(\frac{i}{\sqrt{10}})$ (because $x = -(\frac{i}{\sqrt{10}})y$ ) we get that $x = \frac{-1 \pm \sqrt{161}}{40}$ for a final answer of $-1 + 161 + 40 = \boxed{200}$

Answer:  200
Problem: The equation $2000x^6+100x^5+10x^3+x-2=0$ has exactly two real roots, one of which is $\frac{m+\sqrt{n}}r$ , where $m$ $n$ and $r$ are integers, $m$ and $r$ are relatively prime, and $r>0$ . Find $m+n+r$

Solution: Observe that the given equation may be rearranged as $2000x^6-2+(100x^5+10x^3+x)=0$ .
The expression in parentheses is a geometric series with common factor $10x^2$ . Using the geometric sum formula, we rewrite as $2000x^6-2+\frac{1000x^7-x}{10x^2-1}=0, 10x^2-1\neq0$ .
Factoring a bit, we get $2(1000x^6-1)+(1000x^6-1)\frac{x}{10x^2-1}=0, 10x^2-1\neq0 \implies$ $(1000x^6-1)(2+\frac{x}{10x^2-1})=0, 10x^2-1\neq0$ .
Note that setting $1000x^6-1=0$ gives $10x^2-1=0$ , which is clearly extraneous.
Hence, we set $2+\frac{x}{10x^2-1}=0$ and use the quadratic formula to get the desired root $x=\frac{-1+\sqrt{161}}{40} \implies -1+161+40=\boxed{200}$

Answer:  200
Problem: Every positive integer $k$ has a unique factorial base expansion $(f_1,f_2,f_3,\ldots,f_m)$ , meaning that $k=1!\cdot f_1+2!\cdot f_2+3!\cdot f_3+\cdots+m!\cdot f_m$ , where each $f_i$ is an integer, $0\le f_i\le i$ , and $0<f_m$ . Given that $(f_1,f_2,f_3,\ldots,f_j)$ is the factorial base expansion of $16!-32!+48!-64!+\cdots+1968!-1984!+2000!$ , find the value of $f_1-f_2+f_3-f_4+\cdots+(-1)^{j+1}f_j$

Solution: Note that $1+\sum_{k=1}^{n-1} {k\cdot k!} = 1+\sum_{k=1}^{n-1} {((k+1)\cdot k!- k!)} = 1+\sum_{k=1}^{n-1} {((k+1)!- k!)} = 1 + ((2! - 1!) + (3! - 2!) + \cdots + (n! - (n-1)!)) = n!$
Thus for all $m\in\mathbb{N}$
$(32m+16)!-(32m)! = \left(1+\sum_{k=1}^{32m+15} {k\cdot k!}\right)-\left(1+\sum_{k=1}^{32m-1} {k\cdot k!}\right) = \sum_{k=32m}^{32m+15}k\cdot k!.$
So now,
\begin{align*} 16!-32!+48!-64!+\cdots+1968!-1984!+2000!&=16!+(48!-32!)+(80!-64!)\cdots+(2000!-1984!)\\ &=16! +\sum_{m=1}^{62}(32m+16)!-(32m)!\\ &=16! +\sum_{m=1}^{62}\sum_{k=32m}^{32m+15}k\cdot k! \end{align*}
Therefore we have $f_{16} = 1$ $f_k=k$ if $32m\le k \le 32m+15$ for some $m=1,2,\ldots,62$ , and $f_k = 0$ for all other $k$
Therefore we have:
\begin{align*} f_1-f_2+f_3-f_4+\cdots+(-1)^{j+1}f_j &= (-1)^{17}\cdot 1 + \sum_{m=1}^{62}\sum_{k=32m}^{32m+15}(-1)^{k+1}k\\ &= -1 + \sum_{m=1}^{62}\left[\sum_{j=16m}^{16m+7}(-1)^{2j+1}2j+\sum_{j=16m}^{16m+7}(-1)^{2j+2}(2j+1)\right]\\ &= -1 + \sum_{m=1}^{62}\sum_{j=16m}^{16m+7}[(-1)^{2j+1}2j+(-1)^{2j+2}(2j+1)]\\ &= -1 + \sum_{m=1}^{62}\sum_{j=16m}^{16m+7}[-2j+(2j+1)]\\ &= -1 + \sum_{m=1}^{62}\sum_{j=16m}^{16m+7}1\\ &= -1 + \sum_{m=1}^{62}8\\ &= -1 + 8\cdot 62\\ &= \boxed{495}

Answer:  495
Problem: Every positive integer $k$ has a unique factorial base expansion $(f_1,f_2,f_3,\ldots,f_m)$ , meaning that $k=1!\cdot f_1+2!\cdot f_2+3!\cdot f_3+\cdots+m!\cdot f_m$ , where each $f_i$ is an integer, $0\le f_i\le i$ , and $0<f_m$ . Given that $(f_1,f_2,f_3,\ldots,f_j)$ is the factorial base expansion of $16!-32!+48!-64!+\cdots+1968!-1984!+2000!$ , find the value of $f_1-f_2+f_3-f_4+\cdots+(-1)^{j+1}f_j$

Solution: Let $S = 16!-32!+\cdots-1984!+2000!$ . Note that since $|S - 2000!| << 2000!$ (or $|S - 2000!| = 1984! + \cdots$ is significantly smaller than $2000!$ ), it follows that $1999! < S < 2000!$ . Hence $f_{2000} = 0$ . Then $2000! = 2000 \cdot 1999! = 1999 \cdot 1999! + 1999!$ , and as $S - 2000! << 1999!$ , it follows that $1999 \cdot 1999! < S < 2000 \cdot 1999!$ . Hence $f_{1999} = 1999$ , and we now need to find the factorial base expansion of
\[S_2 = S - 1999 \cdot 1999! = 1999! - 1984! + 1962! - 1946! + \cdots + 16!\]
Since $|S_2 - 1999!| << 1999!$ , we can repeat the above argument recursively to yield $f_{1998} = 1998$ , and so forth down to $f_{1985} = 1985$ . Now $S_{16} = 1985! - 1984! + 1962! + \cdots = 1984 \cdot 1984! + 1962! + \cdots$ , so $f_{1984} = 1984$
The remaining sum is now just $1962! - 1946! + \cdots + 16!$ . We can repeatedly apply the argument from the previous two paragraphs to find that $f_{16} = 1$ , and $f_k=k$ if $32m\le k \le 32m+15$ for some $m=1,2,\ldots,62$ , and $f_k = 0$ for all other $k$
Now for each $m$ , we have $-f_{32m} + f_{32m+1} - f_{32m+2} + \cdots + f_{32m + 31}$ $= -32m + (32m + 1) - (32m + 2) + \cdots - (32m - 30) + (32 m + 31)$ $= 1 + 1 + \cdots + 1 + 1$ $= 8$ . Thus, our answer is $-f_{16} + 8 \cdot 62 = \boxed{495}$

Answer:  495
Problem: Find the least positive integer $n$ such that

Solution: We apply the identity
\begin{align*} \frac{1}{\sin n \sin (n+1)} &= \frac{1}{\sin 1} \cdot \frac{\sin (n+1) \cos n - \sin n \cos (n+1)}{\sin n \sin (n+1)} \\ &= \frac{1}{\sin 1} \cdot \left(\frac{\cos n}{\sin n} - \frac{\cos (n+1)}{\sin (n+1)}\right) \\ &= \frac{1}{\sin 1} \cdot \left(\cot n - \cot (n+1)\right). \end{align*}
The motivation for this identity arises from the need to decompose those fractions, possibly into telescoping
Thus our summation becomes
\[\sum_{k=23}^{67} \frac{1}{\sin (2k-1) \sin 2k} = \frac{1}{\sin 1} \left(\cot 45 - \cot 46 + \cot 47 - \cdots + \cot 133 - \cot 134 \right).\]
Since $\cot (180 - x) = - \cot x$ , the summation simply reduces to $\frac{1}{\sin 1} \cdot \left( \cot 45 - \cot 90 \right) = \frac{1 - 0}{\sin 1} = \frac{1}{\sin 1^{\circ}}$ . Therefore, the answer is $\boxed{001}$

Answer:  001
Problem: Find the least positive integer $n$ such that

Solution: Let S be the sum of the sequence. We begin the same as in Solution 1 to get $S\sin(1)=\cot(45)-\cot(46)+\cot(47)-\cot(48)+...+\cot(133)-\cot(134)$ . Observe that this "almost telescopes," if only we had some extra terms. Consider adding the sequence $\frac{1}{\sin(46)\sin(47)}+\frac{1}{\sin(48)\sin(49)}+...+\frac{1}{\sin(134)\sin(135)}$ . By the identity $\sin(x)=\sin(180-x)$ , this sequence is equal to the original one, simply written backwards. By the same logic as before, we may rewrite this sequence as $S\sin(1)=\cot(46)-\cot(47)+\cot(48)-\cot(49)+...+\cot(134)-\cot(135)$ ,
and when we add the two sequences, they telescope to give $2S\sin(1)=\cot(45)-\cot(135)=2$ .
Hence, $S=\sin(1)$ , and our angle is $\boxed{001}$

Answer:  001
Problem: Consider the parallelogram with vertices $(10,45)$ $(10,114)$ $(28,153)$ , and $(28,84)$ .  A line through the origin cuts this figure into two congruent polygons .  The slope of the line is $m/n,$ where $m_{}$ and $n_{}$ are relatively prime positive integers .  Find $m+n$

Solution: Let the first point on the line $x=10$ be $(10,45+a)$ where a is the height above $(10,45)$ .  Let the second point on the line $x=28$ be $(28, 153-a)$ . For two given points, the line will pass the origin if the coordinates are proportional (such that $\frac{y_1}{x_1} = \frac{y_2}{x_2}$ ). Then, we can write that $\frac{45 + a}{10} = \frac{153 - a}{28}$ . Solving for $a$ yields that $1530 - 10a = 1260 + 28a$ , so $a=\frac{270}{38}=\frac{135}{19}$ . The slope of the line (since it passes through the origin) is $\frac{45 + \frac{135}{19}}{10} = \frac{99}{19}$ , and the solution is $m + n = \boxed{118}$

Answer:  118
Problem: Consider the parallelogram with vertices $(10,45)$ $(10,114)$ $(28,153)$ , and $(28,84)$ .  A line through the origin cuts this figure into two congruent polygons .  The slope of the line is $m/n,$ where $m_{}$ and $n_{}$ are relatively prime positive integers .  Find $m+n$

Solution: You can clearly see that a line that cuts a parallelogram into two congruent pieces must go through the center of the parallelogram. Taking the midpoint of $(10,45)$ , and $(28,153)$ gives $(19,99)$ , which is the center of the parallelogram. Thus the slope of the line must be $\frac{99}{19}$ , and the solution is $\boxed{118}$

Answer:  118
Problem: Consider the parallelogram with vertices $(10,45)$ $(10,114)$ $(28,153)$ , and $(28,84)$ .  A line through the origin cuts this figure into two congruent polygons .  The slope of the line is $m/n,$ where $m_{}$ and $n_{}$ are relatively prime positive integers .  Find $m+n$

Solution: Note that the area of the parallelogram is equivalent to $69 \cdot 18 = 1242,$ so the area of each of the two trapezoids with congruent area is $621.$ Therefore, since the height is $18,$ the sum of the bases of each trapezoid must be $69.$
The points where the line in question intersects the long side of the parallelogram can be denoted as $(10, \frac{10m}{n})$ and $(28, \frac{28m}{n}),$ respectively. We see that $\frac{10m}{n} - 45 + \frac{28m}{n} - 84 = 69,$ so $\frac{38m}{n} = 198 \implies \frac{m}{n} = \frac{99}{19} \implies \boxed{118}.$

Answer:  118
Problem: Consider the parallelogram with vertices $(10,45)$ $(10,114)$ $(28,153)$ , and $(28,84)$ .  A line through the origin cuts this figure into two congruent polygons .  The slope of the line is $m/n,$ where $m_{}$ and $n_{}$ are relatively prime positive integers .  Find $m+n$

Solution: $(\Sigma x_i /4, \Sigma y_i /4)$ is the centroid, which generates $(19,99)$ , so the answer is $\boxed{118}$ . This is the fastest way because you do not need to find the opposite vertices by drawing.

Answer:  118
Problem: Find the sum of all positive integers $n$ for which $n^2-19n+99$ is a perfect square

Solution: If $n^2-19n+99=x^2$ for some positive integer $x$ , then rearranging we get $n^2-19n+99-x^2=0$ . Now from the quadratic formula,
Because $n$ is an integer, this means $4x^2-35=q^2$ for some nonnegative integer $q$ . Rearranging gives $(2x+q)(2x-q)=35$ . Thus $(2x+q, 2x-q)=(35, 1)$ or $(7,5)$ , giving $x=3$ or $9$ . This gives $n=1, 9, 10,$ or $18$ , and the sum is $1+9+10+18=\boxed{38}$

Answer:  38
Problem: Find the sum of all positive integers $n$ for which $n^2-19n+99$ is a perfect square

Solution: When $n \geq 12$ , we have \[(n-10)^2 < n^2 -19n + 99 < (n-8)^2.\]
So if $n \geq 12$ and $n^2 -19n + 99$ is a perfect square, then \[n^2 -19n + 99 = (n-9)^2\]
or $n = 18$
For $1 \leq n < 12$ , it is easy to check that $n^2 -19n + 99$ is a perfect square when $n = 1, 9$ and $10$ ( using the identity $n^2 -19n + 99 = (n-10)^2 + n - 1.)$
We conclude that the answer is $1 + 9 + 10 + 18 = \boxed{38}.$

Answer:  38
Problem: The two squares shown share the same center $O_{}$ and have sides of length 1. The length of $\overline{AB}$ is $43/99$ and the area of octagon $ABCDEFGH$ is $m/n,$ where $m_{}$ and $n_{}$ are relatively prime positive integers .  Find $m+n.$
[asy] //code taken from thread for problem real alpha = 25; pair W=dir(225), X=dir(315), Y=dir(45), Z=dir(135), O=origin; pair w=dir(alpha)*W, x=dir(alpha)*X, y=dir(alpha)*Y, z=dir(alpha)*Z; draw(W--X--Y--Z--cycle^^w--x--y--z--cycle); pair A=intersectionpoint(Y--Z, y--z),  C=intersectionpoint(Y--X, y--x),  E=intersectionpoint(W--X, w--x),  G=intersectionpoint(W--Z, w--z),  B=intersectionpoint(Y--Z, y--x),  D=intersectionpoint(Y--X, w--x),  F=intersectionpoint(W--X, w--z),  H=intersectionpoint(W--Z, y--z); dot(O); label("$O$", O, SE); label("$A$", A, dir(O--A)); label("$B$", B, dir(O--B)); label("$C$", C, dir(O--C)); label("$D$", D, dir(O--D)); label("$E$", E, dir(O--E)); label("$F$", F, dir(O--F)); label("$G$", G, dir(O--G)); label("$H$", H, dir(O--H));[/asy]

Solution: Triangles $AOB$ $BOC$ $COD$ , etc. are congruent by symmetry (you can prove it rigorously by using the power of a point to argue that exactly two chords of length $1$ in the circumcircle of the squares pass through $B$ , etc.), and each area is $\frac{\frac{43}{99}\cdot\frac{1}{2}}{2}$ . Since the area of a triangle is $bh/2$ , the area of all $8$ of them is $\frac{86}{99}$ and the answer is $\boxed{185}$

Answer:  185
Problem: The two squares shown share the same center $O_{}$ and have sides of length 1. The length of $\overline{AB}$ is $43/99$ and the area of octagon $ABCDEFGH$ is $m/n,$ where $m_{}$ and $n_{}$ are relatively prime positive integers .  Find $m+n.$
[asy] //code taken from thread for problem real alpha = 25; pair W=dir(225), X=dir(315), Y=dir(45), Z=dir(135), O=origin; pair w=dir(alpha)*W, x=dir(alpha)*X, y=dir(alpha)*Y, z=dir(alpha)*Z; draw(W--X--Y--Z--cycle^^w--x--y--z--cycle); pair A=intersectionpoint(Y--Z, y--z),  C=intersectionpoint(Y--X, y--x),  E=intersectionpoint(W--X, w--x),  G=intersectionpoint(W--Z, w--z),  B=intersectionpoint(Y--Z, y--x),  D=intersectionpoint(Y--X, w--x),  F=intersectionpoint(W--X, w--z),  H=intersectionpoint(W--Z, y--z); dot(O); label("$O$", O, SE); label("$A$", A, dir(O--A)); label("$B$", B, dir(O--B)); label("$C$", C, dir(O--C)); label("$D$", D, dir(O--D)); label("$E$", E, dir(O--E)); label("$F$", F, dir(O--F)); label("$G$", G, dir(O--G)); label("$H$", H, dir(O--H));[/asy]

Solution: Define the two possible distances from one of the labeled points and the corners of the square upon which the point lies as $x$ and $y$ . The area of the octagon (by subtraction of areas) is $1 - 4\left(\frac{1}{2}xy\right) = 1 - 2xy$
By the Pythagorean theorem \[x^2 + y^2 = \left(\frac{43}{99}\right)^2\]
Also, \begin{align*}x + y + \frac{43}{99} &= 1\\ x^2 + 2xy + y^2 &= \left(\frac{56}{99}\right)^2\end{align*}
Substituting, \begin{align*}\left(\frac{43}{99}\right)^2 + 2xy &= \left(\frac{56}{99}\right)^2 \\ 2xy = \frac{(56 + 43)(56 - 43)}{99^2} &= \frac{13}{99} \end{align*}
Thus, the area of the octagon is $1 - \frac{13}{99} = \frac{86}{99}$ , so $m + n = \boxed{185}$

Answer:  185
Problem: For any positive integer $x_{}$ , let $S(x)$ be the sum of the digits of $x_{}$ , and let $T(x)$ be $|S(x+2)-S(x)|.$ For example, $T(199)=|S(201)-S(199)|=|3-19|=16.$ How many values of $T(x)$ do not exceed 1999?

Solution: For most values of $x$ $T(x)$ will equal $2$ . For those that don't, the difference must be bumping the number up a ten, a hundred, etc. If we take $T(a999)$ as an example, \[|(a + 1) + 0 + 0 + 1 - (a + 9 + 9 + 9)| = |2 - 9(3)|\] And in general, the values of $T(x)$ will then be in the form of $|2 - 9n| = 9n - 2$ . From $7$ to $1999$ , there are $\left\lceil \frac{1999 - 7}{9}\right\rceil = 222$ solutions; including $2$ and there are a total of $\boxed{223}$ solutions.

Answer:  223
Problem: A transformation of the first quadrant of the coordinate plane maps each point $(x,y)$ to the point $(\sqrt{x},\sqrt{y}).$ The vertices of quadrilateral $ABCD$ are $A=(900,300), B=(1800,600), C=(600,1800),$ and $D=(300,900).$ Let $k_{}$ be the area of the region enclosed by the image of quadrilateral $ABCD.$ Find the greatest integer that does not exceed $k_{}.$

Solution: \begin{eqnarray*}A' = & (\sqrt {900}, \sqrt {300})\\ B' = & (\sqrt {1800}, \sqrt {600})\\ C' = & (\sqrt {600}, \sqrt {1800})\\ D' = & (\sqrt {300}, \sqrt {900}) \end{eqnarray*}
First we see that lines passing through $AB$ and $CD$ have equations $y = \frac {1}{3}x$ and $y = 3x$ , respectively. Looking at the points above, we see the equations for $A'B'$ and $C'D'$ are $y^2 = \frac {1}{3}x^2$ and $y^2 = 3x^2$ , or, after manipulation $y = \frac {x}{\sqrt {3}}$ and $y = \sqrt {3}x$ , respectively, which are still linear functions. Basically the square of the image points gives back the original points and we could plug them back into the original equation to get the equation of the image lines.
Now take a look at $BC$ and $AD$ , which have the equations $y = - x + 2400$ and $y = - x + 1200$ . The image equations hence are $x^2 + y^2 = 2400$ and $x^2 + y^2 = 1200$ , respectively, which are the equations for circles
1999 AIME-6.png
To find the area between the circles (actually, parts of the circles), we need to figure out the angle of the arc . This could be done by $\arctan \sqrt {3} - \arctan \frac {1}{\sqrt {3}} = 60^\circ - 30^\circ = 30^\circ$ . So the requested areas are the area of the enclosed part of the smaller circle subtracted from the area enclosed by the part of the larger circle = $\frac {30^\circ}{360^\circ}(R^2\pi - r^2\pi) = \frac {1}{12}(2400\pi - 1200\pi) = 100\pi$ . Hence the answer is $\boxed{314}$

Answer:  314