2021 AMC 12A Fall Problem 20

Below is the professionally curated solution for Problem 20 of the 2021 AMC 12A Fall, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2021 AMC 12A Fall 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:factor countingrecursion

Difficulty rating: 2110

20.

For each positive integer n,n, let f1(n)f_1(n) be twice the number of positive integer divisors of n,n, and for j2,j \ge 2, let fj(n)=f1(fj1(n)).f_j(n) = f_1(f_{j-1}(n)). For how many values of n50n \le 50 is f50(n)=12?f_{50}(n) = 12?

77

88

99

1010

1111

Solution:

Both 88 and 1212 are fixed: f1(8)=24=8f_1(8) = 2\cdot 4 = 8 and f1(12)=26=12.f_1(12) = 2\cdot 6 = 12. The small chain 24682 \to 4 \to 6 \to 8 funnels most numbers to 8;8; to reach 1212 the orbit must hit 12,12, 1818 (since f1(18)=12f_1(18) = 12), or 20.20.

Tracing each n50,n \le 50, the ones reaching 1212 are 12,18,20,28,32,36,44,45,48,5012, 18, 20, 28, 32, 36, 44, 45, 48, 50 — for instance 36181236 \to 18 \to 12 and 482012.48 \to 20 \to 12. That is 1010 values.

Thus, the correct answer is D.

Problem 20 in Other Years