One of the most fundamental datatypes in every programming language is the integer type. GAP is no exception.
GAP integers are entered as a sequence of digits optionally preceded
by a + sign for positive integers or a - sign for negative integers.
The size of integers in GAP is only limited by the amount of available
memory, so you can compute with integers having thousands of digits.
gap> -1234;
-1234
gap> 123456789012345678901234567890123456789012345678901234567890;
123456789012345678901234567890123456789012345678901234567890
The first sections in this chapter describe the operations applicable to integers (see Comparisons of Integers, Operations for Integers, QuoInt and RemInt).
The next sections describe the functions that test whether an object is an integer (see IsInt) and convert objects of various types to integers (see Int).
The next sections describe functions related to the ordering of integers (see AbsInt, SignInt).
The next section describes the function that computes a Chinese remainder (see ChineseRem).
The next sections describe the functions related to the ordering of integers, logarithms, and roots (LogInt, RootInt, SmallestRootInt).
The GAP object Integers is the ring domain of all integers. So all
set theoretic functions are also applicable to this domain (see chapter
Domains and Set Functions for Integers). The only serious use of
this however seems to be the generation of random integers.
Since the integers form a Euclidean ring all the ring functions are Ring Functions for Integers, Primes, IsPrimeInt, IsPrimePowerInt, NextPrimeInt, PrevPrimeInt, FactorsInt, DivisorsInt, Sigma, Tau, and MoebiusMu).
Since the integers are naturally embedded in the field of rationals all the field functions are applicable to integers (see chapter Fields and Field Functions for Rationals).
Many more functions that are mainly related to the prime residue group of integers modulo an integer are described in chapter Number Theory.
The external functions are in the file LIBNAME/"integer.g".
GAP 3.4.4