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 an awesome ramp for a tiny motorcycle stuntman
782 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
653 Solvers
-
Get the length of a given vector
13706 Solvers
-
Moving average (variable kernel length)
138 Solvers
-
Try 1.5.4: Celsius to Fahrenheit
873 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.