Difference between revisions of "2016 AMC 10B Problems/Problem 18"

(Solution)
(Dumb 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>
  
==Dumb Solution==
+
==Solution 1==
 
Factor <math>345=3\cdot 5\cdot 23</math>.
 
Factor <math>345=3\cdot 5\cdot 23</math>.
  
Line 14: Line 14:
 
Looking again at the factors of <math>345</math>, the possible values of <math>k</math> are <math>1,3,5</math> with medians <math>(172,173),(57,58),(34,35)</math> respectively.
 
Looking again at the factors of <math>345</math>, the possible values of <math>k</math> are <math>1,3,5</math> with medians <math>(172,173),(57,58),(34,35)</math> respectively.
  
Thus the answer is <math>\textbf{(E) }7</math>.
+
Thus the answer is <math>\textbf{(F) }7</math>.
  
 
==Solution 2==
 
==Solution 2==

Revision as of 20:53, 4 November 2017

Problem

In how many ways can $345$ be written as the sum of an increasing sequence of two or more consecutive positive integers?

$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 7$

Solution 1

Factor $345=3\cdot 5\cdot 23$.

Suppose we take an odd number $k$ of consecutive integers, with the median as $m$. Then $mk=345$ with $\tfrac12k<m$. Looking at the factors of $345$, the possible values of $k$ are $3,5,15,23$ with medians as $115,69,23,15$ respectively.

Suppose instead we take an even number $2k$ of consecutive integers, with median being the average of $m$ and $m+1$. Then $k(2m+1)=345$ with $k\le m$. Looking again at the factors of $345$, the possible values of $k$ are $1,3,5$ with medians $(172,173),(57,58),(34,35)$ respectively.

Thus the answer is $\textbf{(F) }7$.

Solution 2

We have that we need to find consecutive numbers (an arithmetic sequence that increases by $1$) that sums to $345$. This calls for the sum of an arithmetic sequence given that the first term is $k$, the last term is $g$ and with $n$ elements, which is: $\frac {n*(k+g)}{2}$.

So since it is a sequence of $n$ consecutive numbers starting at $k$ and ending at $k+n-1$. We can now substitute $g$ with $k+n-1$. Now we subsittute our new value of $g$ into $\frac {n*(k+g)}{2}$ to get that the sum is $\frac {n*(k+k+n-1)}{2} = 345$.

This simplifies to $\frac {n*(2k+n-1)}{2} = 345$. This gives a nice equation. We multiply out the 2 to get that $n*(2k+n-1)=690$. This leaves us with 2 integers that multiplies to $690$ which leads us to think of factors of $690$. We know the factors of $690$ are: $1,2,3,5,6,10,15,23,30,46,69,115,138,230,345,690$. So through inspection (checking), we see that only $2,3,5,6,10,15$ and $23$ work. This gives us the answer of $\textbf{(E) }7$ ways.

~~jk23541

See Also

2016 AMC 10B (ProblemsAnswer KeyResources)
Preceded by
Problem 17
Followed by
Problem 19
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 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png