The set of non-negative integers are partitioned into arithmetic sequence with first terms a 1 , a 2 , … , a k , with common differences, d 1 , d 2 , … , d k , respectively. If k = 2 0 1 6 , find d 1 a 1 + d 2 a 2 + ⋯ + d k a k .
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.
Problem Loading...
Note Loading...
Set Loading...
Generalization: d 1 a 1 + d 2 a 2 + . . . + d k a k = 2 k − 1 (MOSP)
Note that the following is true n = 0 ∑ ∞ X a 1 + n d 1 + . . . + n = 0 ∑ ∞ X a k + n d k = n = 0 ∑ ∞ X n which gives us for ∣ X ∣ < 1 , i = 1 ∑ k 1 − X d i X a i i = 1 ∑ k 1 + X + . . . + X d i − 1 X a i = 1 − x 1 = 1 Taking the limit when X → 1 − gives us ∑ d i 1 = 1 .
Consider the second equation,
i = 1 ∑ k 1 + X + . . . + X d i − 1 X a i = 1 taking d x d of both sides gives us i = 1 ∑ k ( 1 + . . . + X d i − 1 ) 2 a i X a i − 1 ( 1 + X + . . . + X d i − 1 ) − X a i ( 1 + 2 X + . . . + ( d i − 1 ) X d i − 2 ) = 0 and taking the limit of X → 1 − gives us i = 1 ∑ k d i 2 a i d i − 2 ( d i − 1 ) ( d i ) i = 1 ∑ k d i a i − 2 d i − 1 ∑ d i a i = 0 = 0 = 2 k − 1 and we are done.