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

DOI10.2307/2152950zbMATH Open0783.11046OpenAlexW181258777WikidataQ63230142 ScholiaQ63230142MaRDI QIDQ3137464FDOQ3137464

Authors D. R. Heath-Brown, Walter M. Lioen, Herman 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 algorithmvector computercubic diophantine equationHeath-Brown's algorithm

Mathematics Subject Classification ID

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

Recommendations

• On searching for solutions of the Diophantine equation 𝑥³+𝑦³+𝑧³=𝑛
• scientific article; zbMATH DE number 681097
• scientific article; zbMATH DE number 66139
• New sums of three cubes
• On searching for solutions of the Diophantine equation $x^3 + y^3 +2z^3 = n$

Cited In (11)

• New sums of three cubes
• An observation concerning the representation of positive integers as a sum of three cubes
• New integer representations as the sum of three cubes
• On searching for solutions of the Diophantine equation $x^3 + y^3 +2z^3 = n$
• Title not available (Why is no real title available?)
• On searching for solutions of the Diophantine equation 𝑥³+𝑦³+𝑧³=𝑛
• An algorithmic implementation of Runge's method for cubic Diophantine equations
• Power values of power sums: a survey
• Cracking the problem with 33
• Solutions of the Diophantine Equation: x ³ +y ³ +z ³ =k
• Title not available (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137464)