olymmath

AMC 10 2021-fall-a Problem 23

  • Paper

For each positive integer nn, let f1(n)f_1(n) be twice the number of positive integer divisors of nn, and for j≥2j \ge 2, let fj(n)=f1(fj−1(n))f_j(n) = f_1(f_{j-1}(n)). For how many values of n≤50n \le 50 is f50(n)=12?f_{50}(n) = 12? (A) 7(B) 8(C) 9(D) 10(E) 11\textbf{(A) }7 \textbf{(B) }8 \textbf{(C) }9 \textbf{(D) }10 \textbf{(E) }11

Dataset text NuminaMath-1.5. Quoted with source.

Show the answer

10

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator amc10/2021-fall-a/p23 · Tag K6NA57JNHG · Edit this page on GitHub · Keys: j next, k previous