Timeless
Reputation
Next privilege 250 Rep.
 May 14 awarded Caucus Sep 21 awarded Custodian Jun 23 accepted What is the sum of this? Jun 16 reviewed Approve What is the sum of this? Jun 16 asked What is the sum of this? Jun 16 accepted What is the result of sum $\sum\limits_{i=0}^n 2^i$ Jun 15 comment What is the result of sum $\sum\limits_{i=0}^n 2^i$ @talmid I just have a class for time complexity, then I looked at past-year exam paper, there is a question about complexity of Fibonacci recursion, so I was trying to figure out the time complexity of that.thanks so much ! Jun 15 asked What is the result of sum $\sum\limits_{i=0}^n 2^i$ Jun 8 awarded Scholar Jun 8 accepted How to prove that $\mathrm{Fibonacci}(n) \leq n!$, for $n\geq 0$ Jun 8 comment How to prove that $\mathrm{Fibonacci}(n) \leq n!$, for $n\geq 0$ @AymanHourieh Can I say that when we assume that the formula is true for K, the K is actually a infinite loop from current base case to infinite, so when base case is true, we are trying to prove that (base case + 1) is also true, if (base case + 1) is true, then try to prove (base case + 2) is also true. Is it the way to understand it? Please correct me if I'm wrong Jun 8 awarded Supporter Jun 7 comment How to prove that $\mathrm{Fibonacci}(n) \leq n!$, for $n\geq 0$ @AymanHourieh That's elegant.But sorry I have two stupid question : 1) How can we prove something by the assumption like f(k) <= k!. 2) We only assume that f(k) <= k!, why we still can assume that f(k-1) <= (k-1)!. Is prove by induction logically correct? Jun 7 awarded Editor Jun 7 revised How to prove that $\mathrm{Fibonacci}(n) \leq n!$, for $n\geq 0$ added 17 characters in body Jun 6 awarded Student Jun 6 awarded Autobiographer Jun 6 asked How to prove that $\mathrm{Fibonacci}(n) \leq n!$, for $n\geq 0$