Problem 197. Recurrence relation

Created by Tomasz

Solve Later

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

201 Solutions
20 Solvers

Last Solution submitted on Jun 10, 2019

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Franck Dernoncourt on 31 Jan 2012

Maybe you should specify the required precision in the problem description.

Tomasz on 31 Jan 2012

OK, I added a sentence, thanks.

Solution Comments

Solution 118115

1 Comment

1 Comment

Aurelien Queffurust on 24 Jul 2012

different matlab fnction used to solve this problem

Solution 29456

1 Comment

1 Comment

Aurelien Queffurust on 24 Jul 2012

lol ! need a translator for this solution!

Solution 19868

2 Comments

2 Comments

@bmtran (Bryant Tran) on 31 Jan 2012

This solution should provide minimal rounding error since it's done in an essentially symbolic domain and then evaluated at the very end, but it doesn't satisfy the test cases. *sigh*

Tomasz on 31 Jan 2012

The sequence is strictly positive. (Not easy to see, but true). If your pn's get negative at some higher n, you still have the roundoff problem. It would be indeed avoided if the integer calculation within the loop was exact, but the numbers quickly become larger than the 48bit mantissa of a double.

Problem Recent Solvers20

Problem Tags

Problem 197. Recurrence relation

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers20

Suggested Problems

More from this Author7

Problem Tags

Problem 197. Recurrence relation

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers20

Suggested Problems

More from this Author7

Problem Tags

Players