New on CTAN: luagcd
Date: December 30, 2022 3:39:57 PM CET
Chetan Shirore and Dr. Ajit Kumar submitted the
luagcd
package.
Version number: 1.0
License type: lppl1.3c
Summary description: Computation of gcd of integers inside LaTeX using Lua
Announcement text:
Using Lua, the luagcd package is developed 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.
This package is located at https://mirrors.ctan.org/macros/luatex/latex/luagcd More information is at https://www.ctan.org/pkg/luagcd
Thanks for the upload. For the CTAN Team Manfred Lotz CTAN is run entirely by volunteers and supported by TeX user groups. Please join a user group or donate to one, see https://ctan.org/lugs .
Using Lua, the luagcd package is developed 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.
This package is located at https://mirrors.ctan.org/macros/luatex/latex/luagcd More information is at https://www.ctan.org/pkg/luagcd
Thanks for the upload. For the CTAN Team Manfred Lotz CTAN is run entirely by volunteers and supported by TeX user groups. Please join a user group or donate to one, see https://ctan.org/lugs .
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.
| Package | luagcd |
| Version | 1.1 |
| Maintainer | Chetan Shirore and Ajit Kumar |