2000 AMC 10 第 1 题

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

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

1.

二〇〇一年,美国将主办国际数学奥林匹克。设 IIMMOO 是互不相同的正整数,且 IMO=2001I \cdot M \cdot O = 2001。那么 I+M+OI + M + O 的最大可能值是多少?

In the year 2001, the United States will host the International Mathematical Olympiad. Let I,I, M,M, and OO be distinct positive integers such that the product IMO=2001.I \cdot M \cdot O = 2001. What is the largest possible value of the sum I+M+O?I + M + O?

2323

5555

9999

111111

671671

答案:E
知识点:质因数分解最优化
难度评级:960
解答:

分解质因数得 2001=32329.2001 = 3 \cdot 23 \cdot 29.

若一个因数是 1,1,另两个因数可能为 (3,667),(3,667), (23,87),(23,87),(29,69).(29,69).它们与 11 的和分别为 671,671, 111,111,99.99.(数对 (1,2001)(1,2001) 会重复因数 1.1.

若没有因数是 1,1,三个质因数必须分别分给三个整数,只能得到 3,23,293,23,29,其和小得多。因此最大可能的和是 1+3+667=671.1 + 3 + 667 = 671.

所以正确答案是 E

Factoring gives 2001=32329.2001 = 3 \cdot 23 \cdot 29.

If one factor is 1,1, the possible pairs for the other two factors are (3,667),(3,667), (23,87),(23,87), and (29,69).(29,69). Their corresponding sums with 11 are 671,671, 111,111, and 99.99. (The pair (1,2001)(1,2001) would repeat the factor 1.1.)

If no factor is 1,1, all three prime factors must be split among the three integers, giving only 3,23,293,23,29 and a much smaller sum. Therefore, the largest possible sum is 1+3+667=671.1 + 3 + 667 = 671.

Thus, the correct answer is E.

完整试卷

其他年份的第 1 题