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
Solution Comments
Show comments
Loading...
Problem Recent Solvers31
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
53637 Solvers
-
384 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3733 Solvers
-
Replace all zeros and NaNs in a matrix with the string 'error'
104 Solvers
-
Penny flipping - calculate winning probability (easy)
200 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!
Maybe you should specify the required precision in the problem description.
OK, I added a sentence, thanks.