Enumerating solutions to π(π)+π(π)=π(π)+π (π)
Open Access
- 12 June 2000
- journal article
- Published byΒ American Mathematical Society (AMS)Β inΒ Mathematics of Computation
- Vol.Β 70 Β (233) , 389-394
- https://doi.org/10.1090/s0025-5718-00-01219-9
Abstract
Letbe polynomials with integer coefficients. This paper presents a fast method, using very little temporary storage, to find all small integerssatisfying. Numerical results include all small solutions to; all small solutions to; and the smallest positive integer that can be written inways as a sum of two coprime cubes.
Keywords
This publication has 20 references indexed in Scilit:
- The Density of Zeros of Forms for which Weak Approximation FailsMathematics of Computation, 1992
- Average-case results on heapsortBIT Numerical Mathematics, 1987
- Solutions of the Diophantine Equation A 4 + B 4 = C 4 + D 4Mathematics of Computation, 1983
- Integer Points on Curves of Genus 1Journal of the London Mathematical Society, 1983
- Integer points and the rank of Thue elliptic curvesInventiones Mathematicae, 1982
- A Survey of Equal Sums of Like PowersMathematics of Computation, 1967
- A Counterexample to Euler's Sum of Powers ConjectureMathematics of Computation, 1967
- AlgorithmsCommunications of the ACM, 1964
- Some solutions of Diophantine equationsMathematical Proceedings of the Cambridge Philosophical Society, 1957
- Eulerβs problem on sums of three fourth powersDuke Mathematical Journal, 1948