Skip to main content

2024 AMC 10A Problem 10

Problem 10 of 25EasierAlgebraNumber Theory

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 4142484 \to 14 \to 24 \to 8 186212.\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?

Answer choices

Show solution

Solution

Just run it from 100:100: 10011012040100 \to 110 \to 120 \to 40 506020\to 50 \to 60 \to 20 301020\to 30 \to 10 \to 20 3010.\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.

More practice

Concepts: recursion · modular arithmetic · process simulation · pattern recognition

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.