# A New Method in the Problem of Three Cubes

@article{Avagyan2017ANM, title={A New Method in the Problem of Three Cubes}, author={Armen Avagyan and Gurgen Dallakyan}, journal={arXiv: Number Theory}, year={2017}, volume={5}, pages={45-56} }

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). Actually, the solution of this problem has close relation with the problem of the sum of three cubes a3 + b3 + c3 = d, since degQ(y) = 0 case coincides with above mentioned problem. It has been considered estimation of possibility of minimization of degQ(y). As a conclusion, for specific values of d… Expand

#### References

SHOWING 1-10 OF 26 REFERENCES

On searching for solutions of the Diophantine equation x3 + y3 +2z3 = n

- Computer Science
- Math. Comput.
- 2000

A new search algorithm to solve the equation x3+y3 + z3 = n for a fixed value of n > 0 is proposed, using several efficient number-theoretic sieves and much faster on average than previous straightforward algorithms. Expand

On searching for solutions of the Diophantine equation x3 + y3 + z3 = n

- Computer Science, Mathematics
- 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. Expand

Rational Points Near Curves and Small Nonzero |x3-y2| via Lattice Reduction

- Mathematics, Computer Science
- ANTS
- 2000

A new algorithm using linear approximation and lattice reduction to efficiently calculate all rational points of small height near a given plane curve C is given, and its proof also yields new estimates on the distribution mod 1 of (cx)3/2 for any positive rational c. Expand

New integer representations as the sum of three cubes

- Mathematics, Computer Science
- Math. Comput.
- 2007

A new algorithm is described for finding integer solutions to x 3 + y 3 + z 3 = k for specific values of k and this is used to find representations forvalues of k for which no solution was previously known, including k = 30 and k = 52. Expand

Tables of solutions of the Diophantine equation x3 + y3

- n, Mathematics of Computation
- 1994

Tables of solutions of the Diophantine equation x3+y3+ z3 = n, Mathematics of Computation

- 1994

elkies@abel.math.harvard.edu > ”x3 + y3 + z3 = d”, 9 July 1996, < nmbrthry@listserv.nodak.edu > via http://listserv.nodak.edu/archives/nmbrthry.html

- 1996

elkies@abel.math.harvard.edu¿ ”x3 + y3 + z3 = d

- 1996