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 Solvers29
Suggested Problems
-
Back to basics 8 - Matrix Diagonals
966 Solvers
-
Arrange vector in ascending order
817 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
13659 Solvers
-
I've got the power! (Inspired by Project Euler problem 29)
142 Solvers
-
Replace multiples of 5 with NaN
468 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.