summaryrefslogtreecommitdiff
path: root/macros/luatex/latex/luagcd/luagcd.tex
diff options
context:
space:
mode:
Diffstat (limited to 'macros/luatex/latex/luagcd/luagcd.tex')
-rw-r--r--macros/luatex/latex/luagcd/luagcd.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/macros/luatex/latex/luagcd/luagcd.tex b/macros/luatex/latex/luagcd/luagcd.tex
index 980c024589..13fb03402c 100644
--- a/macros/luatex/latex/luagcd/luagcd.tex
+++ b/macros/luatex/latex/luagcd/luagcd.tex
@@ -19,7 +19,7 @@
\usepackage[backend=bibtex]{biblatex}
\begin{document}
\title{The luagcd Package in LaTeX}
-\author{Chetan Shirore and Dr. Ajit Kumar}
+\author{Chetan Shirore\thanks{Email id: mathsbeauty@gmail.com} \space and Ajit Kumar}
\maketitle
\section{Introduction}\label{section:introduction}
Using Lua, the \verb|luagcd| package is developed to find the \textbf{greatest common divisor (gcd)} of integers in LaTeX. It provides an easy way to find gcd of two or more integers inside LaTeX documents. The package provides commands to obtain step-by-step computation of gcd of two integers by using 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.