AoPSWiki

Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!

Personal tools

Log in

Search

Toolbox

2002 AMC 12B Problems/Problem 22

From AoPSWiki

Problem

For all integers $n$ greater than $1$ , define $a_n = \frac{1}{\log_n 2002}$ . Let $b = a_2 + a_3 + a_4 + a_5$ and $c = a_{10} + a_{11} + a_{12} + a_{13} + a_{14}$ . Then $b- c$ equals

$\mathrm{(A)}\ -2\qquad\mathrm{(B)}\ -1 \qquad\mathrm{(C)}\ \frac{1}{2002}\qquad\mathrm{(D)}\ \frac{1}{1001}\qquad\mathrm{(E)}...$

Solution

By the change of base formula, $a_n = \frac{1}{\frac{\log 2002}{\log n}} = \left(\frac{1}{\log 2002}\right) \log n$ . Thus $\begin{align*}b- c &= \left(\frac{1}{\log 2002}\right)(\log 2 + \log 3 + \log 4 + \log 5 - \log 10 - \log 11 - \log 12 - ...$

See also

2002 AMC 12B (Problems • Resources)
Preceded by Problem 21	Followed by Problem 23
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

Retrieved from "http://www.artofproblemsolving.com/Wiki/index.php/2002_AMC_12B_Problems/Problem_22"

Category: Introductory Algebra Problems

Add a glimpse of the Art of Problem Solving Forum to your own site!
Click here for details!

© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us