On searching for solutions of the Diophantine equation $x^3 + y^3 +2z^3 = n$

DOI10.1090/S0025-5718-00-01202-3zbMath0964.11058MaRDI QIDQ4501052

Kenji Koyama

Publication date: 3 September 2000

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

zbMATH Keywords

easier Waring problem

Mathematics Subject Classification ID

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

Cites Work

• On searching for solutions of the Diophantine equation 𝑥³+𝑦³+𝑧³=𝑛
• On Solving the Diophantine Equation x 3 + y 3 + z 3 = k on a Vector Computer
• Nonexistence conditions of a solution for the congruence 𝑥₁^{𝑘}+⋯+𝑥_{𝑠}^{𝑘}≡𝑁(\mod𝑝ⁿ)
• Unsolved problems in number theory
• Unnamed Item
• Unnamed Item