Question

How many ordered triples of integers $(a, b, c),$ with $a \ge 2,$ $b \ge 1,$ and $c \ge 0,$ satisfy both $\log_a b = c^{2005}$ and $a + b + c = 2005?$

$0$

$1$

$2$

$3$

$4$

Answer: C

Concepts:logarithm Diophantine Equation bounding to limit cases

Difficulty rating: 2440

Solution:

The condition $\log_a b = c^{2005}$ means $b = a^{\left(c^{2005}\right)}.$

If $c \ge 2,$ then $b = a^{\left(c^{2005}\right)} \ge 2^{\left(2^{2005}\right)},$ which vastly exceeds $2005,$ so $a + b + c = 2005$ is impossible.

For $c = 0:$ $b = a^0 = 1,$ so $a + 1 + 0 = 2005$ gives $(a, b, c) = (2004, 1, 0).$ For $c = 1:$ $b = a^1 = a,$ so $2a + 1 = 2005$ gives $(a, b, c) = (1002, 1002, 1).$

There are $2$ such triples.

Thus, the correct answer is C.

2005 AMC 12A Problem 21

Answer: C

Difficulty rating: 2440

Solution:

Problem 21 in Other Years