Timeline for Upper bound of of fib(n+2)
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 18, 2016 at 11:37 | comment | added | gnasher729 | Many people would consider fib (n+1) as a perfectly fine expression for an upper bound. Even better as it is exact :-) | |
| Nov 18, 2016 at 7:34 | vote | accept | Wawa | ||
| Nov 18, 2016 at 7:34 | vote | accept | Wawa | ||
| Nov 18, 2016 at 7:34 | |||||
| Nov 18, 2016 at 7:03 | history | edited | Wawa | CC BY-SA 3.0 |
deleted 35 characters in body
|
| Nov 16, 2016 at 17:17 | history | tweeted | twitter.com/StackCompSci/status/798937957923176448 | ||
| Nov 16, 2016 at 9:00 | comment | added | Raphael | Welcome to Computer Science! The title you have chosen is not well suited to representing your question. Please take some time to improve it; we have collected some advice here. Thank you! | |
| Nov 16, 2016 at 9:00 | history | edited | Raphael |
edited tags
|
|
| Nov 16, 2016 at 8:09 | answer | added | Yuval Filmus | timeline score: 7 | |
| Nov 16, 2016 at 7:36 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
deleted 229 characters in body
|
| Nov 16, 2016 at 7:14 | answer | added | RE60K | timeline score: 4 | |
| Nov 16, 2016 at 1:35 | answer | added | Lee | timeline score: 8 | |
| Nov 16, 2016 at 0:00 | history | asked | Wawa | CC BY-SA 3.0 |