Dear friends,

I'm begginer at algorithm  theory. Then, I'm solving some recurrences.

How can the equation below be true?

(2 summation of lg(n-2i)  from i=0 to [n/2 -1] )

 equal to 

(2 summation of lg(2i) from i=1 to [n/2])

How can I change lg(n-2i) in lg(2i)?

Thanks in advance.

Allysson

--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to