2015 AIME II 第 1 题

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

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

1.

NN 是最小的正整数,它既比某个整数少 2222%,又比另一个整数多 1616%。求 NN 除以 10001000 的余数。

Let NN be the least positive integer that is both 2222 percent less than one integer and 1616 percent greater than another integer. Find the remainder when NN is divided by 1000.1000.

答案:131
知识点:百分数整除性最小公倍数
难度评级:2050
解答:

条件说明对某些整数 aabbN=78100a=3950aN = \frac{78}{100}a = \frac{39}{50}aN=116100b=2925bN = \frac{116}{100}b = \frac{29}{25}b。因为 gcd(39,50)=1\gcd(39, 50) = 1,第一个等式迫使 50a50 \mid a,所以 NN3939 的倍数;因为 gcd(29,25)=1\gcd(29, 25) = 1,第二个等式迫使 25b25 \mid b,所以 NN2929 的倍数。

同时被这两个数整除的最小正整数是 N=3929=1131N = 39 \cdot 29 = 1131,取 a=1450a = 1450b=975b = 975 时可以达到。除以 10001000 的余数为 131131

The conditions say N=78100a=3950aN = \frac{78}{100}a = \frac{39}{50}a and N=116100b=2925bN = \frac{116}{100}b = \frac{29}{25}b for some integers aa and b.b. Since gcd(39,50)=1,\gcd(39, 50) = 1, the first equation forces 50a,50 \mid a, so NN is a multiple of 39;39; since gcd(29,25)=1,\gcd(29, 25) = 1, the second forces 25b,25 \mid b, so NN is a multiple of 29.29.

The least positive integer divisible by both is N=3929=1131,N = 39 \cdot 29 = 1131, achieved with a=1450a = 1450 and b=975.b = 975. The remainder upon division by 10001000 is 131.131.

完整试卷

其他年份的第 1 题