2018-09-10 重点归纳
AMC12是针对高中学生的数学测验,该竞赛开始于2000年,分A赛和B赛,于每年的2月初和2月中举行,学生可任选参加一项即可。其主要目的在于激发学生对数学的兴趣,参予AMC12的学生应该不难发现测验的问题都很具挑战性,但测验的题型都不会超过学生的学习范围。这项测验希望每个考生能从竞赛中享受数学。那么接下来跟随小编来看一下AMC12的官方AMC真题以及官方解答吧:
All the numbers  are assigned to the six faces of a cube, one number to each face. For each of the eight vertices of the cube, a product of three numbers is computed, where the three numbers are the numbers assigned to the three faces that include that vertex. What is the greatest possible value of the sum of these eight products?
 are assigned to the six faces of a cube, one number to each face. For each of the eight vertices of the cube, a product of three numbers is computed, where the three numbers are the numbers assigned to the three faces that include that vertex. What is the greatest possible value of the sum of these eight products?

First assign each face the letters  . The sum of the product of the faces is
. The sum of the product of the faces is  . We can factor this into
. We can factor this into  which is the product of the sum of each pair of opposite faces. In order to maximize
 which is the product of the sum of each pair of opposite faces. In order to maximize  we use the numbers
 we use the numbers  or
 or  .
.
We proceed from the factorization in the above solution. By the AM-GM inequality,
![\[\frac{a_1+a_2+a_3}{3}\geq\sqrt[3]{a_1a_2a_3}\]](http://latex.artofproblemsolving.com/a/a/6/aa67eef8049086302c27d7648d8e0d17e704e7dd.png)
Cubing both sides,
![\[\left(\frac{a_1+a_2+a_3}{3}\right)^3\geq{a_1a_2a_3}\]](http://latex.artofproblemsolving.com/2/3/3/233c106eb78fd6060382033db69c868915a0e2ac.png)
Let  ,
,  , and
, and  . Let's substitute in these values.
. Let's substitute in these values.

 is fixed at 27.
 is fixed at 27.

![\[\boxed{\textbf{(D)}\ 729 }\geq{(a+f)(b+c)(d+e)}\]](http://latex.artofproblemsolving.com/2/8/3/283da114e616eca58fa458e4073c4b6772997789.png)
In how many ways can  be written as the sum of an increasing sequence of two or more consecutive positive integers?
 be written as the sum of an increasing sequence of two or more consecutive positive integers?

We proceed with this problem by considering two cases, when: 1) There are an odd number of consecutive numbers, 2) There are an even number of consecutive numbers.
For the first case, we can cleverly choose the convenient form of our sequence to be![\[a-n,\cdots, a-1, a, a+1, \cdots, a+n\]](http://latex.artofproblemsolving.com/7/a/0/7a04526e358b74f6c02e0d6197b3ccfda2b03a8e.png)
because then our sum will just be  . We now have
. We now have![\[(2n+1)a = 345\]](http://latex.artofproblemsolving.com/3/1/1/31121d247e7bb15216675853125c76f8f7916c9d.png) and
and  will have a solution when
 will have a solution when  is an integer, namely when
 is an integer, namely when  is a divisor of 345. We check that
 is a divisor of 345. We check that![\[2n+1 = 3, 5, 15, 23\]](http://latex.artofproblemsolving.com/4/6/e/46e8888ffd22a53e9d54b886173734fb9e0dffda.png) work, and no more, because
work, and no more, because  does not satisfy the requirements of two or more consecutive integers, and when
 does not satisfy the requirements of two or more consecutive integers, and when  equals the next biggest factor,
equals the next biggest factor,  , there must be negative integers in the sequence. Our solutions are
, there must be negative integers in the sequence. Our solutions are  .
.
For the even cases, we choose our sequence to be of the form:![\[a-(n-1), \cdots, a, a+1, \cdots, a+n\]](http://latex.artofproblemsolving.com/d/d/c/ddc4567a8fec244e7d8b199e289a10b2a5730020.png) so the sum is
so the sum is  . In this case, we find our solutions to be
. In this case, we find our solutions to be  .
.
We have found all 7 solutions and our answer is  .
.
The sum from  to
 to  where
 where  and
 and  are integers and
 are integers and  is
 is



Let  and
 and 

If we factor  into all of its factor groups
 into all of its factor groups  we will have several ordered pairs
 we will have several ordered pairs  where
 where 
The number of possible values for  is half the number of factors of
 is half the number of factors of  which is
 which is 
However, we have one extraneous case of  because here,
 because here,  and we have the sum of one consecutive number which is not allowed by the question.
 and we have the sum of one consecutive number which is not allowed by the question.
Thus the answer is 
 .
.
There is a handy formula for this problem: The number of odd factors of 


There are 8 ways to have an increasing sum of positive integers that add to 345. However, we have to subtract one for the case where it is just  . The problem wants two or more consecutive integers.
. The problem wants two or more consecutive integers.
Therefore,  
  .
.
We're dealing with an increasing arithmetic progression of common difference 1. Let  be the number of terms in a summation. Let
 be the number of terms in a summation. Let  be the first term in a summation. The sum of an arithmetic progression is the average of the first term and the last term multiplied by the number of terms. The problem tells us that the sum must be 345.
be the first term in a summation. The sum of an arithmetic progression is the average of the first term and the last term multiplied by the number of terms. The problem tells us that the sum must be 345.

In order to satisfy the constraints of the problem, x and y must be positive integers. Maybe we can make this into a Diophantine thing! In fact, if we just factor out that  ... voilà!
... voilà!
![\[(x)(x+2y-1)=690\]](http://latex.artofproblemsolving.com/a/4/4/a44117688d7aaa614a686a2e82f04c681a342a54.png)
There are 16 possible factor pairs to try (for brevity, I will not enumerate them here). Notice that the expression in the right parenthesis is  more than the expression in the parenthesis on the left.
 more than the expression in the parenthesis on the left.  is at least 1. Thus, the expression in the right parenthesis will always be greater than the expression on the left. This eliminates 8 factor pairs. The problem also says the "increasing sequence" has to have "two or more" terms, so
 is at least 1. Thus, the expression in the right parenthesis will always be greater than the expression on the left. This eliminates 8 factor pairs. The problem also says the "increasing sequence" has to have "two or more" terms, so  . This eliminates the factor pair
. This eliminates the factor pair  . With brief testing, we find that the the other 7 factor pairs produce 7 viable ordered pairs. This means we have found
. With brief testing, we find that the the other 7 factor pairs produce 7 viable ordered pairs. This means we have found  ways to write 345 in the silly way outlined by the problem.
 ways to write 345 in the silly way outlined by the problem.
By the sum of an arithmetic sequence... this ultimately comes to  .
.
Quick testing (would take you roughly a minute)
We see that the first 7values of  that work are
 that work are
 .
.
We see that each one of them works. Hence, the answer is  .
.
以上就是小编对AMC12数学竞赛试题及答案的介绍,希望对你有所帮助,更多学习资料请持续关注AMC数学竞赛网!
 
                                            上一篇: AMC数学竞赛真题2016年12B 17
下一篇: AMC考试都适合什么年龄段的学生参加?