# New integer representations as the sum of three cubes

```@article{Beck2007NewIR,
title={New integer representations as the sum of three cubes},
author={Michael Beck and Eric Pine and Wayne Tarrant and Kim Yarbrough Jensen},
journal={Math. Comput.},
year={2007},
volume={76},
pages={1683-1690}
}```
• Published 14 March 2007
• Mathematics, Computer Science
• Math. Comput.
We describe a new algorithm for finding integer solutions to x 3 + y 3 + z 3 = k for specific values of k. We use this to find representations for values of k for which no solution was previously known, including k = 30 and k = 52.
12 Citations

## Tables from this paper

New sums of three cubes
• Mathematics
Math. Comput.
• 2009
The search for solutions of the Diophantine equation x 3 + y 3 + z 3 = n for n < 1000 and |x|, |y |, |z| < 10 14 is reported on.
AN OBSERVATION CONCERNING THE REPRESENTATION OF POSITIVE INTEGERS AS A SUM OF THREE CUBES
• Mathematics
• 2021
In recent years there has been significant progress on the problem of representing integers as a sum of three cubes. Most significantly are the relatively new solutions found by Booker and Sutherland
Existential refinement on the search of integer solutions for the diophantine equation \$x^3+y^3+z^3=n\$
• Mathematics
• 2021
We propose a new algorithm, call S.A.M to determinate the existence of the solutions for the equation x 3 + y 3 + z 3 = n for a ﬁxed value n > 0 unknown.
The search of solutions of the Diophantine equation \$x^3 + y^3 + z^3 = k\$ for \$k<1000\$ has been extended with bounds of \$|x|\$, \$|y|\$ and \$|z|\$ up to \$10^{15}\$. The first solution for \$k=74\$ is
A New Method in the Problem of Three Cubes
• Mathematics
• 2017
In the current paper we are seeking P1(y); P2(y); P3(y) with the highest possible degree polynomials with integer coefficients, and Q(y) via the lowest possible degree polynomial, such that = Q(y).
HOW TO SOLVE A DIOPHANTINE EQUATION
We introduce Diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one can solve a specific equation related to numbers occurring several times in
Cracking the problem with 33
• A. Booker
• Mathematics
Research in Number Theory
• 2019
Inspired by the Numberphile video "The uncracked problem with 33" by Tim Browning and Brady Haran, we investigate solutions to \$x^3+y^3+z^3=k\$ for a few small values of \$k\$. We find the first known
The Heterogeneity of Mathematical Research
If the authors wish to construct formal-logical models of mathematical practices, taking into account the maximum of detail, then it is a wise strategy to see mathematics as a heterogeneous entity, according to the core thesis of this contribution.
Sums of integer cubes
• S. Siksek
• Medicine
Proceedings of the National Academy of Sciences
• 2021

## References

SHOWING 1-10 OF 43 REFERENCES
A Note on the Diophantine Equation: x n + y n + z n = 3
• Mathematics
• 1984
In this note solutions for the Diophantine equation 3 v3 + 9 = 3 are sought along planes x + v + z = 3m, m E Z. This was done for Iml < 50000, and no new solutions were found.
In this paper we study the Diophantine equation x 4 i 6x 2 y 2 + 5y 4 = 16Fni1Fn+1, where (Fn) n¸0 is the Fibonacci sequence and we find a class of such equations having solutions which are
On searching for solutions of the Diophantine equation x3 + y3 + z3 = n
• Mathematics, Computer Science
Math. Comput.
• 1997
A new search algorithm to solve the equation x 3 + y 3 + z 3 = n for a fixed value of n > 0.5 is proposed, using several efficient number-theoretic sieves and much faster on average than previous straightforward algorithms.
Algorithmic Number Theory
• W. Bosma
• Mathematics, Computer Science
Lecture Notes in Computer Science
• 2000
Ajtai’s worstcase/average-case connections for the shortest vector problem, similar results for the closest vector problem and short basis problem, NP-hardness and non-NP- hardness, transference theorems between primal and dual lattices, and application to secure cryptography are discussed.
A Note on the Diophantine Equation x 3 + y 3 + z 3 = 3
Any integral solution of the title equation has x =y z (9). The report of Scarowsky and Boyarsky [3] that an extensive computer search has failed to turn up any further integral solutions of the
Solutions of the diophantine equation
• Mathematics
• 1964
with the help of the EDSAC computer at Cambridge University; their results are tabulated in [1]. Mordell's original interest in this equation centered on the case d = 3 ; in particular, he wanted to
Introduction to Analytic and Probabilistic Number Theory
Foreword Notation Part I. Elementary Methods: Some tools from real analysis 1. Prime numbers 2. Arithmetic functions 3. Average orders 4. Sieve methods 5. Extremal orders 6. The method of van der
A note on diophantine equation
In this note we prove that the equation k 2
(1) Proceedings of the London Mathematical Society (2) Journal of the London Mathematical Society
THE London Mathematical Society now issues its transactions in two volumes a year, the Proceedings and the Journal. Vol. 25 of the Proceedings contains 31 technical papers on various branches of
A new iterative method in Waring's problem
On introduit une nouvelle methode iterative dans le probleme de Waring. On ameliore toutes les bornes superieures anterieures pour G(k) lorsque k est superieur ou egal a 5