Re: closed form for T(n) = c^n + T(n-1)

From: "beelzebub" <tarball@xxxxxxxxx>
Date: 13 Feb 2006 14:00:40 -0800

T(0)=a
T(1)=ac + a
T(2)=ac^2 + ac + a
T(n)=ac^n + ac^(n-1) ... + a

This is sum of the geometric progression (a, ac, ac^2, ac^3, ac^n) for
n+1 terms.
This has the closed form (ac^n - a)/(c - 1)

.

References:
- closed form for T(n) = c^n + T(n-1)
  - From: Daniel Cer
- Re: closed form for T(n) = c^n + T(n-1)
  - From: Daniel Cer
- 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)
  - From: Daniel Cer

Prev by Date: Re: Ambuguity of CFG
Next by Date: Make $$Thousands$$ using PayPal and $6
Previous by thread: Re: closed form for T(n) = c^n + T(n-1)
Next by thread: ZFC IS INCONSISTENT
Index(es):
- Date
- Thread