Re: closed form for T(n) = c^n + T(n-1)
- From: Daniel Cer <cer@xxxxxxxxxxxxxxxx>
- Date: Sat, 11 Feb 2006 08:58:48 +0000
T(0) = a
T(n) = c^n + T(n-1)
Of course, when c is 2, T(n) = (a)*2^n. But, is there a general closed form for arbitrary c, or at least for when c is an arbitrary positive integer?
Sorry, I just noticed a cognitive misfire in my original post. When c is 2, the closed form is: T(n) = a*2^(n+1) - a
-Dan
.
- Follow-Ups:
- Re: closed form for T(n) = c^n + T(n-1)
- From: David Kinny
- Re: closed form for T(n) = c^n + T(n-1)
- References:
- closed form for T(n) = c^n + T(n-1)
- From: Daniel Cer
- closed form for T(n) = c^n + T(n-1)
- Prev by Date: ZFC IS INCONSISTENT
- Next by Date: Re: closed form for T(n) = c^n + T(n-1)
- Previous by thread: closed form for T(n) = c^n + T(n-1)
- Next by thread: Re: closed form for T(n) = c^n + T(n-1)
- Index(es):
