Cody

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

Solution 1978410

Submitted on 16 Oct 2019 by kranthi kumar
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
x = 2; y_correct = 3; assert(isequal(Diophantine(x),y_correct))

y = uint64 3

2   Pass
x = 151; y_correct = 1728148040; assert(isequal(Diophantine(x),y_correct))

y = uint64 1728148040

3   Pass
x = 61; y_correct = 1766319049; assert(isequal(Diophantine(x),y_correct))

y = uint64 1766319049

4   Pass
x = 66; y_correct = 65; assert(isequal(Diophantine(x),y_correct))

y = uint64 65

5   Pass
x = 12000; y_correct = 13007560326001; assert(isequal(Diophantine(x),y_correct))

y = uint64 13007560326001

6   Pass
x = 2345; y_correct = 15129001; assert(isequal(Diophantine(x),y_correct))

y = uint64 15129001

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)))

y = uint64 19 y = uint64 9 y = uint64 11 y = uint64 19 y = uint64 99 y = uint64 31 y = uint64 251 y = uint64 9 y = uint64 19 y = uint64 21 y = uint64 11 y = uint64 6499 y = uint64 71 y = uint64 49 y = uint64 721 y = uint64 339 y = uint64 161 y = uint64 52021 y = uint64 99

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!