Cody

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

Solution 1972027

Submitted on 11 Oct 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))

y = 3

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

y = 152

Assertion failed.

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

y = 62

Assertion failed.

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

y = 67

Assertion failed.

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

y = 12001

Assertion failed.

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

y = 2346

Assertion failed.

7   Fail
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 = 11 y = 21 y = 31 y = 41 y = 51 y = 61 y = 71 y = 81 y = 91 y = 111 y = 121 y = 131 y = 141 y = 151 y = 161 y = 171 y = 181 y = 191 y = 201

Assertion failed.