The Student Room Group
Reply 1
If α=1\alpha = 1 then αn=1\alpha^n = 1 for each value of nn, so your sum is 1+1++11 + 1 + \cdots + 1. You just have to work out how many 1s you're adding together.

And to work out what values of M and N it holds for, think about how the formula is derived.

We can fix MM and for each NMN \ge M write SN=n=MNαnS_N = \displaystyle \sum_{n=M}^N \alpha^n. Then:
SN=αM+αM+1++αN1+αNS_N = \alpha^M + \alpha^{M+1} + \cdots + \alpha^{N-1} + \alpha^N

and so:
αSN=αM+1+αM+2++αN+αN+1\alpha S_N = \alpha^{M+1} + \alpha^{M+2} + \cdots + \alpha^{N} + \alpha^{N+1}

You can take one of these away from the other (so loads of terms on the RHS cancel, leaving just two). Rearranging gives you the formula you have. Does this place any condition on M,N? I'll let you decide that for yourself.

[EDIT: Just to clarify a point, if N<MN<M then by definition the sum is zero (e.g. if you're summing the integers from 3 "up to" 1 it doesn't make much sense).]
(edited 13 years ago)

Latest