Difference between revisions of "2020 AMC 10A Problems"
Airplane50 (talk | contribs) m (Added Problems) |
Airplane50 (talk | contribs) 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: • AoPS Resources • PDF | ||
Instructions
| ||
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 |
Contents
- 1 Problem 1
- 2 Problem 2
- 3 Problem 3
- 4 Problem 4
- 5 Problem 5
- 6 Problem 6
- 7 Problem 7
- 8 Problem 8
- 9 Problem 9
- 10 Problem 10
- 11 Problem 11
- 12 Problem 12
- 13 Problem 13
- 14 Problem 14
- 15 Problem 15
- 16 Problem 16
- 17 Problem 17
- 18 Problem 18
- 19 Problem 19
- 20 Problem 20
- 21 Problem 21
- 22 Problem 22
- 23 Problem 23
- 24 Problem 24
- 25 Problem 25
- 26 See also
Problem 1
What value of satisfies
Problem 2
The numbers and have an average (arithmetic mean) of . What is the average of and ?
Problem 3
Assuming , , and , what is the value in simplest form of the following expression?
Problem 4
A driver travels for hours at miles per hour, during which her car gets miles per gallon of gasoline. She is paid per mile, and her only expense is gasoline at per gallon. What is her net rate of pay, in dollars per hour, after this expense?
Problem 5
What is the sum of all real numbers for which
Problem 6
How many -digit positive integers (that is, integers between and , inclusive) having only even digits are divisible by
Problem 7
The integers from to inclusive, can be arranged to form a -by- 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?
Problem 8
What is the value of
Problem 9
A single bench section at a school event can hold either adults or children. When 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
Problem 10
Seven cubes, whose volumes are , , , , , , and 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?
Problem 11
What is the median of the following list of numbers
Problem 12
Triangle is isoceles with . Medians and are perpendicular to each other, and . What is the area of
Problem 13
A frog sitting at the point begins a sequence of jumps, where each jump is parallel to one of the coordinate axes and has length , 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 and . What is the probability that the sequence of jumps ends on a vertical side of the square
Problem 14
Real numbers and satisfy and . What is the value of
Problem 15
A positive integer divisor of is chosen at random. The probability that the divisor chosen is a perfect square can be expressed as , where and are relatively prime positive integers. What is ?
Problem 16
A point is chosen at random within the square in the coordinate plane whose vertices are and . The probability that the point is within units of a lattice point is . (A point is a lattice point if and are both integers.) What is to the nearest tenth
Problem 17
DefineHow many integers are there such that ?
Problem 18
Let be an ordered quadruple of not necessarily distinct integers, each one of them in the set For how many such quadruples is it true that is odd? (For example, is one such quadruple, because is odd.)
Problem 19
As shown in the figure below, a regular dodecahedron (the polyhedron consisting of 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?
Problem 20
Quadrilateral satisfies and Diagonals and intersect at point and What is the area of quadrilateral
Problem 21
There exists a unique strictly increasing sequence of nonnegative integers such thatWhat is
Problem 22
For how many positive integers isnot divisible by ? (Recall that is the greatest integer less than or equal to .)
Problem 23
Let be the triangle in the coordinate plane with vertices and Consider the following five isometries (rigid transformations) of the plane: rotations of and counterclockwise around the origin, reflection across the -axis, and reflection across the -axis. How many of the sequences of three of these transformations (not necessarily distinct) will return to its original position? (For example, a rotation, followed by a reflection across the -axis, followed by a reflection across the -axis will return to its original position, but a rotation, followed by a reflection across the -axis, followed by another reflection across the -axis will not return to its original position.)
Problem 24
Let be the least positive integer greater than for whichWhat is the sum of the digits of ?
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 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 (Problems • Answer Key • Resources) | ||
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.