Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: Let $N$ be the number of consecutive $0$ 's at the right end of the decimal representation of the product $1!2!3!4!\cdots99!100!.$ Find the remainder when $N$ is divided by $1000$

Solution: A number in decimal notation ends in a zero for each power of ten which divides it.  Thus, we need to count both the number of 5s and the number of 2s dividing into our given expression.  Since there are clearly more 2s than 5s, it is sufficient to count the number of 5s.
One way to do this is as follows: $96$ of the numbers $1!,\ 2!,\ 3!,\ 100!$ have a factor of $5$ $91$ have a factor of $10$ $86$ have a factor of $15$ . And so on. This gives us an initial count of $96 + 91 + 86 + \ldots + 1$ .  Summing this arithmetic series of $20$ terms, we get $970$ .  However, we have neglected some powers of $5$ - every $n!$ term for $n\geq25$ has an additional power of $5$ dividing it, for $76$ extra; every n! for $n\geq 50$ has one more in addition to that, for a total of $51$ extra; and similarly there are $26$ extra from those larger than $75$ and $1$ extra from $100$ .  Thus, our final total is $970 + 76 + 51 + 26 + 1 = 1124$ , and the answer is $\boxed{124}$

Answer:  124
Problem: The number $\sqrt{104\sqrt{6}+468\sqrt{10}+144\sqrt{15}+2006}$ can be written as $a\sqrt{2}+b\sqrt{3}+c\sqrt{5},$ where $a, b,$ and $c$ are positive integers . Find $abc$

Solution: We begin by equating the two expressions:
\[a\sqrt{2}+b\sqrt{3}+c\sqrt{5} = \sqrt{104\sqrt{6}+468\sqrt{10}+144\sqrt{15}+2006}\]
Squaring both sides yields:
\[2ab\sqrt{6} + 2ac\sqrt{10} + 2bc\sqrt{15} + 2a^2 + 3b^2 + 5c^2 = 104\sqrt{6}+468\sqrt{10}+144\sqrt{15}+2006\]
Since $a$ $b$ , and $c$ are integers, we can match coefficients:
\begin{align*} 2ab\sqrt{6} &= 104\sqrt{6} \\  2ac\sqrt{10} &=468\sqrt{10} \\  2bc\sqrt{15} &=144\sqrt{15}\\  2a^2 + 3b^2 + 5c^2 &=2006 \end{align*}
Solving the first three equations gives: \begin{eqnarray*}ab &=& 52\\  ac &=& 234\\  bc &=& 72 \end{eqnarray*}
Multiplying these equations gives $(abc)^2 = 52 \cdot 234 \cdot 72 = 2^63^413^2 \Longrightarrow abc = \boxed{936}$

Answer:  936
Problem: The number $\sqrt{104\sqrt{6}+468\sqrt{10}+144\sqrt{15}+2006}$ can be written as $a\sqrt{2}+b\sqrt{3}+c\sqrt{5},$ where $a, b,$ and $c$ are positive integers . Find $abc$

Solution: We realize that the quantity under the largest radical is a perfect square and attempt to rewrite the radicand as a square. Start by setting $x=\sqrt{2}$ $y=\sqrt{3}$ , and $z=\sqrt{5}$ .  Since
\[(px+qy+rz)^2=p^2x^2+q^2y^2+r^2z^2+2(pqxy+prxz+qryz)\]
we attempt to rewrite the radicand in this form:
\[2006+2(52xy+234xz+72yz)\]
Factoring, we see that $52=13\cdot4$ $234=13\cdot18$ , and $72=4\cdot18$ . Setting $p=13$ $q=4$ , and $r=18$ , we see that
\[2006=13^2x^2+4^2y^2+18^2z^2=169\cdot2+16\cdot3+324\cdot5\]
so our numbers check. Thus $104\sqrt{2}+468\sqrt{3}+144\sqrt{5}+2006=(13\sqrt{2}+4\sqrt{3}+18\sqrt{5})^2$ . Square rooting gives us $13\sqrt{2}+4\sqrt{3}+18\sqrt{5}$ and our answer is $13\cdot4\cdot18=\boxed{936}$

Answer:  936
Problem: Let $\mathcal{S}$ be the set of real numbers that can be represented as repeating decimals of the form $0.\overline{abc}$ where $a, b, c$ are distinct digits . Find the sum of the elements of $\mathcal{S}.$

Solution: Numbers of the form $0.\overline{abc}$ can be written as $\frac{abc}{999}$ . There are $10\times9\times8=720$ such numbers. Each digit will appear in each place value $\frac{720}{10}=72$ times, and the sum of the digits, 0 through 9, is 45. So the sum of all the numbers is $\frac{45\times72\times111}{999}= \boxed{360}$

Answer:  360
Problem: Let $\mathcal{S}$ be the set of real numbers that can be represented as repeating decimals of the form $0.\overline{abc}$ where $a, b, c$ are distinct digits . Find the sum of the elements of $\mathcal{S}.$

Solution: Alternatively, for every number, $0.\overline{abc}$ , there will be exactly one other number, such that when they are added together, the sum is $0.\overline{999}$ , or, more precisely, 1. As an example, $.\overline{123}+.\overline{876}=.\overline{999} \Longrightarrow 1$
Thus, the solution can be determined by dividing the total number of permutations by 2. The answer is $\frac{10 \cdot 9 \cdot 8}{2} = \frac{720}{2}= \boxed{360}$

Answer:  360
Problem: An angle is drawn on a set of equally spaced parallel lines as shown. The ratio of the area of shaded region $C$ to the area of shaded region $B$ is 11/5. Find the ratio of shaded region $D$ to the area of shaded region $A.$
[asy] defaultpen(linewidth(0.7)+fontsize(10)); for(int i=0; i<4; i=i+1) { fill((2*i,0)--(2*i+1,0)--(2*i+1,6)--(2*i,6)--cycle, mediumgray); } pair A=(1/3,4), B=A+7.5*dir(-17), C=A+7*dir(10); draw(B--A--C); fill((7.3,0)--(7.8,0)--(7.8,6)--(7.3,6)--cycle, white); clip(B--A--C--cycle); for(int i=0; i<9; i=i+1) { draw((i,1)--(i,6)); } label("$\mathcal{A}$", A+0.2*dir(-17), S); label("$\mathcal{B}$", A+2.3*dir(-17), S); label("$\mathcal{C}$", A+4.4*dir(-17), S); label("$\mathcal{D}$", A+6.5*dir(-17), S);[/asy]

Solution: Note that the apex of the angle is not on the parallel lines. Set up a coordinate proof
Let the set of parallel lines be perpendicular to the x-axis , such that they cross it at $0, 1, 2 \ldots$ . The base of region $\mathcal{A}$ is on the line $x = 1$ . The bigger base of region $\mathcal{D}$ is on the line $x = 7$ . 
Let the top side of the angle be $y = x - s$ and the bottom side be x-axis, as dividing the angle doesn't change the problem.
Since the area of the triangle is equal to $\frac{1}{2}bh$
\[\frac{\textrm{Region\ }\mathcal{C}}{\textrm{Region\ }\mathcal{B}} = \frac{11}{5} = \frac{\frac 12(5-s)^2 - \frac 12(4-s)^2}{\frac 12(3-s)^2 - \frac12(2-s)^2}\]
Solve this to find that $s = \frac{5}{6}$
Using the same reasoning as above, we get $\frac{\textrm{Region\ }\mathcal{D}}{\textrm{Region\ }\mathcal{A}} = \frac{\frac 12(7-s)^2 - \frac 12(6-s)^2}{\frac 12(1-s)^2}$ , which is $\boxed{408}$

Answer:  408
Problem: An angle is drawn on a set of equally spaced parallel lines as shown. The ratio of the area of shaded region $C$ to the area of shaded region $B$ is 11/5. Find the ratio of shaded region $D$ to the area of shaded region $A.$
[asy] defaultpen(linewidth(0.7)+fontsize(10)); for(int i=0; i<4; i=i+1) { fill((2*i,0)--(2*i+1,0)--(2*i+1,6)--(2*i,6)--cycle, mediumgray); } pair A=(1/3,4), B=A+7.5*dir(-17), C=A+7*dir(10); draw(B--A--C); fill((7.3,0)--(7.8,0)--(7.8,6)--(7.3,6)--cycle, white); clip(B--A--C--cycle); for(int i=0; i<9; i=i+1) { draw((i,1)--(i,6)); } label("$\mathcal{A}$", A+0.2*dir(-17), S); label("$\mathcal{B}$", A+2.3*dir(-17), S); label("$\mathcal{C}$", A+4.4*dir(-17), S); label("$\mathcal{D}$", A+6.5*dir(-17), S);[/asy]

Solution: Note that the sections between the two transversals can be divided into one small triangle and a number of trapezoids. Let one side length (not on a parallel line) of the small triangle be $x$ and the area of it be $x^2$ . Also, let all sections of the line on the same side as the side with length $x$ on a trapezoid be equal to $1$
Move on to the second-smallest triangle, formed by attaching this triangle with the next trapezoid. Parallel lines give us similar triangles, so we know the proportion of this triangle to the previous triangle is ${\left(\frac{x+1}{x}\right)}^2$ . Multiplying, we get $(x+1)^2$ as the area of the triangle, so the area of the trapezoid is $2x+1$ . Repeating this process, we get that the area of B is $2x+3$ , the area of C is $2x+7$ , and the area of D is $2x+11$
We can now use the given condition that the ratio of C and B is $\frac{11}{5}$
$\frac{11}{5} = \frac{2x+7}{2x+3}$ gives us $x = \frac{1}{6}$
So now we compute the ratio of D and A, which is $\frac{(2)(\frac{1}{6}) + 11}{(\frac{1}{6})^2} = \boxed{408.}$

Answer:  408.
Problem: An angle is drawn on a set of equally spaced parallel lines as shown. The ratio of the area of shaded region $C$ to the area of shaded region $B$ is 11/5. Find the ratio of shaded region $D$ to the area of shaded region $A.$
[asy] defaultpen(linewidth(0.7)+fontsize(10)); for(int i=0; i<4; i=i+1) { fill((2*i,0)--(2*i+1,0)--(2*i+1,6)--(2*i,6)--cycle, mediumgray); } pair A=(1/3,4), B=A+7.5*dir(-17), C=A+7*dir(10); draw(B--A--C); fill((7.3,0)--(7.8,0)--(7.8,6)--(7.3,6)--cycle, white); clip(B--A--C--cycle); for(int i=0; i<9; i=i+1) { draw((i,1)--(i,6)); } label("$\mathcal{A}$", A+0.2*dir(-17), S); label("$\mathcal{B}$", A+2.3*dir(-17), S); label("$\mathcal{C}$", A+4.4*dir(-17), S); label("$\mathcal{D}$", A+6.5*dir(-17), S);[/asy]

Solution: Let the distances from the apex to the parallel lines be $x$ and $y$ and the distance between the intersections be $a,b.$ We know the area ratio means $\frac{(x+4a)(y+4b)-(x+3a)(y+3b)}{(x+2a)(y+2b)-(x+a)(y+b)} =\frac{5}{11}$ which simplifying yields $ab = 3ay+3bx.$ The ratio we seek is $\frac{(x+6a)(y+6b)-(x+5a)(y+5b)}{xy} =\frac{ay+yx+11ab}{xy}.$ We know that $ab = 3ay+3bx$ so the ratio we seed is $\frac{33(ay+yx)}{11xy}.$ Finally note that by similar triangles $\frac{x}{x+a} =\frac{y}{y+b} \implies bx = ya.$ Therefore the ratio we seek is $\frac{66(ay)}{11xy} =\frac{66a}{11x}.$ Finally note that $ab=3ay+3bx \implies ab = 6bx \implies a = 6x$ so the final ratio is $6 \cdot 68 = \boxed{408}.$

Answer:  408
Problem: Hexagon $ABCDEF$ is divided into five rhombuses $\mathcal{P, Q, R, S,}$ and $\mathcal{T,}$ as shown. Rhombuses $\mathcal{P, Q, R,}$ and $\mathcal{S}$ are congruent , and each has area $\sqrt{2006}.$ Let $K$ be the area of rhombus $\mathcal{T}$ .  Given that $K$ is a positive integer , find the number of possible values for $K$
[asy] // TheMathGuyd size(8cm); pair A=(0,0), B=(4.2,0), C=(5.85,-1.6), D=(4.2,-3.2), EE=(0,-3.2), F=(-1.65,-1.6), G=(0.45,-1.6), H=(3.75,-1.6), I=(2.1,0), J=(2.1,-3.2), K=(2.1,-1.6); draw(A--B--C--D--EE--F--cycle); draw(F--G--(2.1,0)); draw(C--H--(2.1,0)); draw(G--(2.1,-3.2)); draw(H--(2.1,-3.2)); label("$\mathcal{T}$",(2.1,-1.6)); label("$\mathcal{P}$",(0,-1),NE); label("$\mathcal{Q}$",(4.2,-1),NW); label("$\mathcal{R}$",(0,-2.2),SE); label("$\mathcal{S}$",(4.2,-2.2),SW); [/asy]

Solution: Let $x$ denote the common side length of the rhombi.
Let $y$ denote one of the smaller interior angles of rhombus $\mathcal{P}$ . Then $x^2\sin(y)=\sqrt{2006}$ .  We also see that $K=x^2\sin(2y) \Longrightarrow K=2x^2\sin y \cdot \cos y \Longrightarrow K = 2\sqrt{2006}\cdot \cos y$ .  Thus $K$ can be any positive integer in the interval $(0, 2\sqrt{2006})$ $2\sqrt{2006} = \sqrt{8024}$ and $89^2 = 7921 < 8024 < 8100 = 90^2$ , so $K$ can be any integer between 1 and 89, inclusive.  Thus the number of positive values for $K$ is $\boxed{089}$

Answer:  089
Problem: Hexagon $ABCDEF$ is divided into five rhombuses $\mathcal{P, Q, R, S,}$ and $\mathcal{T,}$ as shown. Rhombuses $\mathcal{P, Q, R,}$ and $\mathcal{S}$ are congruent , and each has area $\sqrt{2006}.$ Let $K$ be the area of rhombus $\mathcal{T}$ .  Given that $K$ is a positive integer , find the number of possible values for $K$
[asy] // TheMathGuyd size(8cm); pair A=(0,0), B=(4.2,0), C=(5.85,-1.6), D=(4.2,-3.2), EE=(0,-3.2), F=(-1.65,-1.6), G=(0.45,-1.6), H=(3.75,-1.6), I=(2.1,0), J=(2.1,-3.2), K=(2.1,-1.6); draw(A--B--C--D--EE--F--cycle); draw(F--G--(2.1,0)); draw(C--H--(2.1,0)); draw(G--(2.1,-3.2)); draw(H--(2.1,-3.2)); label("$\mathcal{T}$",(2.1,-1.6)); label("$\mathcal{P}$",(0,-1),NE); label("$\mathcal{Q}$",(4.2,-1),NW); label("$\mathcal{R}$",(0,-2.2),SE); label("$\mathcal{S}$",(4.2,-2.2),SW); [/asy]

Solution: Call the side of each rhombus w. w is the width of the rhombus. Call the height h, where $w*h=\sqrt{2006}$ . The height of rhombus T would be 2h, and the width would be $\sqrt{w^2-h^2}$ . Substitute the first equation to get $\sqrt{\frac{2006}{h^2}-h^2}$ . Then the area of the rhombus would be $2h * \sqrt{\frac{2006}{h^2}-h^2}$ . Combine like terms to get $2 * \sqrt{2006-h^4}$ . This expression equals an integer K. $2006-h^4$ specifically must be in the form $n^2/4$ . There is no restriction on h as long as it is a positive real number, so all we have to do is find all the positive possible values of $n^2$ for $2006-h^4$ . Now, quick testing shows that $44^2 < 2006$ and $45^2>2006$ , but we must also test $44.5^2$ , because the product of two will make it an integer. $44.5^2$ is also less than $2006$ , so we have numbers 1-44, times two because 0.5 can be added to each of time, plus 1, because 0.5 is also a valid value. (notice 0 is not valid because the height must be a positive number) That gives us $44*2+1=$ $\boxed{089}$

Answer:  089
Problem: Hexagon $ABCDEF$ is divided into five rhombuses $\mathcal{P, Q, R, S,}$ and $\mathcal{T,}$ as shown. Rhombuses $\mathcal{P, Q, R,}$ and $\mathcal{S}$ are congruent , and each has area $\sqrt{2006}.$ Let $K$ be the area of rhombus $\mathcal{T}$ .  Given that $K$ is a positive integer , find the number of possible values for $K$
[asy] // TheMathGuyd size(8cm); pair A=(0,0), B=(4.2,0), C=(5.85,-1.6), D=(4.2,-3.2), EE=(0,-3.2), F=(-1.65,-1.6), G=(0.45,-1.6), H=(3.75,-1.6), I=(2.1,0), J=(2.1,-3.2), K=(2.1,-1.6); draw(A--B--C--D--EE--F--cycle); draw(F--G--(2.1,0)); draw(C--H--(2.1,0)); draw(G--(2.1,-3.2)); draw(H--(2.1,-3.2)); label("$\mathcal{T}$",(2.1,-1.6)); label("$\mathcal{P}$",(0,-1),NE); label("$\mathcal{Q}$",(4.2,-1),NW); label("$\mathcal{R}$",(0,-2.2),SE); label("$\mathcal{S}$",(4.2,-2.2),SW); [/asy]

Solution: [asy] size(8cm); pair A=(0,0), B=(4.2,0), C=(5.85,-1.6), D=(4.2,-3.2), EE=(0,-3.2), F=(-1.65,-1.6), G=(0.45,-1.6), H=(3.75,-1.6), I=(2.1,0), J=(2.1,-3.2), K=(2.1,-1.6); draw(A--B--C--D--EE--F--cycle); label("$A$",A,2*N); label("$B$",B,2*N); label("$C$",C,2*E); label("$D$",D,2*S); label("$E$",EE,2*S); label("$F$",F,2*W); label("$G$",(0.47,-1.55),NW); label("$H$",(3.73,-1.55),NE); label("$I$",I,2*N); label("$J$",J,2*S); label("$K$",K,2*SW); draw(F--C); draw(F--G--(2.1,0)); draw(C--H--(2.1,0)); draw(G--(2.1,-3.2)); draw(H--(2.1,-3.2)); draw((2.1,0)--(2.1,-3.2)); [/asy] To determine the possible values of $[GIHJ],$ we must determine the maximum and minimum possible areas.
In the case where the $4$ rhombi are squares, we have $[GIHJ]=0,$ implying the minimum possible positive-integer-valued area is $1.$
Denote the length $HC=a$ and $KH=b.$ We have \[KI=\sqrt{a^2-b^2}\] by the Pythagorean Theorem, which implies \[[IBCH]=a\sqrt{a^2-b^2}=\sqrt{2006}\] and \[[GIHJ]=2b\sqrt{a^2-b^2}.\] The first equation yields \[\sqrt{a^2-b^2}=\frac{\sqrt{2006}}{a}.\] Plugging into the second, we have \[[GIHJ]=2\sqrt{2006}\frac{b}{a}.\] The maximal value of $\frac{b}{a}$ occurs when the height of $ABCDEF$ is minimized, which means \[\frac{b}{a}\leq 1.\] Plugging back up, we have \[[GIHJ]\leq 2\sqrt{2006}=\sqrt{8024}.\] We have \[\lfloor \sqrt{8024} \rfloor = 89,\] thus our answer is \[89-1+1=\boxed{089}.\]

Answer:  089
Problem: The sequence $a_1, a_2, \ldots$ is geometric with $a_1=a$ and common ratio $r,$ where $a$ and $r$ are positive integers. Given that $\log_8 a_1+\log_8 a_2+\cdots+\log_8 a_{12} = 2006,$ find the number of possible ordered pairs $(a,r).$

Solution: \[\log_8 a_1+\log_8 a_2+\ldots+\log_8 a_{12}= \log_8 a+\log_8 (ar)+\ldots+\log_8 (ar^{11}) \\ = \log_8(a\cdot ar\cdot ar^2\cdot \cdots \cdot ar^{11}) = \log_8  (a^{12}r^{66})\]
So our question is equivalent to solving $\log_8 (a^{12}r^{66})=2006$ for $a, r$ positive integers $a^{12}r^{66}=8^{2006} = (2^3)^{2006} = (2^6)^{1003}$ so $a^{2}r^{11}=2^{1003}$
The product of $a^2$ and $r^{11}$ is a power of 2.  Since both numbers have to be integers, this means that $a$ and $r$ are themselves powers of 2.  Now, let $a=2^x$ and $r=2^y$
\begin{eqnarray*}(2^x)^2\cdot(2^y)^{11}&=&2^{1003}\\ 2^{2x}\cdot 2^{11y}&=&2^{1003}\\ 2x+11y&=&1003\\ y&=&\frac{1003-2x}{11} \end{eqnarray*}
For $y$ to be an integer, the numerator must be divisible by $11$ .  This occurs when $x=1$ because $1001=91*11$ . Because only even integers are being subtracted from $1003$ , the numerator never equals an even multiple of $11$ . Therefore, the numerator takes on the value of every odd multiple of $11$ from $11$ to $1001$ .  Since the odd multiples are separated by a distance of $22$ , the number of ordered pairs that work is $1 + \frac{1001-11}{22}=1 + \frac{990}{22}=46$ .  (We must add 1 because both endpoints are being included.) So the answer is $\boxed{046}$

Answer:  046
Problem: The sequence $a_1, a_2, \ldots$ is geometric with $a_1=a$ and common ratio $r,$ where $a$ and $r$ are positive integers. Given that $\log_8 a_1+\log_8 a_2+\cdots+\log_8 a_{12} = 2006,$ find the number of possible ordered pairs $(a,r).$

Solution: Using the above method, we can derive that $a^{2}r^{11} = 2^{1003}$ .
Now, think about what happens when r is an even power of 2. Then $a^{2}$ must be an odd power of 2 in order to satisfy the equation which is clearly not possible. Thus the only restriction r has is that it must be an odd power of 2, so $2^{1}$ $2^{3}$ $2^{5}$ .... all work for r, until r hits $2^{93}$ , when it gets greater than $2^{1003}$ , so the greatest value for r is $2^{91}$ . All that's left is to count the number of odd integers between 1 and 91 (inclusive), which yields $\boxed{046}$

Answer:  046
Problem: The sequence $a_1, a_2, \ldots$ is geometric with $a_1=a$ and common ratio $r,$ where $a$ and $r$ are positive integers. Given that $\log_8 a_1+\log_8 a_2+\cdots+\log_8 a_{12} = 2006,$ find the number of possible ordered pairs $(a,r).$

Solution: Using the method from Solution 1, we get $\log_8a^{12}r^{66}=2006 \implies a^{12}r^{66}=8^{2006}=2^{6018}$
Since $a$ and $r$ both have to be powers of $2$ , we can rewrite this as $12x+66y=6018$
$6018 \equiv 66 \equiv 6\pmod{12}$ . So, when we subtract $12$ from $6018$ , the result is divisible by $66$ . Evaluating that, we get $(1,91)$ as a valid solution. Since $66 \cdot 2 = 12 \cdot 11$ , when we add $11$ to the value of $a$ , we can subtract $2$ from the value of $r$ to keep the equation valid. Using this, we get $(1,91),(12,89),(23,87), \cdots (541,1)$ . In order to count the number of ordered pairs, we can simply count the number of $y$ values. Every odd number from $1$ to $91$ is included, so we have $\boxed{046}$ solutions.

Answer:  046
Problem: Eight circles of diameter 1 are packed in the first quadrant of the coordinate plane as shown. Let region $\mathcal{R}$ be the union of the eight circular regions. Line $l,$ with slope 3, divides $\mathcal{R}$ into two regions of equal area. Line $l$ 's equation can be expressed in the form $ax=by+c,$ where $a, b,$ and $c$ are positive integers whose greatest common divisor is 1. Find $a^2+b^2+c^2.$ [asy] size(150);defaultpen(linewidth(0.7)); draw((6.5,0)--origin--(0,6.5), Arrows(5)); int[] array={3,3,2}; int i,j; for(i=0; i<3; i=i+1) { for(j=0; j<array[i]; j=j+1) { draw(Circle((1+2*i,1+2*j),1)); }} label("x", (7,0)); label("y", (0,7));[/asy]

Solution: The line passing through the tangency point of the bottom left circle and the one to its right and through the tangency of the top circle in the middle column and the one beneath it is the line we are looking for: a line passing through the tangency of two circles cuts congruent areas, so our line cuts through the four aforementioned circles splitting into congruent areas, and there are an additional two circles on each side. The line passes through $\left(1,\frac 12\right)$ and $\left(\frac 32,2\right)$ , which can be easily solved to be $6x = 2y + 5$ . Thus, $a^2 + b^2 + c^2 = \boxed{065}$

Answer:  065
Problem: Eight circles of diameter 1 are packed in the first quadrant of the coordinate plane as shown. Let region $\mathcal{R}$ be the union of the eight circular regions. Line $l,$ with slope 3, divides $\mathcal{R}$ into two regions of equal area. Line $l$ 's equation can be expressed in the form $ax=by+c,$ where $a, b,$ and $c$ are positive integers whose greatest common divisor is 1. Find $a^2+b^2+c^2.$ [asy] size(150);defaultpen(linewidth(0.7)); draw((6.5,0)--origin--(0,6.5), Arrows(5)); int[] array={3,3,2}; int i,j; for(i=0; i<3; i=i+1) { for(j=0; j<array[i]; j=j+1) { draw(Circle((1+2*i,1+2*j),1)); }} label("x", (7,0)); label("y", (0,7));[/asy]

Solution: This problem looks daunting at a first glance, but we can make geometric inequality inferences by drawing lines that simplify the problem by removing sections of the total area. To begin, we can eliminate the possibility of the line intersecting the circle on the top left (call it circle A), or the circle on the bottom right (call it circle B). This is can be seen visually by drawing a line with slope 3 that is tangent to either of these circles. The area is clearly larger on one side; this can be proven by counting full circles. We can go on with the same mindset and eliminate the circle below circle A and the circle above circle B. By removing pairs of circles and proving the line will never intersect with them, we can safely work with whatever is remaining. By now you should have 4 circles making an L shape (waluigi style). Now the two biggest contenders for this method are the two circles on the bottom row. Using the same strategy, we can see that a line that goes through the tangent point of these two circles also goes through the tangent point of the other two circles. This clearly will cut the 4 circles into two regions of equal area. Using super advanced linear algebra we get: $6x = 2y + 5$ . The answer is then $6^2 + 2^2 + 5^2 = \boxed{065}$ . This solution is an alternate explanation to solution 1.

Answer:  065
Problem: A collection of 8 cubes consists of one cube with edge length $k$ for each integer $k, 1 \le k \le 8.$ A tower is to be built using all 8 cubes according to the rules:
Let $T$ be the number of different towers than can be constructed. What is the remainder when $T$ is divided by 1000?

Solution: We proceed recursively .  Suppose we can build $T_m$ towers using blocks of size $1, 2, \ldots, m$ .  How many towers can we build using blocks of size $1, 2, \ldots, m, m + 1$ ?  If we remove the block of size $m + 1$ from such a tower (keeping all other blocks in order), we get a valid tower using blocks $1, 2, \ldots, m$ .  Given a tower using blocks $1, 2, \ldots, m$ (with $m \geq 2$ ), we can insert the block of size $m + 1$ in exactly 3 places: at the beginning, immediately following the block of size $m - 1$ or immediately following the block of size $m$ .  Thus, there are 3 times as many towers using blocks of size $1, 2, \ldots, m, m + 1$ as there are towers using only $1, 2, \ldots, m$ .  There are 2 towers which use blocks $1, 2$ , so there are $2\cdot 3^6 = 1458$ towers using blocks $1, 2, \ldots, 8$ , so the answer is $\boxed{458}$

Answer:  458
Problem: Find the sum of the values of $x$ such that $\cos^3 3x+ \cos^3 5x = 8 \cos^3 4x \cos^3 x$ , where $x$ is measured in degrees and $100< x< 200.$

Solution: Observe that $2\cos 4x\cos x = \cos 5x + \cos 3x$ by the sum-to-product formulas. Defining $a = \cos 3x$ and $b = \cos 5x$ , we have $a^3 + b^3 = (a+b)^3 \rightarrow ab(a+b) = 0$ . But $a+b = 2\cos 4x\cos x$ , so we require $\cos x = 0$ $\cos 3x = 0$ $\cos 4x = 0$ , or $\cos 5x = 0$
Hence we see by careful analysis of the cases that the solution set is $A = \{150, 126, 162, 198, 112.5, 157.5\}$ and thus $\sum_{x \in A} x = \boxed{906}$

Answer:  906