CTAN Comprehensive TeX Archive Network

luagcd – Computation of gcd of integers inside using Lua

Using Lua, the luagcd package is developped to find the greatest common divisor (gcd) of integers in . 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 file has to be compiled with the Lua engine.

LicensesThe Project Public License 1.3c
MaintainerChetan Shirore and Ajit Kumar
Contained inTeX Live as luagcd
MiKTeX as luagcd

Download the contents of this package in one zip archive (88.7k).

Community Comments



Here you can see a respective diagram in newer browsers.


Guest Book Sitemap Contact Contact Author