Vishalrox said:
Find the sum of : [2^{}0/3] + [2^{}1/3] + [2^{}2/3] + [2^{}3/3] + [2^{}4/3] + ... + [2^{}2008/3]
where [] is the greatest integer function symbol...
if the question is not clear here is the question..
Find the sum of : [(2^0)/3] + [(2^1)/3] + [(2^2)/3] + [(2^3)/3] + ... [(2^2008)/3]
I think i got this one. Compute the first few terms of [2^n/3]
[edit] As Anamitra points out below i confused floor with cieling function, however a slight adjustment fixes the result. THANK YOU ANAMITRA!
0 + 0 + 1 + 2 + 5 + 10 + 21 + 42 + 85 + 170 + 341 + 682 +1365, ...it is clear that this sum has 2009 terms. Group the first 2008 two at a time in order.
(0+0) + (1+2) + (5+10) + (21+42) + (85+170) + (341+682) + ...+ [2^2008/3] it is clear that each sum in parenthesis is 1 less than a power of 4. There are 1004 such sums.
(4^0-1) + (4^1-1) + (4^2-1) + (4^3-1) + (4^4-1) + ...+ (4^1003-1) + [2^2008/3] re-arrange
-1004 + (4^0 + 4^1 + 4^2 + 4^3 + 4^4 + ... + 4^1003) + [2^2008/3]
The sum of consecutive powers of 4, starting at exponent zero up to n is well known, (4^(n+1)-1)/3 i will derive it later.
-1004 + (4^1004-1)/3 + [2^2008/3]
that nasty last expression isn't so nasty if you rewrite it as [4^1004/3] and realize SUBTRACTING 1 from any power of 4 makes it divisible by 3 AND gives the floor of 4^n/3.
-1004 + (4^1004-1)/3 + (4^1004-1)/3 = -1004 + (2(4^1004)-2)/3 = -1004 + (2^2009-2)/3
SUBTRACTING 1 from any even power of 2 makes it divisible by 3 so this gives a whole number
So the final answer is...
(2^2009 - 2)/3 -1004
DERIVATION:
S = 4^0 + 4^1 + 4^2 + ... + 4^n
multiply by 4
4S = 4^1 + 4^2 + 4^3+ ... + 4^n + 4^(n+1)
subtract
4S - S = 4^(n+1) - 1
S = (4^(n+1) -1)/3
P.S. Thanx to Anamitra for pointing out my confusion, from now on let's just call it the floor function to eliminate confusing 'greatest integer' nonsense.
