Difference between revisions of "2018 AIME I Problems"
m (→Problem 10) |
(→Problem 15) |
||
(15 intermediate revisions by 10 users not shown) | |||
Line 12: | Line 12: | ||
==Problem 3== | ==Problem 3== | ||
− | Kathy has <math>5</math> red cards and <math>5</math> green cards. She shuffles the <math>10</math> cards and lays out <math>5</math> of the cards in a row in a random order. She will be happy if and only if all the red cards laid out are adjacent and all the green cards laid out are adjacent. For example, card orders | + | Kathy has <math>5</math> red cards and <math>5</math> green cards. She shuffles the <math>10</math> cards and lays out <math>5</math> of the cards in a row in a random order. She will be happy if and only if all the red cards laid out are adjacent and all the green cards laid out are adjacent. For example, card orders RRGGG, GGGGR, or RRRRR will make Kathy happy, but RRRGR will not. The probability that Kathy will be happy is <math> \frac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m + n</math>. |
[[2018 AIME I Problems/Problem 3 | Solution]] | [[2018 AIME I Problems/Problem 3 | Solution]] | ||
==Problem 4== | ==Problem 4== | ||
− | In <math>\triangle ABC, AB = AC = 10</math> and <math>BC = 12</math>. Point <math>D</math> lies strictly between <math>A</math> and <math>B</math> on <math>\overline{AB}</math> and point <math>E</math> lies strictly between <math>A</math> and <math>C</math> on <math>\overline{AC}</math> | + | In <math>\triangle ABC, AB = AC = 10</math> and <math>BC = 12</math>. Point <math>D</math> lies strictly between <math>A</math> and <math>B</math> on <math>\overline{AB}</math> and point <math>E</math> lies strictly between <math>A</math> and <math>C</math> on <math>\overline{AC}</math> so that <math>AD = DE = EC</math>. Then <math>AD</math> can be expressed in the form <math>\dfrac{p}{q}</math>, where <math>p</math> and <math>q</math> are relatively prime positive integers. Find <math>p+q</math>. |
[[2018 AIME I Problems/Problem 4 | Solution]] | [[2018 AIME I Problems/Problem 4 | Solution]] | ||
Line 50: | Line 50: | ||
==Problem 10== | ==Problem 10== | ||
− | The wheel shown below consists of two circles and five spokes, with a label at each point where a spoke meets a circle. A bug walks along the wheel, starting at point <math>A</math>. At every step of the process, the bug walks from one labeled point to an adjacent labeled point. Along the inner circle the bug only walks in a counterclockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path <math>AJABCHCHIJA</math>, which has <math>10</math> steps. Let <math>n</math> be the number of paths with <math>15</math> steps that begin and end at point <math>A</math> | + | The wheel shown below consists of two circles and five spokes, with a label at each point where a spoke meets a circle. A bug walks along the wheel, starting at point <math>A</math>. At every step of the process, the bug walks from one labeled point to an adjacent labeled point. Along the inner circle the bug only walks in a counterclockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path <math>AJABCHCHIJA</math>, which has <math>10</math> steps. Let <math>n</math> be the number of paths with <math>15</math> steps that begin and end at point <math>A.</math> Find the remainder when <math>n</math> is divided by <math>1000</math>. |
− | < | + | <asy> |
size(6cm); | size(6cm); | ||
Line 61: | Line 61: | ||
} | } | ||
− | dot(1 * dir( 90), | + | dot(1 * dir( 90), linewidth(5)); |
− | dot(1 * dir(162), | + | dot(1 * dir(162), linewidth(5)); |
− | dot(1 * dir(234), | + | dot(1 * dir(234), linewidth(5)); |
− | dot(1 * dir(306), | + | dot(1 * dir(306), linewidth(5)); |
− | dot(1 * dir(378), | + | dot(1 * dir(378), linewidth(5)); |
− | dot(2 * dir(378), | + | dot(2 * dir(378), linewidth(5)); |
− | dot(2 * dir(306), | + | dot(2 * dir(306), linewidth(5)); |
− | dot(2 * dir(234), | + | dot(2 * dir(234), linewidth(5)); |
− | dot(2 * dir(162), | + | dot(2 * dir(162), linewidth(5)); |
− | dot(2 * dir( 90), | + | dot(2 * dir( 90), linewidth(5)); |
− | label(" | + | label("$A$", 1 * dir( 90), -dir( 90)); |
− | label(" | + | label("$B$", 1 * dir(162), -dir(162)); |
− | label(" | + | label("$C$", 1 * dir(234), -dir(234)); |
− | label(" | + | label("$D$", 1 * dir(306), -dir(306)); |
− | label(" | + | label("$E$", 1 * dir(378), -dir(378)); |
− | label(" | + | label("$F$", 2 * dir(378), dir(378)); |
− | label(" | + | label("$G$", 2 * dir(306), dir(306)); |
− | label(" | + | label("$H$", 2 * dir(234), dir(234)); |
− | label(" | + | label("$I$", 2 * dir(162), dir(162)); |
− | label(" | + | label("$J$", 2 * dir( 90), dir( 90)); |
− | + | </asy> | |
[[2018 AIME I Problems/Problem 10 | Solution]] | [[2018 AIME I Problems/Problem 10 | Solution]] | ||
Line 103: | Line 103: | ||
==Problem 14== | ==Problem 14== | ||
− | Let <math>SP_1P_2P_3EP_4P_5</math> be a heptagon. A frog starts jumping at vertex <math>S</math>. From any vertex of the heptagon except <math>E</math>, the frog may jump to either | + | Let <math>SP_1P_2P_3EP_4P_5</math> be a heptagon. A frog starts jumping at vertex <math>S</math>. From any vertex of the heptagon except <math>E</math>, the frog may jump to either of the two adjacent vertices. When it reaches vertex <math>E</math>, the frog stops and stays there. Find the number of distinct sequences of jumps of no more than <math>12</math> jumps that end at <math>E</math>. |
[[2018 AIME I Problems/Problem 14 | Solution]] | [[2018 AIME I Problems/Problem 14 | Solution]] | ||
==Problem 15== | ==Problem 15== | ||
− | David found four sticks of different lengths that can be used to form three non-congruent convex cyclic quadrilaterals, <math>A,\text{ }B,\text{ }C</math>, which can each be inscribed in a circle with radius <math>1</math>. Let <math>\varphi_A</math> denote the measure of the acute angle made by the diagonals of quadrilateral | + | David found four sticks of different lengths that can be used to form three non-congruent convex cyclic quadrilaterals, <math>A,\text{ }B,\text{ }C</math>, which can each be inscribed in a circle with radius <math>1</math>. Let <math>\varphi_A</math> denote the measure of the acute angle made by the diagonals of quadrilateral <math>A</math>, and define <math>\varphi_B</math> and <math>\varphi_C</math> similarly. Suppose that <math>\sin\varphi_A=\frac{2}{3}</math>, <math>\sin\varphi_B=\frac{3}{5}</math>, and <math>\sin\varphi_C=\frac{6}{7}</math>. All three quadrilaterals have the same area <math>K</math>, which can be written in the form <math>\dfrac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>. |
[[2018 AIME I Problems/Problem 15 | Solution]] | [[2018 AIME I Problems/Problem 15 | Solution]] | ||
− | {{AIME box|year=2018|n=I|before=[[2017 AIME II]]|after=[[2018 AIME II]]}} | + | {{AIME box|year=2018|n=I|before=[[2017 AIME II Problems]]|after=[[2018 AIME II Problems]]}} |
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 11:21, 13 March 2020
2018 AIME I (Answer Key) | AoPS Contest Collections | ||
Instructions
| ||
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |
Contents
Problem 1
Let be the number of ordered pairs of integers with and such that the polynomial can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when is divided by .
Problem 2
The number can be written in base as , can be written in base as , and can be written in base as , where . Find the base- representation of .
Problem 3
Kathy has red cards and green cards. She shuffles the cards and lays out of the cards in a row in a random order. She will be happy if and only if all the red cards laid out are adjacent and all the green cards laid out are adjacent. For example, card orders RRGGG, GGGGR, or RRRRR will make Kathy happy, but RRRGR will not. The probability that Kathy will be happy is , where and are relatively prime positive integers. Find .
Problem 4
In and . Point lies strictly between and on and point lies strictly between and on so that . Then can be expressed in the form , where and are relatively prime positive integers. Find .
Problem 5
For each ordered pair of real numbers satisfying there is a real number such that Find the product of all possible values of .
Problem 6
Let be the number of complex numbers with the properties that and is a real number. Find the remainder when is divided by .
Problem 7
A right hexagonal prism has height . The bases are regular hexagons with side length . Any of the vertices determine a triangle. Find the number of these triangles that are isosceles (including equilateral triangles).
Problem 8
Let be an equiangular hexagon such that , and . Denote the diameter of the largest circle that fits inside the hexagon. Find .
Problem 9
Find the number of four-element subsets of with the property that two distinct elements of a subset have a sum of , and two distinct elements of a subset have a sum of . For example, and are two such subsets.
Problem 10
The wheel shown below consists of two circles and five spokes, with a label at each point where a spoke meets a circle. A bug walks along the wheel, starting at point . At every step of the process, the bug walks from one labeled point to an adjacent labeled point. Along the inner circle the bug only walks in a counterclockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path , which has steps. Let be the number of paths with steps that begin and end at point Find the remainder when is divided by .
Problem 11
Find the least positive integer such that when is written in base , its two right-most digits in base are .
Problem 12
For every subset of , let be the sum of the elements of , with defined to be . If is chosen at random among all subsets of , the probability that is divisible by is , where and are relatively prime positive integers. Find .
Problem 13
Let have side lengths , , and . Point lies in the interior of , and points and are the incenters of and , respectively. Find the minimum possible area of as varies along .
Problem 14
Let be a heptagon. A frog starts jumping at vertex . From any vertex of the heptagon except , the frog may jump to either of the two adjacent vertices. When it reaches vertex , the frog stops and stays there. Find the number of distinct sequences of jumps of no more than jumps that end at .
Problem 15
David found four sticks of different lengths that can be used to form three non-congruent convex cyclic quadrilaterals, , which can each be inscribed in a circle with radius . Let denote the measure of the acute angle made by the diagonals of quadrilateral , and define and similarly. Suppose that , , and . All three quadrilaterals have the same area , which can be written in the form , where and are relatively prime positive integers. Find .
2018 AIME I (Problems • Answer Key • Resources) | ||
Preceded by 2017 AIME II Problems |
Followed by 2018 AIME II 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.