Difference between revisions of "2016 AMC 10B Problems/Problem 18"
(→Solution) |
(→Solution) |
||
Line 7: | Line 7: | ||
==Solution== | ==Solution== | ||
Let us have two cases, where <math>345</math> is the sum of increasing odd number of numbers and even number of numbers. | Let us have two cases, where <math>345</math> is the sum of increasing odd number of numbers and even number of numbers. | ||
+ | |||
Case 1: Sum of increasing odd number of numbers: | Case 1: Sum of increasing odd number of numbers: | ||
The mean of an arithmetic sequences with an odd number of numbers is the middle term. | The mean of an arithmetic sequences with an odd number of numbers is the middle term. | ||
Line 17: | Line 18: | ||
<math>(23,15),</math>(69,5)and <math>(105,3)</math> | <math>(23,15),</math>(69,5)and <math>(105,3)</math> | ||
Which gives us three possible ways. | Which gives us three possible ways. | ||
+ | |||
Case 2: Sum of increasing even number of numbers: | Case 2: Sum of increasing even number of numbers: | ||
If the first term is <math>x</math> and there are <math>n</math> numbers, this is the following sum: | If the first term is <math>x</math> and there are <math>n</math> numbers, this is the following sum: |
Revision as of 12:13, 21 February 2016
Problem
In how many ways can be written as the sum of an increasing sequence of two or more consecutive positive integers?
Solution
Let us have two cases, where is the sum of increasing odd number of numbers and even number of numbers.
Case 1: Sum of increasing odd number of numbers: The mean of an arithmetic sequences with an odd number of numbers is the middle term. Let us call the middle term , and the number of terms .
We can break down into . Thus our possible are the following: ,,,,(69,5),, However, the erroneous solutions which have negatives or have only 1 term are the following: ,,,, So, we are left with: (69,5)and Which gives us three possible ways.
Case 2: Sum of increasing even number of numbers: If the first term is and there are numbers, this is the following sum:
In this case we have our following (x,n): ,,,,,,, Taking out our erroneous solutions: ,, Which also gives us three ways. Counting our cases: +=,