2005 AMC 12A Problem 21

Below is the professionally curated solution for Problem 21 of the 2005 AMC 12A, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2005 AMC 12A solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:logarithmDiophantine Equationbounding to limit cases

Difficulty rating: 2440

21.

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

00

11

22

33

44

Solution:

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

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

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

There are 22 such triples.

Thus, the correct answer is C.

Problem 21 in Other Years