Difference between revisions of "2017 AIME II Problems"
(→Problem 12) |
(Undo revision 131907 by Readyplayerone (talk)) (Tag: Undo) |
||
(11 intermediate revisions by 7 users not shown) | |||
Line 42: | Line 42: | ||
==Problem 9== | ==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 | + | 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>. |
[[2017 AIME II Problems/Problem 9 | Solution]] | [[2017 AIME II Problems/Problem 9 | Solution]] | ||
Line 59: | Line 59: | ||
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>. | 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>. | ||
− | < | + | <asy> |
− | |||
− | |||
draw(Circle((0,0),125)); | draw(Circle((0,0),125)); | ||
draw(Circle((25,0),100)); | draw(Circle((25,0),100)); | ||
Line 67: | Line 65: | ||
draw(Circle((9,20),64)); | draw(Circle((9,20),64)); | ||
dot((125,0)); | dot((125,0)); | ||
− | label(" | + | label("$A_0$",(125,0),E); |
dot((25,100)); | dot((25,100)); | ||
− | label(" | + | label("$A_1$",(25,100),SE); |
dot((-55,20)); | dot((-55,20)); | ||
− | label(" | + | label("$A_2$",(-55,20),E); |
− | + | </asy> | |
− | |||
[[2017 AIME II Problems/Problem 12 | Solution]] | [[2017 AIME II Problems/Problem 12 | Solution]] | ||
Line 91: | Line 88: | ||
[[2017 AIME II Problems/Problem 15 | Solution]] | [[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) | AoPS Contest Collections • PDF | ||
Instructions
| ||
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |
Contents
Problem 1
Find the number of subsets of that are subsets of neither
nor
.
Problem 2
Teams ,
,
, and
are in the playoffs. In the semifinal matches,
plays
, and
plays
. The winners of those two matches will play each other in the final match to determine the champion. When
plays
, the probability that
wins is
, and the outcomes of all the matches are independent. The probability that
will be the champion is
, where
and
are relatively prime positive integers. Find
.
Problem 3
A triangle has vertices ,
, and
. The probability that a randomly chosen point inside the triangle is closer to vertex
than to either vertex
or vertex
can be written as
, where
and
are relatively prime positive integers. Find
.
Problem 4
Find the number of positive integers less than or equal to whose base-three representation contains no digit equal to
.
Problem 5
A set contains four numbers. The six pairwise sums of distinct elements of the set, in no particular order, are ,
,
,
,
, and
. Find the greatest possible value of
.
Problem 6
Find the sum of all positive integers such that
is an integer.
Problem 7
Find the number of integer values of in the closed interval
for which the equation
has exactly one real solution.
Problem 8
Find the number of positive integers less than
such that
is an integer.
Problem 9
A special deck of cards contains cards, each labeled with a number from
to
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
have at least one card of each color and at least one card with each number is
, where
and
are relatively prime positive integers. Find
.
Problem 10
Rectangle has side lengths
and
. Point
is the midpoint of
, point
is the trisection point of
closer to
, and point
is the intersection of
and
. Point
lies on the quadrilateral
, and
bisects the area of
. Find the area of
.
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).
Problem 12
Circle has radius
, and the point
is a point on the circle. Circle
has radius
and is internally tangent to
at point
. Point
lies on circle
so that
is located
counterclockwise from
on
. Circle
has radius
and is internally tangent to
at point
. In this way a sequence of circles
and a sequence of points on the circles
are constructed, where circle
has radius
and is internally tangent to circle
at point
, and point
lies on
counterclockwise from point
, as shown in the figure below. There is one point
inside all of these circles. When
, the distance from the center
to
is
, where
and
are relatively prime positive integers. Find
.
Problem 13
For each integer , let
be the number of
-element subsets of the vertices of a regular
-gon that are the vertices of an isosceles triangle (including equilateral triangles). Find the sum of all values of
such that
.
Problem 14
A grid of points consists of all points in space of the form
, where
,
, and
are integers between
and
, inclusive. Find the number of different lines that contain exactly
of these points.
Problem 15
Tetrahedron has
,
, and
. For any point
in space, define
. The least possible value of
can be expressed as
, where
and
are positive integers, and
is not divisible by the square of any prime. Find
.
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.