Difference between revisions of "2016 AMC 12B Problems/Problem 16"
(New solution) |
|||
Line 5: | Line 5: | ||
<math>\textbf{(A)}\ 1\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 7</math> | <math>\textbf{(A)}\ 1\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 7</math> | ||
− | ==Solution== | + | ==Solution 1== |
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. | 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. | ||
Line 58: | Line 58: | ||
Therefore, <math>8-1=</math> <math>\boxed{\textbf{(E)} \,7}</math>. | Therefore, <math>8-1=</math> <math>\boxed{\textbf{(E)} \,7}</math>. | ||
+ | |||
+ | ==Solution 4== | ||
+ | |||
+ | We're dealing with an increasing arithmetic progression of common difference 1. Let <math>x</math> be the number of terms in a summation. Let <math>y</math> 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. | ||
+ | |||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | x \cdot \frac{y+y+[(x-1)1]}{2}&=345 \\ | ||
+ | 2xy+x^2-x&=690 | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | |||
+ | 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 <math>x</math>... voila! | ||
+ | |||
+ | <cmath>(x)(x+2y-1)=690</cmath> | ||
+ | |||
+ | 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 <math>2y-1</math> more than the expression in the parenthesis on the left. <math>y</math> 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 that were just mirrors of the other 8. The problem also says the "increasing sequence" has to have "two or more" terms, so <math>x \geqslant 2</math>. This eliminates the factor pair <math>1 \cdot 690</math>. With brief testing, we find that the the other 7 factor pairs produce 7 viable ordered pairs. This means we have found <math>\boxed{\textbf{(E)}\ 7}</math> ways to write 345 in the silly way outlined by the problem. | ||
+ | |||
==See Also== | ==See Also== | ||
{{AMC12 box|year=2016|ab=B|num-b=15|num-a=17}} | {{AMC12 box|year=2016|ab=B|num-b=15|num-a=17}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 00:55, 4 August 2017
Problem
In how many ways can be written as the sum of an increasing sequence of two or more consecutive positive integers?
Solution 1
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
because then our sum will just be . We now have
and
will have a solution when
is an integer, namely when
is a divisor of 345. We check that
work, and no more, because
does not satisfy the requirements of two or more consecutive integers, and when
equals the next biggest factor,
, there must be negative integers in the sequence. Our solutions are
.
For the even cases, we choose our sequence to be of the form:
so the sum is
. In this case, we find our solutions to be
.
We have found all 7 solutions and our answer is .
Solution 2
The sum from to
where
and
are integers and
is
Let and
If we factor into all of its factor groups
we will have several ordered pairs
where
The number of possible values for is half the number of factors of
which is
However, we have one extraneous case of because here,
and we have the sum of one consecutive number which is not allowed by the question.
Thus the answer is
.
Solution 3
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.
Therefore,
.
Solution 4
We're dealing with an increasing arithmetic progression of common difference 1. 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.
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 ... voila!
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.
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 that were just mirrors of the other 8. The problem also says the "increasing sequence" has to have "two or more" terms, so
. 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
ways to write 345 in the silly way outlined by the problem.
See Also
2016 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 15 |
Followed by Problem 17 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.