2018-08-06 重点归纳
AMC10数学竞赛是美国高中数学竞赛中的一项,是针对高中一年级及初中三年级学生的数学测试,该竞赛开始于2000年,分A赛和B赛,于每年的2月初和2月中举行,学生可任选参加一项即可。不管是对高校申请还是今后在数学领域的发展都极其有利!那么接下来跟随小编来看一下AMC10的官方真题以及官方解答吧:
Let  be a positive integer greater than 4 such that the decimal representation of
 be a positive integer greater than 4 such that the decimal representation of  ends in
 ends in  zeros and the decimal representation of
 zeros and the decimal representation of  ends in
 ends in  zeros. Let
 zeros. Let  denote the sum of the four least possible values of
 denote the sum of the four least possible values of  . What is the sum of the digits of
. What is the sum of the digits of  ?
?

A trailing zero requires a factor of two and a factor of five. Since factors of two occur more often than factors of five, we can focus on the factors of five. We make a chart of how many trailing zeros factorials have:

We first look at the case when  has
 has  zero and
 zero and  has
 has  zeros. If
 zeros. If  ,
,  has only
 has only  zeros. But for
 zeros. But for  ,
,  has
has  zeros. Thus,
 zeros. Thus,  and
 and  work.
 work.
Secondly, we look at the case when  has
 has  zeros and
 zeros and  has
 has  zeros. If
 zeros. If  ,
,  has only
 has only  zeros. But for
 zeros. But for  ,
,  has
 has  zeros. Thus, the smallest four values of
 zeros. Thus, the smallest four values of  that work are
 that work are  , which sum to
, which sum to  . The sum of the digits of
. The sum of the digits of  is
 is 
By Legendre's Formula and the information given, we have that  .
.
Trivially, it is obvious that  as there is no way that if
 as there is no way that if  ,
,  would have
 would have  times as many zeroes as
 times as many zeroes as  .
.
First, let's plug in the number  We get that
 We get that  , which is obviously not true. Hence,
, which is obviously not true. Hence, 
After several attempts, we realize that the RHS needs  to
 to  more "extra" zeroes than the LHS. Hence,
 more "extra" zeroes than the LHS. Hence,  is greater than a multiple of
 is greater than a multiple of  .
.
Very quickly, we find that the least  are
 are  .
.
 .
.
Aaron the ant walks on the coordinate plane according to the following rules. He starts at the origin  facing to the east and walks one unit, arriving at
 facing to the east and walks one unit, arriving at  . For
. For  , right after arriving at the point
, right after arriving at the point  , if Aaron can turn
, if Aaron can turn  left and walk one unit to an unvisited point
left and walk one unit to an unvisited point  , he does that. Otherwise, he walks one unit straight ahead to reach
, he does that. Otherwise, he walks one unit straight ahead to reach  . Thus the sequence of points continues
. Thus the sequence of points continues  , and so on in a counterclockwise spiral pattern. What is
, and so on in a counterclockwise spiral pattern. What is  ?
?

The first thing we would do is track Aaron's footsteps:
He starts by taking  step East and
 step East and  step North, ending at
 step North, ending at  after
 after  steps and about to head West.
 steps and about to head West.
Then he takes  steps West and
 steps West and  steps South, ending at
 steps South, ending at  ) after
) after  steps, and about to head East.
 steps, and about to head East.
Then he takes  steps East and
 steps East and  steps North, ending at
 steps North, ending at  after
 after  steps, and about to head West.
 steps, and about to head West.
Then he takes  steps West and
 steps West and  steps South, ending at
 steps South, ending at  after
 after  steps, and about to head East.
 steps, and about to head East.
From this pattern, we can notice that for any integer  he's at
 he's at  after
 after  steps, and about to head East. There are
 steps, and about to head East. There are  terms in the sum, with an average value of
 terms in the sum, with an average value of  , so:
, so:
![\[2 + 4 + 6 + ... + 4k = 2k(2k + 1)\]](http://latex.artofproblemsolving.com/a/b/e/abe2c1579bcfaa3d307e00f78ea511e026a2b9d7.png)
If we substitute  into the equation:
 into the equation:  . So he has
. So he has  moves to go. This makes him end up at
 moves to go. This makes him end up at  .
.
We are given that Aaron starts at  , and we note that his net steps follow the pattern of
, and we note that his net steps follow the pattern of  in the
 in the  -direction,
-direction,  in the
 in the  -direction,
-direction,  in the
 in the  -direction,
-direction,  in the
 in the  -direction,
-direction,  in the
 in the  -direction,
-direction,  in the
 in the  -direction, and so on, where we add odd and subtract even.
-direction, and so on, where we add odd and subtract even.
We want  , but it does not work out cleanly. Instead, we get that
, but it does not work out cleanly. Instead, we get that  , which means that there are
, which means that there are  extra steps past adding
 extra steps past adding  in the
 in the  -direction (and the final number we add in the
-direction (and the final number we add in the  -direction is
-direction is  ).
).
So  .
.
We can group  as
 as  .
.
Thus  .
.
Looking at his steps, we see that he walks in a spiral shape. At the  th step, he is on the bottom right corner of the
th step, he is on the bottom right corner of the  square centered on the origin. On the
square centered on the origin. On the  th step, he is on the bottom right corner of the
th step, he is on the bottom right corner of the  square centered at the origin. It seems that the
 square centered at the origin. It seems that the  is the bottom right corner of the
 is the bottom right corner of the  square. This makes sense since, after
 square. This makes sense since, after  , he has been on n^2 dots, including the point
, he has been on n^2 dots, including the point  . Also, this is only for odd
. Also, this is only for odd  , because starting with the
, because starting with the  square, we can only add one extra set of dots to each side, so we cannot get even
 square, we can only add one extra set of dots to each side, so we cannot get even  . Since
. Since  ,
,  is the bottom right corner of the
 is the bottom right corner of the  square. This point is
 square. This point is  over to the right, and therefore
 over to the right, and therefore  down, so
 down, so  . Since
. Since  is
 is  ahead of
 ahead of  , we go back
, we go back spaces to
 spaces to  .
.
A rectangular box measures  , where
, where  ,
,  , and
, and  are integers and
 are integers and  . The volume and the surface area of the box are numerically equal. How many ordered triples
. The volume and the surface area of the box are numerically equal. How many ordered triples  are possible?
 are possible?

The surface area is  , the volume is
, the volume is  , so
, so  .
.
Divide both sides by  , we have:
, we have:
![\[\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=\frac{1}{2}.\]](http://latex.artofproblemsolving.com/7/0/1/7015aa0f25ec791b015812b9ebf3c0429b13bed5.png)
First consider the bound of the variable  . Since
. Since  we have
 we have  , or
, or  .
.
Also note that  , we have
, we have  . Thus,
. Thus,  , so
, so  .
.
So we have  or
 or  .
.
Before the casework, let's consider the possible range for  if
 if  .
.
From  , we have
, we have  . From
. From  , we have
, we have  . Thus
. Thus 
When  ,
,  , so
, so  . The solutions we find are
. The solutions we find are  , for a total of
, for a total of  solutions.
 solutions.
When  ,
,  , so
, so  . The solutions we find are
. The solutions we find are  , for a total of
, for a total of  solutions.
solutions.
When  ,
,  , so
, so  . The only solution in this case is
. The only solution in this case is  .
.
When  ,
,  is forced to be
 is forced to be  , and thus
, and thus  .
.
Thus, our answer is 
Start right after the Solution says  is
 is  . We can say
. We can say  , where
, where  .
.
Notice  that
 that  ! This is our key step. Then we can say
! This is our key step. Then we can say  ,
,  . If we clear the fraction about b and c (do the math), our immediate result is that
. If we clear the fraction about b and c (do the math), our immediate result is that  . Realize also that
. Realize also that  .
.
Now go through cases for  and you end up with the same result. However, now you don't have to guess solutions. For example, when
 and you end up with the same result. However, now you don't have to guess solutions. For example, when  , then
, then  and
 and  .
.
以上就是小编对AMC10数学竞赛试题以及解析的介绍,希望对你有所帮助,更多学习资料请持续关注AMC数学竞赛网!
