Problem 197. Recurrence relation
A recurrence relation is given by
P(1) := 1 P(n+1) := exp(1) - (n+1)*P(n)
Write a function that, given an integer n, returns P(n). The n will be smaller than 100 in all test-suite problems and an absolute precision of 10*eps (~2e-15, i.e. almost machine precision) is required.
Solution Stats
Problem Comments
-
2 Comments
Franck Dernoncourt
on 31 Jan 2012
Maybe you should specify the required precision in the problem description.
Tomasz
on 31 Jan 2012
OK, I added a sentence, thanks.
Solution Comments
Show commentsProblem Recent Solvers29
Suggested Problems
-
Remove the small words from a list of words.
1559 Solvers
-
Calculate the Levenshtein distance between two strings
1506 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1301 Solvers
-
Given a window, how many subsets of a vector sum positive
869 Solvers
-
1479 Solvers
More from this Author7
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!