2018-08-06 重点归纳
AMC10数学竞赛是美国高中数学竞赛中的一项,是针对高中一年级及初中三年级学生的数学测试,该竞赛开始于2000年,分A赛和B赛,于每年的2月初和2月中举行,学生可任选参加一项即可。不管是对高校申请还是今后在数学领域的发展都极其有利!那么接下来跟随小编来看一下AMC10的官方真题以及官方解答吧:
Let be a positive integer greater than 4 such that the decimal representation of ends in zeros and the decimal representation of ends in zeros. Let denote the sum of the four least possible values 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 zero and has zeros. If , has only zeros. But for , has zeros. Thus, and work.
Secondly, we look at the case when has zeros and has zeros. If , has only zeros. But for , has zeros. Thus, the smallest four values of that work are , which sum to . The sum of the digits of is
By Legendre's Formula and the information given, we have that .
Trivially, it is obvious that as there is no way that if , would have times as many zeroes as .
First, let's plug in the number We get that , which is obviously not true. Hence,
After several attempts, we realize that the RHS needs to more "extra" zeroes than the LHS. Hence, is greater than a multiple of .
Very quickly, we find that the least 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 . For , right after arriving at the point , if Aaron can turn left and walk one unit to an unvisited point , he does that. Otherwise, he walks one unit straight ahead to reach . Thus the sequence of points continues , 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 North, ending at after steps and about to head West.
Then he takes steps West and steps South, ending at ) after steps, and about to head East.
Then he takes steps East and steps North, ending at after steps, and about to head West.
Then he takes steps West and steps South, ending at after steps, and about to head East.
From this pattern, we can notice that for any integer he's at after steps, and about to head East. There are terms in the sum, with an average value of , so:
If we substitute into the equation: . So he has 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 in the -direction, in the -direction, in the -direction, in the -direction, in the -direction, in the -direction, and so on, where we add odd and subtract even.
We want , but it does not work out cleanly. Instead, we get that , which means that there are extra steps past adding in the -direction (and the final number we add in the -direction is ).
So .
We can group 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 square centered on the origin. On the th step, he is on the bottom right corner of the square centered at the origin. It seems that the is the bottom right corner of the square. This makes sense since, after , he has been on n^2 dots, including the point . Also, this is only for odd , because starting with the square, we can only add one extra set of dots to each side, so we cannot get even . Since , is the bottom right corner of the square. This point is over to the right, and therefore down, so . Since is ahead of , we go back spaces to .
A rectangular box measures , where , , and are integers and . The volume and the surface area of the box are numerically equal. How many ordered triples are possible?
The surface area is , the volume is , so .
Divide both sides by , we have:
First consider the bound of the variable . Since we have , or .
Also note that , we have . Thus, , so .
So we have or .
Before the casework, let's consider the possible range for if .
From , we have . From , we have . Thus
When , , so . The solutions we find are , for a total of solutions.
When , , so . The solutions we find are , for a total of solutions.
When , , so . The only solution in this case is .
When , is forced to be , and thus .
Thus, our answer is
Start right after the Solution says is . We can say , where .
Notice that ! 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 . 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 , then and .
以上就是小编对AMC10数学竞赛试题以及解析的介绍,希望对你有所帮助,更多学习资料请持续关注AMC数学竞赛网!