| 1 |
# The luagcd package |
| 2 |
# version 1.1 |
| 3 |
# Authors: Chetan Shirore and Ajit Kumar |
| 4 |
# Email: [email protected] |
| 5 |
|
| 6 |
# Introduction |
| 7 |
Using Lua, the luagcd package is developed to find the greatest common divisor (gcd) of integers in LaTeX. |
| 8 |
The package provides commands to obtain step-by-step computation of gcd of two integers by using the Euclidean algorithm. |
| 9 |
In addition, the package has the command to express gcd of two integers as a linear combination. |
| 10 |
The Bezout’s Identity can be verified for any two integers using commands in the package. |
| 11 |
No particular environment is required for the use of commands in the package. |
| 12 |
It is written in Lua, and the TeX file has to be compiled with the LuaLaTeX engine. |
| 13 |
|
| 14 |
|
| 15 |
# License |
| 16 |
The luagcd package is released under the LaTeX Project Public License v1.3c or later. |
| 17 |
The complete license text is available at http://www.latex-project.org/lppl.txt. |
| 18 |
It is developed in Lua. |
| 19 |
Lua is available as a certified open-source software. |
| 20 |
Its license is simple and liberal, which is compatible with GPL. |
| 21 |
|
| 22 |
#Installation and Inclusion |
| 23 |
The installation of luagcd package is similar to plain latex package, where the .sty file is in LATEXdirectory of texmf tree. |
| 24 |
The package can be included with \usepackage{luagcd} command in the preamble of the LaTeX document. |
| 25 |
The TeX file is to be compiled using the LuaLaTeX engine. |