2018-08-06 重点归纳
AMC10数学竞赛是美国高中数学竞赛中的一项,是针对高中一年级及初中三年级学生的数学测试,该竞赛开始于2000年,分A赛和B赛,于每年的2月初和2月中举行,学生可任选参加一项即可。不管是对高校申请还是今后在数学领域的发展都极其有利!那么接下来跟随小编来看一下AMC10的官方真题以及官方解答吧:
Cozy the Cat and Dash the Dog are going up a staircase with a certain number of steps. However, instead of walking up the steps one at a time, both Cozy and Dash jump. Cozy goes two steps up with each jump (though if necessary, he will just jump the last step). Dash goes five steps up with each jump (though if necessary, he will just jump the last steps if there are fewer than  steps left). Suppose the Dash takes
steps left). Suppose the Dash takes  fewer jumps than Cozy to reach the top of the staircase. Let
 fewer jumps than Cozy to reach the top of the staircase. Let  denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of
 denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of  ?
?

We can translate this wordy problem into this simple equation:

We will proceed to solve this equation via casework.
Case 1: 
Our equation becomes  , where
, where  Using the fact that
 Using the fact that  is an integer, we quickly find that
 is an integer, we quickly find that  and
and  yield
 yield  and
 and  , respectively.
, respectively.
Case 2: 
Our equation becomes  , where
, where  Using the fact that
 Using the fact that  is an integer, we quickly find that
 is an integer, we quickly find that  yields
 yields  . Summing up we get
. Summing up we get  . The sum of the digits is
. The sum of the digits is  .
.
We know from the problem that Dash goes 3 steps further than Cozy per jump (assuming they aren't within 4 steps from the top). That means that if Dash takes 19 fewer jumps than Cozy to get to the top of the staircase, the staircase must be at least 57 steps high (3*19=57). We then start using guess-and-check:
 steps:
 steps:  jumps for Cozy, and
 jumps for Cozy, and  jumps for Dash, giving a difference of
 jumps for Dash, giving a difference of  jumps.
 jumps.
 steps:
 steps:  jumps for Cozy, and
 jumps for Cozy, and  jumps for Dash, giving a difference of
 jumps for Dash, giving a difference of  jumps.
 jumps.
 steps:
 steps:  jumps for Cozy, and
 jumps for Cozy, and  jumps for Dash, giving a difference of
 jumps for Dash, giving a difference of  jumps.
 jumps.
By the time we test  steps, we notice that when the number of steps exceeds a multiple of
 steps, we notice that when the number of steps exceeds a multiple of  , the difference in jumps increases. So, we have to find the next number that will increase the difference.
, the difference in jumps increases. So, we have to find the next number that will increase the difference.  doesn't because both both Cozy's and Dash's number of jumps increases, but
 doesn't because both both Cozy's and Dash's number of jumps increases, but  does, and
 does, and  .
.  actually gives a difference of 20 jumps, but
 actually gives a difference of 20 jumps, but  goes back down to 19 (because Dash had to take another jump when Cozy didn't). We don't need to go any further because the difference will stay above 19 onward.
 goes back down to 19 (because Dash had to take another jump when Cozy didn't). We don't need to go any further because the difference will stay above 19 onward.
Therefore, the possible numbers of steps in the staircase are  ,
,  , and
, and  , giving a sum of
, giving a sum of  . The sum of those digits is
. The sum of those digits is  , so the answer is
, so the answer is 
We're looking for natural numbers  such that
 such that  .
.
Let's call  . We now have
. We now have  , or
, or
 .
.
Obviously, since  , this will not work for any value under 6. In addition, since obviously
, this will not work for any value under 6. In addition, since obviously  , this will not work for any value over six, so we have
, this will not work for any value over six, so we have  and
 and 
This can be achieved when  and
 and  , or when
, or when  and
 and  .
.
Case One:
We have  and
 and  , so
, so  .
.
Case Two:
We have  and
 and  , so
, so  .
.
We then have  , which has a digit sum of
, which has a digit sum of  .
.
Translate the problem into following equation:

Since  , we have
, we have

i.e.,

We then have  when
 when  or
 or  (dog's last jump has 2 steps and cat's last jump has 1 step), which yields
(dog's last jump has 2 steps and cat's last jump has 1 step), which yields  and
 and  respectively.
 respectively.
Another solution is  when
 when  , which yields
, which yields  .
.
Therefore, with  , the digit sum is
, the digit sum is  .
.
以上就是小编对AMC10数学竞赛试题以及解析的介绍,希望对你有所帮助,更多学习资料请持续关注AMC数学竞赛网!
 
                                            上一篇: 考题22 2015 AMC 10B
下一篇: AMC考试都适合什么年龄段的学生参加?