AIME I 2016

For \(- 1 < r < 1\) , let \(S ( r )\) denote the sum of the geometric series \( 12 + 12 r + 12 r^2 + 12 r^3 + \cdots.c . \) Let \(a\) between \(- 1\) and \(1\) satisfy \(S ( a ) S ( - a ) = 2016\) . Find \(S ( a ) + S ( - a )\) .

Two dice appear to be normal dice with their faces numbered from \(1\) to \(6\) , but each die is weighted so that the probability of rolling the number \(k\) is directly proportional to \(k\) . The probability of rolling a \(7\) with this pair of dice is \(\dfrac{m}{n}\) , where \(m\) and \(n\) are relatively prime positive integers. Find \(m + n\) .

A regular icosahedron is a \(20\) -faced solid where each face is an equilateral triangle and five triangles meet at every vertex. The regular icosahedron shown below has one vertex at the top, one vertex at the bottom, an upper pentagon of five vertices all adjacent to the top vertex and all in the same horizontal plane, and a lower pentagon of five vertices all adjacent to the bottom vertex and all in another horizontal plane. Find the number of paths from the top vertex to the bottom vertex such that each part of a path goes downward or horizontally along an edge of the icosahedron, and no vertex is repeated.

A right prism with height \(h\) has bases that are regular hexagons with sides of length \(12\) . A vertex \(A\) of the prism and its three adjacent vertices are the vertices of a triangular pyramid. The dihedral angle (the angle between the two planes) formed by the face of the pyramid that lies in a base of the prism and the face of the pyramid that does not contain \(A\) measures \(60^\circ\) . Find \(h^2\) .

Anh read a book. On the first day she read \(n\) pages in \(t\) minutes, where \(n\) and \(t\) are positive integers. On the second day Anh read \(n + 1\) pages in \(t + 1\) minutes. Each day thereafter Anh read one more page than she read on the previous day, and it took her one more minute than on the previous day until she completely read the \(374\) page book. It took her a total of \(319\) minutes to read the book. Find \(n + t\) .

In \(\triangle A B C\) let \(I\) be the center of the inscribed circle, and let the bisector of \(\angle A C B\) intersect \(\overline{A B}\) at \(L\) . The line through \(C\) and \(L\) intersects the circumscribed circle of \(\triangle A B C\) at the two points \(C\) and \(D\) . If \(L I = 2\) and \(L D = 3\) , then \(I C = \dfrac{p}{q}\) , where \(p\) and \(q\) are relatively prime positive integers. Find \(p + q\) .

For integers \(a\) and \(b\) consider the complex number \( \dfrac{\sqrt{a b + 2016}}{a b + 100} - \left(\dfrac{\sqrt{\| a + b \|}}{a b + 100}\right) i . \) Find the number of ordered pairs of integers \(( a , b )\) such that this complex number is a real number.

For a permutation \(p = ( a_1 , a_2 , \cdots , a_9 )\) of the digits \(1 , 2 , \cdots , 9\) , let \(s ( p )\) denote the sum of the three \(3\) \-digit numbers \(a_1 a_2 a_3\) , \(a_4 a_5 a_6\) , and \(a_7 a_8 a_9\) . Let \(m\) be the minimum value of \(s ( p )\) subject to the condition that the units digit of \(s ( p )\) is \(0\) . Let \(n\) denote the number of permutations \(p\) with \(s ( p ) = m\) . Find \(\| m - n \|\) .

Triangle \(A B C\) has \(A B = 40 , A C = 31 ,\) and \(\sin A = \dfrac{1}{5}\) . This triangle is inscribed in rectangle \(A Q R S\) with \(B\) on \(\overline{Q R}\) and \(C\) on \(\overline{R S}\) . Find the maximum possible area of \(A Q R S\) .

A strictly increasing sequence of positive integers \(a_1\) , \(a_2\) , \(a_3\) , \(\cdots.c\) has the property that for every positive integer \(k\) , the subsequence \(a_{2 k - 1}\) , \(a_{2 k}\) , \(a_{2 k + 1}\) is geometric and the subsequence \(a_{2 k}\) , \(a_{2 k + 1}\) , \(a_{2 k + 2}\) is arithmetic. Suppose that \(a_13 = 2016\) . Find \(a_1\) .

Let \(P ( x )\) be a nonzero polynomial such that \(( x - 1 ) P ( x + 1 ) = ( x + 2 ) P ( x )\) for every real \(x\) , and \((P ( 2 ))^2 = P ( 3 )\) . Then \(P \left( \dfrac{7}{2} \right) = \dfrac{m}{n}\) , where \(m\) and \(n\) are relatively prime positive integers. Find \(m + n\) .

Find the least positive integer \(m\) such that \(m^2 - m + 11\) is a product of at least four not necessarily distinct primes.

Freddy the frog is jumping around the coordinate plane searching for a river, which lies on the horizontal line \(y = 24\) . A fence is located at the horizontal line \(y = 0\) . On each jump Freddy randomly chooses a direction parallel to one of the coordinate axes and moves one unit in that direction. When he is at a point where \(y = 0\) , with equal likelihoods he chooses one of three directions where he either jumps parallel to the fence or jumps away from the fence, but he never chooses the direction that would have him cross over the fence to where \(y < 0\) . Freddy starts his search at the point \(( 0 , 21 )\) and will stop once he reaches a point on the river. Find the expected number of jumps it will take Freddy to reach the river.

Centered at each lattice point in the coordinate plane are a circle radius \(\dfrac{1}{10}\) and a square with sides of length \(\dfrac{1}{5}\) whose sides are parallel to the coordinate axes. The line segment from \(( 0 , 0 )\) to \(( 1001 , 429 )\) intersects \(m\) of the squares and \(n\) of the circles. Find \(m + n\) .

Circles \(\omega_1\) and \(\omega_2\) intersect at points \(X\) and \(Y\) . Line \(\ell\) is tangent to \(\omega_1\) and \(\omega_2\) at \(A\) and \(B\) , respectively, with line \(A B\) closer to point \(X\) than to \(Y\) . Circle \(\omega\) passes through \(A\) and \(B\) intersecting \(\omega_1\) again at \(D \neq A\) and intersecting \(\omega_2\) again at \(C \neq B\) . The three points \(C\) , \(Y\) , \(D\) are collinear, \(X C = 67\) , \(X Y = 47\) , and \(X D = 37\) . Find \(A B^2\) .