Difference between revisions of "Mock AIME 1 2005-2006/Problem 7"
Aimesolver (talk | contribs) (→Solution) |
MRENTHUSIASM (talk | contribs) (Tag: Undo) |
||
(6 intermediate revisions by 4 users not shown) | |||
Line 1: | Line 1: | ||
− | |||
== Problem == | == Problem == | ||
− | Let <math>f(n)</math> denote the number of divisors of a positive integer n. Evaluate f(f( | + | Let <math>f(n)</math> denote the number of divisors of a positive integer <math>n</math>. Evaluate <math>f(f(2006^{6002}))</math>. |
− | |||
== Solution == | == Solution == | ||
− | <math>2006</math> = <math>2*17*59</math>, so <math>f(2006^{6002})</math> has <math>6003^3</math> positive divisors. <math>6003</math> = <math>(3^ | + | <math>2006</math> = <math>2*17*59</math>, so <math>f(2006^{6002})</math> has <math>6003^3</math> positive divisors. <math>6003^3</math> = <math>(3^6)(23^3)(29^3)</math> so <math>6003^3</math> has <math>(6+1)(3+1)(3+1)</math>, or <math>\boxed {112}</math> divisors. |
Latest revision as of 17:39, 9 February 2023
Problem
Let denote the number of divisors of a positive integer . Evaluate .
Solution
= , so has positive divisors. = so has , or divisors.