The whole pan has area $20 \times 18 = 360$ square inches. Each piece is $2 \times 2 = 4$ square inches. So the number of pieces is $360 / 4 = 90.$ Thus, A is the correct answer.

Each leg is half an hour. In the first, Sam drove $60 \cdot \tfrac12 = 30$ miles; in the second, $65 \cdot \tfrac12 = 32.5$ miles. That's $62.5$ miles so far. That leaves $96 - 62.5 = 33.5$ miles for the last half hour, which is a speed of $33.5 / \tfrac12 = 67$ mph. Therefore, the answer is D.

Order inside a product doesn't matter, and neither does the order we add the two products. So all that matters is how the four digits split into two pairs. There are three splits: $1\cdot2 + 3\cdot4 = 14,$ $1\cdot3 + 2\cdot4 = 11,$ and $1\cdot4 + 2\cdot3 = 10.$ That's $3$ different values. Thus, B is the correct answer.

The three distinct face areas are the pairwise products $XY = 24,$ $XZ = 48,$ $YZ = 72$ in some order. Multiply all three: $(XYZ)^2 = 24 \cdot 48 \cdot 72 = 82944,$ so $XYZ = 288.$ Now divide by each face area. We get $Z = 288/24 = 12,$ $Y = 288/48 = 6,$ and $X = 288/72 = 4,$ so $X + Y + Z = 22.$ Therefore, the answer is B.

Count the complement. The set has $2^8 = 256$ subsets total. A subset avoids every prime exactly when it sticks to the non-primes $\{4, 6, 8, 9\},$ and there are $2^4 = 16$ of those. So $256 - 16 = 240$ subsets contain at least one prime. Thus, D is the correct answer.

We need a third draw exactly when the first two chips still sum to $4$ or less. The only such pairs are $\{1,2\}$ and $\{1,3\}.$ Each shows up as an ordered pair of first draws in $2$ ways, so there are $4$ favorable sequences out of $5 \cdot 4 = 20$ equally likely ones. The probability is $4/20 = \tfrac15.$ Therefore, the answer is D.

Let each small semicircle have radius $r.$ The $N$ diameters cover the big diameter, so the large radius is $Nr.$ Then $A = N \cdot \tfrac12 \pi r^2,$ and the large semicircle has area $\tfrac12 \pi (Nr)^2,$ so the leftover region is $B = \tfrac12 \pi r^2(N^2 - N).$ This gives $A : B = N : N(N-1)$ $= 1 : (N-1).$ Set $N - 1 = 18,$ and $N = 19.$ Thus, D is the correct answer.

In an $n$-step staircase the vertical toothpicks number $(1 + 2 + \cdots + n) + n$ $= \tfrac{n(n+1)}{2} + n,$ and there are just as many horizontal ones. That's a total of $n(n+1) + 2n = n(n+3).$ Check: $n = 3$ gives $18,$ as it should. Now solve $n(n+3) = 180.$ This factors as $(n-12)(n+15) = 0,$ so $n = 12.$ Therefore, the answer is C.

Replace each die's value $k$ by $7 - k.$ This pairs up outcomes one-to-one and keeps their probabilities, and it sends a total of $s$ to $7 \cdot 7 - s = 49 - s.$ So the sums $s$ and $49 - s$ are equally likely. The partner of $10$ is $49 - 10 = 39.$ Thus, D is the correct answer.

Put $A$ at the origin with edges along the axes: $A = (0,0,0),$ $B = (3,0,0),$ $C = (3,1,0),$ $E = (0,0,2),$ $H = (0,1,2),$ $F = (3,0,2),$ $G = (3,1,2),$ so $M = (3, \tfrac12, 2).$ The base $BCHE$ is a rectangle with $BC = 1$ and $BE = \sqrt{3^2 + 2^2} = \sqrt{13},$ hence area $\sqrt{13}.$ Its plane is $2x + 3z = 6,$ and $M$ sits at distance $\frac{|2\cdot3 + 3\cdot2 - 6|}{\sqrt{13}} = \frac{6}{\sqrt{13}}$ from it. The volume is $\tfrac13 \cdot \sqrt{13} \cdot \frac{6}{\sqrt{13}} = 2.$ Therefore, the answer is E.

Look at $p^2 + 26.$ When $p = 3,$ it's $35 = 5 \cdot 7.$ For any other prime, $p$ isn't divisible by $3,$ so $p^2 \equiv 1 \pmod 3$ and $p^2 + 26 \equiv 1 + 2 \equiv 0 \pmod 3.$ Either way it's a multiple of $3$ bigger than $3,$ hence composite. So it's never prime. Thus, C is the correct answer.

Put the center $O$ at the origin, so $A = (-12, 0)$ and $B = (12, 0),$ while $C$ runs over the circle of radius $12.$ Then $A + B = 0,$ so the centroid is $\tfrac13(A + B + C) = \tfrac13 C.$ As $C$ circles, $\tfrac13 C$ traces a circle of radius $\tfrac{12}{3} = 4$ (minus the two points where $C = A$ or $B$). Its area is $\pi \cdot 4^2 = 16\pi \approx 50.$ Therefore, the answer is C.

The $k$-th term is $10^{k+1} + 1,$ which $101$ divides iff $10^{k+1} \equiv -1 \pmod{101}.$ Notice $10^2 = 100 \equiv -1 \pmod{101}.$ So $10^m \equiv -1$ exactly when $m \equiv 2 \pmod 4,$ meaning $k + 1 \equiv 2,$ that is $k \equiv 1 \pmod 4.$ Among $k = 1, 2, \ldots, 2018,$ the values $1, 5, \ldots, 2017$ number $505.$ Thus, C is the correct answer.

The mode shows up $10$ times. To keep the number of distinct values small, let every other value repeat as much as the rules allow, which is $9$ times each (any more would tie the mode). With $d$ distinct values the list holds at most $10 + 9(d-1)$ entries. We need $10 + 9(d-1) \ge 2018,$ so $d - 1 \ge 223.1,$ giving $d \ge 225.$ Therefore, the answer is D.

Let the sheet have side $s.$ The base sits as a square of side $w$ turned $45^\circ,$ so the center is $\tfrac{w}{2}$ from each base edge. A corner of the sheet lies $\tfrac{s}{\sqrt2}$ from the center. Folding that corner up to the top center traces a straight line: $\tfrac{w}{2}$ out to the base edge, then $h$ up the side, then $\tfrac{w}{2}$ across the top. So $\tfrac{s}{\sqrt2} = \tfrac{w}{2} + h + \tfrac{w}{2} = w + h.$ Then $s = \sqrt2\,(w + h),$ and the area is $s^2 = 2(w + h)^2.$ Thus, A is the correct answer.

For any integer $n,$ $n^3 - n = (n-1)n(n+1)$ is a product of three consecutive integers, so it's divisible by $6.$ That means $n^3 \equiv n \pmod 6.$ Summing, $\sum a_i^3 \equiv \sum a_i$ $= 2018^{2018} \pmod 6.$ Now $2018 \equiv 2 \pmod 6,$ and powers of $2$ mod $6$ alternate $2, 4, 2, 4, \ldots.$ The exponent $2018$ is even, so $2^{2018} \equiv 4 \pmod 6.$ The remainder is $4.$ Therefore, the answer is E.

By symmetry the four cut corners are congruent right triangles, with legs $x$ along the sides of length $8$ and $y$ along the sides of length $6.$ The octagon's sides come in three types, $8 - 2x,$ $6 - 2y,$ and $\sqrt{x^2 + y^2},$ and they're all equal. From $8 - 2x = 6 - 2y$ we get $y = x - 1.$ Substitute into $8 - 2x = \sqrt{x^2 + (x-1)^2}$ and square: $2x^2 - 30x + 63 = 0,$ so $x = \tfrac{15 - 3\sqrt{11}}{2}$ (taking the root with $x < 4$). The side length is $8 - 2x = -7 + 3\sqrt{11},$ so $k + m + n = -7 + 3 + 11 = 7.$ Thus, B is the correct answer.

Suppose some family put both children in one row. They'd have to take the non-adjacent seats $1$ and $3,$ which forces the middle family's two children into the same column. Not allowed. So each row holds exactly one child from each family. The second row is a permutation of the three families, $3! = 6$ ways. The third row needs a different family in every column, a derangement of the second row's order, and there are $2$ of those. Finally, each pair can swap its two children between their seats, $2^3 = 8$ ways. The total is $6 \cdot 2 \cdot 8 = 96.$ Therefore, the answer is D.

Let Chloe be $n$ today; Zoe is $1.$ In $t$ years her age over Zoe's is $\frac{n + t}{1 + t} = 1 + \frac{n - 1}{1 + t},$ an integer exactly when $1 + t$ divides $n - 1.$ So the number of such birthdays is the number of divisors of $n - 1.$ Nine of them means $n - 1$ has $9$ divisors, forcing $n - 1 = 2^2 \cdot 3^2 = 36$ (the only two-digit choice). So Chloe is $37$ and Joey is $38.$ Now Joey's age $38 + t$ is a multiple of $1 + t$ iff $1 + t$ divides $37.$ The next such time is $t = 36,$ when Joey is $74.$ Its digit sum is $7 + 4 = 11.$ Thus, E is the correct answer.