AIME II 2017

Find the number of subsets of \(\{ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 \}\) that are subsets of neither \(\{ 1 , 2 , 3 , 4 , 5 \}\) nor \(\{ 4 , 5 , 6 , 7 , 8 \}\) .

Teams \(T_1\) , \(T_2\) , \(T_3\) , and \(T_4\) are in the playoffs. In the semifinal matches, \(T_1\) plays \(T_4\) , and \(T_2\) plays \(T_3\) . The winners of those two matches will play each other in the final match to determine the champion. When \(T_i\) plays \(T_j\) , the probability that \(T_i\) wins is \(\dfrac{i}{i + j}\) , and the outcomes of all the matches are independent. The probability that \(T_4\) will be the champion is \(\dfrac{p}{q}\) , where \(p\) and \(q\) are relatively prime positive integers. Find \(p + q\) .

A triangle has vertices \(A ( 0 , 0 )\) , \(B ( 12 , 0 )\) , and \(C ( 8 , 10 )\) . The probability that a randomly chosen point inside the triangle is closer to vertex \(B\) than to either vertex \(A\) or vertex \(C\) can be written as \(\dfrac{p}{q}\) , where \(p\) and \(q\) are relatively prime positive integers. Find \(p + q\) .

Find the number of positive integers less than or equal to \(2017\) whose base-three representation contains no digit equal to \(0\) .

A set contains four numbers. The six pairwise sums of distinct elements of the set, in no particular order, are \(189\) , \(320\) , \(287\) , \(234\) , \(x\) , and \(y\) . Find the greatest possible value of \(x + y\) .

Find the sum of all positive integers \(n\) such that \(\sqrt{n^2 + 85 n + 2017}\) is an integer.

Find the number of integer values of \(k\) in the closed interval \([ - 500 , 500 ]\) for which the equation \(\log ( k x ) = 2 \log ( x + 2 )\) has exactly one real solution.

Find the number of positive integers \(n\) less than \(2017\) such that \( 1 + n + \dfrac{n^2}{2 !} + \dfrac{n^3}{3 !} + \dfrac{n^4}{4 !} + \dfrac{n^5}{5 !} + \dfrac{n^6}{6 !} \) is an integer.

A special deck of cards contains \(49\) cards, each labeled with a number from \(1\) to \(7\) and colored with one of seven colors. Each number-color combination appears on exactly one card. Sharon will select a set of eight cards from the deck at random. Given that she gets at least one card of each color and at least one card with each number, the probability that Sharon can discard one of her cards and \(\mathit{\text{still}}\) have at least one card of each color and at least one card with each number is \(\dfrac{p}{q}\) , where \(p\) and \(q\) are relatively prime positive integers. Find \(p + q\) .

Rectangle \(A B C D\) has side lengths \(A B = 84\) and \(A D = 42\) . Point \(M\) is the midpoint of \(\overline{A D}\) , point \(N\) is the trisection point of \(\overline{A B}\) closer to \(A\) , and point \(O\) is the intersection of \(\overline{C M}\) and \(\overline{D N}\) . Point \(P\) lies on the quadrilateral \(B C O N\) , and \(\overline{B P}\) bisects the area of \(B C O N\) . Find the area of \(\triangle C D P\) .

Five towns are connected by a system of roads. There is exactly one road connecting each pair of towns. Find the number of ways there are to make all the roads one-way in such a way that it is still possible to get from any town to any other town using the roads (possibly passing through other towns on the way).

Circle \(C_0\) has radius \(1\) , and the point \(A_0\) is a point on the circle. Circle \(C_1\) has radius \(r < 1\) and is internally tangent to \(C_0\) at point \(A_0\) . Point \(A_1\) lies on circle \(C_1\) so that \(A_1\) is located \(90^\circ\) counterclockwise from \(A_0\) on \(C_1\) . Circle \(C_2\) has radius \(r^2\) and is internally tangent to \(C_1\) at point \(A_1\) . In this way a sequence of circles \(C_1 , C_2 , C_3 , \cdots\) and a sequence of points on the circles \(A_1 , A_2 , A_3 , \cdots\) are constructed, where circle \(C_n\) has radius \(r^n\) and is internally tangent to circle \(C_{n - 1}\) at point \(A_{n - 1}\) , and point \(A_n\) lies on \(C_n\) \(90^\circ\) counterclockwise from point \(A_{n - 1}\) , as shown in the figure below. There is one point \(B\) inside all of these circles. When \(r = \dfrac{11}{60}\) , the distance from the center \(C_0\) to \(B\) is \(\dfrac{m}{n}\) , where \(m\) and \(n\) are relatively prime positive integers. Find \(m + n\) .

For each integer \(n \geq 3\) , let \(f ( n )\) be the number of \(3\) \-element subsets of the vertices of a regular \(n\) -gon that are the vertices of an isosceles triangle (including equilateral triangles). Find the sum of all values of \(n\) such that \(f ( n + 1 ) = f ( n ) + 78\) .

A \(10 \times 10 \times 10\) grid of points consists of all points in space of the form \(( i , j , k )\) , where \(i\) , \(j\) , and \(k\) are integers between \(1\) and \(10\) , inclusive. Find the number of different lines that contain exactly \(8\) of these points.

Tetrahedron \(A B C D\) has \(A D = B C = 28\) , \(A C = B D = 44\) , and \(A B = C D = 52\) . For any point \(X\) in space, define \(f ( X ) = A X + B X + C X + D X\) . The least possible value of \(f ( X )\) can be expressed 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\) .