
The Library
Gauss' algorithm for the solution of quadratic diophantine equations
Tools
Beynon, Meurig and Iliopoulos, C. S. (Costas S.) (1981) Gauss' algorithm for the solution of quadratic diophantine equations. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)
|
Text
WRAP_Beynon_cs-rr-037.pdf - Published Version Download (6Mb) | Preview |
Abstract
An algorithmic solution to the problem of deciding whether a given
integer is representable by a given binary quadratic form was first
described by Gauss in Disquisitiones Arithmeticae (1801) (reference [G]
below). This solution forms a part of the elementary theory of quadratic
forms as developed by Gauss in Articles 153-222 of [G].
Item Type: | Report | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Library of Congress Subject Headings (LCSH): | Diophantine equations | ||||
Series Name: | Theory of Computation Report | ||||
Publisher: | University of Warwick. Department of Computer Science | ||||
Official Date: | May 1981 | ||||
Dates: |
|
||||
Number: | Number 27 | ||||
Number of Pages: | 29 | ||||
DOI: | CS-RR-037 | ||||
Institution: | University of Warwick | ||||
Theses Department: | Department of Computer Science | ||||
Status: | Not Peer Reviewed | ||||
Publication Status: | Unpublished | ||||
Access rights to Published version: | Open Access (Creative Commons) | ||||
Date of first compliant deposit: | 1 August 2016 | ||||
Date of first compliant Open Access: | 1 August 2016 |
Request changes or add full text files to a record
Repository staff actions (login required)
![]() |
View Item |
Downloads
Downloads per month over past year