Cody

Problem 1215. Diophantine Equations (Inspired by Project Euler, problem 66)

Solution 1178675

Submitted on 3 May 2017 by Informaton
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 = 2; y_correct = 3; assert(isequal(Diophantine(x),y_correct))
2   Pass
x = 151; y_correct = 1728148040; assert(isequal(Diophantine(x),y_correct))
3   Pass
x = 61; y_correct = 1766319049; assert(isequal(Diophantine(x),y_correct))
4   Pass
x = 66; y_correct = 65; assert(isequal(Diophantine(x),y_correct))
5   Pass
x = 12000; y_correct = 13007560326001; assert(isequal(Diophantine(x),y_correct))
6   Pass
x = 2345; y_correct = 15129001; assert(isequal(Diophantine(x),y_correct))
7   Pass
j=[10:10:90 110:10:200]; v=arrayfun(@(x) Diophantine(j(x)),1:length(j)); y_correct=[19 9 11 19 99 31 251 9 19 21 11 6499 71 49 721 339 161 52021 99]; assert(all(isequal(v,y_correct)))

Suggested Problems

More from this Author80

Community Treasure Hunt

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

Start Hunting!