Problem 292. Infernal Recursion

Solution 34697

Submitted on 9 Feb 2012 by @bmtran (Bryant Tran)

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Alfonso Nieto-Castanon on 9 Feb 2012

that was a photo-finish :)

David Young on 29 Feb 2012

OK for both n=1 and n=2.

Test	Status	Code Input and Output
1	Pass	%% assert(abs(get_recurse(exp(1),pi,5,7/9)-20.066097534719034)<100*eps)
2	Pass	%% assert(abs(get_recurse(1.01,1.02,5,pi)-4.1026063901404743)<100*eps)
3	Pass	%% assert(abs(get_recurse(3.3,1,5,1/2)-1.5647419554132411)<100*eps)
4	Pass	%% assert(abs(get_recurse(8,9,35,5/11)-1.3002291773509134)<1000*eps)
5	Pass	%% assert(abs(get_recurse(2,5,50,10/21)-1.3133198875358512)<1000*eps)
6	Pass	%% assert(abs(get_recurse(1.5,2,600,1/2)-1.8171205928321394)<1000*eps)