2024 AMC 10A Problem 10

Below is the professionally curated solution for Problem 10 of the 2024 AMC 10A, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2024 AMC 10A solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:recursionmodular arithmeticprocess simulationpattern recognition

Difficulty rating: 1350

10.

Consider the following operation. Given a positive integer n,n, if nn is a multiple of 3,3, then you replace nn by n3.\tfrac{n}{3}. If nn is not a multiple of 3,3, then you replace nn by n+10.n + 10. Then continue this process. For example, beginning with n=4,n = 4, this procedure gives 414248186212.4 \to 14 \to 24 \to 8 \to 18 \to 6 \to 2 \to 12 \to \cdots.

Suppose you start with n=100.n = 100. What value results if you perform this operation exactly 100100 times?

1010

2020

3030

4040

5050

Solution:

Just run it from 100:100: 100110120405060203010203010.100 \to 110 \to 120 \to 40 \to 50 \to 60 \to 20 \to 30 \to 10 \to 20 \to 30 \to 10 \to \cdots. After the 88th step we're at 10,10, and from there it cycles 10,20,3010, 20, 30 with period 3.3. So step 8+k8 + k is the kkth entry of the cycle. For step 100,100, k=92,k = 92, and 922(mod3),92 \equiv 2 \pmod 3, which lands on 30.30. Therefore, the answer is C.

Problem 10 in Other Years