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 | Pass |
n = 1/9765625;
assert(abs(fifth_root(n)-1/25)<1e-5)
|
3 | Pass |
n = 1/5555;
assert(abs(fifth_root(n)-0.178263811215444)<1e-5)
|
4 | Pass |
n = 1/3125;
assert(abs(fifth_root(n)-1/5)<1e-5)
|
5 | Pass |
n = 1/125;
assert(abs(fifth_root(n)-0.380730787743176)<1e-5)
|
6 | Pass |
n = 1/5;
assert(abs(fifth_root(n)-0.724779663677696)<1e-5)
|
7 | Pass |
n = 1;
assert(abs(fifth_root(n)-1)<1e-5)
|
8 | Pass |
n = 5;
assert(abs(fifth_root(n)-1.37972966146121)<1e-5)
|
9 | Pass |
n = 25;
assert(abs(fifth_root(n)-1.90365393871588)<1e-5)
|
10 | Pass |
n = 50;
assert(abs(fifth_root(n)-2.18672414788656)<1e-5)
|
11 | Pass |
n = 500;
assert(abs(fifth_root(n)-3.46572421577573)<1e-5)
|
12 | Pass |
n = 3125;
assert(abs(fifth_root(n)-5)<1e-5)
|
13 | Pass |
n = 759375;
assert(abs(fifth_root(n)-15)<1e-5)
|
14 | Pass |
n = 9765625;
assert(abs(fifth_root(n)-25)<1e-5)
|
15 | Pass |
n = 312500000;
assert(abs(fifth_root(n)-50)<1e-5)
|
16 | Pass |
n = 75937500000;
assert(abs(fifth_root(n)-150)<1e-5)
|
17 | Pass |
n = 31250000000000;
assert(abs(fifth_root(n)-500)<1e-5)
|
18 | Pass |
n = 52658067346875;
assert(abs(fifth_root(n)-555)<1e-5)
|
686 Solvers
272 Solvers
How long is the longest prime diagonal?
338 Solvers
223 Solvers
277 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!