Perhaps the simplest type of recurrence reduces immediately to a product. The recurrence
an = xnan – 1 for n > 0 with a0 = 1
is equivalent to
- Chapter Two. Recurrence Relations
- from An Introduction to the Analysis of Algorithms, Second Edition
- Publisher: Addison-Wesley Professional
- Released: January 2013
Give a try.