AoPSWiki
Visit the AoPS Book Store.

2008 AMC 12B Problems/Problem 23

From AoPSWiki

Problem 23

The sum of the base-10 logarithms of the divisors of 10^n is 792. What is n?

\text{(A)}\ 11\qquad \text{(B)}\ 12\qquad \text{(C)}\ 13\qquad \text{(D)}\ 14\qquad \text{(E)}\ 15

Contents

Solution

Solution 1

Every factor of 10^n will be of the form 2^a \times 5^b , a\leq n , b\leq n. Using the logarithmic property \log(a \times b) = \log(a)+\log(b), it suffices to count the total number of 2's and 5's running through all possible (a,b). For every factor 2^a \times 5^b, there will be another 2^b \times 5^a, so it suffices to count the total number of 2's occurring in all factors (because of this symmetry, the number of 5's will be equal). And since \log(2)+\log(5) = \log(10) = 1, the final sum will be the total number of 2's occurring in all factors of 10^n.

There are n+1 choices for the exponent of 5 in each factor, and for each of those choices, there are n+1 factors (each corresponding to a different exponent of 2), yielding 0+1+2+3...+n = \frac{n(n+1)}{2} total 2's. The total number of 2's is therefore \frac{n \cdot(n+1)^2}{2} = \frac{n^3+2n^2+n}{2}. Plugging in our answer choices into this formula yields 11 (answer choice \mathrm{(A)}) as the correct answer.

Solution 2

For every divisor d of 10^n, d \le \sqrt{10^n}, we have \log d + \log \frac{10^n}{d} = \log 10^n = n. There are \left \lfloor \frac{(n+1)^2}{2} \right \rfloor divisors of 10^n = 2^n \times 5^n that are \le \sqrt{10^n}. After casework on the parity of n, we find that the answer is given by n \times \frac{(n+1)^2}{2} = 792 \Longrightarrow n = 11\ \mathrm{(A)}.

See Also

2008 AMC 12B (ProblemsResources)
Preceded by
Problem 22
Followed by
Problem 24
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us