Can we find the sum of the integers from 2k to 4k inclusive?
Question
- The positive integer k is given. Find, in terms of k, an expression for S1, the sum of the integers from 2k to 4k inclusive. Find, in terms of k, an expression for S2, the sum of the odd integers lying between 2k and 4k. Show that S2S1=2+k1.
- Prove that the sum of the first n terms of the geometric progression having first term a and common ratio r (r=1) is a(1−r1−rn). By regarding the recurring decimal 0.0˙75˙ (=0.075075…c, where the figures 075 repeat) as an infinite geometric progression, or otherwise, obtain the value of the decimal as a fraction in its lowest terms.
Suggestion
Is there a convenient way of dividing up these sums into smaller sums that are easier to deal with?
Can we use the fact that the kth term in this geometric progression has the form a×rk−1?
If we call the sum of the first n terms Tn, do you notice anything about the terms in r×Tn?
What’s the first term of the geometric progression? What’s the common ratio?
Solution
Approach 1
We could add together the integers
2k
,
2k+1
,
…c
,
4k
excluding
3k
in pairs as follows:
2k+4k(2k+1)+(4k−1)⋮(3k−1)+(3k+1)=6k=6k=6k.
And there are k of these pairs in total.
So to add the numbers between 2k and 4k inclusive, we can add k pairs that add to 6k, together with 3k, that is, S1=6k2+3k.
Approach 2
We could use the fact that the sum of the integers from 1 to n is Pn=2n(n+1).
So we want to find P4k−P2k−1.
We have
S1=P4k−P2k−1=21(4k)(4k+1)−21(2k−1)(2k)=6k2+3k.
The idea behind the first approach above can be used again for (a)(ii).
Approach 1
If
k
is even, we can add the odd integers between
2k
and
4k
in
k/2
pairs that add to
6k
:
(2k+1)+(4k−1)(2k+3)+(4k−3)⋮(3k−1)+(3k+1)=6k=6k=6k.
So
S2=6k×2k=3k2.
We can use exactly the same approach if k is odd, only this time the odd integers between 2k and 4k consist of (k−1)/2 pairs that add to 6k, together with 3k=6k/2.
So once again S2=3k2.
Approach 2
We need (2k+1)+(2k+3)+⋯+(4k−1), or (2k+1)+(2k+3)+⋯+(2k+(2k−1)).
This is an arithmetic sequence with k terms, so for the formula, n=k, d=2 and a=2k+1.
The sum is therefore 2n(2a+(n−1)d)=2k(4k+2+2(k−1))=k(3k)=3k2.
We have
S2S1=3k26k2+3k=2+k1.
The sum of the first n terms of a geometric progression is Tn=a+ar+ar2+⋯+arn−1.
Now notice that r×Tn=ar+ar2+⋯+arn−1+arn.
Subtracting, most of the terms cancel out so that
(1−r)Tn⟹Tn=a−arn=(1−r)a(1−rn).
By regarding the recurring decimal 0.0˙75˙ (=0.075075…, where the figures 075 repeat) as an infinite geometric progression, or otherwise, obtain the value of the decimal as a fraction in its lowest terms.
Now 0.075075… can be written as the sum of a geometric progression with first term 0.075 and common ratio 0.001.
Using the expression above for the sum of the first n terms, and taking the limit as n→∞, we have Tn→a(1−r1) (since ∣r∣<1, and rn→0 as n→∞).
Substituting in our values of a and r gives 0.0˙75˙=1−0.0010.075=0.9990.075=33325.
Alternatively, let x=0.075075…, so 1000x=75.075075….
Subtracting, we get 999x=75, so x=99975=33325.