Cody

Solution 2021949

Submitted on 14 Nov 2019 at 21:27
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
filetext = fileread('fifth_root.m'); assert(isempty(strfind(filetext, '^')),'^ forbidden') assert(isempty(strfind(filetext, 'power')),'power() forbidden') assert(isempty(strfind(filetext, 'mpower')),'mpower() forbidden') assert(isempty(strfind(filetext, 'realpow')),'realpow() forbidden') assert(isempty(strfind(filetext, 'nthroot')),'nthroot() forbidden') assert(isempty(strfind(filetext, 'roots')),'roots() forbidden')

2   Fail
n = 1/9765625; assert(abs(fifth_root(n)-1/25)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

3   Fail
n = 1/5555; assert(abs(fifth_root(n)-0.178263811215444)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

4   Fail
n = 1/3125; assert(abs(fifth_root(n)-1/5)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

5   Fail
n = 1/125; assert(abs(fifth_root(n)-0.380730787743176)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

6   Fail
n = 1/5; assert(abs(fifth_root(n)-0.724779663677696)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

7   Fail
n = 1; assert(abs(fifth_root(n)-1)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

8   Fail
n = 5; assert(abs(fifth_root(n)-1.37972966146121)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

9   Fail
n = 25; assert(abs(fifth_root(n)-1.90365393871588)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

10   Fail
n = 50; assert(abs(fifth_root(n)-2.18672414788656)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

11   Fail
n = 500; assert(abs(fifth_root(n)-3.46572421577573)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

12   Fail
n = 3125; assert(abs(fifth_root(n)-5)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

13   Fail
n = 759375; assert(abs(fifth_root(n)-15)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

14   Fail
n = 9765625; assert(abs(fifth_root(n)-25)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

15   Fail
n = 312500000; assert(abs(fifth_root(n)-50)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

16   Fail
n = 75937500000; assert(abs(fifth_root(n)-150)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

17   Fail
n = 31250000000000; assert(abs(fifth_root(n)-500)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)

18   Fail
n = 52658067346875; assert(abs(fifth_root(n)-555)<1e-5)

Out of memory. The likely cause is an infinite recursion within the program. Error in fifth_root (line 2) for f = sqrt(n)