Difference between revisions of "2021 AIME I Problems"

(Problem 7)
(Undo revision 190908 by Pappustheorem (talk) The original order was correct.)
(Tag: Undo)
 
(18 intermediate revisions by 8 users not shown)
Line 1: Line 1:
 
{{AIME Problems|year=2021|n=I}}
 
{{AIME Problems|year=2021|n=I}}
WTF
+
==Problem 1==
 +
Zou and Chou are practicing their <math>100</math>-meter sprints by running <math>6</math> races against each other. Zou wins the first race, and after that, the probability that one of them wins a race is <math>\frac23</math> if they won the previous race but only <math>\frac13</math> if they lost the previous race. The probability that Zou will win exactly <math>5</math> of the <math>6</math> races is <math>\frac mn</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
  
WTF
+
[[2021 AIME I Problems/Problem 1|Solution]]
 +
 
 +
==Problem 2==
 +
In the diagram below, <math>ABCD</math> is a rectangle with side lengths <math>AB=3</math> and <math>BC=11</math>, and <math>AECF</math> is a rectangle with side lengths <math>AF=7</math> and <math>FC=9,</math> as shown. The area of the shaded region common to the interiors of both rectangles is <math>\frac mn</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
 +
 
 +
<asy>
 +
pair A, B, C, D, E, F;
 +
A = (0,3);
 +
B=(0,0);
 +
C=(11,0);
 +
D=(11,3);
 +
E=foot(C, A, (9/4,0));
 +
F=foot(A, C, (35/4,3));
 +
draw(A--B--C--D--cycle);
 +
draw(A--E--C--F--cycle);
 +
filldraw(A--(9/4,0)--C--(35/4,3)--cycle,gray*0.5+0.5*lightgray);
 +
dot(A^^B^^C^^D^^E^^F);
 +
label("$A$", A, W);
 +
label("$B$", B, W);
 +
label("$C$", C, (1,0));
 +
label("$D$", D, (1,0));
 +
label("$F$", F, N);
 +
label("$E$", E, S);
 +
</asy>
 +
 
 +
[[2021 AIME I Problems/Problem 2|Solution]]
 +
 
 +
==Problem 3==
 +
Find the number of positive integers less than <math>1000</math> that can be expressed as the difference of two integral powers of <math>2.</math>
 +
 
 +
[[2021 AIME I Problems/Problem 3|Solution]]
 +
 
 +
==Problem 4==
 +
Find the number of ways <math>66</math> identical coins can be separated into three nonempty piles so that there are fewer coins in the first pile than in the second pile and fewer coins in the second pile than in the third pile.
 +
 
 +
[[2021 AIME I Problems/Problem 4|Solution]]
 +
 
 +
==Problem 5==
 +
Call a three-term strictly increasing arithmetic sequence of integers special if the sum of the squares of the three terms equals the product of the middle term and the square of the common difference. Find the sum of the third terms of all special sequences.
 +
 
 +
[[2021 AIME I Problems/Problem 5|Solution]]
 +
 
 +
==Problem 6==
 +
Segments <math>\overline{AB}, \overline{AC},</math> and <math>\overline{AD}</math> are edges of a cube and <math>\overline{AG}</math> is a diagonal through the center of the cube. Point <math>P</math> satisfies <math>BP=60\sqrt{10}</math>, <math>CP=60\sqrt{5}</math>, <math>DP=120\sqrt{2}</math>, and <math>GP=36\sqrt{7}</math>. Find <math>AP.</math>
 +
 
 +
[[2021 AIME I Problems/Problem 6|Solution]]
 +
 
 +
==Problem 7==
 +
Find the number of pairs <math>(m,n)</math> of positive integers with <math>1\le m<n\le 30</math> such that there exists a real number <math>x</math> satisfying<cmath>\sin(mx)+\sin(nx)=2.</cmath>
 +
 
 +
[[2021 AIME I Problems/Problem 7|Solution]]
  
 
==Problem 8==
 
==Problem 8==
Line 22: Line 73:
  
 
==Problem 11==
 
==Problem 11==
Let <math>ABCD</math> be a cyclic quadrilateral with <math>AB=4,BC=5,CD=6,</math> and <math>DA=7</math>. Let <math>A_1</math> and <math>C_1</math> be the feet of the perpendiculars from <math>A</math> and <math>C</math>, respectively, to line <math>BD,</math> and let <math>B_1</math> and <math>D_1</math> be the feet of the perpendiculars from <math>B</math> and <math>D,</math> respectively, to line <math>AC</math>. The perimeter of <math>A_1B_1C_1D_1</math> is <math>\frac mn</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
+
Let <math>ABCD</math> be a cyclic quadrilateral with <math>AB=4,BC=5,CD=6,</math> and <math>DA=7.</math> Let <math>A_1</math> and <math>C_1</math> be the feet of the perpendiculars from <math>A</math> and <math>C,</math> respectively, to line <math>BD,</math> and let <math>B_1</math> and <math>D_1</math> be the feet of the perpendiculars from <math>B</math> and <math>D,</math> respectively, to line <math>AC.</math> The perimeter of <math>A_1B_1C_1D_1</math> is <math>\frac mn,</math> where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n.</math>
  
 
[[2021 AIME I Problems/Problem 11|Solution]]
 
[[2021 AIME I Problems/Problem 11|Solution]]
  
 
==Problem 12==
 
==Problem 12==
Let <math>A_1A_2A_3...A_{12}</math> be a dodecagon (12-gon). Three frogs initially sit at <math>A_4,A_8,</math> and <math>A_{12}</math>. At the end of each minute, simultaneously, each of the three frogs jumps to one of the two vertices adjacent to its current position, chosen randomly and independently with both choices being equally likely. All three frogs stop jumping as soon as two frogs arrive at the same vertex at the same time. The expected number of minutes until the frogs stop jumping is <math>\frac mn</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
+
Let <math>A_1A_2A_3\ldots A_{12}</math> be a dodecagon (<math>12</math>-gon). Three frogs initially sit at <math>A_4,A_8,</math> and <math>A_{12}</math>. At the end of each minute, simultaneously, each of the three frogs jumps to one of the two vertices adjacent to its current position, chosen randomly and independently with both choices being equally likely. All three frogs stop jumping as soon as two frogs arrive at the same vertex at the same time. The expected number of minutes until the frogs stop jumping is <math>\frac mn</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
  
 
[[2021 AIME I Problems/Problem 12|Solution]]
 
[[2021 AIME I Problems/Problem 12|Solution]]

Latest revision as of 13:54, 13 March 2023

2021 AIME I (Answer Key)
Printable version | AoPS Contest CollectionsPDF

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

Zou and Chou are practicing their $100$-meter sprints by running $6$ races against each other. Zou wins the first race, and after that, the probability that one of them wins a race is $\frac23$ if they won the previous race but only $\frac13$ if they lost the previous race. The probability that Zou will win exactly $5$ of the $6$ races is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

Problem 2

In the diagram below, $ABCD$ is a rectangle with side lengths $AB=3$ and $BC=11$, and $AECF$ is a rectangle with side lengths $AF=7$ and $FC=9,$ as shown. The area of the shaded region common to the interiors of both rectangles is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

[asy] pair A, B, C, D, E, F; A = (0,3); B=(0,0); C=(11,0); D=(11,3); E=foot(C, A, (9/4,0)); F=foot(A, C, (35/4,3)); draw(A--B--C--D--cycle); draw(A--E--C--F--cycle); filldraw(A--(9/4,0)--C--(35/4,3)--cycle,gray*0.5+0.5*lightgray); dot(A^^B^^C^^D^^E^^F); label("$A$", A, W); label("$B$", B, W); label("$C$", C, (1,0)); label("$D$", D, (1,0)); label("$F$", F, N); label("$E$", E, S); [/asy]

Solution

Problem 3

Find the number of positive integers less than $1000$ that can be expressed as the difference of two integral powers of $2.$

Solution

Problem 4

Find the number of ways $66$ identical coins can be separated into three nonempty piles so that there are fewer coins in the first pile than in the second pile and fewer coins in the second pile than in the third pile.

Solution

Problem 5

Call a three-term strictly increasing arithmetic sequence of integers special if the sum of the squares of the three terms equals the product of the middle term and the square of the common difference. Find the sum of the third terms of all special sequences.

Solution

Problem 6

Segments $\overline{AB}, \overline{AC},$ and $\overline{AD}$ are edges of a cube and $\overline{AG}$ is a diagonal through the center of the cube. Point $P$ satisfies $BP=60\sqrt{10}$, $CP=60\sqrt{5}$, $DP=120\sqrt{2}$, and $GP=36\sqrt{7}$. Find $AP.$

Solution

Problem 7

Find the number of pairs $(m,n)$ of positive integers with $1\le m<n\le 30$ such that there exists a real number $x$ satisfying\[\sin(mx)+\sin(nx)=2.\]

Solution

Problem 8

Find the number of integers $c$ such that the equation\[\left||20|x|-x^2|-c\right|=21\]has $12$ distinct real solutions.

Solution

Problem 9

Let $ABCD$ be an isosceles trapezoid with $AD=BC$ and $AB<CD.$ Suppose that the distances from $A$ to the lines $BC,CD,$ and $BD$ are $15,18,$ and $10,$ respectively. Let $K$ be the area of $ABCD.$ Find $\sqrt2 \cdot K.$

Solution

Problem 10

Consider the sequence $(a_k)_{k\ge 1}$ of positive rational numbers defined by $a_1 = \frac{2020}{2021}$ and for $k\ge 1$, if $a_k = \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, then

\[a_{k+1} = \frac{m + 18}{n+19}.\]Determine the sum of all positive integers $j$ such that the rational number $a_j$ can be written in the form $\frac{t}{t+1}$ for some positive integer $t$.

Solution

Problem 11

Let $ABCD$ be a cyclic quadrilateral with $AB=4,BC=5,CD=6,$ and $DA=7.$ Let $A_1$ and $C_1$ be the feet of the perpendiculars from $A$ and $C,$ respectively, to line $BD,$ and let $B_1$ and $D_1$ be the feet of the perpendiculars from $B$ and $D,$ respectively, to line $AC.$ The perimeter of $A_1B_1C_1D_1$ is $\frac mn,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Solution

Problem 12

Let $A_1A_2A_3\ldots A_{12}$ be a dodecagon ($12$-gon). Three frogs initially sit at $A_4,A_8,$ and $A_{12}$. At the end of each minute, simultaneously, each of the three frogs jumps to one of the two vertices adjacent to its current position, chosen randomly and independently with both choices being equally likely. All three frogs stop jumping as soon as two frogs arrive at the same vertex at the same time. The expected number of minutes until the frogs stop jumping is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

Problem 13

Circles $\omega_1$ and $\omega_2$ with radii $961$ and $625$, respectively, intersect at distinct points $A$ and $B$. A third circle $\omega$ is externally tangent to both $\omega_1$ and $\omega_2$. Suppose line $AB$ intersects $\omega$ at two points $P$ and $Q$ such that the measure of minor arc $\widehat{PQ}$ is $120^{\circ}$. Find the distance between the centers of $\omega_1$ and $\omega_2$.

Solution

Problem 14

For any positive integer $a,$ $\sigma(a)$ denotes the sum of the positive integer divisors of $a$. Let $n$ be the least positive integer such that $\sigma(a^n)-1$ is divisible by $2021$ for all positive integers $a$. Find the sum of the prime factors in the prime factorization of $n$.

Solution

Problem 15

Let $S$ be the set of positive integers $k$ such that the two parabolas\[y=x^2-k~~\text{and}~~x=2(y-20)^2-k\]intersect in four distinct points, and these four points lie on a circle with radius at most $21$. Find the sum of the least element of $S$ and the greatest element of $S$.

Solution

See also

2021 AIME I (ProblemsAnswer KeyResources)
Preceded by
2020 AIME II
Followed by
2021 AIME II
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