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
-
Check to see if a Sudoku Puzzle is Solved
338 Solvers
-
Increment a number, given its digits
683 Solvers
-
the fly, the train, the second train, and their Zeno's paradox
75 Solvers
-
Flip the main diagonal of a matrix
901 Solvers
-
572 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.