diff options
| author | Mattias Andrée <maandree@kth.se> | 2016-06-02 13:28:15 +0200 |
|---|---|---|
| committer | Mattias Andrée <maandree@kth.se> | 2016-06-02 13:28:15 +0200 |
| commit | c3ab337dd90f303227a55f4ec935d4cbbc8518c6 (patch) | |
| tree | d8442e03712a8b08c581e9d723edf352e02e3a18 | |
| parent | More on stuff that will not be included (diff) | |
| download | libzahl-c3ab337dd90f303227a55f4ec935d4cbbc8518c6.tar.gz libzahl-c3ab337dd90f303227a55f4ec935d4cbbc8518c6.tar.bz2 libzahl-c3ab337dd90f303227a55f4ec935d4cbbc8518c6.tar.xz | |
Manual: extended gcd calculates two values for free, which most implementations ignore
Signed-off-by: Mattias Andrée <maandree@kth.se>
Diffstat (limited to '')
| -rw-r--r-- | doc/not-implemented.tex | 11 |
1 files changed, 11 insertions, 0 deletions
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} |