Cody

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

Solution 1938656

Submitted on 16 Sep 2019
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))

X = 3

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

X = 498062163

Assertion failed.

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

X = 335159612

Assertion failed.

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

X = 65

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

X = 1.9545e+09

Assertion failed.

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

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

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