Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2017 AIME II Problems"

(Created page with "<math>\textbf{Problem 1}</math> Find the number of subsets of <math>\{1, 2, 3, 4, 5, 6, 7, 8\}</math> that are subsets of neither <math>\{1, 2, 3, 4, 5\}</math> nor <math>\{4,...")
 
(Undo revision 131907 by Readyplayerone (talk))
(Tag: Undo)
 
(32 intermediate revisions by 9 users not shown)
Line 1: Line 1:
−
<math>\textbf{Problem 1}</math>
+
{{AIME Problems|year=2017|n=II}}
 +
 
 +
==Problem 1==
 
Find the number of subsets of <math>\{1, 2, 3, 4, 5, 6, 7, 8\}</math> that are subsets of neither <math>\{1, 2, 3, 4, 5\}</math> nor <math>\{4, 5, 6, 7, 8\}</math>.
 
Find the number of subsets of <math>\{1, 2, 3, 4, 5, 6, 7, 8\}</math> that are subsets of neither <math>\{1, 2, 3, 4, 5\}</math> nor <math>\{4, 5, 6, 7, 8\}</math>.
  
−
<math>\textbf{Problem 1 Solution}</math>
+
[[2017 AIME II Problems/Problem 1 | Solution]]
−
The number of subsets of a set with <math>n</math> elements is <math>2^n</math>. The total number of subsets of <math>\{1, 2, 3, 4, 5, 6, 7, 8\}</math> is equal to <math>2^8</math>. The number of sets that are subsets of at least one of <math>\{1, 2, 3, 4, 5\}</math> or <math>\{4, 5, 6, 7, 8\}</math> can be found using complimentary counting. There are <math>2^5</math> subsets of <math>\{1, 2, 3, 4, 5\}</math> and <math>2^5</math> subsets of <math>\{4, 5, 6, 7, 8\}</math>. It is easy to make the mistake of assuming there are <math>2^5+2^5</math> sets that are subsets of at least one of <math>\{1, 2, 3, 4, 5\}</math> or <math>\{4, 5, 6, 7, 8\}</math>, but the <math>2^2</math> subsets of <math>\{4, 5\}</math> are overcounted. There are <math>2^5+2^5-2^2</math> sets that are subsets of at least one of <math>\{1, 2, 3, 4, 5\}</math> or <math>\{4, 5, 6, 7, 8\}</math>, so there are <math>2^8-(2^5+2^5-2^2)</math> subsets of <math>\{1, 2, 3, 4, 5, 6, 7, 8\}</math> that are subsets of neither <math>\{1, 2, 3, 4, 5\}</math> nor <math>\{4, 5, 6, 7, 8\}</math>. <math>2^8-(2^5+2^5-2^2)=\boxed{196}</math>.
 
  
−
<math>\textbf{Problem 2}</math>
+
==Problem 2==
−
Theams <math>T_1</math>, <math>T_2</math>, <math>T_3</math>, and <math>T_4</math> are in the playoffs. In the semifinal matches, <math>T_1</math> plays <math>T_4</math>, and <math>T_2</math> plays <math>T_3</math>. The winners of those two matches will play each other in the final match to determine the champion. When <math>T_i</math> plays <math>T_j</math>, the probability that <math>T_i</math> wins is <math>\frac{i}{i+j}</math>, and the outcomes of all the matches are independent. The probability that <math>T_4</math> will be the champion is <math>\frac{p}{q}</math>, where <math>p</math> and <math>q</math> are relatively prime positive integers. Find <math>p+q</math>.
+
Teams <math>T_1</math>, <math>T_2</math>, <math>T_3</math>, and <math>T_4</math> are in the playoffs. In the semifinal matches, <math>T_1</math> plays <math>T_4</math>, and <math>T_2</math> plays <math>T_3</math>. The winners of those two matches will play each other in the final match to determine the champion. When <math>T_i</math> plays <math>T_j</math>, the probability that <math>T_i</math> wins is <math>\frac{i}{i+j}</math>, and the outcomes of all the matches are independent. The probability that <math>T_4</math> will be the champion is <math>\frac{p}{q}</math>, where <math>p</math> and <math>q</math> are relatively prime positive integers. Find <math>p+q</math>.
  
−
<math>\textbf{Problem 2 Solution}</math>
+
[[2017 AIME II Problems/Problem 2 | Solution]]
−
There are two scenarios in which <math>T_4</math> wins. The first scenario is where <math>T_4</math> beats <math>T_1</math>, <math>T_3</math> beats <math>T_2</math>, and <math>T_4</math> beats <math>T_3</math>, and the second scenario is where <math>T_4</math> beats <math>T_1</math>, <math>T_2</math> beats <math>T_3</math>, and <math>T_4</math> beats <math>T_3</math>. Consider the first scenario. The probability <math>T_4</math> beats <math>T_1</math> is <math>\frac{4}{4+1}</math>, the probability <math>T_3</math> beats <math>T_2</math> is <math>\frac{3}{3+2}</math>, and the probability <math>T_4</math> beats <math>T_3</math> is <math>\frac{4}{4+3}</math>. Therefore the first scenario happens with probability <math>\frac{4}{4+1}\cdot\frac{3}{3+2}\cdot\frac{4}{4+3}</math>. Consider the second scenario. The probability <math>T_4</math> beats <math>T_1</math> is <math>\frac{4}{1+4}</math>, the probability <math>T_2</math> beats <math>T_3</math> is <math>\frac{2}{2+3}</math>, and the probability <math>T_4</math> beats <math>T_2</math> is <math>\frac{4}{4+2}</math>. Therefore the second scenario happens with probability <math>\frac{4}{1+4}\cdot\frac{2}{2+3}\cdot\frac{4}{4+2}</math>. By summing these two probabilities, the probability that <math>T_4</math> wins is <math>\frac{4}{4+1}\cdot\frac{3}{3+2}\cdot\frac{4}{4+3}+\frac{4}{1+4}\cdot\frac{2}{2+3}\cdot\frac{4}{4+2}</math>. Because this expression is equal to <math>\frac{256}{525}</math>, the answer is <math>256+525=\boxed{781}</math>.
 
  
−
<math>\textbf{Problem 3}</math>
+
==Problem 3==
 
A triangle has vertices <math>A(0,0)</math>, <math>B(12,0)</math>, and <math>C(8,10)</math>. The probability that a randomly chosen point inside the triangle is closer to vertex <math>B</math> than to either vertex <math>A</math> or vertex <math>C</math> can be written as <math>\frac{p}{q}</math>, where <math>p</math> and <math>q</math> are relatively prime positive integers. Find <math>p+q</math>.
 
A triangle has vertices <math>A(0,0)</math>, <math>B(12,0)</math>, and <math>C(8,10)</math>. The probability that a randomly chosen point inside the triangle is closer to vertex <math>B</math> than to either vertex <math>A</math> or vertex <math>C</math> can be written as <math>\frac{p}{q}</math>, where <math>p</math> and <math>q</math> are relatively prime positive integers. Find <math>p+q</math>.
  
−
<math>\textbf{Problem 3 Solution}</math>
+
[[2017 AIME II Problems/Problem 3 | Solution]]
−
[asy]
 
−
pair A,B,C,D,X,Z,P;
 
−
A=(0,0); B=(12,0); C=(8,10); X=(10,5); Z=(6,0); P=(6,3.4);
 
−
fill(B--X--P--Z--cycle,lightgray);
 
−
draw(A--B--C--cycle);
 
−
dot(A);
 
−
label("<math>A</math>",A,SW);
 
−
dot(B);
 
−
label("<math>B</math>",B,SE);
 
−
dot(C);
 
−
label("<math>C</math>",C,N);
 
−
draw(X--P,dashed);
 
−
draw(Z--P,dashed);
 
−
dot(X);
 
−
label("<math>X</math>",X,NE);
 
−
dot(Z);
 
−
label("<math>Z</math>",Z,S);
 
−
dot(P);
 
−
label("<math>P</math>",P,NW);
 
−
[/asy]
 
−
A diagram is above. The set of all points closer to point <math>B</math> than to point <math>A</math> lie to the right of the perpendicular bisector of <math>AB</math> (line <math>PZ</math> in the diagram), and the set of all points closer to point <math>B</math> than to point <math>C</math> lie below the perpendicular bisector of <math>BC</math> (line <math>PX</math> in the diagram). Therefore, the set of points inside the triangle that are closer to <math>B</math> than to either vertex <math>A</math> or vertex <math>C</math> is bounded by quadrilateral <math>BXPZ</math>. Because <math>X</math> is the midpoint of <math>BC</math> and <math>Z</math> is the midpoint of <math>AB</math>, <math>X=(10,5)</math> and <math>Z=(6,0)</math>. The coordinates of point <math>P</math> is the solution to the system of equations defined by lines <math>PX</math> and <math>PZ</math>. Using the point-slope form of a linear equation and the fact that the slope of the line perpendicular to a line with slope <math>m</math> is <math>-\frac{1}{m}</math>, the equation for line <math>PX</math> is <math>y=\frac{2}{5}x+1</math> and the equation for line <math>PZ</math> is <math>x=6</math>. The solution of this system is <math>P=\left(6,\frac{17}{5}\right)</math>. Using the shoelace formula on quadrilateral <math>BXPZ</math> and triangle <math>ABC</math>, the area of quadrilateral <math>BXPZ</math> is <math>\frac{109}{5}</math> and the area of triangle <math>ABC</math> is <math>60</math>. Finally, the probability that a randomly chosen point inside the triangle is closer to vertex <math>B</math> than to vertex <math>A</math> or vertex <math>C</math> is the ratio of the area of quadrilateral <math>BXPZ</math> to the area of <math>ABC</math>, which is <math>\frac{\frac{109}{5}}{60}=\frac{109}{300}</math>. The answer is <math>109+300=\boxed{409}</math>.
 
  
−
<math>\textbf{Problem 4}</math>
+
==Problem 4==
 
Find the number of positive integers less than or equal to <math>2017</math> whose base-three representation contains no digit equal to <math>0</math>.
 
Find the number of positive integers less than or equal to <math>2017</math> whose base-three representation contains no digit equal to <math>0</math>.
  
−
<math>\textbf{Problem 4 Solution}</math>
+
[[2017 AIME II Problems/Problem 4 | Solution]]
−
The base-<math>3</math> representation of <math>2017_{10}</math> is <math>2202201_3</math>. Because any <math>7</math>-digit base-<math>3</math> number that starts with <math>22</math> and has no digit equal to <math>0</math> must be greater than <math>2017_{10}</math>, all <math>7</math>-digit numbers that have no digit equal to <math>0</math> must start with <math>21</math> or <math>1</math> in base <math>3</math>. Of the base-<math>3</math> numbers that have no digit equal to <math>0</math>, there are <math>2^5</math> <math>7</math>-digit numbers that start with <math>21</math>, <math>2^6</math> <math>7</math>-digit numbers that start with <math>1</math>, <math>2^6</math> <math>6</math>-digit numbers, <math>2^5</math> <math>5</math>-digit numbers, <math>2^4</math> <math>4</math>-digit numbers, <math>2^3</math> <math>3</math>-digit numbers, <math>2^2</math> <math>2</math>-digit numbers, and <math>2^1</math> <math>1</math>-digit numbers. Summing these up, the answer is <math>2^5+2^6+2^6+2^5+2^4+2^3+2^2+2^1=\boxed{222}</math>.
 
  
−
<math>\textbf{Problem 5}</math>
+
==Problem 5==
 
A set contains four numbers. The six pairwise sums of distinct elements of the set, in no particular order, are <math>189</math>, <math>320</math>, <math>287</math>, <math>234</math>, <math>x</math>, and <math>y</math>. Find the greatest possible value of <math>x+y</math>.
 
A set contains four numbers. The six pairwise sums of distinct elements of the set, in no particular order, are <math>189</math>, <math>320</math>, <math>287</math>, <math>234</math>, <math>x</math>, and <math>y</math>. Find the greatest possible value of <math>x+y</math>.
  
−
<math>\textbf{Problem 5 Solution}</math>
+
[[2017 AIME II Problems/Problem 5 | Solution]]
−
Let these four numbers be <math>a</math>, <math>b</math>, <math>c</math>, and <math>d</math>, where <math>a>b>c>d</math>. <math>x+y</math> needs to be maximized, so let <math>x=a+b</math> and <math>y=a+c</math> because these are the two largest pairwise sums. Now <math>x+y=2a+b+c</math> needs to be maximized. Notice <math>2a+b+c=3(a+b+c+d)-(a+2b+2c+3d)=3((a+c)+(b+d))-((a+d)+(b+c)+(b+d)+(c+d))</math>. No matter how the numbers <math>189</math>, <math>320</math>, <math>287</math>, and <math>234</math> are assigned to the values <math>a+d</math>, <math>b+c</math>, <math>b+d</math>, and <math>c+d</math>, the sum <math>(a+d)+(b+c)+(b+d)+(c+d)</math> will always be <math>189+320+287+234</math>. Therefore we need to maximize <math>3((a+c)+(b+d))-(189+320+287+234)</math>. The maximum value of <math>(a+c)+(b+d)</math> is achieved when we let <math>a+c</math> and <math>b+d</math> be <math>320</math> and <math>287</math> because these are the two largest pairwise sums besides <math>x</math> and <math>y</math>. Therefore, the maximum possible value of <math>x+y=3(320+287)-(189+320+287+234)=\boxed{791}</math>.
 
  
−
<math>\textbf{Problem 6}</math>
+
==Problem 6==
 
Find the sum of all positive integers <math>n</math> such that <math>\sqrt{n^2+85n+2017}</math> is an integer.
 
Find the sum of all positive integers <math>n</math> such that <math>\sqrt{n^2+85n+2017}</math> is an integer.
  
−
<math>\textbf{Problem 6 Solution}</math>
+
[[2017 AIME II Problems/Problem 6 | Solution]]
−
Manipulating the given expression, <math>\sqrt{n^2+85n+2017}=\frac{1}{2}\sqrt{4n^2+340n+8068}=\frac{1}{2}\sqrt{(2n+85)^2+843}</math>. The expression under the radical must be an square number for the entire expression to be an integer, so <math>(2n+85)^2+843=s^2</math>. Rearranging, <math>s^2-(2n+85)^2=843</math>. By difference of squares, <math>(s-(2n+85))(s+(2n+85))=1\times843=3\times281</math>. It is easy to check that those are all the factor pairs of 843. Considering each factor pair separately, <math>2n+85</math> is found to be <math>421</math> and <math>139</math>. The two values of <math>n</math> that satisfy one of the equations are <math>168</math> and <math>27</math>. Summing these together, the answer is <math>168+27=\boxed{195}</math>.
 
  
−
<math>\textbf{Problem 7}</math>
+
==Problem 7==
 
Find the number of integer values of <math>k</math> in the closed interval <math>[-500,500]</math> for which the equation <math>\log(kx)=2\log(x+2)</math> has exactly one real solution.
 
Find the number of integer values of <math>k</math> in the closed interval <math>[-500,500]</math> for which the equation <math>\log(kx)=2\log(x+2)</math> has exactly one real solution.
  
−
<math>\textbf{Problem 7 Solution}</math>
+
[[2017 AIME II Problems/Problem 7 | Solution]]
−
 
 
−
<math>\boxed{501}</math>
 
  
−
<math>\textbf{Problem 8}</math>
+
==Problem 8==
 
Find the number of positive integers <math>n</math> less than <math>2017</math> such that <cmath>1+n+\frac{n^2}{2!}+\frac{n^3}{3!}+\frac{n^4}{4!}+\frac{n^5}{5!}+\frac{n^6}{6!}</cmath> is an integer.
 
Find the number of positive integers <math>n</math> less than <math>2017</math> such that <cmath>1+n+\frac{n^2}{2!}+\frac{n^3}{3!}+\frac{n^4}{4!}+\frac{n^5}{5!}+\frac{n^6}{6!}</cmath> is an integer.
  
−
<math>\textbf{Problem 8 Solution}</math>
+
[[2017 AIME II Problems/Problem 8 | Solution]]
−
<math>\boxed{134}</math>
 
  
−
<math>\textbf{Problem 9}</math>
+
==Problem 9==
−
A special deck of cards contains <math>49</math> cards, each labeled with a number from <math>1</math> to <math>7</math> and colored with one of seven solors. 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 cardf with each number, the probability that Sharon can discard one of her cards and <math>\textit{still}</math> have at least one card of each color and at least one card with each number if <math>\frac{p}{q}</math>, where <math>p</math> and <math>q</math> are relatively prime positive integers. Find <math>p+q</math>.
+
A special deck of cards contains <math>49</math> cards, each labeled with a number from <math>1</math> to <math>7</math> 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 <math>\textit{still}</math> have at least one card of each color and at least one card with each number is <math>\frac{p}{q}</math>, where <math>p</math> and <math>q</math> are relatively prime positive integers. Find <math>p+q</math>.
  
−
<math>\textbf{Problem 9 Solution}</math>
+
[[2017 AIME II Problems/Problem 9 | Solution]]
−
<math>\boxed{013}</math>
 
  
−
<math>\textbf{Problem 10}</math>
+
==Problem 10==
 
Rectangle <math>ABCD</math> has side lengths <math>AB=84</math> and <math>AD=42</math>. Point <math>M</math> is the midpoint of <math>\overline{AD}</math>, point <math>N</math> is the trisection point of <math>\overline{AB}</math> closer to <math>A</math>, and point <math>O</math> is the intersection of <math>\overline{CM}</math> and <math>\overline{DN}</math>. Point <math>P</math> lies on the quadrilateral <math>BCON</math>, and <math>\overline{BP}</math> bisects the area of <math>BCON</math>. Find the area of <math>\triangle CDP</math>.
 
Rectangle <math>ABCD</math> has side lengths <math>AB=84</math> and <math>AD=42</math>. Point <math>M</math> is the midpoint of <math>\overline{AD}</math>, point <math>N</math> is the trisection point of <math>\overline{AB}</math> closer to <math>A</math>, and point <math>O</math> is the intersection of <math>\overline{CM}</math> and <math>\overline{DN}</math>. Point <math>P</math> lies on the quadrilateral <math>BCON</math>, and <math>\overline{BP}</math> bisects the area of <math>BCON</math>. Find the area of <math>\triangle CDP</math>.
  
−
<math>\textbf{Problem 10 Solution}</math>
+
[[2017 AIME II Problems/Problem 10 | Solution]]
−
<math>\boxed{546}</math>
+
 
 +
==Problem 11==
 +
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).
  
−
<math>\textbf{Problem 11}</math>
+
[[2017 AIME II Problems/Problem 11 | Solution]]
−
Five towns are connected by a system of raods. 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).
 
  
−
<math>\textbf{Problem 11 Solution}</math>
+
==Problem 12==
−
<math>\boxed{544}</math>
+
Circle <math>C_0</math> has radius <math>1</math>, and the point <math>A_0</math> is a point on the circle. Circle <math>C_1</math> has radius <math>r<1</math> and is internally tangent to <math>C_0</math> at point <math>A_0</math>. Point <math>A_1</math> lies on circle <math>C_1</math> so that <math>A_1</math> is located <math>90^{\circ}</math> counterclockwise from <math>A_0</math> on <math>C_1</math>. Circle <math>C_2</math> has radius <math>r^2</math> and is internally tangent to <math>C_1</math> at point <math>A_1</math>. In this way a sequence of circles <math>C_1,C_2,C_3,\ldots</math> and a sequence of points on the circles <math>A_1,A_2,A_3,\ldots</math> are constructed, where circle <math>C_n</math> has radius <math>r^n</math> and is internally tangent to circle <math>C_{n-1}</math> at point <math>A_{n-1}</math>, and point <math>A_n</math> lies on <math>C_n</math> <math>90^{\circ}</math> counterclockwise from point <math>A_{n-1}</math>, as shown in the figure below. There is one point <math>B</math> inside all of these circles. When <math>r = \frac{11}{60}</math>, the distance from the center <math>C_0</math> to <math>B</math> is <math>\frac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
  
−
<math>\textbf{Problem 12}</math>
+
<asy>
−
Circle <math>C_0</math> has radius <math>1</math>, and the point <math>A_0</math> is a point on the circle. Circle <math>C_1</math> has radius <math>r<1</math> and is internally tangent to <math>C_0</math> at point <math>A_0</math>. Point <math>A_1</math> lies on circle <math>C_1</math> so that <math>A_1</math> is located <math>90^{\circ}</math> counterclockwise from <math>A_0</math> on <math>C_1</math>. Circle <math>C_2</math> has radius <math>r^2</math> and is internally tangent to <math>C_1</math> at point <math>A_1</math>. In this way a sequence of circles <math>C_1,C_2,C_3,\cdots</math> and a sequence of points on the circles <math>A_1,A_2,A_3,\cdots</math> are constructed, where circle <math>C_n</math> has radius <math>r^n</math> and is internally tangent to circle <math>C_{n-1}</math> at point <math>A_{n-1}</math>, and point <math>A_n</math> lies on <math>C_n</math> <math>90^{\circ}</math> counterclockwise from point <math>A_{n-1}</math>, as shown in the figure below. There is one point <math>B</math> inside all of these circles. When <math>r = \frac{11}{60}</math>, the distance from the center <math>C_0</math> to <math>B</math> is <math>\frac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
 
−
[asy]
 
 
draw(Circle((0,0),125));
 
draw(Circle((0,0),125));
 
draw(Circle((25,0),100));
 
draw(Circle((25,0),100));
Line 94: Line 65:
 
draw(Circle((9,20),64));
 
draw(Circle((9,20),64));
 
dot((125,0));
 
dot((125,0));
−
label("<math>A_0</math>",(125,0),E);
+
label("$A_0$",(125,0),E);
 
dot((25,100));
 
dot((25,100));
−
label("<math>A_1</math>",(25,100),SE);
+
label("$A_1$",(25,100),SE);
 
dot((-55,20));
 
dot((-55,20));
−
label("<math>A_2</math>",(-55,20),E);
+
label("$A_2$",(-55,20),E);
−
[/asy]
+
</asy>
  
−
<math>\textbf{Problem 12 Solution}</math>
+
[[2017 AIME II Problems/Problem 12 | Solution]]
−
<math>\boxed{110}</math>
 
  
−
<math>\textbf{Problem 13}</math>
+
==Problem 13==
−
For each integer <math>n\geq3</math>, let <math>f(n)</math> be the number of <math>3</math>-element subsets of the vertices of the regular <math>n</math>-gon that are the vertices of an isosceles triangle (including equilateral triangles). Find the sum of all values of <math>n</math> such that <math>f(n+1)=f(n)+78</math>.
+
For each integer <math>n\geq3</math>, let <math>f(n)</math> be the number of <math>3</math>-element subsets of the vertices of a regular <math>n</math>-gon that are the vertices of an isosceles triangle (including equilateral triangles). Find the sum of all values of <math>n</math> such that <math>f(n+1)=f(n)+78</math>.
  
−
<math>\textbf{Problem 13 Solution}</math>
+
[[2017 AIME II Problems/Problem 13 | Solution]]
−
<math>\boxed{245}</math>
 
  
−
<math>\textbf{Problem 14}</math>
+
==Problem 14==
 
A <math>10\times10\times10</math> grid of points consists of all points in space of the form <math>(i,j,k)</math>, where <math>i</math>, <math>j</math>, and <math>k</math> are integers between <math>1</math> and <math>10</math>, inclusive. Find the number of different lines that contain exactly <math>8</math> of these points.
 
A <math>10\times10\times10</math> grid of points consists of all points in space of the form <math>(i,j,k)</math>, where <math>i</math>, <math>j</math>, and <math>k</math> are integers between <math>1</math> and <math>10</math>, inclusive. Find the number of different lines that contain exactly <math>8</math> of these points.
  
−
<math>\textbf{Problem 14 Solution}</math>
+
[[2017 AIME II Problems/Problem 14 | Solution]]
  
−
<math>\textbf{Problem 15}</math>
+
==Problem 15==
 
Tetrahedron <math>ABCD</math> has <math>AD=BC=28</math>, <math>AC=BD=44</math>, and <math>AB=CD=52</math>. For any point <math>X</math> in space, define <math>f(X)=AX+BX+CX+DX</math>. The least possible value of <math>f(X)</math> can be expressed as <math>m\sqrt{n}</math>, where <math>m</math> and <math>n</math> are positive integers, and <math>n</math> is not divisible by the square of any prime. Find <math>m+n</math>.
 
Tetrahedron <math>ABCD</math> has <math>AD=BC=28</math>, <math>AC=BD=44</math>, and <math>AB=CD=52</math>. For any point <math>X</math> in space, define <math>f(X)=AX+BX+CX+DX</math>. The least possible value of <math>f(X)</math> can be expressed as <math>m\sqrt{n}</math>, where <math>m</math> and <math>n</math> are positive integers, and <math>n</math> is not divisible by the square of any prime. Find <math>m+n</math>.
  
−
<math>\textbf{Problem 15 Solution}</math>
+
[[2017 AIME II Problems/Problem 15 | Solution]]
 +
 
 +
{{AIME box|year=2017|n=II|before=[[2017 AIME I Problems]]|after=[[2018 AIME I Problems]]}}
 +
{{MAA Notice}}

Latest revision as of 15:02, 8 September 2020

2017 AIME II (Answer Key)
Printable version | AoPS Contest Collections • PDF

Instructions

  1. This is a 15-question, 3-hour examination. All answers are integers ranging from $000$ to $999$, inclusive. Your score will be the number of correct answers; i.e., there is neither partial credit nor a penalty for wrong answers.
  2. No aids other than scratch paper, graph paper, ruler, compass, and protractor are permitted. In particular, calculators and computers are not permitted.
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15

Problem 1

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\}$.

Solution

Problem 2

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 $\frac{i}{i+j}$, and the outcomes of all the matches are independent. The probability that $T_4$ will be the champion is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Solution

Problem 3

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 $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Solution

Problem 4

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

Solution

Problem 5

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$.

Solution

Problem 6

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

Solution

Problem 7

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

Solution

Problem 8

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

Solution

Problem 9

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 $\textit{still}$ have at least one card of each color and at least one card with each number is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Solution

Problem 10

Rectangle $ABCD$ has side lengths $AB=84$ and $AD=42$. Point $M$ is the midpoint of $\overline{AD}$, point $N$ is the trisection point of $\overline{AB}$ closer to $A$, and point $O$ is the intersection of $\overline{CM}$ and $\overline{DN}$. Point $P$ lies on the quadrilateral $BCON$, and $\overline{BP}$ bisects the area of $BCON$. Find the area of $\triangle CDP$.

Solution

Problem 11

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).

Solution

Problem 12

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,\ldots$ and a sequence of points on the circles $A_1,A_2,A_3,\ldots$ 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 = \frac{11}{60}$, the distance from the center $C_0$ to $B$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

[asy] draw(Circle((0,0),125)); draw(Circle((25,0),100)); draw(Circle((25,20),80)); draw(Circle((9,20),64)); dot((125,0)); label("$A_0$",(125,0),E); dot((25,100)); label("$A_1$",(25,100),SE); dot((-55,20)); label("$A_2$",(-55,20),E); [/asy]

Solution

Problem 13

For each integer $n\geq3$, 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$.

Solution

Problem 14

A $10\times10\times10$ 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.

Solution

Problem 15

Tetrahedron $ABCD$ has $AD=BC=28$, $AC=BD=44$, and $AB=CD=52$. For any point $X$ in space, define $f(X)=AX+BX+CX+DX$. 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$.

Solution

2017 AIME II (Problems • Answer Key • Resources)
Preceded by
2017 AIME I Problems 		Followed by
2018 AIME I Problems
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2017_AIME_II_Problems&oldid=133363"