Lagrange's Algorithm Revisited: Solving at 2 + btu + cu 2 = n in the Case of Negative Discriminant

dc.contributor.authorMatthews, Keith
dc.date.accessioned2015-12-07T22:49:44Z
dc.date.available2015-12-07T22:49:44Z
dc.date.issued2014
dc.date.updated2015-12-07T12:12:22Z
dc.description.abstractWe make more accessible a neglected continued fraction algorithm of Lagrange for solving the equation at2 + btu + cu2 = n in relatively prime integers t, u, where a> 0, gcd(a,n) = 1, and D = b2 - 4ac < 0. The cases D = -4 and D = -3 present a consec
dc.identifier.issn1530-7638
dc.identifier.urihttp://hdl.handle.net/1885/26902
dc.publisherUniversity of Waterloo
dc.sourceJournal of Integer Sequences
dc.titleLagrange's Algorithm Revisited: Solving at 2 + btu + cu 2 = n in the Case of Negative Discriminant
dc.typeJournal article
local.bibliographicCitation.issue11
local.bibliographicCitation.lastpage10
local.bibliographicCitation.startpage1
local.contributor.affiliationMatthews, Keith, College of Physical and Mathematical Sciences, ANU
local.contributor.authoruidMatthews, Keith, a176508
local.description.notesImported from ARIES
local.identifier.absfor010101 - Algebra and Number Theory
local.identifier.absseo970101 - Expanding Knowledge in the Mathematical Sciences
local.identifier.ariespublicationu5328909xPUB47
local.identifier.citationvolume17
local.identifier.scopusID2-s2.0-84910048305
local.type.statusPublished Version

Downloads