AMC // 10
PAPERS>AMC 10A 2024
// PAPER // AMC 10A 2024

AMC 10A 2024

2024-11-06

View the original on AoPS Wiki ↑

// PROBLEM 1
// PROBLEM

What is the value of 990110199101019901 \cdot 101 - 99 \cdot 10101?

// PROBLEM 2
// PROBLEM

A model used to estimate the time it will take to hike to the top of the mountain on a trail is of the form T=aL+bGT = aL + bG, where aa and bb are constants, TT is the time in minutes, LL is the length of the trail in miles, and GG is the altitude gain in feet. The model estimates that it will take 6969 minutes to hike to the top if a trail is 1.51.5 miles long and ascends 800800 feet, as well as if a trail is 1.21.2 miles long and ascends 11001100 feet. How many minutes does the model estimate it will take to hike to the top if the trail is 4.24.2 miles long and ascends 40004000 feet?

// PROBLEM 3
// PROBLEM

Let nn be the least prime number that can be written as the sum of 55 distinct prime numbers. What is the sum of the digits of nn?

// PROBLEM 4
// PROBLEM

The number 20242024 is written as the sum of not necessarily distinct two-digit numbers. What is the least number of two-digit numbers needed to write this sum?

// PROBLEM 5
// PROBLEM

What is the least value of nn such that n!n! is a multiple of 20242024?

// PROBLEM 6
// PROBLEM

What is the minimum number of successive swaps of adjacent letters in the string ABCDEFABCDEF that are needed to change the string to FEDCBAFEDCBA? (For example, 33 swaps are required to change ABCABC to CBACBA; one such sequence of swaps is ABCBACBCACBAABC \to BAC \to BCA \to CBA.)

// PROBLEM 7
// PROBLEM

The product of three integers is 6060. What is the least possible positive sum of the three integers?

// PROBLEM 8
// PROBLEM

Amy, Bomani, Charlie, and Daria work in a chocolate factory. On Monday Amy, Bomani, and Charlie started working at 1:001{:}00 PM and were able to pack 44, 33, and 33 packages, respectively, every 33 minutes. At some later time, Daria joined the group, and Daria was able to pack 55 packages every 44 minutes. Together, they finished packing 450450 packages at exactly 2:452{:}45 PM. At what time did Daria join the group?

// PROBLEM 9
// PROBLEM

In how many ways can 66 juniors and 66 seniors form 33 disjoint teams of 44 people so that each team has 22 juniors and 22 seniors?

// PROBLEM 10
// PROBLEM

Consider the following operation. Given a positive integer nn, if nn is a multiple of 33, then you replace nn by n3\dfrac{n}{3}. If nn is not a multiple of 33, then you replace nn by n+10n + 10. For example, beginning with n=4n = 4, this procedure gives 4142481862124 \to 14 \to 24 \to 8 \to 18 \to 6 \to 2 \to 12 \to \cdots. Suppose you start with n=100n = 100. What value results if you perform this operation exactly 100100 times?

// PROBLEM 11
// PROBLEM

How many ordered pairs of integers (m,n)(m, n) satisfy n249=m\sqrt{n^2 - 49} = m?

// PROBLEM 12
// PROBLEM

Zelda played the Adventures of Math game on August 1 and scored 17001700 points. She continued to play daily over the next 55 days. The bar chart below shows the daily change in her score compared to the day before. (For example, Zelda's score on August 2 was 1700+80=17801700 + 80 = 1780 points.) What was Zelda's average score in points over the 66 days?

The bar chart shows the following daily changes (positive = increase, negative = decrease):

| Day | Aug 2 | Aug 3 | Aug 4 | Aug 5 | Aug 6 | |-----|-------|-------|-------|-------|-------| | Change | +80+80 | 90-90 | 10-10 | +60+60 | 40-40 |

// PROBLEM 13
// PROBLEM

Two transformations are said to commute if applying the first followed by the second gives the same result as applying the second followed by the first. Consider these four transformations of the coordinate plane:

  • a translation 22 units to the right,
  • a 9090^\circ-rotation counterclockwise about the origin,
  • a reflection across the xx-axis, and
  • a dilation centered at the origin with scale factor 22.

Of the 66 pairs of distinct transformations from this list, how many commute?

// PROBLEM 14
// PROBLEM

One side of an equilateral triangle of height 2424 lies on line \ell. A circle of radius 1212 is tangent to line \ell and is externally tangent to the triangle. The area of the region exterior to the triangle and the circle and bounded by the triangle, the circle, and line \ell can be written as abcπa\sqrt{b} - c\pi, where aa, bb, and cc are positive integers and bb is not divisible by the square of any prime. What is a+b+ca + b + c?

// PROBLEM 15
// PROBLEM

Let MM be the greatest integer such that both M+1213M + 1213 and M+3773M + 3773 are perfect squares. What is the units digit of MM?

// PROBLEM 16 · NOT TRANSCRIBED (figure-dependent: requires exact layout of similar-rectangle dissection to identify segment AB; no faithful textual description possible)

View this problem on AoPS Wiki ↑

// PROBLEM 17
// PROBLEM

Two teams are in a best-two-out-of-three playoff: the teams will play at most 33 games, and the winner of the playoff is the first team to win 22 games. The first game is played on Team A's home field, and the remaining games are played on Team B's home field. Team A has a 23\tfrac{2}{3} chance of winning at home, and its probability of winning when playing away from home is pp. Outcomes of the games are independent. The probability that Team A wins the playoff is 12\tfrac{1}{2}. Then pp can be written in the form 12(mn)\tfrac{1}{2}(m - \sqrt{n}), where mm and nn are positive integers. What is m+nm + n?

// PROBLEM 18
// PROBLEM

There are exactly KK positive integers bb with 5b20245 \leq b \leq 2024 such that the base-bb integer 2024b\overline{2024}_b is divisible by 1616 (where 1616 is in base ten). What is the sum of the digits of KK?

// PROBLEM 19
// PROBLEM

The first three terms of a geometric sequence are the integers aa, 720720, and bb, where a<720<ba < 720 < b. What is the sum of the digits of the least possible value of bb?

// PROBLEM 20
// PROBLEM

Let SS be a subset of {1,2,3,,2024}\{1, 2, 3, \ldots, 2024\} such that the following two conditions hold:

  • If xx and yy are distinct elements of SS, then xy>2|x - y| > 2.
  • If xx and yy are distinct odd elements of SS, then xy>6|x - y| > 6.

What is the maximum possible number of elements in SS?

// PROBLEM 21
// PROBLEM

The numbers, in order, of each row and the numbers, in order, of each column of a 5×55 \times 5 array of integers form an arithmetic progression of length 55. The numbers in positions (5,5)(5,5), (2,4)(2,4), (4,3)(4,3), and (3,1)(3,1) are 00, 4848, 1616, and 1212, respectively. What number is in position (1,2)(1,2)?

// PROBLEM 22
// PROBLEM

Let KK be the kite formed by joining two right triangles with legs 11 and 3\sqrt{3} along a common hypotenuse. Eight copies of KK are used to form the polygon shown below (the "hat" einstein tile). AA, BB, CC are three vertices of the polygon such that ABAB is a long outer edge of the polygon with AA and BB at opposite ends, and CC is the vertex of the polygon farthest from line ABAB. What is the area of triangle ABC\triangle ABC?

(The polygon is a 13-sided figure — 8 kites joined together — where AA and BB are the two endpoints of the longest straight segment on one side, and CC is the vertex of the polygon farthest from segment ABAB.)

// PROBLEM 23
// PROBLEM

Integers aa, bb, and cc satisfy ab+c=100ab + c = 100, bc+a=87bc + a = 87, and ca+b=60ca + b = 60. What is ab+bc+caab + bc + ca?

// PROBLEM 24
// PROBLEM

A bee is moving in three-dimensional space. A fair six-sided die with faces labeled A+A^+, AA^-, B+B^+, BB^-, C+C^+, and CC^- is rolled. Suppose the bee occupies the point (a,b,c)(a, b, c). If the die shows A+A^+, then the bee moves to the point (a+1,b,c)(a+1, b, c) and if the die shows AA^-, then the bee moves to the point (a1,b,c)(a-1, b, c). Analogous moves are made with the other four outcomes. Suppose the bee starts at the point (0,0,0)(0, 0, 0) and the die is rolled four times. What is the probability that the bee traverses four distinct edges of some unit cube?

// PROBLEM 25 · NOT TRANSCRIBED (figure-dependent: requires exact positions of constraint numbers in 8x3 toothpick grid; no faithful textual description possible)

View this problem on AoPS Wiki ↑