luagcd – Computation of gcd of integers inside LaTeX using Lua
Using Lua, the luagcd package is developped to find the greatest common divisor (gcd) of integers in LaTeX. The package provides commands to obtain step-by-step computation of gcd of two integers by using the Euclidean algorithm. In addition, the package has the command to express gcd of two integers as a linear combination. The Bezout's Identity can be verified for any two integers using commands in the package. No particular environment is required for the use of commands in the package. It is written in Lua, and the TeX file has to be compiled with the LuaLaTeX engine.
|Licenses||The LaTeX Project Public License 1.3c|
|Maintainer||Chetan Shirore and Ajit Kumar|
|Contained in||TeX Live as luagcd|
MiKTeX as luagcd
Download the contents of this package in one zip archive (133.3k).
Maybe you are interested in the following packages as well.
- luamathalign: More flexible alignment in amsmath environments
- luatruthtable: Generate truth tables of boolean values in LuaLaTeX
- luaset: Set Operations inside LaTeX documents using Lua
- luasseq: Drawing spectral sequences in LuaLaTeX