On Solving the Diophantine Equation x 3 + y 3 + z 3 = k on a Vector Computer

DOI10.2307/2152950zbMath0783.11046OpenAlexW181258777WikidataQ63230142 ScholiaQ63230142MaRDI QIDQ3137464

D. R. Heath-Brown, Walter M. Lioen, Herman J. J. te Riele

Publication date: 14 March 1994

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2152950

zbMATH Keywords

Euclidean algorithmcubic diophantine equationvector computerHeath-Brown's algorithm

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Cubic and quartic Diophantine equations (11D25)

Related Items (6)

An observation concerning the representation of positive integers as a sum of three cubes ⋮ New sums of three cubes ⋮ Cracking the problem with 33 ⋮ On searching for solutions of the Diophantine equation 𝑥³+𝑦³+𝑧³=𝑛 ⋮ New integer representations as the sum of three cubes ⋮ On searching for solutions of the Diophantine equation $x^3 + y^3 +2z^3 = n$

This page was built for publication: On Solving the Diophantine Equation x 3 + y 3 + z 3 = k on a Vector Computer