AMC 10 · 2024 · #10

학년 6 number-theoryarithmetic
pattern-recognitionmodular-arithmeticrecursive-sequencedivisibility-rules pattern-recognitionsystematic-enumeration ↑ 선수 지식: divisibility-rulesmulti-digit-arithmetic
📏 짧은 풀이 💡 2 개 인사이트

문제

Consider the following operation. Given a positive integer nn, if nn is a multiple of 33, then you replace nn by n3\frac{n}{3}. If nn is not a multiple of 33, then you replace nn by n+10n+10. Then continue this process. 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?

답을 골라 클릭하세요.

(A)
10
(B)
20
(C)
30
(D)
40
(E)
50

AMC 10 2024 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

풀이는 먼저 직접 풀어본 뒤에 보는 게 가장 효과적이에요.