In Figure 1, three unshaded dots are arranged to form an equilateral triangle, as shown. Figure 2 is formed by arranging three copies of Figure 1 to form the outline of a larger equilateral triangle and then filling the resulting empty space with 1 shaded dot. For each integer $n>2$, Figure $n$ is formed by first arranging three copies of Figure $n-1$ to form the outline of a larger equilateral triangle and then filling the resulting empty space in the centre with an inverted triangle of shaded dots.

![](https://cdn.mathpix.com/cropped/2024_04_20_ac36362783317e0251fdg-017.jpg?height=79&width=106&top_left_y=1500&top_left_x=630)

Figure 1

![](https://cdn.mathpix.com/cropped/2024_04_20_ac36362783317e0251fdg-017.jpg?height=152&width=163&top_left_y=1431&top_left_x=946)

Figure 2

![](https://cdn.mathpix.com/cropped/2024_04_20_ac36362783317e0251fdg-017.jpg?height=298&width=336&top_left_y=1285&top_left_x=1206)

Figure 3

The smallest value of $n$ for which Figure $n$ includes at least 100000 shaded dots is
(A) 8
(B) 9
(C) 10
(D) 11
(E) 12
Since each Figure is formed by placing two copies of the previous Figure side-by-side along the base and then adding other pieces above, the number of dots in the base of each Figure is two times as many as in the previous Figure.

Since each Figure is an equilateral triangle, then the number of dots in the Figure equals the sum of the positive integers from 1 to the number of dots in the base, inclusive. In other words, if the base of a Figure consists of $b$ dots, then the Figure includes $1+2+3+\cdots+(b-1)+b$ dots. This sum is equal to $\frac{1}{2} b(b+1)$. (If this formula for the sum is unfamiliar, can you argue why it is true?)

Since each Figure is formed by using three copies of the previous Figure and any new dots added are shaded dots, the number of unshaded dots in each Figure is exactly three times the number of unshaded dots in the previous Figure.

Since each dot is either shaded or unshaded, the number of shaded dots equals the total number of dots minus the number of unshaded dots.

Using these statements, we construct a table:

| Figure | Dots in base | Dots in Figure | Unshaded dots | Shaded dots |
| :---: | :---: | :---: | :---: | :---: |
| 1 | 2 | 3 | 3 | 0 |
| 2 | 4 | 10 | 9 | 1 |
| 3 | 8 | 36 | 27 | 9 |
| 4 | 16 | 136 | 81 | 55 |
| 5 | 32 | 528 | 243 | 285 |
| 6 | 64 | 2080 | 729 | 1351 |
| 7 | 128 | 8256 | 2187 | 6069 |
| 8 | 256 | 32896 | 6561 | 26335 |
| 9 | 512 | 131328 | 19683 | 111645 |

Therefore, the smallest value of $n$ for which Figure $n$ includes at least 100000 dots is $n=9$.

We note that since the number of dots in the base of Figure 1 is 2 and the number of dots in the base of each subsequent Figure is double the number of dots in the previous Figure, then the number of dots in the base of Figure $n$ is equal to $2^{n}$.

Since the number of unshaded dots in Figure 1 is 3 and the number of unshaded dots in each subsequent Figure is three times the number of unshaded dots in the previous Figure, then the number of unshaded dots in Figure $n$ is $3^{n}$.

Therefore, a formula for the number of unshaded dots in Figure $n$ is $\frac{1}{2} 2^{n}\left(2^{n}+1\right)-3^{n}$ which can be re-written as $2^{2 n-1}+2^{n-1}-3^{n}$, which agrees with the numbers in the table above.

ANSWER: (B)