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
-
Remove the polynomials that have positive real elements of their roots.
1743 Solvers
-
Count from 0 to N^M in base N.
241 Solvers
-
Create a function handle that reverses the input arguments of another function handle
158 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
462 Solvers
-
390 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.