Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Cornacchia's algorithm

From MaRDI portal
Publication:1906662
Jump to:navigation, search

zbMath0852.11074MaRDI QIDQ1906662

Abderrahmane Nitaj

Publication date: 25 February 1996

Published in: Expositiones Mathematicae (Search for Journal in Brave)


zbMATH Keywords

continued fractionsalgorithm of Cornacchia


Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Computer solution of Diophantine equations (11Y50) Number-theoretic algorithms; complexity (11Y16) Continued fractions (11A55)


Related Items (3)

Thue's theorem and the diophantine equation $x^2-Dy^2=\pm N$ ⋮ A New Look at an Old Equation ⋮ Implementing the asymptotically fast version of the elliptic curve primality proving algorithm




This page was built for publication: Cornacchia's algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1906662&oldid=14323396"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 14:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki