Cody

Problem 1977. Power of n ?

Solution 370180

Submitted on 14 Dec 2013 by Muhammad Sarwar
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
%% x = 16; n = 2; y_correct = logical(1); assert(isequal(isnpower(x,n),y_correct))

y = 1

2   Pass
%% x = 243; n = 3; y_correct = logical(1); assert(isequal(isnpower(x,n),y_correct))

y = 1

3   Pass
%% x = 256; n = 4; y_correct = logical(1); assert(isequal(isnpower(x,n),y_correct))

y = 1

4   Pass
%% x = 225; n = 5; y_correct = logical(0); assert(isequal(isnpower(x,n),y_correct))

5   Pass
%% x = 3125; n = 5; y_correct = logical(1); assert(isequal(isnpower(x,n),y_correct))

y = 1

6   Pass
%% x = 1000; n = 10; y_correct = logical(1); assert(isequal(isnpower(x,n),y_correct))

y = 1

Suggested Problems

More from this Author3

Community Treasure Hunt

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

Start Hunting!