Problem 42829. Number construction III

Solution 885260

Submitted on 3 May 2016 by LY Cao

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

Test	Status	Code Input and Output
1	Pass	n = 100; [a b c] = numcons(n); assert(all([a b c]==0))
2	Pass	n = 888; [a b c] = numcons(n); assert(all([a b c]==0))
3	Pass	n = 19666; [a b c] = numcons(n); assert(all([a b c]==0))
4	Pass	n = 314159; [a b c] = numcons(n); assert(all([a b c]==0))
5	Pass	n = 1100; [a b c] = numcons(n); assert(all(mod([a b c],1)==0)) assert(all([a b c]>1)) assert(a^1.5+b^2.5+c^3.5==n)
6	Pass	n = 116600; [a b c] = numcons(n); assert(all(mod([a b c],1)==0)) assert(all([a b c]>1)) assert(a^1.5+b^2.5+c^3.5==n)
7	Pass	n = 16999; [a b c] = numcons(n); assert(all(mod([a b c],1)==0)) assert(all([a b c]>1)) assert(a^1.5+b^2.5+c^3.5==n)
8	Pass	n = 10000040; [a b c] = numcons(n); assert(all(mod([a b c],1)==0)) assert(all([a b c]>1)) assert(a^1.5+b^2.5+c^3.5==n)
9	Pass	n = 94940; [a b c] = numcons(n); assert(all(mod([a b c],1)==0)) assert(all([a b c]>1)) assert(a^1.5+b^2.5+c^3.5==n)
10	Pass	n = 9990; [a b c] = numcons(n); assert(all(mod([a b c],1)==0)) assert(all([a b c]>1)) assert(a^1.5+b^2.5+c^3.5==n)

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

Start Hunting!