PREPARE FOR THE AMC 10
Join outstanding instructors and top-scoring students in our online AMC 10 Problem Series course.
CHECK SCHEDULE

Difference between revisions of "2020 AMC 10A Problems"

m (Added Problems)
m (Added Problems)
Line 121: Line 121:
  
 
==Problem 19==
 
==Problem 19==
 +
 +
As shown in the figure below, a regular dodecahedron (the polyhedron consisting of <math>12</math> congruent regular pentagonal faces) floats in space with two horizontal faces. Note that there is a ring of five slanted faces adjacent to the top face, and a ring of five slanted faces adjacent to the bottom face. How many ways are there to move from the top face to the bottom face via a sequence of adjacent faces so that each face is visited at most once and moves are not permitted from the bottom ring to the top ring?
 +
 +
<math>\textbf{(A) } 125 \qquad \textbf{(B) } 250 \qquad \textbf{(C) } 405 \qquad \textbf{(D) } 640 \qquad \textbf{(E) } 810</math>
  
 
==Problem 20==
 
==Problem 20==
 +
 +
Quadrilateral <math>ABCD</math> satisfies <math>\angle ABC = \angle ACD = 90^{\circ}, AC=20,</math> and <math>CD=30.</math> Diagonals <math>\overline{AC}</math> and <math>\overline{BD}</math> intersect at point <math>E,</math> and <math>AE=5.</math> What is the area of quadrilateral <math>ABCD?</math>
 +
 +
<math>\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370</math>
  
 
==Problem 21==
 
==Problem 21==
 +
 +
There exists a unique strictly increasing sequence of nonnegative integers <math>a_1 < a_2 < … < a_k</math> such that<cmath>\frac{2^{289}+1}{2^{17}+1} = 2^{a_1} + 2^{a_2} + … + 2^{a_k}.</cmath>What is <math>k?</math>
 +
 +
<math>\textbf{(A) } 117 \qquad \textbf{(B) } 136 \qquad \textbf{(C) } 137 \qquad \textbf{(D) } 273 \qquad \textbf{(E) } 306</math>
  
 
==Problem 22==
 
==Problem 22==
 +
 +
For how many positive integers <math>n \le 1000</math> is<cmath>\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor</cmath>not divisible by <math>3</math>? (Recall that <math>\lfloor x \rfloor</math> is the greatest integer less than or equal to <math>x</math>.)
 +
 +
<math>\textbf{(A) } 22 \qquad\textbf{(B) } 23 \qquad\textbf{(C) } 24 \qquad\textbf{(D) } 25 \qquad\textbf{(E) } 26</math>
  
 
==Problem 23==
 
==Problem 23==
 +
 +
Let <math>T</math> be the triangle in the coordinate plane with vertices <math>(0,0), (4,0),</math> and <math>(0,3).</math> Consider the following five isometries (rigid transformations) of the plane: rotations of <math>90^{\circ}, 180^{\circ},</math> and <math>270^{\circ}</math> counterclockwise around the origin, reflection across the <math>x</math>-axis, and reflection across the <math>y</math>-axis. How many of the <math>125</math> sequences of three of these transformations (not necessarily distinct) will return <math>T</math> to its original position? (For example, a <math>180^{\circ}</math> rotation, followed by a reflection across the <math>x</math>-axis, followed by a reflection across the <math>y</math>-axis will return <math>T</math> to its original position, but a <math>90^{\circ}</math> rotation, followed by a reflection across the <math>x</math>-axis, followed by another reflection across the <math>x</math>-axis will not return <math>T</math> to its original position.)
 +
 +
<math>\textbf{(A) } 12 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 17 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 25</math>
  
 
==Problem 24==
 
==Problem 24==
 +
 +
Let <math>n</math> be the least positive integer greater than <math>1000</math> for which<cmath>\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.</cmath>What is the sum of the digits of <math>n</math>?
 +
 +
<math>\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24</math>
  
 
==Problem 25==
 
==Problem 25==
  
 +
Jason rolls three fair standard six-sided dice. Then he looks at the rolls and chooses a subset of the dice (possibly empty, possibly all three dice) to reroll. After rerolling, he wins if and only if the sum of the numbers face up on the three dice is exactly <math>7.</math> Jason always plays to optimize his chances of winning. What is the probability that he chooses to reroll exactly two of the dice?
  
 
==See also==
 
==See also==
 
{{AMC10 box|year=2020|ab=A|before=[[2019 AMC 10B Problems]]|after=[[2020 AMC 10B Problems]]}}
 
{{AMC10 box|year=2020|ab=A|before=[[2019 AMC 10B Problems]]|after=[[2020 AMC 10B Problems]]}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 00:42, 1 February 2020

2020 AMC 10A (Answer Key)
Printable versions: WikiAoPS ResourcesPDF

Instructions

  1. This is a 25-question, multiple choice test. Each question is followed by answers marked A, B, C, D and E. Only one of these is correct.
  2. You will receive 6 points for each correct answer, 2.5 points for each problem left unanswered if the year is before 2006, 1.5 points for each problem left unanswered if the year is after 2006, and 0 points for each incorrect answer.
  3. No aids are permitted other than scratch paper, graph paper, ruler, compass, protractor and erasers (and calculators that are accepted for use on the SAT if before 2006. No problems on the test will require the use of a calculator).
  4. Figures are not necessarily drawn to scale.
  5. You will have 75 minutes working time to complete the test.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

Problem 1

What value of $x$ satisfies

\[x- \frac{3}{4} = \frac{5}{12} - \frac{1}{3}?\] $\textbf{(A)}\ -\frac{2}{3}\qquad\textbf{(B)}\ \frac{7}{36}\qquad\textbf{(C)}\ \frac{7}{12}\qquad\textbf{(D)}\ \frac{2}{3}\qquad\textbf{(E)}\ \frac{5}{6}$

Solution

Problem 2

The numbers $3, 5, 7, a,$ and $b$ have an average (arithmetic mean) of $15$. What is the average of $a$ and $b$?

$\textbf{(A) } 0 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 30 \qquad\textbf{(D) } 45 \qquad\textbf{(E) } 60$

Solution

Problem 3

Assuming $a\neq3$, $b\neq4$, and $c\neq5$, what is the value in simplest form of the following expression? \[\frac{a-3}{5-c} \cdot \frac{b-4}{3-a} \cdot \frac{c-5}{4-b}\]

$\textbf{(A) } -1 \qquad \textbf{(B) } 1 \qquad \textbf{(C) } \frac{abc}{60} \qquad \textbf{(D) } \frac{1}{abc} - \frac{1}{60} \qquad \textbf{(E) } \frac{1}{60} - \frac{1}{abc}$

Solution

Problem 4

A driver travels for $2$ hours at $60$ miles per hour, during which her car gets $30$ miles per gallon of gasoline. She is paid $$0.50$ per mile, and her only expense is gasoline at $$2.00$ per gallon. What is her net rate of pay, in dollars per hour, after this expense?

$\textbf{(A) }20 \qquad\textbf{(B) }22 \qquad\textbf{(C) }24 \qquad\textbf{(D) } 25\qquad\textbf{(E) } 26$

Solution

Problem 5

What is the sum of all real numbers $x$ for which $|x^2-12x+34|=2?$

$\textbf{(A) } 12 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 18 \qquad \textbf{(D) } 21 \qquad \textbf{(E) } 25$

Problem 6

How many $4$-digit positive integers (that is, integers between $1000$ and $9999$, inclusive) having only even digits are divisible by $5?$

$\textbf{(A) } 80 \qquad \textbf{(B) } 100 \qquad \textbf{(C) } 125 \qquad \textbf{(D) } 200 \qquad \textbf{(E) } 500$

Problem 7

The $25$ integers from $-10$ to $14,$ inclusive, can be arranged to form a $5$-by-$5$ square in which the sum of the numbers in each row, the sum of the numbers in each column, and the sum of the numbers along each of the main diagonals are all the same. What is the value of this common sum?

$\textbf{(A) }2 \qquad\textbf{(B) } 5\qquad\textbf{(C) } 10\qquad\textbf{(D) } 25\qquad\textbf{(E) } 50$

Problem 8

What is the value of

$1+2+3-4+5+6+7-8+\cdots+197+198+199-200?$

$\textbf{(A) } 9,800 \qquad \textbf{(B) } 9,900 \qquad \textbf{(C) } 10,000 \qquad \textbf{(D) } 10,100 \qquad \textbf{(E) } 10,200$

Problem 9

A single bench section at a school event can hold either $7$ adults or $11$ children. When $N$ bench sections are connected end to end, an equal number of adults and children seated together will occupy all the bench space. What is the least possible positive integer value of $N?$

$\textbf{(A) } 9 \qquad \textbf{(B) } 18 \qquad \textbf{(C) } 27 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 77$

Problem 10

Seven cubes, whose volumes are $1$, $8$, $27$, $64$, $125$, $216$, and $343$ cubic units, are stacked vertically to form a tower in which the volumes of the cubes decrease from bottom to top. Except for the bottom cube, the bottom face of each cube lies completely on top of the cube below it. What is the total surface area of the tower (including the bottom) in square units?

$\textbf{(A)}\ 644\qquad\textbf{(B)}\ 658\qquad\textbf{(C)}\ 664\qquad\textbf{(D)}\ 720\qquad\textbf{(E)}\ 749$

Problem 11

What is the median of the following list of $4040$ numbers$?$

\[1, 2, 3, ..., 2020, 1^2, 2^2, 3^2, ..., 2020^2\] $\textbf{(A)}\ 1974.5\qquad\textbf{(B)}\ 1975.5\qquad\textbf{(C)}\ 1976.5\qquad\textbf{(D)}\ 1977.5\qquad\textbf{(E)}\ 1978.5$

Problem 12

Triangle $AMC$ is isoceles with $AM = AC$. Medians $\overline{MV}$ and $\overline{CU}$ are perpendicular to each other, and $MV=CU=12$. What is the area of $\triangle AMC?$

$\textbf{(A) } 48 \qquad \textbf{(B) } 72 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 144 \qquad \textbf{(E) } 192$

Problem 13

A frog sitting at the point $(1, 2)$ begins a sequence of jumps, where each jump is parallel to one of the coordinate axes and has length $1$, and the direction of each jump (up, down, right, or left) is chosen independently at random. The sequence ends when the frog reaches a side of the square with vertices $(0,0), (0,4), (4,4),$ and $(4,0)$. What is the probability that the sequence of jumps ends on a vertical side of the square$?$

$\textbf{(A)}\ \frac12\qquad\textbf{(B)}\ \frac 58\qquad\textbf{(C)}\ \frac 23\qquad\textbf{(D)}\ \frac34\qquad\textbf{(E)}\ \frac 78$

Problem 14

Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \cdot y = -2$. What is the value of\[x + \frac{x^3}{y^2} + \frac{y^3}{x^2} + y?\]$\textbf{(A)}\ 360\qquad\textbf{(B)}\ 400\qquad\textbf{(C)}\ 420\qquad\textbf{(D)}\ 440\qquad\textbf{(E)}\ 480$

Problem 15

A positive integer divisor of $12!$ is chosen at random. The probability that the divisor chosen is a perfect square can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$?

$\textbf{(A)}\ 3\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 23$

Problem 16

A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0), (2020, 0), (2020, 2020),$ and $(0, 2020)$. The probability that the point is within $d$ units of a lattice point is $\tfrac{1}{2}$. (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$ to the nearest tenth$?$

$\textbf{(A) } 0.3 \qquad \textbf{(B) } 0.4 \qquad \textbf{(C) } 0.5 \qquad \textbf{(D) } 0.6 \qquad \textbf{(E) } 0.7$

Problem 17

Define\[P(x) =(x-1^2)(x-2^2)\cdots(x-100^2).\]How many integers $n$ are there such that $P(n)\leq 0$?

$\textbf{(A) } 4900 \qquad \textbf{(B) } 4950\qquad \textbf{(C) } 5000\qquad \textbf{(D) } 5050 \qquad \textbf{(E) } 5100$

Problem 18

Let $(a,b,c,d)$ be an ordered quadruple of not necessarily distinct integers, each one of them in the set ${0,1,2,3}.$ For how many such quadruples is it true that $a\cdot d-b\cdot c$ is odd? (For example, $(0,3,1,1)$ is one such quadruple, because $0\cdot 1-3\cdot 1 = -3$ is odd.)

$\textbf{(A) } 48 \qquad \textbf{(B) } 64 \qquad \textbf{(C) } 96 \qquad \textbf{(D) } 128 \qquad \textbf{(E) } 192$

Problem 19

As shown in the figure below, a regular dodecahedron (the polyhedron consisting of $12$ congruent regular pentagonal faces) floats in space with two horizontal faces. Note that there is a ring of five slanted faces adjacent to the top face, and a ring of five slanted faces adjacent to the bottom face. How many ways are there to move from the top face to the bottom face via a sequence of adjacent faces so that each face is visited at most once and moves are not permitted from the bottom ring to the top ring?

$\textbf{(A) } 125 \qquad \textbf{(B) } 250 \qquad \textbf{(C) } 405 \qquad \textbf{(D) } 640 \qquad \textbf{(E) } 810$

Problem 20

Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC=20,$ and $CD=30.$ Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$

$\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370$

Problem 21

There exists a unique strictly increasing sequence of nonnegative integers $a_1 < a_2 < … < a_k$ such that\[\frac{2^{289}+1}{2^{17}+1} = 2^{a_1} + 2^{a_2} + … + 2^{a_k}.\]What is $k?$

$\textbf{(A) } 117 \qquad \textbf{(B) } 136 \qquad \textbf{(C) } 137 \qquad \textbf{(D) } 273 \qquad \textbf{(E) } 306$

Problem 22

For how many positive integers $n \le 1000$ is\[\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor\]not divisible by $3$? (Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.)

$\textbf{(A) } 22 \qquad\textbf{(B) } 23 \qquad\textbf{(C) } 24 \qquad\textbf{(D) } 25 \qquad\textbf{(E) } 26$

Problem 23

Let $T$ be the triangle in the coordinate plane with vertices $(0,0), (4,0),$ and $(0,3).$ Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}, 180^{\circ},$ and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$-axis, and reflection across the $y$-axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by a reflection across the $y$-axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by another reflection across the $x$-axis will not return $T$ to its original position.)

$\textbf{(A) } 12 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 17 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 25$

Problem 24

Let $n$ be the least positive integer greater than $1000$ for which\[\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.\]What is the sum of the digits of $n$?

$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$

Problem 25

Jason rolls three fair standard six-sided dice. Then he looks at the rolls and chooses a subset of the dice (possibly empty, possibly all three dice) to reroll. After rerolling, he wins if and only if the sum of the numbers face up on the three dice is exactly $7.$ Jason always plays to optimize his chances of winning. What is the probability that he chooses to reroll exactly two of the dice?

See also

2020 AMC 10A (ProblemsAnswer KeyResources)
Preceded by
2019 AMC 10B Problems
Followed by
2020 AMC 10B Problems
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 10 Problems and Solutions

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