big integer library
git clone git://
Log | Files | Refs | README | LICENSE

commit c3ab337dd90f303227a55f4ec935d4cbbc8518c6
parent aa24c082343e22c743a64919da6e0d5d04e161af
Author: Mattias Andrée <>
Date:   Thu,  2 Jun 2016 13:28:15 +0200

Manual: extended gcd calculates two values for free, which most implementations ignore

Signed-off-by: Mattias Andrée <>

Mdoc/not-implemented.tex | 11+++++++++++
1 file changed, 11 insertions(+), 0 deletions(-)

diff --git a/doc/not-implemented.tex b/doc/not-implemented.tex @@ -65,6 +65,17 @@ extgcd(z_t bézout_coeff_1, z_t bézout_coeff_2, z_t gcd \} \end{alltt} +Perhaps you are asking yourself ``wait a minute, +doesn't the extended Euclidean algorithm only +have three outputs if you include the greatest +common divisor, what is this shenanigans?'' +No\footnote{Well, technically yes, but it calculates +two values for free in the same ways as division +calculates the remainder for free.}, it has five +outputs, most implementations just ignore two of +them. If this confuses you, or you want to know +more about this, I refer you to Wikipeida. + \newpage \section{Least common multiple}