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 "2018 AIME I Problems"

(→‎Problem 12)
m (Remove unnecessary newline)
 
(41 intermediate revisions by 17 users not shown)
Line 7: Line 7:
  
 
==Problem 2==
 
==Problem 2==
−
 
+
The number <math>n</math> can be written in base <math>14</math> as <math>\underline{a}\text{ }\underline{b}\text{ }\underline{c}</math>, can be written in base <math>15</math> as <math>\underline{a}\text{ }\underline{c}\text{ }\underline{b}</math>, and can be written in base <math>6</math> as <math>\underline{a}\text{ }\underline{c}\text{ }\underline{a}\text{ }\underline{c}\text{ }</math>, where <math>a > 0</math>. Find the base-<math>10</math> representation of <math>n</math>.
  
 
[[2018 AIME I Problems/Problem 2 | Solution]]
 
[[2018 AIME I Problems/Problem 2 | Solution]]
  
 
==Problem 3==
 
==Problem 3==
−
Kathy has \(5\) red cards and \(5\) green cards. She shuffles the \(10\) cards and lays out \(5\) 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 \( \dfrac{m}{n}\), where \(m\) and \(n\) are relatively prime positive integers. Find \(m + n\).
+
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> 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]]
  
 
==Problem 5==
 
==Problem 5==
−
 
+
For each ordered pair of real numbers <math>(x,y)</math> satisfying
 +
<cmath> \log_2(2x+y) = \log_4(x^2+xy+7y^2) </cmath>there is a real number <math>K</math> such that
 +
<cmath> \log_3(3x+y) = \log_9(3x^2+4xy+Ky^2). </cmath>Find the product of all possible values of <math>K</math>.
  
 
[[2018 AIME I Problems/Problem 5 | Solution]]
 
[[2018 AIME I Problems/Problem 5 | Solution]]
  
 
==Problem 6==
 
==Problem 6==
−
 
+
Let <math>N</math> be the number of complex numbers <math>z</math> with the properties that <math>|z|=1</math> and <math>z^{6!}-z^{5!}</math> is a real number. Find the remainder when <math>N</math> is divided by <math>1000</math>.
  
 
[[2018 AIME I Problems/Problem 6 | Solution]]
 
[[2018 AIME I Problems/Problem 6 | Solution]]
  
 
==Problem 7==
 
==Problem 7==
−
 
+
A right hexagonal prism has height <math>2</math>. The bases are regular hexagons with side length <math>1</math>. Any <math>3</math> of the <math>12</math> vertices determine a triangle. Find the number of these triangles that are isosceles (including equilateral triangles).
  
 
[[2018 AIME I Problems/Problem 7 | Solution]]
 
[[2018 AIME I Problems/Problem 7 | Solution]]
  
 
==Problem 8==
 
==Problem 8==
−
 
+
Let <math>ABCDEF</math> be an equiangular hexagon such that <math>AB=6, BC=8, CD=10</math>, and <math>DE=12</math>. Denote <math>d</math> the diameter of the largest circle that fits inside the hexagon. Find <math>d^2</math>.
  
 
[[2018 AIME I Problems/Problem 8 | Solution]]
 
[[2018 AIME I Problems/Problem 8 | Solution]]
Line 43: Line 45:
 
==Problem 9==
 
==Problem 9==
 
Find the number of four-element subsets of <math>\{1,2,3,4,\dots, 20\}</math> with the property that two distinct elements of a subset have a sum of <math>16</math>, and two distinct elements of a subset have a sum of <math>24</math>. For example, <math>\{3,5,13,19\}</math> and <math>\{6,10,20,18\}</math> are two such subsets.
 
Find the number of four-element subsets of <math>\{1,2,3,4,\dots, 20\}</math> with the property that two distinct elements of a subset have a sum of <math>16</math>, and two distinct elements of a subset have a sum of <math>24</math>. For example, <math>\{3,5,13,19\}</math> and <math>\{6,10,20,18\}</math> are two such subsets.
−
 
  
 
[[2018 AIME I Problems/Problem 9 | Solution]]
 
[[2018 AIME I Problems/Problem 9 | Solution]]
  
 
==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 \(A\). 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 circular clockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path \(AJABCHCHIJA\), which has \(10\) steps. Let \(n\) be the number of paths with \(15\) steps that begin and end at point \(A\). Find the remainder when \(n\) is divided by \(1000\).
+
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);
 +
 
 +
draw(unitcircle);
 +
draw(scale(2) * unitcircle);
 +
for(int d = 90; d < 360 + 90; d += 72){
 +
draw(2 * dir(d) -- dir(d));
 +
}
 +
 
 +
dot(1 * dir( 90), linewidth(5));
 +
dot(1 * dir(162), linewidth(5));
 +
dot(1 * dir(234), linewidth(5));
 +
dot(1 * dir(306), linewidth(5));
 +
dot(1 * dir(378), linewidth(5));
 +
dot(2 * dir(378), linewidth(5));
 +
dot(2 * dir(306), linewidth(5));
 +
dot(2 * dir(234), linewidth(5));
 +
dot(2 * dir(162), linewidth(5));
 +
dot(2 * dir( 90), linewidth(5));
  
 +
label("$A$", 1 * dir( 90), -dir( 90));
 +
label("$B$", 1 * dir(162), -dir(162));
 +
label("$C$", 1 * dir(234), -dir(234));
 +
label("$D$", 1 * dir(306), -dir(306));
 +
label("$E$", 1 * dir(378), -dir(378));
 +
label("$F$", 2 * dir(378), dir(378));
 +
label("$G$", 2 * dir(306), dir(306));
 +
label("$H$", 2 * dir(234), dir(234));
 +
label("$I$", 2 * dir(162), dir(162));
 +
label("$J$", 2 * dir( 90), dir( 90));
 +
</asy>
  
 
[[2018 AIME I Problems/Problem 10 | Solution]]
 
[[2018 AIME I Problems/Problem 10 | Solution]]
Line 55: Line 87:
 
==Problem 11==
 
==Problem 11==
 
Find the least positive integer <math>n</math> such that when <math>3^n</math> is written in base <math>143</math>, its two right-most digits in base <math>143</math> are <math>01</math>.
 
Find the least positive integer <math>n</math> such that when <math>3^n</math> is written in base <math>143</math>, its two right-most digits in base <math>143</math> are <math>01</math>.
−
 
  
 
[[2018 AIME I Problems/Problem 11 | Solution]]
 
[[2018 AIME I Problems/Problem 11 | Solution]]
Line 65: Line 96:
  
 
==Problem 13==
 
==Problem 13==
−
 
+
Let <math>\triangle ABC</math> have side lengths <math>AB=30</math>, <math>BC=32</math>, and <math>AC=34</math>. Point <math>X</math> lies in the interior of <math>\overline{BC}</math>, and points <math>I_1</math> and <math>I_2</math> are the incenters of <math>\triangle ABX</math> and <math>\triangle ACX</math>, respectively. Find the minimum possible area of <math>\triangle AI_1I_2</math> as <math>X</math> varies along <math>\overline{BC}</math>.
  
 
[[2018 AIME I Problems/Problem 13 | Solution]]
 
[[2018 AIME I Problems/Problem 13 | Solution]]
  
 
==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 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 <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 13:35, 9 August 2021

2018 AIME I (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

Let $S$ be the number of ordered pairs of integers $(a,b)$ with $1 \leq a \leq 100$ and $b \geq 0$ such that the polynomial $x^2+ax+b$ can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when $S$ is divided by $1000$.

Solution

Problem 2

The number $n$ can be written in base $14$ as $\underline{a}\text{ }\underline{b}\text{ }\underline{c}$, can be written in base $15$ as $\underline{a}\text{ }\underline{c}\text{ }\underline{b}$, and can be written in base $6$ as $\underline{a}\text{ }\underline{c}\text{ }\underline{a}\text{ }\underline{c}\text{ }$, where $a > 0$. Find the base-$10$ representation of $n$.

Solution

Problem 3

Kathy has $5$ red cards and $5$ green cards. She shuffles the $10$ cards and lays out $5$ 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 $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Solution

Problem 4

In $\triangle ABC, AB = AC = 10$ and $BC = 12$. Point $D$ lies strictly between $A$ and $B$ on $\overline{AB}$ and point $E$ lies strictly between $A$ and $C$ on $\overline{AC}$ so that $AD = DE = EC$. Then $AD$ can be expressed in the form $\dfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Solution

Problem 5

For each ordered pair of real numbers $(x,y)$ satisfying \[\log_2(2x+y) = \log_4(x^2+xy+7y^2)\]there is a real number $K$ such that \[\log_3(3x+y) = \log_9(3x^2+4xy+Ky^2).\]Find the product of all possible values of $K$.

Solution

Problem 6

Let $N$ be the number of complex numbers $z$ with the properties that $|z|=1$ and $z^{6!}-z^{5!}$ is a real number. Find the remainder when $N$ is divided by $1000$.

Solution

Problem 7

A right hexagonal prism has height $2$. The bases are regular hexagons with side length $1$. Any $3$ of the $12$ vertices determine a triangle. Find the number of these triangles that are isosceles (including equilateral triangles).

Solution

Problem 8

Let $ABCDEF$ be an equiangular hexagon such that $AB=6, BC=8, CD=10$, and $DE=12$. Denote $d$ the diameter of the largest circle that fits inside the hexagon. Find $d^2$.

Solution

Problem 9

Find the number of four-element subsets of $\{1,2,3,4,\dots, 20\}$ with the property that two distinct elements of a subset have a sum of $16$, and two distinct elements of a subset have a sum of $24$. For example, $\{3,5,13,19\}$ and $\{6,10,20,18\}$ are two such subsets.

Solution

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 $A$. 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 $AJABCHCHIJA$, which has $10$ steps. Let $n$ be the number of paths with $15$ steps that begin and end at point $A.$ Find the remainder when $n$ is divided by $1000$.

[asy] size(6cm); draw(unitcircle); draw(scale(2) * unitcircle); for(int d = 90; d < 360 + 90; d += 72){ draw(2 * dir(d) -- dir(d)); } dot(1 * dir( 90), linewidth(5)); dot(1 * dir(162), linewidth(5)); dot(1 * dir(234), linewidth(5)); dot(1 * dir(306), linewidth(5)); dot(1 * dir(378), linewidth(5)); dot(2 * dir(378), linewidth(5)); dot(2 * dir(306), linewidth(5)); dot(2 * dir(234), linewidth(5)); dot(2 * dir(162), linewidth(5)); dot(2 * dir( 90), linewidth(5)); label("$A$", 1 * dir( 90), -dir( 90)); label("$B$", 1 * dir(162), -dir(162)); label("$C$", 1 * dir(234), -dir(234)); label("$D$", 1 * dir(306), -dir(306)); label("$E$", 1 * dir(378), -dir(378)); label("$F$", 2 * dir(378), dir(378)); label("$G$", 2 * dir(306), dir(306)); label("$H$", 2 * dir(234), dir(234)); label("$I$", 2 * dir(162), dir(162)); label("$J$", 2 * dir( 90), dir( 90)); [/asy]

Solution

Problem 11

Find the least positive integer $n$ such that when $3^n$ is written in base $143$, its two right-most digits in base $143$ are $01$.

Solution

Problem 12

For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$, let $s(T)$ be the sum of the elements of $T$, with $s(\emptyset)$ defined to be $0$. If $T$ is chosen at random among all subsets of $U$, the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m$.

Solution

Problem 13

Let $\triangle ABC$ have side lengths $AB=30$, $BC=32$, and $AC=34$. Point $X$ lies in the interior of $\overline{BC}$, and points $I_1$ and $I_2$ are the incenters of $\triangle ABX$ and $\triangle ACX$, respectively. Find the minimum possible area of $\triangle AI_1I_2$ as $X$ varies along $\overline{BC}$.

Solution

Problem 14

Let $SP_1P_2P_3EP_4P_5$ be a heptagon. A frog starts jumping at vertex $S$. From any vertex of the heptagon except $E$, the frog may jump to either of the two adjacent vertices. When it reaches vertex $E$, the frog stops and stays there. Find the number of distinct sequences of jumps of no more than $12$ jumps that end at $E$.

Solution

Problem 15

David found four sticks of different lengths that can be used to form three non-congruent convex cyclic quadrilaterals, $A,\text{ }B,\text{ }C$, which can each be inscribed in a circle with radius $1$. Let $\varphi_A$ denote the measure of the acute angle made by the diagonals of quadrilateral $A$, and define $\varphi_B$ and $\varphi_C$ similarly. Suppose that $\sin\varphi_A=\frac{2}{3}$, $\sin\varphi_B=\frac{3}{5}$, and $\sin\varphi_C=\frac{6}{7}$. All three quadrilaterals have the same area $K$, which can be written in the form $\dfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2018_AIME_I_Problems&oldid=159887"