Let c> 1 and g (c) = 1 + c + c 2 + ... + c n .
The first thing to understand is that for some n S (n) = (c
n + 1 - 1) / (c - 1), where S (n) is the sum of the series.
So, we have (c n + 1 - c n ) / (c-1) <= (c n + 1 - 1) / (c - 1) = S (n), since c n > = 1.
So (c n + 1 - c n ) / (c-1) = (c n (c-1)) / (c-1) = c n <= S (n)
Thus, we have S (n)> = c n .
Now that we have found our lower bound, consider the upper bound.
Note that S (n) = (c n + 1 - 1) / (c - 1) <= (c n + 1 ) / (c - 1) = ((c n ) c) / (c -1) .
To just our view of algebra a little, let y = c / (c-1) and substitute it in the above equation.
Therefore, S (n) <= y * c n where y is just some constant, since c ! This is an important observation, because now it is simply a multiple of c n .
So now we have found our upper bound.
Thus, we have c n <= S (n) <= y * c n .
Therefore, S (n) = Ξ (c n ) for c> 1.
source share