AIME II 2016

Initially Alex, Betty, and Charlie had a total of \(444\) peanuts. Charlie had the most peanuts, and Alex had the least. The three numbers of peanuts that each person had formed a geometric progression. Alex eats \(5\) of his peanuts, Betty eats \(9\) of her peanuts, and Charlie eats \(25\) of his peanuts. Now the three numbers of peanuts each person has forms an arithmetic progression. Find the number of peanuts Alex had initially.

There is a \(40 %\) chance of rain on Saturday and a \(30 %\) chance of rain on Sunday. However, it is twice as likely to rain on Sunday if it rains on Saturday than if it does not rain on Saturday. The probability that it rains at least one day this weekend is \(\dfrac{a}{b}\) , where \(a\) and \(b\) are relatively prime positive integers. Find \(a + b\) .

Let \(x , y ,\) and \(z\) be real numbers satisfying the system Find the value of \(\| \log_5 x \| + \| \log_5 y \| + \| \log_5 z \|\) .

An \(a \times b \times c\) rectangular box is built from \(a \cdot b \cdot c\) unit cubes. Each unit cube is colored red, green, or yellow. Each of the \(a\) layers of size \(1 \times b \times c\) parallel to the \(( b \times c )\) faces of the box contains exactly \(9\) red cubes, exactly \(12\) green cubes, and some yellow cubes. Each of the \(b\) layers of size \(a \times 1 \times c\) parallel to the \(( a \times c )\) faces of the box contains exactly \(20\) green cubes, exactly \(25\) yellow cubes, and some red cubes. Find the smallest possible volume of the box.

Triangle \(A B C_0\) has a right angle at \(C_0\) . Its side lengths are pairwise relatively prime positive integers, and its perimeter is \(p\) . Let \(C_1\) be the foot of the altitude to \(\overline{A B}\) , and for \(n \geq 2\) , let \(C_n\) be the foot of the altitude to \(\overline{C_{n - 2} B}\) in \(\triangle C_{n - 2} C_{n - 1} B\) . The sum \(\displaystyle\sum_{n = 2}^\infty C_{n - 2} C_{n - 1} = 6 p\) . Find \(p\) .

For polynomial \(P ( x ) = 1 - \dfrac{1}{3} x + \dfrac{1}{6} x^2\) , define \(Q ( x ) = P ( x ) P ( x^3 ) P ( x^5 ) P ( x^7 ) P ( x^9 ) = \displaystyle\sum_{i = 0}^50 a_i x^i\) . Then \(\displaystyle\sum_{i = 0}^50 \| a_i \| = \dfrac{m}{n}\) , where \(m\) and \(n\) are relatively prime positive integers. Find \(m + n\) .

Squares \(A B C D\) and \(E F G H\) have a common center and \(\overline{A B} \| \| \overline{E F}\) . The area of \(A B C D\) is 2016, and the area of \(E F G H\) is a smaller positive integer. Square \(I J K L\) is constructed so that each of its vertices lies on a side of \(A B C D\) and each vertex of \(E F G H\) lies on a side of \(I J K L\) . Find the difference between the largest and smallest positive integer values for the area of \(I J K L\) .

Find the number of sets \({ a , b , c }\) of three distinct positive integers with the property that the product of \(a , b ,\) and \(c\) is equal to the product of \(11 , 21 , 31 , 41 , 51 ,\) and \(61\) .

The sequences of positive integers \(1 , a_2 , a_3 , . . .\) and \(1 , b_2 , b_3 , . . .\) are an increasing arithmetic sequence and an increasing geometric sequence, respectively. Let \(c_n = a_n + b_n\) . There is an integer \(k\) such that \(c_{k - 1} = 100\) and \(c_{k + 1} = 1000\) . Find \(c_k\) .

Triangle \(A B C\) is inscribed in circle \(\omega\) . Points \(P\) and \(Q\) are on side \(\overline{A B}\) with \(A P < A Q\) . Rays \(C P\) and \(C Q\) meet \(\omega\) again at \(S\) and \(T\) (other than \(C\) ), respectively. If \(A P = 4 , P Q = 3 , Q B = 6 , B T = 5 ,\) and \(A S = 7\) , then \(S T = \dfrac{m}{n}\) , where \(m\) and \(n\) are relatively prime positive integers. Find \(m + n\) .

For positive integers \(N\) and \(k\) , define \(N\) to be \(k\) -nice if there exists a positive integer \(a\) such that \(a^k\) has exactly \(N\) positive divisors. Find the number of positive integers less than \(1000\) that are neither \(7\) -nice nor \(8\) -nice.

The figure below shows a ring made of six small sections which you are to paint on a wall. You have four paint colors available and you will paint each of the six sections a solid color. Find the number of ways you can choose to paint the sections if no two adjacent sections can be painted with the same color.

Beatrix is going to place six rooks on a \(6 \times 6\) chessboard where both the rows and columns are labeled \(1\) to \(6\) the rooks are placed so that no two rooks are in the same row or the same column. The value of a square is the sum of its row number and column number. The score of an arrangement of rooks is the least value of any occupied square. The average score over all valid configurations is \(\dfrac{p}{q}\) , where \(p\) and \(q\) are relatively prime positive integers. Find \(p + q\) .

Equilateral \(\triangle A B C\) has side length \(600\) . Points \(P\) and \(Q\) lie outside the plane of \(\triangle A B C\) and are on opposite sides of the plane. Furthermore, \(P A = P B = P C\) , and \(Q A = Q B = Q C\) , and the planes of \(\triangle P A B\) and \(\triangle Q A B\) form a \(120^\circ\) dihedral angle (the angle between the two planes). There is a point \(O\) whose distance from each of \(A , B , C , P ,\) and \(Q\) is \(d\) . Find \(d\) .

For \(1 \leq i \leq 215\) let \(a_i = 1 / 2^i\) and \(a_216 = 1 / 2^215\) . Let \(x_1 , x_2 , . . . , x_216\) be positive real numbers such that \(\displaystyle\sum_{i = 1}^216 x_i = 1\) and \(\displaystyle\sum_{1 \leq i < j \leq 216} x_i x_j = \dfrac{107}{215} + \displaystyle\sum_{i = 1}^216 \dfrac{a_i x_i^2}{2 ( 1 - a_i )}\) . The maximum possible value of \(x_2 = \dfrac{m}{n}\) , where \(m\) and \(n\) are relatively prime positive integers. Find \(m + n\) .