2005 AMC 12A 第 21 题

先试着解答 2005 AMC 12A 第 21 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2005 AMC 12A 解答,或核对答案。

所有题目均经美国数学协会(MAA)官方合法授权使用。

21.

有多少个整数有序三元组 (a,b,c)(a, b, c),其中 a≥2a \ge 2、b≥1b \ge 1、c≥0c \ge 0,同时满足 log⁡ab=c2005\log_a b = c^{2005} 和 a+b+c=2005a + b + c = 2005?
How many ordered triples of integers (a,b,c),(a, b, c), with a≥2,a \ge 2, b≥1,b \ge 1, and c≥0,c \ge 0, satisfy both log⁡ab=c2005\log_a b = c^{2005} and a+b+c=2005?a + b + c = 2005?
00
11
22
33
44
答案:C
知识点:对数丢番图方程极限情形界定
小提示:
把第一个条件改写为 b=a(c2005)b = a^{\left(c^{2005}\right)}。
Rewrite the first condition as b=a(c2005)b = a^{\left(c^{2005}\right)}
大提示:
若 c≥2c \ge 2,则 bb 远大于 20052005;只有 c=0c = 0 和 c=1c = 1 可能成立。
If c≥2,c \ge 2, then bb is astronomically larger than 2005;2005; only c=0c = 0 and c=1c = 1 can work
解答:
条件 log⁡ab=c2005\log_a b = c^{2005} 等价于 b=a(c2005)b = a^{\left(c^{2005}\right)}。
若 c≥2c \ge 2,则 b=a(c2005)≥2(22005)b = a^{\left(c^{2005}\right)} \ge 2^{\left(2^{2005}\right)},远大于 20052005,不可能满足 a+b+c=2005a + b + c = 2005。
当 c=0c = 0 时,b=a0=1b = a^0 = 1,且 a+1+0=2005a + 1 + 0 = 2005,得到 (a,b,c)=(2004,1,0)(a, b, c) = (2004, 1, 0)。当 c=1c = 1 时,b=a1=ab = a^1 = a,且 2a+1=20052a + 1 = 2005,得到 (a,b,c)=(1002,1002,1)(a, b, c) = (1002, 1002, 1)。
共有 22 个三元组。
所以正确答案是 C。
The condition log⁡ab=c2005\log_a b = c^{2005} means b=a(c2005).b = a^{\left(c^{2005}\right)}.
If c≥2,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.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.