Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: Triangle $ABC$ with $AB=50$ and $AC=10$ has area $120$ . Let $D$ be the midpoint of $\overline{AB}$ , and let $E$ be the midpoint of $\overline{AC}$ . The angle bisector of $\angle BAC$ intersects $\overline{DE}$ and $\overline{BC}$ at $F$ and $G$ , respectively. What is the area of quadrilateral $FDBG$
$\textbf{(A) }60 \qquad \textbf{(B) }65 \qquad \textbf{(C) }70 \qquad \textbf{(D) }75 \qquad \textbf{(E) }80 \qquad$

Solution: We try to find the area of quadrilateral $FDBG$ by subtracting the area outside the quadrilateral but inside triangle $ABC$ . Note that the area of $\triangle ADE$ is equal  to $\frac{1}{2} \cdot 25 \cdot 5 \cdot \sin{A}$ and the area of triangle $ABC$ is equal to $\frac{1}{2} \cdot 50 \cdot 10 \cdot \sin A$ . The ratio $\frac{[ADE]}{[ABC]}$ is thus equal to $\frac{1}{4}$ and the area of triangle $ADE$ is $\frac{1}{4} \cdot 120 = 30$ . Let side $BC$ be equal to $6x$ , then $BG = 5x, GC = x$ by the angle bisector theorem. Similarly, we find the area of triangle $AGC$ to be $\frac{1}{2} \cdot 10 \cdot x \cdot \sin C$ and the area of triangle $ABC$ to be $\frac{1}{2} \cdot 6x \cdot 10 \cdot \sin C$ . A ratio between these two triangles yields $\frac{[ACG]}{[ABC]} = \frac{x}{6x} = \frac{1}{6}$ , so $[AGC] = 20$ . Now we just need to find the area of triangle $AFE$ and subtract it from the combined areas of $[ADE]$ and $[ACG]$ , since we count it twice. Note that the angle bisector theorem also applies for $\triangle ADE$ and $\frac{AE}{AD} = \frac{1}{5}$ , so thus $\frac{EF}{ED} = \frac{1}{6}$ and we find $[AFE] = \frac{1}{6} \cdot 30 = 5$ , and the area outside $FDBG$ must be $[ADE] + [AGC] - [AFE] = 30 + 20 - 5 = 45$ , and we finally find $[FDBG] = [ABC] - 45 = 120 -45 = \boxed{75}$ , and we are done.

Answer: D 75
Problem: For a positive integer $n$ and nonzero digits $a$ $b$ , and $c$ , let $A_n$ be the $n$ -digit integer each of whose digits is equal to $a$ ; let $B_n$ be the $n$ -digit integer each of whose digits is equal to $b$ , and let $C_n$ be the $2n$ -digit (not $n$ -digit) integer each of whose digits is equal to $c$ . What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$
$\textbf{(A) } 12 \qquad \textbf{(B) } 14 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 20$

Solution: By geometric series, we have \begin{alignat*}{8} A_n&=a\bigl(\phantom{ }\underbrace{111\cdots1}_{n\text{ digits}}\phantom{ }\bigr)&&=a\left(1+10+10^2+\cdots+10^{n-1}\right)&&=a\cdot\frac{10^n-1}{9}, \\ B_n&=b\bigl(\phantom{ }\underbrace{111\cdots1}_{n\text{ digits}}\phantom{ }\bigr)&&=b\left(1+10+10^2+\cdots+10^{n-1}\right)&&=b\cdot\frac{10^n-1}{9}, \\ C_n&=c\bigl(\phantom{ }\underbrace{111\cdots1}_{2n\text{ digits}}\phantom{ }\bigr)&&=c\left(1+10+10^2+\cdots+10^{2n-1}\right)&&=c\cdot\frac{10^{2n}-1}{9}. \end{alignat*} By substitution, we rewrite the given equation $C_n - B_n = A_n^2$ as \[c\cdot\frac{10^{2n}-1}{9} - b\cdot\frac{10^n-1}{9} = a^2\cdot\left(\frac{10^n-1}{9}\right)^2.\] Since $n > 0,$ it follows that $10^n > 1.$ We divide both sides by $\frac{10^n-1}{9}$ and then rearrange: \begin{align*} c\left(10^n+1\right) - b &= a^2\cdot\frac{10^n-1}{9} \\ 9c\left(10^n+1\right) - 9b &= a^2\left(10^n-1\right) \\ \left(9c-a^2\right)10^n &= 9b-9c-a^2. &&(\bigstar) \end{align*} Let $y=10^n.$ Note that $(\bigstar)$ is a linear equation with $y,$ and $y$ is a one-to-one function of $n.$ Since $(\bigstar)$ has at least two solutions of $n,$ it has at least two solutions of $y.$ We conclude that $(\bigstar)$ must be an identity, so we get the following system of equations: \begin{align*} 9c-a^2&=0, \\ 9b-9c-a^2&=0. \end{align*} The first equation implies that $c=\frac{a^2}{9}.$ Substituting this into the second equation gives $b=\frac{2a^2}{9}.$
To maximize $a + b + c = a + \frac{a^2}{3},$ we need to maximize $a.$ Clearly, $a$ must be divisible by $3.$ The possibilities for $(a,b,c)$ are $(9,18,9),(6,8,4),$ or $(3,2,1),$ but $(9,18,9)$ is invalid. Therefore, the greatest possible value of $a + b + c$ is $6+8+4=\boxed{18}.$

Answer: D 18
Problem: For a positive integer $n$ and nonzero digits $a$ $b$ , and $c$ , let $A_n$ be the $n$ -digit integer each of whose digits is equal to $a$ ; let $B_n$ be the $n$ -digit integer each of whose digits is equal to $b$ , and let $C_n$ be the $2n$ -digit (not $n$ -digit) integer each of whose digits is equal to $c$ . What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$
$\textbf{(A) } 12 \qquad \textbf{(B) } 14 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 20$

Solution: Immediately start trying $n = 1$ and $n = 2$ . These give the system of equations $11c - b = a^2$ and $1111c - 11b = (11a)^2$ (which simplifies to $101c - b = 11a^2$ ). These imply that $a^2 = 9c$ , so the possible $(a, c)$ pairs are $(9, 9)$ $(6, 4)$ , and $(3, 1)$ . The first puts $b$ out of range but the second makes $b = 8$ . We now know the answer is at least $6 + 8 + 4 = 18$
We now only need to know whether $a + b + c = 20$ might work for any larger $n$ . We will always get equations like $100001c - b = 11111a^2$ where the $c$ coefficient is very close to being nine times the $a$ coefficient. Since the $b$ term will be quite insignificant, we know that once again $a^2$ must equal $9c$ , and thus $a = 9, c = 9$ is our only hope to reach $20$ . Substituting and dividing through by $9$ , we will have something like $100001 - \frac{b}{9} = 99999$ . No matter what $n$ really was, $b$ is out of range (and certainly isn't $2$ as we would have needed).
The answer then is $\boxed{18}$

Answer: D 18
Problem: For a positive integer $n$ and nonzero digits $a$ $b$ , and $c$ , let $A_n$ be the $n$ -digit integer each of whose digits is equal to $a$ ; let $B_n$ be the $n$ -digit integer each of whose digits is equal to $b$ , and let $C_n$ be the $2n$ -digit (not $n$ -digit) integer each of whose digits is equal to $c$ . What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$
$\textbf{(A) } 12 \qquad \textbf{(B) } 14 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 20$

Solution: The given equation can be written as \[c \cdot (\phantom{ } \overbrace{1111 \ldots 1111}^{2n\text{ digits}}\phantom{ }) - b \cdot (\phantom{ } \overbrace{11 \ldots 11}^{n\text{ digits}} \phantom{ }) = a^2 \cdot (\phantom{ } \overbrace{11 \ldots 11}^{n\text{ digits}} \phantom{ })^2.\] Divide by $\overbrace{11 \ldots 11}^{n\text{ digits}}$ on both sides: \[c \cdot (\phantom{ } \overbrace{1000 \ldots 0001}^{n+1\text{ digits}}\phantom{ }) - b = a^2 \cdot (\phantom{ } \overbrace{11 \ldots 11}^{n\text{ digits}} \phantom{ }).\] Next, split the first term to make it easier to deal with: \begin{align*} 2c + c \cdot (\phantom{ }\overbrace{99 \ldots 99}^{n\text{ digits}}\phantom{ }) - b &= a^2 \cdot (\phantom{ } \overbrace{11 \ldots 11}^{n\text{ digits}} \phantom{ }) \\ 2c - b &= (a^2 - 9c) \cdot (\phantom{ }\overbrace{11 \ldots 11}^{n\text{ digits}}\phantom{ }). \end{align*} Because $2c - b$ and $a^2 - 9c$ are constants and because there must be at least two distinct values of $n$ that satisfy, $2c - b = a^2 - 9c = 0.$ Thus, we have \begin{align*} 2c&=b, \\ a^2&=9c. \end{align*} Knowing that $a,b,$ and $c$ are single digit positive integers and that $9c$ must be a perfect square, the values of $(a,b,c)$ that satisfy both equations are $(3,2,1)$ and $(6,8,4).$ Finally, $6 + 8 + 4 = \boxed{18}.$

Answer: D 18
Problem: For a positive integer $n$ and nonzero digits $a$ $b$ , and $c$ , let $A_n$ be the $n$ -digit integer each of whose digits is equal to $a$ ; let $B_n$ be the $n$ -digit integer each of whose digits is equal to $b$ , and let $C_n$ be the $2n$ -digit (not $n$ -digit) integer each of whose digits is equal to $c$ . What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$
$\textbf{(A) } 12 \qquad \textbf{(B) } 14 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 20$

Solution: By PaperMath’s sum , the answer is $6+8+4=\boxed{18}$

Answer: D 18
Problem: Kate bakes a $20$ -inch by $18$ -inch pan of cornbread. The cornbread is cut into pieces that measure $2$ inches by $2$ inches. How many pieces of cornbread does the pan contain?
$\textbf{(A) } 90 \qquad \textbf{(B) } 100 \qquad \textbf{(C) } 180 \qquad \textbf{(D) } 200 \qquad \textbf{(E) } 360$

Solution: The area of the pan is $20\cdot18=360$ . Since the area of each piece is $2\cdot2=4$ , there are $\frac{360}{4} = \boxed{90}$ pieces.

Answer: A 90
Problem: Kate bakes a $20$ -inch by $18$ -inch pan of cornbread. The cornbread is cut into pieces that measure $2$ inches by $2$ inches. How many pieces of cornbread does the pan contain?
$\textbf{(A) } 90 \qquad \textbf{(B) } 100 \qquad \textbf{(C) } 180 \qquad \textbf{(D) } 200 \qquad \textbf{(E) } 360$

Solution: By dividing each of the dimensions by $2$ , we get a $10\times9$ grid that makes $\boxed{90}$ pieces.

Answer: A 90
Problem: Sam drove $96$ miles in $90$ minutes. His average speed during the first $30$ minutes was $60$ mph (miles per hour), and his average speed during the second $30$ minutes was $65$ mph. What was his average speed, in mph, during the last $30$ minutes?
$\textbf{(A) } 64 \qquad \textbf{(B) } 65 \qquad \textbf{(C) } 66 \qquad \textbf{(D) } 67 \qquad \textbf{(E) } 68$

Solution: Suppose that Sam's average speed during the last $30$ minutes was $x$ mph.
Recall that a half hour is equal to $30$ minutes. Therefore, Sam drove $60\cdot0.5=30$ miles during the first half hour, $65\cdot0.5=32.5$ miles during the second half hour, and $x\cdot0.5$ miles during the last half hour. We have \begin{align*} 30+32.5+x\cdot0.5&=96 \\ x\cdot0.5&=33.5 \\ x&=\boxed{67} ~Haha0201 ~MRENTHUSIASM

Answer: D 67
Problem: Sam drove $96$ miles in $90$ minutes. His average speed during the first $30$ minutes was $60$ mph (miles per hour), and his average speed during the second $30$ minutes was $65$ mph. What was his average speed, in mph, during the last $30$ minutes?
$\textbf{(A) } 64 \qquad \textbf{(B) } 65 \qquad \textbf{(C) } 66 \qquad \textbf{(D) } 67 \qquad \textbf{(E) } 68$

Solution: Suppose that Sam's average speed during the last $30$ minutes was $x$ mph.
Note that Sam's average speed during the entire trip was $\frac{96}{3/2}=64$ mph. Since Sam drove at $60$ mph, $65$ mph, and $x$ mph for the same duration ( $30$ minutes each), his average speed during the entire trip was the average of $60$ mph, $65$ mph, and $x$ mph. We have \begin{align*} \frac{60+65+x}{3}&=64 \\ 60+65+x&=192 \\ x&=\boxed{67} ~coolmath_2018 ~MRENTHUSIASM

Answer: D 67
Problem: In the expression $\left(\underline{\qquad}\times\underline{\qquad}\right)+\left(\underline{\qquad}\times\underline{\qquad}\right)$ each blank is to be filled in with one of the digits $1,2,3,$ or $4,$ with each digit being used once. How many different values can be obtained?
$\textbf{(A) }2 \qquad \textbf{(B) }3\qquad \textbf{(C) }4 \qquad \textbf{(D) }6 \qquad \textbf{(E) }24 \qquad$

Solution: We have $\binom{4}{2}$ ways to choose the pairs, and we have $2!$ ways for the values to be rearranged, hence $\frac{6}{2}=\boxed{3}$

Answer: B 3
Problem: In the expression $\left(\underline{\qquad}\times\underline{\qquad}\right)+\left(\underline{\qquad}\times\underline{\qquad}\right)$ each blank is to be filled in with one of the digits $1,2,3,$ or $4,$ with each digit being used once. How many different values can be obtained?
$\textbf{(A) }2 \qquad \textbf{(B) }3\qquad \textbf{(C) }4 \qquad \textbf{(D) }6 \qquad \textbf{(E) }24 \qquad$

Solution: We have four available numbers $(1, 2, 3, 4)$ . Because different permutations do not matter because they are all addition and multiplication, if we put $1$ on the first space, it is obvious there are $\boxed{3}$ possible outcomes $(2, 3, 4)$

Answer: B 3
Problem: In the expression $\left(\underline{\qquad}\times\underline{\qquad}\right)+\left(\underline{\qquad}\times\underline{\qquad}\right)$ each blank is to be filled in with one of the digits $1,2,3,$ or $4,$ with each digit being used once. How many different values can be obtained?
$\textbf{(A) }2 \qquad \textbf{(B) }3\qquad \textbf{(C) }4 \qquad \textbf{(D) }6 \qquad \textbf{(E) }24 \qquad$

Solution: There are exactly $4!$ ways to arrange the numbers and $2!2!2!$ overcounts per way due to commutativity. Therefore, the answer is $\frac{4!}{2!2!2!}=\boxed{3}$

Answer: B 3
Problem: How many subsets of $\{2,3,4,5,6,7,8,9\}$ contain at least one prime number?
$\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$

Solution: Well, there are 4 composite numbers, and you can list them in a 1 number format, a 2 number, 3 number, and a 4 number format. Now, we can use combinations.
$\binom{4}{1} + \binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 15$ . Using the answer choices, the only multiple of 15 is $\boxed{240}$

Answer: D 240
Problem: How many subsets of $\{2,3,4,5,6,7,8,9\}$ contain at least one prime number?
$\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$

Solution: Subsets of $\{2,3,4,5,6,7,8,9\}$ include a single digit up to all eight numbers. Therefore, we must add the combinations of all possible subsets and subtract from each of the subsets formed by the composite numbers.
Hence:
$\binom{8}{1} - \binom{4}{1} + \binom{8}{2} - \binom{4}{2} + \binom{8}{3} - \binom{4}{3} + \binom{8}{4} - 1 + \binom{8}{5} + \binom{8}{6} + \binom{8}{7} + 1 = \boxed{240}$

Answer: D 240
Problem: How many subsets of $\{2,3,4,5,6,7,8,9\}$ contain at least one prime number?
$\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$

Solution: Total subsets is $(2^8) = 256$ Using complementary counting and finding the sets with composite numbers:
only 4,6,8 and 9 are composite. Each one can be either in the set or out: $2^4$ = 16 $256-16=240$ $\boxed{240}$

Answer: D 240
Problem: How many subsets of $\{2,3,4,5,6,7,8,9\}$ contain at least one prime number?
$\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$

Solution: We multiply the number of possibilities of the set having prime numbers and the set having composites.
The possibilities of primes are $2^4-1=15$ (As there is one solution not containing any primes)
The possibilities of the set containing composites are $2^4=16$ (There can be a set with no composites)
Multiplying this we get $15 \cdot 16 = \boxed{240}$

Answer: D 240
Problem: In the figure below, $N$ congruent semicircles lie on the diameter of a large semicircle, with their diameters covering the diameter of the large semicircle with no overlap. Let $A$ be the combined area of the small semicircles and $B$ be the area of the region inside the large semicircle but outside the semicircles. The ratio $A:B$ is $1:18$ . What is $N$
[asy] draw((0,0)--(18,0)); draw(arc((9,0),9,0,180)); filldraw(arc((1,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((3,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((5,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((7,0),1,0,180)--cycle,gray(0.8)); label("...",(9,0.5)); filldraw(arc((11,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((13,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((15,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((17,0),1,0,180)--cycle,gray(0.8)); [/asy]
$\textbf{(A) } 16 \qquad \textbf{(B) } 17 \qquad \textbf{(C) } 18 \qquad \textbf{(D) } 19 \qquad \textbf{(E) } 36$

Solution: Use the answer choices and calculate them. The one that works is $\bold{\boxed{19}$

Answer: D 19
Problem: In the figure below, $N$ congruent semicircles lie on the diameter of a large semicircle, with their diameters covering the diameter of the large semicircle with no overlap. Let $A$ be the combined area of the small semicircles and $B$ be the area of the region inside the large semicircle but outside the semicircles. The ratio $A:B$ is $1:18$ . What is $N$
[asy] draw((0,0)--(18,0)); draw(arc((9,0),9,0,180)); filldraw(arc((1,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((3,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((5,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((7,0),1,0,180)--cycle,gray(0.8)); label("...",(9,0.5)); filldraw(arc((11,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((13,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((15,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((17,0),1,0,180)--cycle,gray(0.8)); [/asy]
$\textbf{(A) } 16 \qquad \textbf{(B) } 17 \qquad \textbf{(C) } 18 \qquad \textbf{(D) } 19 \qquad \textbf{(E) } 36$

Solution: Let the number of semicircles be $n$ and let the radius of each semicircle be $r$ . To find the total area of all of the small semicircles, we have $n \cdot \frac{\pi \cdot r^2}{2}$
Next, we have to find the area of the larger semicircle. The radius of the large semicircle can be deduced to be $n \cdot r$ . So, the area of the larger semicircle is $\frac{\pi \cdot n^2 \cdot r^2}{2}$
Now that we have found the area of both A and B, we can find the ratio. $\frac{A}{B}=\frac{1}{18}$ , so part-to-whole ratio is $1:19$ . When we divide the area of the small semicircles combined by the area of the larger semicircles, we get $\frac{1}{n}$ . This is equal to $\frac{1}{19}$ . By setting them equal, we find that $n = 19$ . This is our answer, which corresponds to choice $\bold{\boxed{19}$

Answer: D 19
Problem: In the figure below, $N$ congruent semicircles lie on the diameter of a large semicircle, with their diameters covering the diameter of the large semicircle with no overlap. Let $A$ be the combined area of the small semicircles and $B$ be the area of the region inside the large semicircle but outside the semicircles. The ratio $A:B$ is $1:18$ . What is $N$
[asy] draw((0,0)--(18,0)); draw(arc((9,0),9,0,180)); filldraw(arc((1,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((3,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((5,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((7,0),1,0,180)--cycle,gray(0.8)); label("...",(9,0.5)); filldraw(arc((11,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((13,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((15,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((17,0),1,0,180)--cycle,gray(0.8)); [/asy]
$\textbf{(A) } 16 \qquad \textbf{(B) } 17 \qquad \textbf{(C) } 18 \qquad \textbf{(D) } 19 \qquad \textbf{(E) } 36$

Solution: Each small semicircle is $\frac{1}{N^2}$ of the large semicircle. Since $N$ small semicircles make $\frac{1}{19}$ of the large one, $\frac{N}{N^2} = \frac1{19}$ . Solving this, we get $\boxed{19}$ . ...

Answer:  19
Problem: Sara makes a staircase out of toothpicks as shown:
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } } [/asy]
This is a 3-step staircase and uses 18 toothpicks. How many steps would be in a staircase that used 180 toothpicks?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 30$

Solution: A staircase with $n$ steps contains $4 + 6 + 8 + ... + 2n + 2$ toothpicks. This can be rewritten as $(n+1)(n+2) -2$
So, $(n+1)(n+2) - 2 = 180$
So, $(n+1)(n+2) = 182.$
Inspection could tell us that $13 \cdot 14 = 182$ , so the answer is $13 - 1 = \boxed{12}$

Answer: C 12
Problem: Sara makes a staircase out of toothpicks as shown:
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } } [/asy]
This is a 3-step staircase and uses 18 toothpicks. How many steps would be in a staircase that used 180 toothpicks?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 30$

Solution: Layer $1$ $4$ steps
Layer $1,2$ $10$ steps
Layer $1,2,3$ $18$ steps
Layer $1,2,3,4$ $28$ steps
From inspection, we can see that with each increase in layer the difference in toothpicks between the current layer and the previous increases by $2$ . Using this pattern:
$4, 10, 18, 28, 40, 54, 70, 88, 108, 130, 154, 180$
From this we see that the solution is $\boxed{12}$

Answer: C 12
Problem: Sara makes a staircase out of toothpicks as shown:
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } } [/asy]
This is a 3-step staircase and uses 18 toothpicks. How many steps would be in a staircase that used 180 toothpicks?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 30$

Solution: We can find a function that gives us the number of toothpicks for every layer. Using finite difference, we know that the degree must be $2$ and the leading coefficient is $1$ . The function is $f(n)=n^2+3n$ where $n$ is the layer and $f(n)$ is the number of toothpicks.
We have to solve for $n$ when $n^2+3n=180\Rightarrow n^2+3n-180=0$ . Factor to get $(n-12)(n+15)$ . The roots are $12$ and $-15$ . Clearly $-15$ is impossible so the answer is $\boxed{12}$

Answer: C 12
Problem: Sara makes a staircase out of toothpicks as shown:
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } } [/asy]
This is a 3-step staircase and uses 18 toothpicks. How many steps would be in a staircase that used 180 toothpicks?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 30$

Solution: Notice that the number of toothpicks can be found by adding all the horizontal and all the vertical toothpicks. We can see that for the case of 3 steps, there are $2(3+3+2+1)=18$ toothpicks. Thus, the equation is $2S + 2(1+2+3...+S)=180$ with $S$ being the number of steps. Solving, we get $S = 12$ , or $\boxed{12}$ .
-liu4505

Answer: C 12
Problem: Sara makes a staircase out of toothpicks as shown:
[asy] size(150); defaultpen(linewidth(0.8)); path h = ellipse((0.5,0),0.45,0.015), v = ellipse((0,0.5),0.015,0.45); for(int i=0;i<=2;i=i+1) { for(int j=0;j<=3-i;j=j+1) { filldraw(shift((i,j))*h,black); filldraw(shift((j,i))*v,black); } } [/asy]
This is a 3-step staircase and uses 18 toothpicks. How many steps would be in a staircase that used 180 toothpicks?
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 24\qquad\textbf{(E)}\ 30$

Solution: There are $\frac{n(n+1)}{2}$ squares. Each has $4$ toothpick sides. To remove overlap, note that there are $4n$ perimeter toothpicks. $\frac{\frac{n(n+1)}{2}\cdot 4-4n}{2}$ is the number of overlapped toothpicks
Add $4n$ to get the perimeter (non-overlapping). Formula is $\text{number of toothpicks} = n^2+3n$ Then you can "guess" or factor (also guessing) to get the answer $\boxed{12}$ .
~bjc

Answer: C 12