|
COMMENTS
|
The equation x^2 + y^3 = z^7 has several solutions, and some of them involve large integers. The set of primitive integer solutions is finite if we consider the general equation Ax^p + By^q = Cz^r and the relation 1/p + 1/q + 1/r - 1 = 1/2 + 1/3 + 1/7 - 1 < 0 (See Darmon and Grandville link).
Theorem: The primitive integer solutions to x^2 + y^3 = z^7 are the 16 triples: (-1,-1,0),(1,-1,0), (-1,0,1), (1,0,1), (0,1,1), (0,-1,-1) (-3,-2,1), (3,-2,1), (-71,-17,2), (71,-17,2), (-2213459,1414,65), (2213459,1414,65), (-15312283,9262,113), (15312283,9262,113), (-21063928,-76271,17), (21063928,-76271,17).
The proof is given in Darmon and Granville's paper. Remark: there exist other solutions where gcd(x,y,z) <> 1; for example: (8,4,2), (250,25,5), (729,162,9), (832,112,8), (3000,100,10), (3456,288,12), (12250,275,15), (14739,578,17), (19652,289,17).
|
|
MATHEMATICA
|
(* This script is a recomputation of the x>0 solutions, assuming z max is 113 *) r[y_, z_]:= Reduce[x>0 && x^2+y^3==z^7, x, Integers]; Reap[Do[If[(rr=r[y, z]) =!= False, xx = rr[[2]]; If[GCD[xx, y, z] == 1, Print[{xx, y, z}]; Sow[{xx, y, z}]] ]; yy = -y; If[(rr=r[yy, z]) =!= False, xx = rr[[2]]; If[GCD[xx, yy, z]==1, Print[{xx, yy, z}]; Sow[{xx, yy, z}]]], {z, 0, 113}, {y, 0, 10^5}]][[2, 1]] (* Jean-François Alcover, Apr 10 2015 *)
|