Answer: C

Solution(s):

Simplifying yields \[ \begin{align*} &(2(2(2(2(2(2+1)+1)\\ &+1)+1)+1)+1) \\ =& (2(2(2(2(2(3)+1)\\ &+1)+1)+1)+1)\\=&(2(2(2(2(7)+1)+1)+1)+1) \\=& (2(2(2(15) + 1) + 1) + 1) \\ =&(2(2(31) + 1) + 1) \\=& 2(63) + 1 \\=& 127. \end{align*} \]

Thus, C is the correct answer.

Answer: D

Solution(s):

The \($3\) boxes give us the most popsicles per dollar, so we want to buy as many of those as possible.

We can buy two of those, getting \(5 \cdot 2 = 10\) popsicles with \($8 - $6 = $2\) remaining.

The \($1\) single popsicles are the worst deal, so Pablo should spend the rest of his money on the \(3\)-popsicle box.

He then ends up with \(10 + 3 = 13\) popsicles.

Thus, D is the correct answer.

Answer: B

Solution(s):

We can see that the width of the garden is \[2 \cdot 6 + 3 \cdot 1 = 15.\] We can also see that the height is \[ 3 \cdot 2 + 4 \cdot 1 = 10. \] The total area of the garden is therefore \(15 \cdot 10 = 150.\) The area of all the flower beds is \[ 6 \cdot 2 \cdot 6 = 72. \] Subtracting this from the area of the garden yields \(150 - 72 = 78,\) which is the area of the walkways.

Thus, B is the correct answer.

Answer: B

Solution(s):

Note that after \(30\) seconds, there are \(3\) toys added and \(2\) removed, leaving a net total of \(+1\) toys in the box.

We have to be careful towards the end, however, since it is possible for the box to have \(30\) toys right after Mia's mom adds the toys and before Mia removes them.

After there are \(27\) toys in the box, Mia's mom can add \(3,\) leaving \(30\) toys in the box.

It will take \(27 \cdot 30\) seconds, plus another \(30\) seconds, which gives us \[ 28 \cdot 30 \div 60 = 14 \] minutes to get \(30\) toys in the box.

Thus, B is the correct answer.

Answer: C

Solution(s):

Let \(x\) and \(y\) be the two numbers. We are given that \(x + y = 4xy.\)

Note that \[ \dfrac{1}{x} + \dfrac{1}{y} = \dfrac{x + y}{xy} = 4. \]

Thus, C is the correct answer.

Answer: B

Solution(s):

There is no stipulation on how to get an A other than that getting all the multiple choice right guarantees an A.

This means that it is possible to get an A without getting all the multiple choice questions right.

It is also possible to not get an A even if all but one of the multiple choice questions are answered correctly.

This rules out A, C, D, and E.

Thus, B is the correct answer.

Answer: A

Solution(s):

Let \(s\) be the side length of the field. Then Jerry traveled \(2s\) and Silvia traveled \(s\sqrt{2}\) from the Pythagorean theorem.

The desired value is \[\begin{align*} \dfrac{2s - s\sqrt{2}}{2s} &= \dfrac{2 - \sqrt{2}}{2} \\ &\approx \dfrac{2 - 1.4}{2} \\&= .3\\ &= 30\%. \end{align*}\]

Thus, A is the correct answer.

Answer: B

Solution(s):

Each of the \(10\) people shake hands with each of the \(20\) people. This results in \(10 \cdot 20 = 200\) handshakes.

There are also \(\binom{10}{2} = 45\) handshakes within the \(10\) people (every pair of people shake hands).

Therefore, the total number of handshakes is \(200 + 45 = 245.\)

Thus, B is the correct answer.

Answer: C

Solution(s):

It will take Minnie \(10 \div 5 = 2\) hours to travel the uphill distance. It will take her \(15 \div 30 = \frac{1}{2}\) hours to travel the downhill distance.

Finally, it will take her \(20 \div 20 = 1\) hour to travel the flat. This will take her a total of \[ \begin{align*}60\left(2 + \frac{1}{2} + 1\right) &= 60 \cdot \frac{7}{2} \\&= 210 \end{align*}\] minutes.

It will take Penny \(20 \div 30 = \frac{2}{3}\) hours to travel the flat. It will take her another \(15 \div 10 = \frac{3}{2}\) hours to travel the uphill.

Finally, it will take her \(10 \div 40 = \frac{1}{4}\) hours to travel the downhill. This is a total of \[\begin{align*} 60\left(\dfrac{2}{3} + \dfrac{3}{2} + \dfrac{1}{4}\right) &= 60 \cdot \dfrac{29}{12} \\&= 145 \end{align*}\] minutes. The trip takes Minnie \(210 - 145 = 65\) more minutes to travel than Penny.

Thus, C is the correct answer.

Answer: B

Solution(s):

Note that no one side can be greater than or equal to the sum of the other side lengths.

Let \(x\) be the length fourth rod. Then we have that \[ x \lt 3 + 7 + 15\] and \[ x + 3 + 7 \gt 15\] Simplifying, we know that \[5\lt x\lt 25.\] Counting the number of integers in this range, we are left with \(25 - 5 - 1 = 19\) values for \(x.\)

The rods with length \(7\) and \(15\) are already being used, however, so \(x\) cannot equal these.

This leaves \(19 - 2 = 17\) viable solutions for \(x.\)

Thus, B is the correct solution.

Answer: D

Solution(s):

Recall that all the points at most a fixed distance \(r\) away from a point form a sphere.

At the end points of this line segment, we can visualize two hemispheres being formed at each end.

All the points in the middle also have spheres forming around them, but they get merged into the ones right next to them.

This means that the middle section forms a cylinder with radius \(3.\) The two hemispheres form a sphere with radius \(3,\) and therefore a volume of \[ \dfrac{4}{3} \pi 3^3 = 27 \cdot \dfrac{4}{3} \pi = 36 \pi. \] This means that the cylinder has a volume of \(216 \pi - 36 \pi = 180 \pi.\) We know the base is \(3 \pi,\) so if \(h\) is \(AB,\) then the volume is \[ \begin{align*} \pi 3^2 h &= 180\pi \\9h \pi &= 180 \pi \\ h &= 20. \end{align*}\]

Thus, D is the correct answer.

Answer: E

Solution(s):

Let us case on which of the values are equal. If \(3 = x + 2,\) then \(x = 1.\) This also tells us that \[ y - 4 \leq 3 \]\[ y \leq 7. \] This describes a ray starting at \((1, 7)\) and extending in the negative \(y\) direction.

Similarly, if \(3 = y - 4,\) then \(y = 7\) and \[ x + 2 \leq 3 \]\[ x \leq 1. \] This also describes a ray starting at \((1, 7)\) but instead extending in the negative \(x\) direction.

Finally, if \(x + 2 = y - 4,\) then we have the line \(y = x + 6.\) Furthermore, we have that \[ 3 \leq x + 2 \]\[ x \geq 1 \] and \[ 3 \leq y - 4 \]\[ y \geq 7. \] Note that if one if these conditions is met, the other is also necessarily true due to the equation of the line.

If \(y = 7,\) then \(x = 1.\) The other points are along the line, where \(y \gt 7\) and \(x \gt 1.\)

This describes another ray that starts at \((1, 7)\) and goes off in some third direction.

All three cases result in rays originating from \((1, 7)\) that all go in different directions.

Thus, E is the correct answer.

Answer: D

Solution(s):

Let us list out the first few values to see if we can find a pattern in this sequence.

\[ 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, \cdots \]

From this we can see that the pattern repeats every \(8\) terms.

The desired answer is the sum of \(8\) consecutive numbers, which is fixed. This sum is \[ 0 + 1 + 1 + 2 + 0 + 2\]\[ + 2 + 1 = 9. \] Thus, D is the correct answer.

Answer: D

Solution(s):

Let \(t\) be the cost of the ticket and \(s\) be the cost of the soda. Then we get the following equations. \[ t = \dfrac{A - s}{5} \] \[ s = \dfrac{A - t}{20} \]

Cross-multiplying the first equation gives us \(5t = A - s.\) Substituting in the expression for \(s\) yields \[ 5t = A - \dfrac{A - t}{20}. \] Solving yields \[ \begin{align*} 5t &= A - \dfrac{A - t}{20} \\ 100t &= 20A - A + t \\ 99t &= 19A \\ t &= \dfrac{19A}{99}. \end{align*} \]

This also gives us \[ s = \dfrac{A - \frac{19A}{99}}{20} = \dfrac{4A}{99}. \]

Adding together the costs gives us \[ \dfrac{19A}{99} + \dfrac{4A}{99} = \dfrac{23A}{99} \approx 23 \%. \]

Thus, D is the correct answer.

Answer: C

Solution(s):

If Laurent chooses a number in the interval \((2017, 4034],\) then there is no way that Chloe can have the greater number.

This means that Laurent has a \(\frac{1}{2}\) chance of automatically winning.

Otherwise, Laurent chooses a number in the interval \([0, 2017].\) The probability that she gets a greater number than Chloe is the same as Chloe getting a greater number then Laurent.

This means that Laurent has a \(\frac{1}{2}\) chance of getting a greater number (when working with real intervals, the probability of a tie is essentially \(0\) due to the infinite size of the intervals).

Laurent's total chance of getting a greater number is \[ \dfrac{1}{2} \cdot 1 + \dfrac{1}{2} \cdot \dfrac{1}{2} = \dfrac{3}{4}. \]

Thus, C is the correct answer.

Answer: B

Solution(s):

The time it will take for \(5\) horses to meet again at the start is the least common multiple of their times.

We want to find the \(5\) numbers that share lots of prime factors and have small prime factors.

This is because to find the least common multiple, we choose the highest power of a prime that is present among all the numbers.

As such, we can choose Horses \(1, 2, 3, 4,\) and \(6.\) These have prime factors of \(2\) and \(3,\) which the best we can do.

The least common multiple is \(12.\) The sum of its digits is \(1 + 2 = 3.\)

Thus, B is the correct answer.

Answer: D

Solution(s):

Note that the only integer coordinate pairs on this circle are \[ (\pm 3, \pm 4),\]\[ (\pm 4, \pm 3),\]\[ (\pm 5, 0), \] and \[ (0, \pm 5). \]

To get the greatest possible ratio, we want to maximize \(PQ\) and minimize \(RS.\)

We can see that the distance between any of these points is irrational as long as it is not a diameter.

There are only \(2\) logical candidates for the longest distance: \((-4, 3)\) and \((3, -4)\) or \((-4, 3)\) and \((5, 0).\)

Using the distance formula gives us the two distances as \(\sqrt{98}\) and \(\sqrt{90}.\) The first is greater.

There is only one viable choice for the shortest distance: \((3, 4)\) and \((4, 3),\) which give us a distance of \(\sqrt{2}.\)

The desired ratio is then \[ \dfrac{\sqrt{98}}{\sqrt{2}} = \sqrt{49} = 7. \]

Thus, D is the correct answer.

Answer: D

Solution(s):

Let \(x\) be the probability that Amelia wins.

There is a \(\frac{1}{3}\) chance Amelia wins off her first flip.

If she gets a tails, we want Blaine to lose, which happens with a \(\frac{3}{5}\) chance.

The total probability of this case is \[\dfrac{2}{3} \cdot \dfrac{3}{5} = \dfrac{2}{5}.\]

The game then goes back to Amelia, who then again has a \(x\) chance of winning.

Therefore, we get the following equation. \[ x = \dfrac{1}{3} + \dfrac{2}{5}x\]\[\dfrac{3}{5}x = \dfrac{1}{3} \]\[ x = \dfrac{5}{9}. \]

The difference between the denominator and numerator is \(9 - 5 = 4.\)

Thus, D is the correct answer.

Answer: C

Solution(s):

If Alice sets on an edge, then the person next to her cannot be Bob or Carla. This means that it must be Derek or Eric.

WLOG, let the person be Eric. Then the person next to Eric has to be Bob or Carla. After that there are no more restrictions.

This gives us a total of \[ 2 \cdot 2 \cdot 2 \cdot 2 = 16. \]

The first \(2\) is for both edges. The second \(2\) is for Derek or Eric. The third \(2\) is for Bob or Carla. The final \(2\) is just for the \(2\) people that are remaining.

Otherwise, let Alice be in the middle. Then the two people next to her have to be Derek and Eric. Bob and Carla are forced to be in the last \(2\) seats.

There are \(3\) choices for Alice sets. The side on which Derek is sat has \(2\) options, and then there are \(2\) options for where Bob and Carla go.

This gives us \[ 3 \cdot 2 \cdot 2 = 12 \] configurations.

Therefore, there are a total of \(12 + 16 = 28\) total seating arrangements.

Thus, C is the correct answer.

Answer: D

Solution(s):

Recall that a number is divisible by \(9\) if and only if the sum of its digits is also divisible by \(9.\)

This means that looking at \(S(n)\) mod \(9\) would also give us \(n\) mod \(9.\)

Let us prove this. If we add \(x\) to \(n\) without carrying, it is clear that the sum of the digits increases by \(x\) and that \(n\) itself increases by \(x.\)

This would increase both their values mod \(9\) by \(x.\)

Now, if it does carry, we would be subtracting \(10\) from some digit and adding on \(1\) to the next digit.

This would keep the value mod \(9\) constant. We did, however, add \(x\) in there, so the value mod \(9\) still increased by \(x.\)

These are the only two cases, and in both we have shown that the value mod \(9\) for both \(n\) and \(S(n)\) increased by \(x.\)

Therefore, we have that \[ n \equiv S(n) \equiv 5 \pmod 9. \]

From this, we can see that \[ n + 1 \equiv 6 \equiv S(n + 1) \pmod 9. \]

The only answer choice that leaves a remainder of \(6\) when divided by \(9\) is \(1239.\)

Thus, D is the correct answer.

Answer: D

Solution(s):

We can see that \(\triangle ABC\) and \(\triangle FBE\) are similar (angle-angle). This gives us \[ \dfrac{BF}{FE} = \dfrac{AB}{AC} \]\[ \dfrac{4 - x}{x} = \dfrac{4}{3}. \]

Cross-multiplying yields \[ 12 - 3x = 4x \]\[ x = \dfrac{12}{7}. \]

Here, we have that \(\triangle ABC,\) \(\triangle RBQ,\) and \(\triangle STC\) are similar (angle-angle).

This means that \(RB = \dfrac{4}{3}y\) and \(CS = \dfrac{3}{4}y.\) This gives us the equation \[ \dfrac{4}{3}y + \dfrac{3}{4}y + y = 5 \]\[ \dfrac{37}{12}y = 5. \]

Finally, we get that \(y = \dfrac{60}{37}.\) The desired ratio is \[ \dfrac{\frac{12}{7}}{\frac{60}{37}} = \dfrac{37}{35}. \]

Thus, D is the correct answer.

Answer: E

Solution(s):

Let the radius of the circle be \(r.\)

To find the area of the triangle outside of the circle, we can find the area of the triangle inside the circle and subtract it.

We get that \(\angle BOC = 120^{\circ}\) since \(\angle ABO\) and \(\angle ACO\) are right angles.

This means that the area of sector \(OBC\) is \[ \dfrac{120}{360} \cdot \pi r^2 = \dfrac{\pi r^2}{3}. \]

Now, we need to find the area of \(\triangle BOC.\) Using the formula for the area of a triangle with sine, we get the area to be \[ \dfrac{1}{2} \sin (120^{\circ}) \cdot r^2 = \dfrac{r^2\sqrt{3}}{4}. \]

Then the area of the triangle inside the circle is \[ \dfrac{\pi r^2}{3} - \dfrac{r^2\sqrt{3}}{4} = \dfrac{r^2(4\pi - 3\sqrt{3})}{12}. \]

The area of \(\triangle ABC\) is \[ \dfrac{(r\sqrt{3})^2\sqrt{3}}{4} = \dfrac{3r^2\sqrt{3}}{4}. \]

The desired fraction is then \[\begin{align*} 1 - \dfrac{\frac{r^2(4\pi - 3\sqrt{3})}{12}}{\frac{3r^2\sqrt{3}}{4}} &= 1 - \dfrac{4\pi - 3\sqrt{3}}{9\sqrt{3}} \\&= 1 - \dfrac{4\pi\sqrt{3}}{27} + \dfrac{1}{3} \\&= \dfrac{4}{3} - \dfrac{4\pi\sqrt{3}}{27}. \end{align*}\]

Thus, E is the correct answer.

Answer: B

Solution(s):

We can use complementary counting to find the total number of triangles and subtract out the ones that don't work.

There are a total of \(5^2 = 25\) points, so there are \(\binom{25}{3} = 2300\) possible triangles.

Note that the only way a triangle doesn't work is if all the \(3\) points are in a straight line.

There are \(5\) rows, \(5\) columns, and \(2\) long diagonals. Each of these \(12\) lines have \(5\) points, which means they contribute \[ 12 \cdot \binom{5}{3} = 12 \cdot 10 = 120 \] degenerate triangles.

There are also the diagonal lines with \(4\) points, such as \((0, 1)\) to \((4, 5).\) There are \(4\) of these lines, so they have \[ 4 \cdot \binom{4}{3} = 4 \cdot 4 = 16 \] degenerate triangles.

Similarly, they are \(4\) diagonal lines with \(3\) points. These give us \(4 \cdot 1 = 4\) extra triangles that don't work.

Now, we have to look at the lines with slopes of \(\dfrac{1}{2}, 2, -\dfrac{1}{2},\) and \(-2.\)

There are \(3\) such lines for each slope, and they all have \(3\) points on them. Therefore, they contribute \[ 4 \cdot 3 \cdot 1 = 12 \] more triangles to discount.

The total number of working triangles is then \[ 2300 - 120 - 16 - 4 - 12 \]\[= 2148. \] Thus, B is the correct answer.

Answer: C

Solution(s):

We know that \(f(x)\) has \(4\) roots, \(3\) of which are the roots of \(g(x).\) This means that we can express as \(f(x)\) as \[ f(x) = g(x)(x - r), \] for some complex number \(r\) that is the other root of \(f(x).\)

Plugging in \(g(x),\) we get \(f(x)\) equals: \[ (x^3 + ax^2 + x + 10)(x - r) \]\[ = x^4 + (a - r)x^3 + (1 - ar)x^2 \]\[+ (10 - r)x - 10r. \]

Comparing coefficients, we get \[ 10 - r = 100 \]\[ r = -90. \] We also know that \[ a - r = 1 \]\[ a = -89. \]

Finally, we have that \(f(1)\) equals: \[1^4 + (a - r)1^3 + (1 - ar)1^2 \]\[+ (10 - r)1 - 10r \]\[= 1+ (-89 + 90) + (1 - 89 \cdot 90) \]\[+ (10 + 90) + 10 \cdot 90 \]\[= 1 + 1 - 8009 + 100 + 900 \]\[= -7007. \]

Thus, C is the correct answer.

Answer: A

Solution(s):

We can analyze all the multiple so \(11\) and see how many permutations each of them contribute. We can do this by casing on the number of unique digits in the number.

Case \(1:\) all the digits are the same

This cannot happen. We can see this by the divisibility rule for \(11,\) which says that the sum of the first and last digit minus the middle digit must be divisible by \(11.\)

If all the digits are the sum, then the above expression evaluates to that digit, which cannot be divisible by \(11.\)

Case \(2:\) two of the digits are the same

We can split this up into the numbers that have the digit \(0\) and those that don't.

There are \(8\) multiples of \(11\) that do not have the digit \(0:\) \[ 121, 242, 363, 484, 616, 737, 858, \] and \(979.\)

Each of these numbers contributes \(3\) permutations, so this scenario has \(8 \cdot 3 = 24\) numbers.

There are \(9\) multiples of \(11\) that have the digit \(0:\)\[ 110, 220, 330, 440, 550, 660, 770, \] \(880,\) and \(990.\)

For these numbers, \(0\) cannot be the hundreds digit, so each of them only contributes \(2\) permutations, for a total of \(9 \cdot 2 = 18.\)

Case \(3:\) all the digits are different

There are a total of \(81\) multiples of \(11\) between \(100\) and \(999.\) The number of these with all different digits is \[ 81 - 8 - 9 = 64. \] As in case \(2,\) we have to specially account for the numbers with \(0\) as a digit. There are \(8:\) \[ 209, 308, 407, 506, 605, 704, 803, \] and \(902.\)

Each of these gives us \(2 \cdot 2 = 4\) permutations, but we overcount by a factor of \(2\) since flipping the first and last digits creates another number already in the set.

Therefore, these numbers provide a total of \[ 8 \cdot 4 \div 2 = 16 \] unique permutations.

There are now \(64 - 8 = 56\) multiples of \(11\) that we need to account for.

We know that each of these provides \(3! = 6\) permutations. As above, however, note that flipping the first and last digit of any number in this set produces another number in this set.

We can see this by using the divisibility rule for \(11.\) If \(ABC\) is divisible by \(11,\) then we have that \(A + C - B\) is divisible by \(11.\)

This means that \(C + A - B\) is divisible by \(11,\) which means that \(CBA\) is also divisible by \(11.\)

Therefore, these numbers contribute \[ 56 \cdot 6 \div 2 = 168 \] more permutations.

Over all the cases, we have a total of \[ 24 + 18 + 16 + 168 = 226 \] numbers.

Thus, A is the correct answer.