How to Install and Uninstall texlive-luagcd Package on openSuSE Tumbleweed
Last updated: December 27,2024
1. Install "texlive-luagcd" package
This guide covers the steps necessary to install texlive-luagcd on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
texlive-luagcd
Copied
2. Uninstall "texlive-luagcd" package
Learn how to uninstall texlive-luagcd on openSuSE Tumbleweed:
$
sudo zypper remove
texlive-luagcd
Copied
3. Information about the texlive-luagcd package on openSuSE Tumbleweed
Information for package texlive-luagcd:
---------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : texlive-luagcd
Version : 2023.208.1.0svn65396-53.3
Arch : noarch
Vendor : openSUSE
Installed Size : 8.6 KiB
Installed : No
Status : not installed
Source package : texlive-specs-o-2023-53.3.src
Upstream URL : https://www.tug.org/texlive/
Summary : Computation of gcd of integers inside LaTeX using Lua
Description :
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.
---------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : texlive-luagcd
Version : 2023.208.1.0svn65396-53.3
Arch : noarch
Vendor : openSUSE
Installed Size : 8.6 KiB
Installed : No
Status : not installed
Source package : texlive-specs-o-2023-53.3.src
Upstream URL : https://www.tug.org/texlive/
Summary : Computation of gcd of integers inside LaTeX using Lua
Description :
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.