Can we sum from 1000 to 2000 excluding multiples of 5?
Question
- Prove that the sum of all the integers between m and n inclusive (m,n∈Z+, n>m) is 21(m+n)(n−m+1). Find the sum of all the integers between 1000 and 2000 which are not divisible by 5.
- A geometric series has first term 2 and common ratio 0.95. The sum of the first n terms of the series is denoted by Sn and the sum to infinity is denoted by S. Calculate the least value of n for which S−Sn<1.
Solution
We know that
1+2+…+n=2n(n+1)
. So we can write
m+(m+1)+(m+2)+…+n=(1+2+…+n)−(1+2+…+(m−1))=2n(n+1)−2(m−1)m=2n2+n−m2+m=2(m+n)(n−m+1).
We can calculate this by summing all the integers between
1000
and
2000
, and then subtracting the sum of all those divisible by
5
. By the above formula,
i=1000∑2000i=2(1000+2000)(2000−1000+1)=23000×1001=1501500.
The sum of all numbers between
1000
and
2000
that
are
divisible by
5
can be written as
1000+1005+…b+1995+2000=5×200+5×201+…b+5×400=5×(200+201+…b+400)=5i=200∑400i=25×(200+400)×(400−200+1)=25×600×201=301500.
Hence, the desired sum is
1501500−301500=1200000.
We have
Sn=a1−r1−rn,
where
a=2
and
r=0.95
, and
S=n→∞limSn=1−ra=0.052=40.
We are to find the least value of n for which S−Sn<1; let’s try to solve S−Sn=1.
This gives us 40−21−0.951−0.95n=40−40(1−0.95n)=1, and multiplying out and rearranging gives 0.95n=401⟹n=ln0.95ln(1/40)=71.9...
Thus the value of n that we require is 72.
Alternatively, we could solve 0.95n=401 by taking logs to base 0.95.