Math Help Forum: proof of sum

I'm sorry that the thread title isn't descriptive at all, but I didn't know what to name it.

I have to take this sum:
sum from 0 to log base 2 of (n-1) of (n((3/2)^k)) - Wolfram|Alpha

and prove that for every positive integer n that is a power of 2, the sum is:
2(n^(log3/log2) - n)

can anyone help? thanks in advance

Originally Posted by giygaskeptpraying

I'm sorry that the thread title isn't descriptive at all, but I didn't know what to name it.

I have to take this sum:
sum from 0 to log base 2 of (n-1) of (n((3/2)^k)) - Wolfram|Alpha

and prove that for every positive integer n that is a power of 2, the sum is:
2(n^(log3/log2) - n)

can anyone help? thanks in advance

Your sum is:



1. Suppose

2. The sum is not well defined as the upper limit of summation is not an integer, so I suppose it means:



3. The series is a finite geometric series.

CB