[hackers] [libzahl] Manual: extended gcd calculates two values for free, which most implementations ignore || Mattias Andrée

[git]

commit c3ab337dd90f303227a55f4ec935d4cbbc8518c6
Author:     Mattias Andrée <maand...@kth.se>
AuthorDate: Thu Jun 2 13:28:15 2016 +0200
Commit:     Mattias Andrée <maand...@kth.se>
CommitDate: Thu Jun 2 13:28:15 2016 +0200

    Manual: extended gcd calculates two values for free, which most 
implementations ignore
    
    Signed-off-by: Mattias Andrée <maand...@kth.se>

diff --git a/doc/not-implemented.tex b/doc/not-implemented.tex
index aea63fc..3e33c6f 100644
--- 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}