How to Install and Uninstall libmath-random-tt800-perl Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: December 28,2024

1. Install "libmath-random-tt800-perl" package

Here is a brief guide to show you how to install libmath-random-tt800-perl on Ubuntu 21.04 (Hirsute Hippo)

$ sudo apt update $ sudo apt install libmath-random-tt800-perl

2. Uninstall "libmath-random-tt800-perl" package

Please follow the step by step instructions below to uninstall libmath-random-tt800-perl on Ubuntu 21.04 (Hirsute Hippo):

$ sudo apt remove libmath-random-tt800-perl $ sudo apt autoclean && sudo apt autoremove

3. Information about the libmath-random-tt800-perl package on Ubuntu 21.04 (Hirsute Hippo)

Package: libmath-random-tt800-perl
Architecture: amd64
Version: 1.01-3build7
Priority: optional
Section: universe/perl
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Perl Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 42
Depends: perl (>= 5.32.0-4), perlapi-5.32.0
Filename: pool/universe/libm/libmath-random-tt800-perl/libmath-random-tt800-perl_1.01-3build7_amd64.deb
Size: 9928
MD5sum: b80ae4822b2a4b269b646224890aa5da
SHA1: b5d116a2e592c546b8688563974b15b190226298
SHA256: 500e5c7ff2e1e449cc1973654e099f4c5a381eb491a97610d4f7dd32b42b3601
SHA512: 1f3a1f06801ad5546fc9c20621fabf37b4ef46166e25375c63b7eb8bc9657e0c991a5bd127774459db9e29df361d4f35b7da0ed95e3a169f166cca97f7bc0735
Homepage: https://metacpan.org/release/Math-Random-TT800/
Description-en: Perl module implementing the TT800 algorithm
Math::Random::TT800 provides an implementation of Makoto Matsumoto and Takuji
Nishimura's pseudorandom number generator (PRNG) algorithm called TT800. It is
similar to some other fantastic PRNG algorithms such as the Mersenne Twister
(see libmath-random-mt-perl) and ISAAC (see libmath-random-isaac-perl). This
particular implementation is particularly notable because it has no external
dependencies aside from Perl itself.
.
The algorithm itself is described in Matsumoto's article published in ACM
Transactions on Modelling and Computer Simulation, Volume 4, Issue 3, 1994,
pages 254-266.
.
This algorithm is similar to the Mersenne Twister algorithm but uses a smaller
array to hold state information (25 elements compared to MT's 624).
Consequently, the period is much smaller - 2^800-1 versus MT's 2^19937-1.
The period of ISAAC is 2^8295 values on average.
Description-md5: b9f910f9c5a8eb0e1b8fad9817bc6d49