olymmath

AMC 12 2002b Problem 22

  • Paper

For all integers nn greater than 11, define an=1log⁡n2002a_n = \frac{1}{\log_n 2002}. Let b=a2+a3+a4+a5b = a_2 + a_3 + a_4 + a_5 and c=a10+a11+a12+a13+a14c = a_{10} + a_{11} + a_{12} + a_{13} + a_{14}. Then b−cb- c equals

(A) −2(B) −1(C) 12002(D) 11001(E) 12\mathrm{(A)}\ -2 \mathrm{(B)}\ -1 \mathrm{(C)}\ \frac{1}{2002} \mathrm{(D)}\ \frac{1}{1001} \mathrm{(E)}\ \frac 12

Dataset text AMC 12 2000 to 2025. Quoted with source.

Show the answer

B

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 amc12/2002b/p22 · Tag AYNEPNKG7E · Edit this page on GitHub · Keys: j next, k previous