Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
filetext = fileread('mPolySym.m');
assert(~contains(filetext,'regexp'))
|
2 | Pass |
r = randi(1000);
x = mPolySym(r);
assert(isempty(x.varnames))
assert(isequal(x.exponents,0))
assert(isequal(x.coefficients,r))
|
3 | Pass |
r = randi(1000);
x = mPolySym('x');
y = r*x;
assert(isequal(y.varnames,"x"))
assert(isequal(y.exponents,1))
assert(isequal(y.coefficients,r))
assert(isequal(r*x,x*r))
|
4 | Pass |
x = mPolySym('x');
y = mPolySym("y");
z = mPolySym('z');
w = x*y*z;
assert(isequal(w.varnames,["x" "y" "z"]))
assert(isequal(w.exponents,[1 1 1]))
assert(isequal(w.coefficients,1))
|
5 | Pass |
m = randi(5);
n = randi(4);
x = mPolySym("x");
y = mPolySym("y");
p = [repmat(x,1,m) repmat(y,1,n)];
p = p(randperm(length(p)));
r = randi(1000);
p_prod = r;
for ii=1:length(p)
p_prod = p_prod*p(ii);
end
s = randi(1000);
p_prod = p_prod*s;
assert(isequal(p_prod.varnames,["x" "y"]))
assert(isequal(p_prod.exponents,[m n]))
assert(isequal(p_prod.coefficients,r*s))
|
298 Solvers
Create One Large Eye of size N x N Quickly?
70 Solvers
Convert from Base 10 to base 5
119 Solvers
76 Solvers
I've got the power! (Inspired by Project Euler problem 29)
75 Solvers