AMC12每日一题(2001年真题#07)
- 2018-06-06
- 694 人浏览
- 分享
- 收藏
AMC不但是美 国顶尖数学人才的人才库,更为学校提供了解申请入学者在数学科目上的学习成就与表现评估。AMC成功地为许多学生因测验成绩优良而进入理想学校。藉由设计 严谨的试题,达到激发应试者解决问题的能力,培养对数学的兴趣。试题由简至难兼具,使任何程度的学生都能感受到挑战,还可以筛选出特有天赋者。AMC12的主要目的是在刺激学生对数学的兴趣并且透过选择题的方式来开启学生对数学的才能。如果学生能预先练习必定能提高对数学的兴趣,最重要的是学生能集体参与对数学的练习远比一个人独自研读的效果来得好,特别在老师的指导之下,能够学习到如何分配时间解题。参予AMC12的学生应该不难发现测验的问题都很具挑战性,但测验的题型都不会超过学生的学习范围。这项测验希望每个考生能从竞赛中享受数学。今天课窝小编为大家整理了AMC12真题练习,希望考生们认真阅读,能够对你的考试有所帮助。

2001 AMC 12竞赛试题/第07题
Problem
How many positive integers not exceeding
are multiples of
or
but not
?
![]()
Solution 1
Out of the numbers
to
four are divisible by
and three by
, counting
twice. Hence
out of these
numbers are multiples of
or
.
The same is obviously true for the numbers
to
for any positive integer
.
Hence out of the numbers
to
there are
numbers that are divisible by
or
. Out of these
, the numbers
,
,
,
,
and
are divisible by
. Therefore in the set
there are precisely
numbers that satisfy all criteria from the problem statement.
Again, the same is obviously true for the set
for any positive integer
.
We have
, hence there are
good numbers among the numbers
to
. At this point we already know that the only answer that is still possible is
, as we only have
numbers left.
By examining the remaining
by hand we can easily find out that exactly
of them match all the criteria, giving us
good numbers. This is correct.
Solution 2
We can solve this problem by finding the cases where the number is divisible by
or
, then subtract from the cases where none of those cases divide
. To solve the ways the numbers divide
or
we find the cases where a number is divisible by
and
as separate cases. We apply the floor function to every case to get
,
, and
. The first two floor functions were for calculating the number of individual cases for
and
. The third case was to find any overlapping numbers. The numbers were
,
, and
, respectively. We add the first two terms and subtract the third to get
. The first case is finished.
The second case is more or less the same, except we are applying
and
to
. We must find the cases where the first case over counts multiples of five. Utilizing the floor function again on the fractions
,
, and
yields the numbers
,
, and
. The first two numbers counted all the numbers that were multiples of either four with five or three with five less than
. The third counted the overlapping cases, which we must subtract from the sum of the first two. We do this to reach
. Subtracting this number from the original
numbers procures
.
Solution 3
First find the number of such numbers between 1 and 2000 (inclusive) and then add one to this result because 2001 is a multiple of 3.
There are
numbers that are not multiples of
.
are not multiples of
or
, so
numbers are.![]()
Solution 4
Take a good-sized sample of consecutive integers; for example, the first 25 positive integers. Determine that the numbers 3, 4, 6, 8, 12, 16, 18, 21, and 24 exhibit the properties given in the question. 25 is a divisor of 2000, so there are
numbers satisfying the given conditions between 1 and 2000. Since 2001 is a multiple of 3, add 1 to 800 to get
.
以上就是课窝考试网为大家带来的有关AMC课程信息,想要获取更多AMC报名信息,AMC数学竞赛,AMC竞赛培训请继续关注课窝哦!
- 上一篇: AMC12每日一题(2000年真题#01)
- 下一篇: AMC12每日一题(2001年真题#08)
本站凡注明原创和署名的文章,未经课窝考试网许可,不得转载。课窝考试网的部分文章素材来自于网络,版权归原作者所有,仅供学习与研究,如果侵权,请提供版权证明,以便尽快删除。
- AMC12数学竞赛考点试题讲解(四) 2020.04.02 15:35
- AMC12数学竞赛考点试题讲解(三) 2020.02.13 16:21
- AMC12数学竞赛考点试题讲解(二) 2020.01.15 16:11
- AMC12数学竞赛考点试题讲解(一) 2020.01.14 15:03

