2021 Fall AMC 10A Problems/Problem 23: Difference between revisions

Latest revision as of 22:21, 23 November 2021

Redirect to:

Revision as of 21:27, 22 November 2021 view source Leo.euler (talk \| contribs) editor 106 edits Created page with "For each positive integer <math>n</math>, let <math>f_1(n)</math> be twice the number of positive integer divisors of <math>n</math>, and for <math>j \ge 2</math>, let <math>f..."		Latest revision as of 22:21, 23 November 2021 view source MRENTHUSIASM (talk \| contribs) editor 9,986 edits Redirected page to 2021 Fall AMC 12A Problems/Problem 20 Tag: New redirect
(6 intermediate revisions by 4 users not shown)
Line 1:		Line 1:
	~~For each positive integer <math>n<~~/math>, let <math>f_1(n)</math> be twice the number of positive integer divisors of <math>n</math>, and for <math>j \ge 2</math>, let <math>f_j(n) = f_1(f_{j-1}(n))</math>. For how many values of <math>n \le 50</math> is <math>f_{50}(n) = 12?</math>		#REDIRECT [[2021_Fall_AMC_12A_Problems/Problem_20]]

	~~<math>\textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11</math>~~