dtm (
dtm
) wrote
2007-12-12 06:27 pm (UTC)
no subject
The hard bit is getting from the recurrence relation:
t(n) = t(n-1) + t(n-2) + 1
to proving that this sequence is (eventually) bounded by constant multiples of fib(n).
(
3 comments
)
Post a comment in response:
From:
Anonymous
This account has disabled anonymous posting.
OpenID
Identity URL:
Log in?
Dreamwidth account
Account name
Password
Log in?
If you don't have an account you can
create one now
.
Subject
HTML doesn't work in the subject.
Formatting type
Casual HTML
Markdown
Raw HTML
Rich Text Editor
Message
[
Home
|
Post Entry
|
Log in
|
Search
|
Browse Options
|
Site Map
]
no subject
t(n) = t(n-1) + t(n-2) + 1
to proving that this sequence is (eventually) bounded by constant multiples of fib(n).