-1

solve the following full-history recurrence relation T(n) =max{T(i)} where T(1) = 1

flag
1 
 What's i? What's T(2)? What did you try? – Eric Tressler Sep 17 2010 at 7:44
I suppose it's obvious, but you should still indicate the set i ranges over in max{T(i)}. – Ricky Demer Sep 17 2010 at 7:45
2 
 Please read the FAQ mathoverflow.net/faq for some explanation of the kinds of question preferred on this site, and how to go about asking a question. – Yemon Choi Sep 17 2010 at 7:45
4 
 This looks like homework. It certainly isn't a research-level question. – Per Vognsen Sep 17 2010 at 7:45

closed as too localized by Andrew Stacey, Yemon Choi, Sergei Ivanov, Daniel Moskovich, David Speyer Sep 17 2010 at 11:16

Browse other questions tagged or ask your own question.