Recurrence relation - MATLAB Cody - MATLAB Central

Problem 197. Recurrence relation

Difficulty:
(6)
Rate

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.

Solve

Solution Stats

19.63% Correct | 80.37% Incorrect
Last Solution submitted on Aug 06, 2024

Problem Comments

Solution Comments

Show comments
Why should you share code?
In a discussion on LInkedin about my recent blog post, Do these...
Mike Croucher in General
1
3
View Post

Problem Recent Solvers27

Suggested Problems

More from this Author7

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!