0 Bewertungen0% fanden dieses Dokument nützlich (0 Abstimmungen)
27 Ansichten14 Seiten
We make more accessible a neglected simple continued fraction based algorithm due to Lagrange, for deciding the solubility of ax2 + bxy + cy2 = n in relatively prime integers x, y. We use a lemma on unimodular matrices that gives a much simpler proof than Lagrange's for the necessity of the existence of a solution.
We make more accessible a neglected simple continued fraction based algorithm due to Lagrange, for deciding the solubility of ax2 + bxy + cy2 = n in relatively prime integers x, y. We use a lemma on unimodular matrices that gives a much simpler proof than Lagrange's for the necessity of the existence of a solution.
Copyright:
Attribution Non-Commercial (BY-NC)
Verfügbare Formate
Als PS, PDF, TXT herunterladen oder online auf Scribd lesen
We make more accessible a neglected simple continued fraction based algorithm due to Lagrange, for deciding the solubility of ax2 + bxy + cy2 = n in relatively prime integers x, y. We use a lemma on unimodular matrices that gives a much simpler proof than Lagrange's for the necessity of the existence of a solution.
Copyright:
Attribution Non-Commercial (BY-NC)
Verfügbare Formate
Als PS, PDF, TXT herunterladen oder online auf Scribd lesen