On small solutions of the general nonsingular quadratic Diophantine equation in five or more unknowns
Published online by Cambridge University Press: 24 October 2008
Extract
Matijaseviê [7] showed in 1970 that the problem of deciding whether an arbitrary Diophantine equation has an integer solution is algorithmically unsolvable. However, in 1972, Siegel [10] provided an algorithm for all equations of degree two.
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 107 , Issue 2 , March 1990 , pp. 197 - 211
- Copyright
- Copyright © Cambridge Philosophical Society 1990
References
REFERENCES
- 2
- Cited by