| Display title | Cornacchia's algorithm |
| Default sort key | Cornacchia's algorithm |
| Page length (in bytes) | 2,806 |
| Namespace ID | 0 |
| Page ID | 320803 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>QCDvac |
| Date of page creation | 20:47, 8 March 2021 |
| Latest editor | imported>QCDvac |
| Date of latest edit | 20:47, 8 March 2021 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computational number theory, Cornacchia's algorithm is an algorithm for solving the Diophantine equation $ x^{2}+dy^{2}=m $, where $ 1\leq d<m $ and d and m are coprime. The algorithm was described in 1908 by Giuseppe Cornacchia. |
