Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: Let $N$ be the number of ways to write $2010$ in the form $2010 = a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0$ , where the $a_i$ 's are integers, and $0 \le a_i \le 99$ . An example of such a representation is $1\cdot 10^3 + 3\cdot 10^2 + 67\cdot 10^1 + 40\cdot 10^0$ . Find $N$

Solution: Note that $a_0 \equiv 2010\ (\textrm{mod}\ 10)$ and $a_1 \equiv 2010 - a_0\  (\textrm{mod}\ 100)$ . It's easy to see that exactly 10 values in $0 \leq a_0 \leq 99$ that satisfy our first congruence. Similarly, there are 10 possible values of $a_1$ for each choice of $a_0$ . Thus, there are $10 \times 10 = 100$ possible choices for $a_0$ and $a_1$ . We next note that if $a_0$ and $a_1$ are chosen, then a valid value of $a_3$ determines $a_2$ , so we dive into some simple casework:
Our answer is thus $6 + 0 + 196 = \boxed{202}$

Answer:  202
Problem: Let $N$ be the number of ways to write $2010$ in the form $2010 = a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0$ , where the $a_i$ 's are integers, and $0 \le a_i \le 99$ . An example of such a representation is $1\cdot 10^3 + 3\cdot 10^2 + 67\cdot 10^1 + 40\cdot 10^0$ . Find $N$

Solution: We immediately see that $a_3$ can only be $0$ $1$ or $2$ . We also note that the maximum possible value for $10a_1 + a_0$ is $990 + 99 = 1089$ . We then split into cases:
Case 1: $a_3 = 0$ .
We try to find possible values of $a_2$ . We plug in $a_3 = 0$ and $10a_1 + a_0 = 1089$ to our initial equation, which gives us $2010 = 0 + 100a_2 + 1089$ . Thus $a_2 \geq 10$ . We also see that $a_2 \leq 20$ . We now take these values of $a_2$ and find the number of pairs $(a_1, a_0)$ that work. If $a_2 = 10$ $10a_1 + a_0 = 1010$ . We see that there are $8$ possible pairs in this case. Using the same logic, there are $10$ ways for $a_2 = 11, 12 \ldots 19$ . For $a_2 = 20$ , we get the equation $10a_1 + a_0 = 10$ , for 2 ways. Thus, for $a_3 = 0$ , there are $8 + 10 \cdot 9 + 2 = 100$ ways.
Case 2: $a_3 = 1$ .
This case is almost identical to the one above, except $0 \leq a_2 \leq 10$ . We also get 100 ways.
Case 3: $a_3 = 2$ .
If $a_3 = 2$ , our initial equation becomes $100a_2 + 10a_1 + a_0 = 10$ . It is obvious that $a_2 = 0$ , and we are left with $10a_1 + a_0 = 10$ . We saw above that there are $2$ ways.
Totaling everything, we get that there are $100 + 100 + 2 = \boxed{202}$ ways.

Answer:  202
Problem: Let $N$ be the number of ways to write $2010$ in the form $2010 = a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0$ , where the $a_i$ 's are integers, and $0 \le a_i \le 99$ . An example of such a representation is $1\cdot 10^3 + 3\cdot 10^2 + 67\cdot 10^1 + 40\cdot 10^0$ . Find $N$

Solution: We will represent the problem using generating functions. Consider the generating function \[f(x) = (1+x^{1000}+x^{2000}+\cdots+x^{99000})(1+x^{100}+x^{200}+\cdots+x^{9900})(1+x^{10}+x^{20}+\cdots+x^{990})(1+x+x^2+\cdots+x^{99})\] where the first factor represents $a_3$ , the second factor $a_2$ , and so forth. We want to find the coefficient of $x^{2010}$ in the expansion of $f(x)$ . Now rewriting each factor using the geometric series yields \[f(x) = \frac{\cancel{x^{100}-1}}{x-1} \cdot \frac{\cancel{x^{1000}-1}}{x^{10}-1} \cdot \frac{x^{10000}-1}{\cancel{x^{100}-1}} \cdot \frac{x^{100000}-1}{\cancel{x^{1000}-1}}=\frac{x^{10000}-1}{x-1} \cdot \frac{x^{100000}-1}{x^{10}-1} = (1+x+x^2+\cdots + x^{9999})(1+x^{10}+x^{20}+\cdots+x^{99990})\] The coefficient of $x^{2010}$ in this is simply $\boxed{202}$ , as we can choose any of the first 202 terms from the second factor and pair it with exactly one term in the first factor.

Answer:  202
Problem: Let $N$ be the number of ways to write $2010$ in the form $2010 = a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0$ , where the $a_i$ 's are integers, and $0 \le a_i \le 99$ . An example of such a representation is $1\cdot 10^3 + 3\cdot 10^2 + 67\cdot 10^1 + 40\cdot 10^0$ . Find $N$

Solution: First note that $a_3$ has to be a single-digit number( $0$ $1$ , or $2$ to be exact), and that $a_1$ has to be a two-digit multiple of ten.
Then, $a_3$ $a_2$ $a_1$ and $a_0$ can be represented as follows: \begin{align*} a_3 = a \\ a_2 = 10b+c \\ a_1= 10d+e \\ a_0 = 10f \end{align*} , where $a$ $b$ $c$ $d$ $e$ , and $f$ are all(not necessarily nonzero) digits.
Now, we can write our given equation as follows: \begin{align*} 2010 = 1000(a+b) + 100(c+d) + 10(e+f) \\ 201 = 100(a+b) + 10(c+d) + (e+f) \\ 201 = (100a + 10c + e) + (100b + d + f) \end{align*} Now, each integer between $0$ and $201$ inclusive can be represented in exactly one way as $100a + 10c + e$ , and this corresponds with one unique $100b + d + f$ , so it remains to count the number of integers between $0$ and $201$ inclusive. This is easily counted to be $\boxed{202}$ $\blacksquare$

Answer:  202
Problem: Let $\mathcal{R}$ be the region consisting of the set of points in the coordinate plane that satisfy both $|8 - x| + y \le 10$ and $3y - x \ge 15$ . When $\mathcal{R}$ is revolved around the line whose equation is $3y - x = 15$ , the volume of the resulting solid is $\frac {m\pi}{n\sqrt {p}}$ , where $m$ $n$ , and $p$ are positive integers, $m$ and $n$ are relatively prime , and $p$ is not divisible by the square of any prime. Find $m + n + p$

Solution: The inequalities are equivalent to $y \ge x/3 + 5, y \le 10 - |x - 8|$ . We can set them equal to find the two points of intersection, $x/3 + 5 = 10 - |x - 8| \Longrightarrow |x - 8| = 5 - x/3$ . This implies that one of $x - 8, 8 - x = 5 - x/3$ , from which we find that $(x,y) = \left(\frac 92, \frac {13}2\right), \left(\frac{39}{4}, \frac{33}{4}\right)$ . The region $\mathcal{R}$ is a triangle , as shown above. When revolved about the line $y = x/3+5$ , the resulting solid is the union of two right cones that share the same base and axis.
Let $h_1,h_2$ denote the height of the left and right cones, respectively (so $h_1 > h_2$ ), and let $r$ denote their common radius. The volume of a cone is given by $\frac 13 Bh$ ; since both cones share the same base, then the desired volume is $\frac 13 \cdot \pi r^2 \cdot (h_1 + h_2)$ . The distance from the point $(8,10)$ to the line $x - 3y + 15 = 0$ is given by $\left|\frac{(8) - 3(10) + 15}{\sqrt{1^2 + (-3)^2}}\right| = \frac{7}{\sqrt{10}}$ . The distance between $\left(\frac 92, \frac {13}2\right)$ and $\left(\frac{39}{4}, \frac{33}{4}\right)$ is given by $h_1 + h_2 = \sqrt{\left(\frac{18}{4} - \frac{39}{4}\right)^2 + \left(\frac{26}{4} - \frac{33}{4}\right)^2} = \frac{7\sqrt{10}}{4}$ . Thus, the answer is $\frac{343\sqrt{10}\pi}{120} = \frac{343\pi}{12\sqrt{10}} \Longrightarrow 343 + 12 + 10 = \boxed{365}$ . (Note to MAA: Is it a coincidence that this is the number of days in a non-leap year?)

Answer:  365
Problem: Let $m \ge 3$ be an integer and let $S = \{3,4,5,\ldots,m\}$ . Find the smallest value of $m$ such that for every partition of $S$ into two subsets, at least one of the subsets contains integers $a$ $b$ , and $c$ (not necessarily distinct) such that $ab = c$
Note : a partition of $S$ is a pair of sets $A$ $B$ such that $A \cap B = \emptyset$ $A \cup B = S$

Solution: We claim that $243$ is the minimal value of $m$ . Let the two partitioned sets be $A$ and $B$ ; we will try to partition $3, 9, 27, 81,$ and $243$ such that the $ab=c$ condition is not satisfied. Without loss of generality , we place $3$ in $A$ . Then $9$ must be placed in $B$ , so $81$ must be placed in $A$ , and $27$ must be placed in $B$ . Then $243$ cannot be placed in any set, so we know $m$ is less than or equal to $243$
For $m \le 242$ , we can partition $S$ into $S \cap \{3, 4, 5, 6, 7, 8, 81, 82, 83, 84 ... 242\}$ and $S \cap \{9, 10, 11 ... 80\}$ , and in neither set are there values where $ab=c$ (since $8 < (3\text{ to }8)^2 < 81$ and $81^2>242$ and $(9\text{ to }80)^2 > 80$ ). Thus $m = \boxed{243}$

Answer:  243
Problem: Rectangle $ABCD$ and a semicircle with diameter $AB$ are coplanar and have nonoverlapping interiors. Let $\mathcal{R}$ denote the region enclosed by the semicircle and the rectangle. Line $\ell$ meets the semicircle, segment $AB$ , and segment $CD$ at distinct points $N$ $U$ , and $T$ , respectively. Line $\ell$ divides region $\mathcal{R}$ into two regions with areas in the ratio $1: 2$ . Suppose that $AU = 84$ $AN = 126$ , and $UB = 168$ . Then $DA$ can be represented as $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 center of the semicircle is also the midpoint of $AB$ . Let this point be O. Let $h$ be the length of $AD$
Rescale everything by 42, so $AU = 2, AN = 3, UB = 4$ . Then $AB = 6$ so $OA = OB = 3$
Since $ON$ is a radius of the semicircle, $ON = 3$ . Thus $OAN$ is an equilateral triangle.
Let $X$ $Y$ , and $Z$ be the areas of triangle $OUN$ , sector $ONB$ , and trapezoid $UBCT$ respectively.
$X = \frac {1}{2}(UO)(NO)\sin{O} = \frac {1}{2}(1)(3)\sin{60^\circ} = \frac {3}{4}\sqrt {3}$
$Y = \frac {1}{3}\pi(3)^2 = 3\pi$
To find $Z$ we have to find the length of $TC$ . Project $T$ and $N$ onto $AB$ to get points $T'$ and $N'$ . Notice that $UNN'$ and $TUT'$ are similar. Thus:
$\frac {TT'}{UT'} = \frac {UN'}{NN'} \implies \frac {TT'}{h} = \frac {1/2}{3\sqrt {3}/2} \implies TT' = \frac {\sqrt {3}}{9}h$
Then $TC = T'C - T'T = UB - TT' = 4 - \frac {\sqrt {3}}{9}h$ . So:
$Z = \frac {1}{2}(BU + TC)(CB) = \frac {1}{2}\left(8 - \frac {\sqrt {3}}{9}h\right)h = 4h - \frac {\sqrt {3}}{18}h^2$
Let $L$ be the area of the side of line $l$ containing regions $X, Y, Z$ . Then
$L = X + Y + Z = \frac {3}{4}\sqrt {3} + 3\pi + 4h - \frac {\sqrt {3}}{18}h^2$
Obviously, the $L$ is greater than the area on the other side of line $l$ . This other area is equal to the total area minus $L$ . Thus:
$\frac {2}{1} = \frac {L}{6h + \frac {9}{2}{\pi} - L} \implies 12h + 9\pi = 3L$
Now just solve for $h$
\begin{align*} 12h + 9\pi & = \frac {9}{4}\sqrt {3} + 9\pi + 12h - \frac {\sqrt {3}}{6}h^2 \\ 0 & = \frac {9}{4}\sqrt {3} - \frac {\sqrt {3}}{6}h^2 \\ h^2 & = \frac {9}{4}(6) \\ h & = \frac {3}{2}\sqrt {6} \end{align*}
Don't forget to un-rescale at the end to get $AD = \frac {3}{2}\sqrt {6} \cdot 42 = 63\sqrt {6}$
Finally, the answer is $63 + 6 = \boxed{069}$

Answer:  069
Problem: Rectangle $ABCD$ and a semicircle with diameter $AB$ are coplanar and have nonoverlapping interiors. Let $\mathcal{R}$ denote the region enclosed by the semicircle and the rectangle. Line $\ell$ meets the semicircle, segment $AB$ , and segment $CD$ at distinct points $N$ $U$ , and $T$ , respectively. Line $\ell$ divides region $\mathcal{R}$ into two regions with areas in the ratio $1: 2$ . Suppose that $AU = 84$ $AN = 126$ , and $UB = 168$ . Then $DA$ can be represented as $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: Let $O$ be the center of the semicircle. It follows that $AU + UO = AN = NO = 126$ , so triangle $ANO$ is equilateral
Let $Y$ be the foot of the altitude from $N$ , such that $NY = 63\sqrt{3}$ and $NU = 21$
Finally, denote $DT = a$ , and $AD = x$ . Extend $U$ to point $Z$ so that $Z$ is on $CD$ and $UZ$ is perpendicular to $CD$ . It then follows that $ZT = a-84$ . Since $NYU$ and $UZT$ are similar
$\frac {x}{a-84} = \frac {63\sqrt{3}}{21} = 3\sqrt{3}$
Given that line $NT$ divides $R$ into a ratio of $1:2$ , we can also say that
$(x)(\frac{84+a}{2}) + \frac {126^2\pi}{6} - (63)(21)(\sqrt{3}) = (\frac{1}{3})(252x + \frac{126^2\pi}{2})$
where the first term is the area of trapezoid $AUTD$ , the second and third terms denote the areas of $\frac{1}{6}$ a full circle, and the area of $NUO$ , respectively, and the fourth term on the right side of the equation is equal to $R$ . Cancelling out the $\frac{126^2\pi}{6}$ on both sides, we obtain
$(x)(\frac{84+a}{2}) - \frac{252x}{3} = (63)(21)(\sqrt{3})$
By adding and collecting like terms, $\frac{3ax - 252x}{6} = (63)(21)(\sqrt{3})$
$\frac{(3x)(a-84)}{6} = (63)(21)(\sqrt{3})$
Since $a - 84 = \frac{x}{3\sqrt{3}}$
$\frac {(3x)(\frac{x}{3\sqrt{3}})}{6} = (63)(21)(\sqrt{3})$
$\frac {x^2}{\sqrt{3}} = (63)(126)(\sqrt{3})$
$x^2 = (63)(126)(3) = (2)(3^5)(7^2)$
$x = AD = (7)(3^2)(\sqrt{6}) = 63\sqrt{6}$ , so the answer is $\boxed{069}.$

Answer:  069
Problem: Rectangle $ABCD$ and a semicircle with diameter $AB$ are coplanar and have nonoverlapping interiors. Let $\mathcal{R}$ denote the region enclosed by the semicircle and the rectangle. Line $\ell$ meets the semicircle, segment $AB$ , and segment $CD$ at distinct points $N$ $U$ , and $T$ , respectively. Line $\ell$ divides region $\mathcal{R}$ into two regions with areas in the ratio $1: 2$ . Suppose that $AU = 84$ $AN = 126$ , and $UB = 168$ . Then $DA$ can be represented as $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 the total area of $\mathcal{R}$ is $252DA + \frac {126^2 \pi}{2}$ and thus one of the regions has area $84DA + \frac {126^2 \pi}{6}$
As in the above solutions we discover that $\angle AON = 60^\circ$ , thus sector $ANO$ of the semicircle has $\frac{1}{3}$ of the semicircle's area.
Similarly, dropping the $N'T'$ perpendicular we observe that $[AN'T'D] = 84DA$ , which is $\frac{1}{3}$ of the total rectangle.
Denoting the region to the left of $\overline {NT}$ as $\alpha$ and to the right as $\beta$ , it becomes clear that if $[\triangle UT'T] = [\triangle NUO]$ then the regions will have the desired ratio.
Using the 30-60-90 triangle, the slope of $NT$ , is ${-3\sqrt{3}}$ , and thus $[\triangle UT'T] = \frac {DA^2}{6\sqrt{3}}$
$[NUO]$ is most easily found by $\frac{absin(c)}{2}$ $[\triangle NUO] = \frac {126*42 * \frac {\sqrt{3}}{2}}{2}$
Equating, $\frac {126*42 * \frac {\sqrt{3}}{2}}{2} = \frac {DA^2}{6\sqrt{3}}$
Solving, $63 * 21 * 3 * 6 = DA^2$
$DA = 63 \sqrt{6} \longrightarrow \boxed{069}$

Answer:  069
Problem: Rectangle $ABCD$ and a semicircle with diameter $AB$ are coplanar and have nonoverlapping interiors. Let $\mathcal{R}$ denote the region enclosed by the semicircle and the rectangle. Line $\ell$ meets the semicircle, segment $AB$ , and segment $CD$ at distinct points $N$ $U$ , and $T$ , respectively. Line $\ell$ divides region $\mathcal{R}$ into two regions with areas in the ratio $1: 2$ . Suppose that $AU = 84$ $AN = 126$ , and $UB = 168$ . Then $DA$ can be represented as $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: Like above solutions, note that $ANO$ is equilateral with side length $126,$ where $O$ is the midpoint of $AB.$ Then, if we let $DA=a$ and set origin at $D=(0,0),$ we get $N=(63,a+63\sqrt{3}), U=(84,a).$ Line $NU$ is then $y-a=\sqrt{27}(x-84),$ so it intersects $CA,$ the $x$ -axis, at $x=(a/\sqrt{27}+84),$ giving us point $T.$ Now the area of region $R$ is $252a+\pi(126)^2 / 2,$ so one third of that is $84a+\pi(126)^2 / 6.$
The area of the smaller piece of $R$ is $[AUTD] + [ANU] + [\text{lune} AN] = \frac{1}{2} \cdot a(84+\frac{a}{\sqrt{27}}+84)+\frac{1}{2} \cdot 84 \cdot 63 \sqrt{3}+ \frac{\pi (126)^2}{6}-\frac{1}{2} \cdot 126 \cdot 63 \sqrt{2}$ $=\frac{a^2}{2\sqrt{27}}+84a-21\cdot 63\sqrt{2} + \frac{\pi(126)^2}{6}.$ Setting this equal to $84a+\pi(126)^2 / 6$ and canceling the $84a + \pi(126)^2$ yields $\frac{a^2}{2\sqrt{27}}=21 \cdot 63 \sqrt{3},$ so $a = 63 \sqrt{6}$ and the anser is $\boxed{069}.$ ~ rzlng

Answer:  069
Problem: Rectangle $ABCD$ and a semicircle with diameter $AB$ are coplanar and have nonoverlapping interiors. Let $\mathcal{R}$ denote the region enclosed by the semicircle and the rectangle. Line $\ell$ meets the semicircle, segment $AB$ , and segment $CD$ at distinct points $N$ $U$ , and $T$ , respectively. Line $\ell$ divides region $\mathcal{R}$ into two regions with areas in the ratio $1: 2$ . Suppose that $AU = 84$ $AN = 126$ , and $UB = 168$ . Then $DA$ can be represented as $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: Once we establish that $\Delta ANO$ is equilateral, we have \[[{\rm Sector } BON] = 2[{\rm Sector } AON],  [BCT'U]=2[ADT'U]\] \[\Rightarrow [\overset{\large\frown}{NB} CT'UO]=2[\overset{\large\frown}{NA} DT'UO]\] On the other hand, \[[\overset{\large\frown}{NB} CT]=2[\overset{\large\frown}{NA} DT]\] Therefore, $[UT'T]=[NUO]$
Now, $UO=42, NU=21 \Rightarrow [UT'T]=[NUO]=2[NN'U]$ . Also $\Delta UT'T \sim \Delta NN'U$ . Therefore, \[DA=UT'=\sqrt{2} NN'=\sqrt{2} \left(\frac{\sqrt{3}}{2}\cdot 126\right)=63\sqrt{6}\longrightarrow \boxed{069}\]

Answer:  069
Problem: For each positive integer $n$ , let $f(n) = \sum_{k = 1}^{100} \lfloor \log_{10} (kn) \rfloor$ . Find the largest value of $n$ for which $f(n) \le 300$
Note: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$

Solution: Observe that $f$ is strictly increasing in $n$ . We realize that we need $100$ terms to add up to around $300$ , so we need some sequence of $2$ s, $3$ s, and then $4$ s.
It follows that $n \approx 100$ (alternatively, use binary search to get to this, with $n\le 1000$ ). Manually checking shows that $f(109) = 300$ and $f(110) > 300$ . Thus, our answer is $\boxed{109}$

Answer:  109
Problem: For each positive integer $n$ , let $f(n) = \sum_{k = 1}^{100} \lfloor \log_{10} (kn) \rfloor$ . Find the largest value of $n$ for which $f(n) \le 300$
Note: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$

Solution: Because we want the value for which $f(n)=300$ , the average value of the 100 terms of the sequence should be around $3$ . For the value of $\lfloor \log_{10} (kn) \rfloor$ to be $3$ $1000 \le kn < 10000$ . We want kn to be around the middle of that range, and for k to be in the middle of 0 and 100, let $k=50$ , so $50n=\frac{10000+1000}{2}=\frac{11000}{2}=5500$ , and $n = 110$ $f(110) = 301$ , so we want to lower $n$ . Testing $109$ yields $300$ , so our answer is still $\boxed{109}$

Answer:  109
Problem: For each positive integer $n$ , let $f(n) = \sum_{k = 1}^{100} \lfloor \log_{10} (kn) \rfloor$ . Find the largest value of $n$ for which $f(n) \le 300$
Note: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$

Solution: For any $n$ where the sum is close to $300$ , all the terms in the sum must be equal to $2$ $3$ or $4$ . Let $M$ be the number of terms less than or equal to $3$ and $N$ be the number of terms equal to $2$ (also counted in $M$ ). With this definition of $M$ and $N$ the total will be $400 - M - N \le 300$ , from which $M + N \ge 100$ . Now $M+1$ is the smallest integer $k$ for which $\log_{10}(kn) \ge 4$ or $kn \ge 10000$ , thus \[M = \left\lfloor\frac{9999}{n}\right\rfloor.\] Similarly, \[N = \left\lfloor\frac{999}{n}\right\rfloor = \left\lfloor\frac{M}{10}\right\rfloor.\]
Therefore, \[M + \left\lfloor \frac{M}{10} \right\rfloor \ge 100 \implies M \ge \left\lceil\frac{1000}{11}\right\rceil = 91 \implies n \le \left\lfloor\frac{9999}{91}\right\rfloor = 109.\] Since we want the largest possible $n$ , the answer is $\boxed{109}$

Answer:  109
Problem: For each positive integer $n$ , let $f(n) = \sum_{k = 1}^{100} \lfloor \log_{10} (kn) \rfloor$ . Find the largest value of $n$ for which $f(n) \le 300$
Note: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$

Solution: Since we're working with base- $10$ logarithms, we can start by testing out $n$ 's that are powers of $10$ . For $n = 1$ , the terms in the sum are $\lfloor \log_{10} (1)\rfloor, \lfloor \log_{10} (2)\rfloor, \lfloor \log_{10} (3) \rfloor , . . . , \lfloor \log_{10} (100) \rfloor$ . For numbers $1$ $9$ $\lfloor \log_{10} (kn) \rfloor = 0$ . Then we have $90$ numbers, namely $10$ $99$ , for which $\lfloor \log_{10} (kn) \rfloor = 1$ . The last number we have is $100$ , which gives us $\lfloor \log_{10} (kn) \rfloor = 2$ . This sum gives us only $90 + 2 = 92$ , which is much too low. However, applying the same counting technique for $n = 10$ , our sum comes out to be $9 + 180 + 3 = 192$ , since there are $9$ terms for which $\lfloor \log_{10} (kn) \rfloor = 1$ $90$ terms for which $\lfloor \log_{10} (kn) \rfloor = 2$ , and one term for which $\lfloor \log_{10} (kn) \rfloor = 3$ . So we go up one more power of $10$ and get $18 + 270 + 4 = 292$ , which is very close to what we are looking for.
Now we only have to bump up the value of $n$ a bit and check our sum. Each increase in $n$ by $1$ actually increases the value of our sum by $1$ as well (except for $n = 101$ ), because whenever a $4$ is added to the sum, a $3$ is taken away. It doesn't take long to check and see that the value of $n$ we're looking for is $\boxed{109}$ , which corresponds to a sum of exactly $300$

Answer:  109
Problem: In $\triangle{ABC}$ with $AB = 12$ $BC = 13$ , and $AC = 15$ , let $M$ be a point on $\overline{AC}$ such that the incircles of $\triangle{ABM}$ and $\triangle{BCM}$ have equal radii . Then $\frac{AM}{CM} = \frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$

Solution: Let $AM = x$ , then $CM = 15 - x$ . Also let $BM = d$ Clearly, $\frac {[ABM]}{[CBM]} = \frac {x}{15 - x}$ . We can also express each area by the rs formula. Then $\frac {[ABM]}{[CBM]} = \frac {p(ABM)}{p(CBM)} = \frac {12 + d + x}{28 + d - x}$ . Equating and cross-multiplying yields $25x + 2dx = 15d + 180$ or $d = \frac {25x - 180}{15 - 2x}.$ Note that for $d$ to be positive, we must have $7.2 < x < 7.5$
By Stewart's Theorem , we have $12^2(15 - x) + 13^2x = d^215 + 15x(15 - x)$ or $432 = 3d^2 + 40x - 3x^2.$ Brute forcing by plugging in our previous result for $d$ , we have $432 = \frac {3(25x - 180)^2}{(15 - 2x)^2} + 40x - 3x^2.$ Clearing the fraction and gathering like terms, we get $0 = 12x^4 - 340x^3 + 2928x^2 - 7920x.$
Aside: Since $x$ must be rational in order for our answer to be in the desired form, we can use the Rational Root Theorem to reveal that $6x$ is an integer because we can divide the polynomial by $2$ . The only such $x$ in the above-stated range is $\frac {22}3$
Legitimately solving that quartic, note that $x = 0$ and $x = 15$ should clearly be solutions, corresponding to the sides of the triangle and thus degenerate cevians. Factoring those out, we get $0 = 4x(x - 15)(3x^2 - 40x + 132) = x(x - 15)(x - 6)(3x - 22).$ The only solution in the desired range is thus $\frac {22}3$ . Then $CM = \frac {23}3$ , and our desired ratio $\frac {AM}{CM} = \frac {22}{23}$ , giving us an answer of $\boxed{045}$

Answer:  045
Problem: In $\triangle{ABC}$ with $AB = 12$ $BC = 13$ , and $AC = 15$ , let $M$ be a point on $\overline{AC}$ such that the incircles of $\triangle{ABM}$ and $\triangle{BCM}$ have equal radii . Then $\frac{AM}{CM} = \frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$

Solution: Let $AM = 2x$ and $BM = 2y$ so $CM = 15 - 2x$ . Let the incenters of $\triangle ABM$ and $\triangle BCM$ be $I_1$ and $I_2$ respectively, and their equal inradii be $r$ . From $r = \sqrt {(s - a)(s - b)(s - c)/s}$ , we find that
\begin{align*}r^2 & = \frac {(x + y - 6)( - x + y + 6)(x - y + 6)}{x + y + 6} & (1) \\ & = \frac {( - x + y + 1)(x + y - 1)( - x - y + 14)}{ - x + y + 14}. & (2) \end{align*}
Let the incircle of $\triangle ABM$ meet $AM$ at $P$ and the incircle of $\triangle BCM$ meet $CM$ at $Q$ . Then note that $I_1 P Q I_2$ is a rectangle. Also, $\angle I_1 M I_2$ is right because $MI_1$ and $MI_2$ are the angle bisectors of $\angle AMB$ and $\angle CMB$ respectively and $\angle AMB + \angle CMB = 180^\circ$ . By properties of tangents to circles $MP = (MA + MB - AB)/2 = x + y - 6$ and $MQ = (MB + MC - BC)/2 = - x + y + 1$ . Now notice that the altitude of $M$ to $I_1 I_2$ is of length $r$ , so by similar triangles we find that $r^2 = MP \cdot MQ = (x + y - 6)( - x + y + 1)$ (3). Equating (3) with (1) and (2) separately yields
\begin{align*} 2y^2 - 30 = 2xy + 5x - 7y \\  2y^2 - 70 = - 2xy - 5x + 7y, \end{align*}
and adding these we have
\[4y^2 - 100 = 0\implies y = 5\implies x = 11/3 \\ \implies AM/MC = (22/3)/(15 - 22/3) = 22/23 \implies \boxed{045}.\]

Answer:  045