Determine the number of sequences of (at least two) consecutive integers whose sum is 100.
Note: The sequence could contain negative integers.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Perfect, same solution here. Except the sum is n k + 2 n ( n − 1 ) , instead of n k + 2 n ( n + 1 )
Let the sum of the consecutive integers be an arithmetic progression with d = 1 . Hence, since the sum of those numbers is equal to 1 0 0 then,
S n = 2 n ⋅ ( a 1 + a n ) ⇒ 1 0 0 = 2 n ⋅ ( 2 ⋅ a 1 + ( n − 1 ) ⋅ d ) , for n > 1 ⇒ n 2 + ( 2 ⋅ a 1 − 1 ) ⋅ n − 2 0 0 = 0 Let's approach this expression as an parametric quadratic equation. Since we are working in the set of integers then both a 1 and n must be integers, which means that the discriminant must be a perfect square of an integer. But, n = 2 1 − 2 ⋅ a 1 ± Δ , so Δ must be a square of an odd number so that n is integer. Thus, Δ = ( 2 ⋅ a 1 − 1 ) 2 + 8 0 0 = ( 2 ⋅ r + 1 ) 2 , for some integer r
⇒ ( 2 ⋅ a 1 − 1 ) 2 − ( 2 ⋅ r + 1 ) 2 = − 8 0 0
⇒ ( − a 1 + r + 1 ) ⋅ ( a 1 + r ) = 2 0 0 = 2 3 ⋅ 5 2
So the possible pairs are:
( ( − a 1 + r + 1 ) , ( a 1 + r ) ) = { ( 1 , 2 0 0 ) , ( 2 , 1 0 0 ) , ( 4 , 5 0 ) , ( 5 , 4 0 ) , ( 8 , 2 5 ) , ( 1 0 , 2 0 ) }
But only the pairs: { ( 1 , 2 0 0 ) , ( 5 , 4 0 ) , ( 8 , 2 5 ) } give integers a 1 , r
1)Pair: ( 1 , 2 0 0 )
( − a + r + 1 ) = 1 , ( a + r ) = 2 0 0 ⇒ a = 1 0 0 , r = 1 0 0
So, n = 1 ∣ ∣ n = − 2 0 0
( − a + r + 1 ) = 2 0 0 , ( a + r ) = 1 ⇒ a = − 9 9 , r = 1 0 0
So, n = 2 0 0 ∣ ∣ n = − 1
2)Pair: ( 5 , 4 0 )
( − a + r + 1 ) = 5 , ( a + r ) = 4 0 ⇒ a = 1 8 , r = 2 2
So, n = 5 ∣ ∣ n = − 4 0
( − a + r + 1 ) = 4 0 , ( a + r ) = 5 ⇒ a = − 1 7 , r = 2 2
So, n = 4 0 ∣ ∣ n = − 5
3)Pair: ( 8 , 2 5 )
( − a + r + 1 ) = 8 , ( a + r ) = 2 5 ⇒ a = 9 , r = 1 6
So, n = 8 ∣ ∣ n = − 2 5
( − a + r + 1 ) = 2 5 , ( a + r ) = 8 ⇒ a = − 8 , r = 1 6
So, n = 2 5 ∣ ∣ n = − 8
From the above values of n we disregard all the negative values and the one where n = 1 because of the restriction n > 1 . If you count them you'll find out 5 correct values, each one refering to a unique arithmetic progression!
a is the leading term of a possible sequence such that a < 1 0 0 ∈ Z
n is the number of terms in that sequence such that n > 1 ∈ Z
The possibilities for the sum of the terms of possible sequences are:
a + ( a + 1 ) = 2 a + 1 = 1 0 0
a + ( a + 1 ) + ( a + 2 ) = 3 a + 3 = 1 0 0
a + ( a + 1 ) + ( a + 2 ) + ( a + 3 ) = 4 a + 6 = 1 0 0
...
Or in general: n a + i = 1 ∑ n − 1 i = 1 0 0 ⇒ n a + 2 n ( n − 1 ) = 1 0 0
⇒ n 2 + ( 2 a − 1 ) n − 2 0 0 = 0
2a-1 is always an odd integer. And since n is also only an integer, this quadric is factorable. To factor this quadratic, there are 6 possible factorizations for 200, and there are two possible sums for each factorization. These sums will give you the possibilities for 2a-1:
1) 1 and 200 ⇒ − 1 + 2 0 0 = 1 9 9 or 1 − 2 0 0 = − 1 9 9
2) 2 and 100 ⇒ − 2 + 1 0 0 = 9 8 or 2 − 1 0 0 = − 9 8
3) 4 and 50 ⇒ − 4 + 5 0 = 4 6 or 4 − 5 0 = − 4 6
4) 5 and 40 ⇒ − 5 + 4 0 = 3 5 or 5 − 4 0 = − 3 5
5) 8 and 25 ⇒ − 8 + 2 5 = 1 7 or 8 − 2 5 = − 1 7
6) 10 and 20 ⇒ − 1 0 + 2 0 = 1 0 or 1 0 − 2 0 = − 1 0
Since 2a-1 must be odd, options 2, 3 and 6 are out. You can now use these sums to solve for a:
1) 2 a − 1 = 1 9 9 ⇒ a = 1 0 0
2) 2 a − 1 = − 1 9 9 ⇒ a = − 9 9
3) 2 a − 1 = 3 5 ⇒ a = 1 8
4) 2 a − 1 = − 3 5 ⇒ a = − 1 7
5) 2 a − 1 = 1 7 ⇒ a = 9
6) 2 a − 1 = − 1 7 ⇒ a = − 8
Since a<100, option 1 is out. By substituting your 5 possible values of 2a-1, you now have 5 quadratics you can solve:
1) n 2 − 1 9 9 n − 2 0 0 = 0 ⇒ n = 2 0 0 , − 1
2) n 2 + 3 5 n − 2 0 0 = 0 ⇒ n = 5 , − 4 0
3) n 2 − 3 5 n − 2 0 0 = 0 ⇒ n = 4 0 , − 5
4) n 2 + 1 7 n − 2 0 0 = 0 ⇒ n = 8 , − 2 5
5) n 2 − 1 7 n − 2 0 0 = 0 ⇒ n = 2 5 , − 8
Since n>1, only one of each pair of n values works, leaving you 5 pairs of answers:
1) A sequence of 200 starting with -99
2) A sequence of 5 starting with 18
3) A sequence of 40 starting with -17
4) A sequence of 8 starting with 9
5) A sequence of 25 starting with -8 □
I start with the fact that k = m + 1 ∑ k = n k = 2 n ( n + 1 ) − 2 m ( m + 1 ) = 1 0 0 . (It is easy to see this for positive integers, but it works for negatives as well.)
Multiply by two and work out the products:
n 2 − m 2 + n − m = 2 0 0 ; ( n − m ) ( n + m + 1 ) = 2 0 0 = 2 3 ⋅ 5 2 .
One of the factors will be even, the other odd. Thus one of the factors will be a power of five. (They cannot be negative.) However, we require n > m ). It is now easy to check all cases:
1 2 3 4 5 6 7 8 |
|
Thus there are 5 of such sequences.
100 = 1×100 = 2×50 = 4×25 = 5×20 = 10×10
If there is an odd factor, we can construct a sequence satisfy the condition.
100×1 : a hundred pairs of "1"
(0 + 1) + (-1 + 2) + (-2 + 3) + ... + (-99 + 100) = -99 + -98 + ... + 99 + 100
4×25 : four pairs of "25"
(12 + 13) + (11 + 14) + (10 + 15) + (9 + 16) = 9 + 10 + ... + 15 + 16
25×4 : twenty five "4" (3 + 5 = two "4")
4 + (3 + 5) + (2 + 6) + (1 + 7) + ... + (-8 + 16) = - 8 - 7 + ... + 15 + 16
5×20 : five "20" (19 + 21 = two "20")
20 + (19 + 21) + (18 + 22) = 18 + 19 + 20 + 21 + 22
20×5 : twenty pairs of "5"
(2 + 3) + (1 + 4) + (0 + 5) + ... + (-17 + 22) = - 17 - 16 + ... + 21 + 22
Problem Loading...
Note Loading...
Set Loading...
Let sequence have n > 1 consecutive integers starting with k + 1 k + 1 + k + 2 + . . . + k + n = n k + 2 n ( n + 1 ) = 1 0 0 2 k = n 2 0 0 − ( n + 1 ) Now n must be a divisor of 2 0 0 and the expression n 2 0 0 − ( n + 1 ) must be even. It's easy to see that just n = 5 , 8 , 2 5 , 4 0 , 2 0 0 work.