Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Cornacchia's algorithm
open-in-new
<p>In <a href="/facts/Computational_number_theory/7Lu5N57C">computational number theory</a>, Cornacchia's algorithm is an <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> for solving the <a href="/facts/Diophantine_equation/mYaHp7oX">Diophantine equation</a> x 2 + d y 2 = m {\displaystyle x^{2}+dy^{2}=m} , where 1 ≤ d < m {\displaystyle 1\leq d<m} and <i>d</i> and <i>m</i> are <a href="/facts/Coprime/bnCxCXxs">coprime</a>. The algorithm was described in 1908 by Giuseppe Cornacchia. </p>