Dear friends, I have a recurrence to solve but I'm lost
T(N)= [T(N-1)]^2. Then I need to develop this recurrence by iteration/expasion. T(n-1)=[(T(N-2)]^2 T(n-2)=[(T(N-3)]^2 T(n-3)=[(T(N-4)]^2 Then T(N)= [T(N-1)]^2 T(N)= [T(N-2)]^4 T(N)= [T(N-3)]^8 T(N)= [T(N-4)]^4 . : T(N)=[T(N-k)]^2^k For T(1) --> N-k=1 --> k=N-1 Then T(N)=[T(1)]^2^N-1 I stop here and don't know how to show the closed form of recurrence. Any suggestions. Thanks. Allysson --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---