Introduction

The default integer type in Nemo is provided by Flint. The associated ring of integers is represented by the constant parent object called FlintZZ.

For convenience we define

ZZ = FlintZZ

so that integers can be constructed using ZZ instead of FlintZZ. Note that this is the name of a specific parent object, not the name of its type.

The types of the integer ring parent objects and elements of the asociated rings of integers are given in the following table according to the library provding them.

All integer element types belong directly to the abstract type RingElem and all the integer ring parent object types belong to the abstract type Ring.

Integer element constructors

There are various ways to construct integers given an integer ring parent object such as ZZ. As usual, one can coerce various elements into the ring of integers using the parent object. Here are some examples.

ZZ(123)
ZZ("123")
ZZ(123.0)

Note that when coercing from floating point numbers of various kinds, the input must be exactly an integer without fractional part.

Apart from coercing elements into the ring of integers, we offer the following functions.

#Base.zero — Method.

zero(R::FlintIntegerRing)

Return the integer $1$.

source

#Base.one — Method.

one(R::FlintIntegerRing)

Return the integer $1$.

source

Here are some examples of constructing integers.

a = ZZ(123)
b = one(ZZ)
c = zero(ZZ)

Basic functionality

The following basic functionality is provided by the default integer implementation in Nemo, to support construction of generic rings over the integers. Any custom integer implementation in Nemo should provide these functions along with the usual arithmetic operations and greatest common divisor.

parent_type(::Type{fmpz})

Gives the type of the parent object of a Flint integer.

elem_type(R::FlintIntegerRing)

Given the parent object for the integer ring, return the type of elements of the integer ring.

Base.hash(a::fmpz, h::UInt)

Return a UInt hexadecimal hash of the integer $a$. This should be xor'd with a fixed random hexadecimal specific to the integer type. The hash of the machine words used to store the integer should be xor'd with the supplied parameter h as part of computing the hash.

deepcopy(a::fmpz)

Construct a copy of the given integer and return it. This function must recursively construct copies of all of the internal data in the given integer. Nemo integers are mutable and so returning shallow copies is not sufficient.

mul!(c::fmpz, a::fmpz, b::fmpz)

Multiply $a$ by $b$ and set the existing integer $c$ to the result. This function is provided for performance reasons as it saves allocating a new object for the result and eliminates associated garbage collection.

addeq!(c::fmpz, a::fmpz)

In-place addition. Adds $a$ to $c$ and sets $c$ to the result. This function is provided for performance reasons as it saves allocating a new object for the result and eliminates associated garbage collection.

Given the parent object ZZ for the integer ring, the following coercion functions are provided to coerce various elements into the integer ring. Developers provide these by overloading the call operator for the integer ring parent objects.

ZZ()

Coerce zero into the integer ring.

ZZ(n::Integer)

Coerce an integer value into the integer ring.

ZZ(n::String)

Parse the given string as an integer.

ZZ(n::Float64)
ZZ(n::Float32)
ZZ(n::Float16)
ZZ(n::BigFloat)

Coerce the given floating point number into the integer ring, assuming that it can be exactly represented as an integer.

ZZ(f::fmpz)

Take an integer that is already in the Flint integer ring and simply return it. A copy of the original is not made.

In addition to the above, developers of custom integer types must ensure that they provide the equivalent of the function base_ring(R::FlintIntegerRing) which should return Union{}. In addition to this they should ensure that each integer element contains a field parent specifying the parent object of the integer, or at least supply the equivalent of the function parent(a::fmpz) to return the parent object of an integer.

Basic manipulation

Numerous functions are provided to manipulate integers. Also see the section on basic functionality above.

#Nemo.base_ring — Method.

base_ring(a::FlintIntegerRing)

Returns Union{} as this ring is not dependent on another ring.

source

#Nemo.base_ring — Method.

base_ring(a::fmpz)

Returns Union{} as the parent ring is not dependent on another ring.

source

#Base.parent — Method.

parent(a::fmpz)

Returns the unique Flint integer parent object FlintZZ.

source

#Nemo.iszero — Method.

iszero(a::fmpz)

Return true if the given integer is zero, otherwise return false.

source

#Nemo.isone — Method.

isone(a::fmpz)

Return true if the given integer is one, otherwise return false.

source

#Nemo.isunit — Method.

isunit(a::fmpz)

Return true if the given integer is a unit, i.e. $\pm 1$, otherwise return false.

source

#Base.sign — Method.

sign(a::fmpz)

Returns the sign of $a$, i.e. $+1$, $0$ or $-1$.

source

#Base.size — Method.

size(a::fmpz)

Returns the number of limbs required to store the absolute value of $a$.

source

#Nemo.fits — Method.

fits(::Type{UInt}, a::fmpz)

Returns true if the given integer fits into a UInt, otherwise returns false.

source

#Nemo.fits — Method.

fits(::Type{Int}, a::fmpz)

Returns true if the given integer fits into an Int, otherwise returns false.

source

#Base.den — Method.

den(a::fmpz)

Returns the denominator of $a$ thought of as a rational. Always returns $1$.

source

#Base.num — Method.

num(a::fmpz)

Returns the numerator of $a$ thought of as a rational. Always returns $a$.

source

Here are some examples of basic manipulation of integers.

a = ZZ(12)

R = base_ring(ZZ)
S = base_ring(a)
T = parent(a)
iszero(a)
isone(a)
isunit(a)
sign(a)
s = size(a)
fits(Int, a)
n = num(a)
d = den(a)

Arithmetic operations

Nemo provides all the standard ring operations for integers, as follows.

In addition, the following ad hoc ring operations are defined.

Here are some examples of arithmetic operations on integers.

a = fmpz(12)
b = fmpz(3)

c = a + b
d = divexact(a, b)
f = 3a
g = a*ZZ(7)
h = 3 - a
k = divexact(a, 4)
m = a^7

Euclidean division

Nemo also provides a large number of Euclidean division operations. Recall that for a dividend $a$ and divisor $b$, we can write $a = bq + r$ with $0 \leq |r| < |b|$. We call $q$ the quotient and $r$ the remainder.

We distinguish three cases. If $q$ is rounded towards zero, $r$ will have the same sign as $a$. If $q$ is rounded towards plus infinity, $r$ will have the opposite sign to $b$. Finally, if $q$ is rounded towards minus infinity, $r$ will have the same sign as $b$.

In the following table we list the division functions and their rounding behaviour. We also give the return value of the function, with $q$ representing return of the quotient and $r$ representing return of the remainder.

Nemo also offers the following ad hoc division operators. The notation and description is as for the other Euclidean division functions.

The following functions are also available, for the case where one is dividing by a power of $2$. In other words, for Euclidean division of the form $a = b2^{d} + r$. These are useful for bit twiddling.

Here are some examples of Euclidean division.

a = fmpz(12)
b = fmpz(5)

q, r = divrem(a, b)
c = cdiv(a, b)
d = fdiv(a, b)
f = tdivpow2(a, 2)
g = fmodpow2(a, 3)

Comparison

Nemo provides a full complement of comparison operators for integers. This includes the usual $<, >, \leq, \geq, ==, !=$ operators. These are usually provided via Julia once Nemo provides the isless function and the == function. However, to avoid two calls to Flint for such comparisons we implement them differently.

Instead of isless we implement a function cmp(a, b) which returns a positive value if $a > b$, zero if $a == b$ and a negative value if $a < b$. We then implement all the other operators, including == in terms of cmp.

For convenience we also implement a cmpabs(a, b) function which returns a positive value if $|a| > |b|$, zero if $|a| == |b|$ and a negative value if $|a| < |b|$. This can be slightly faster than a call to cmp or one of the comparison operators when comparing nonnegative values for example.

Here is a list of the comparison functions implemented, with the understanding that cmp provides all of the comparison operators listed above.

Function

cmp(a::fmpz, b::fmpz) cmpabs(a::fmpz, b::fmpz)

We also provide the following ad hoc comparisons which again provide all of the comparison operators mentioned above.

Function

cmp(a::fmpz, b::Int) cmp(a::Int, b::fmpz) cmp(a::fmpz, b::UInt) cmp(a::UInt, b::fmpz)

Here are some examples of comparisons.

a = ZZ(12)
b = ZZ(3)

a < b
a != b
a > 4
5 <= b
cmpabs(a, b)

Shifting

#Base.:<< — Method.

<<(x::fmpz, c::Int)

Return $2^cx$ where $c \geq 0$.

source

Base.:>> — Method.

>>(x::fmpz, c::Int)

source

Here are some examples of shifting.

a = fmpz(12)

a << 3
a >> 5

Modular arithmetic

#Base.mod — Method.

mod(x::fmpz, y::fmpz)

Return the remainder after division of $x$ by $y$. The remainder will be the least nonnegative remainder.

source

#Base.mod — Method.

mod(x::fmpz, y::Int)

Return the remainder after division of $x$ by $y$. The remainder will be the least nonnegative remainder.

source

#Nemo.powmod — Method.

powmod(x::fmpz, p::fmpz, m::fmpz)

Return $x^p (\mod m)$. The remainder will be in the range $[0, m)$

source

#Nemo.powmod — Method.

powmod(x::fmpz, p::Int, m::fmpz)

Return $x^p (\mod m)$. The remainder will be in the range $[0, m)$

source

#Base.invmod — Method.

invmod(x::fmpz, m::fmpz)

Return $x^{-1} (\mod m)$. The remainder will be in the range $[0, m)$

source

#Nemo.sqrtmod — Method.

sqrtmod(x::fmpz, m::fmpz)

Return a square root of $x (\mod m)$ if one exists. The remainder will be in the range $[0, m)$. We require that $m$ is prime, otherwise the algorithm may not terminate.

source

#Nemo.crt — Method.

crt(r1::fmpz, m1::fmpz, r2::fmpz, m2::fmpz, signed=false)

Find $r$ such that $r \equiv r_1 (\mod m_1)$ and $r \equiv r_2 (\mod m_2)$. If signed = true, $r$ will be in the range $-m_1m_2/2 < r \leq m_1m_2/2$. If signed = false the value will be in the range $0 \leq r < m_1m_2$.

source

#Nemo.crt — Method.

crt(r1::fmpz, m1::fmpz, r2::Int, m2::Int, signed=false)

Find $r$ such that $r \equiv r_1 (\mod m_1)$ and $r \equiv r_2 (\mod m_2)$. If signed = true, $r$ will be in the range $-m_1m_2/2 < r \leq m_1m_2/2$. If signed = false the value will be in the range $0 \leq r < m_1m_2$.

source

Here are some examples of modular arithmetic.

a = powmod(ZZ(12), ZZ(110), ZZ(13))
a = powmod(ZZ(12), 110, ZZ(13))
b = invmod(ZZ(12), ZZ(13))
c = sqrtmod(ZZ(12), ZZ(13))
d = crt(ZZ(5), ZZ(13), ZZ(7), ZZ(37), true)

Integer logarithm

#Nemo.flog — Method.

flog(x::fmpz, c::fmpz)

Return the floor of the logarithm of $x$ to base $c$.

source

#Nemo.flog — Method.

flog(x::fmpz, c::Int)

Return the floor of the logarithm of $x$ to base $c$.

source

#Nemo.clog — Method.

clog(x::fmpz, c::fmpz)

Return the ceiling of the logarithm of $x$ to base $c$.

source

#Nemo.clog — Method.

clog(x::fmpz, c::Int)

Return the ceiling of the logarithm of $x$ to base $c$.

source

Here are some examples of computing integer logarithms.

a = fmpz(12)
b = fmpz(2)

c = flog(a, b)
d = clog(a, 3)

GCD and LCM

#Base.gcd — Method.

gcd(x::fmpz, y::fmpz)

Return the greatest common divisor of $x$ and $y$. The returned result will always be nonnegative and will be zero iff $x$ and $y$ are zero.

source

#Base.gcd — Method.

gcd(x::Array{fmpz, 1})

Return the greatest common divisor of the elements of $x$. The returned result will always be nonnegative and will be zero iff all elements of $x$ are zero.

source

#Base.lcm — Method.

lcm(x::fmpz, y::fmpz)

Return the least common multiple of $x$ and $y$. The returned result will always be nonnegative and will be zero iff $x$ and $y$ are zero.

source

#Base.lcm — Method.

lcm(x::Array{fmpz, 1})

Return the least common multiple of the elements of $x$. The returned result will always be nonnegative and will be zero iff the elements of $x$ are zero.

source

#Base.gcdx — Method.

gcdx(a::fmpz, b::fmpz)

Return a tuple $g, s, t$ such that $g$ is the greatest common divisor of $a$ and $b$ and integers $s$ and $t$ such that $g = as + bt$.

source

#Nemo.gcdinv — Method.

gcdinv(a::fmpz, b::fmpz)

Return a tuple $g, s$ where $g$ is the greatest common divisor of $a$ and $b$ and where $s$ is the inverse of $a$ modulo $b$ if $g = 1$. This function can be used to detect impossible inverses, i.e. where $a$ and $b$ are not coprime, and to yield the common factor of $a$ and $b$ if they are not coprime. We require $b \geq a \geq 0$.

source

Here are some examples of GCD and LCM.

a = ZZ(3)
b = ZZ(12)

c = gcd(a, b)
d = lcm(a, b)
g, s, t = gcdx(a, b)
g, s = gcdinv(a, b)

Integer roots

#Base.isqrt — Method.

isqrt(x::fmpz)

Return the floor of the square root of $x$.

source

#Nemo.isqrtrem — Method.

isqrtrem(x::fmpz)

Return a tuple $s, r$ consisting of the floor $s$ of the square root of $x$ and the remainder $r$, i.e. such that $x = s^2 + r$. We require $x \geq 0$.

source

#Nemo.root — Method.

root(x::fmpz, n::Int)

Return the floor of the $n$-the root of $x$. We require $n > 0$ and that $x \geq 0$ if $n$ is even.

source

Here are some examples of integer roots.

a = ZZ(13)

b = sqrt(a)
s, r = sqrtrem(a)
c = root(a, 3)

Number theoretic functionality

#Nemo.divisible — Method.

divisible(x::fmpz, y::Int)

Return true if $x$ is divisible by $y$, otherwise return false. We require $x \neq 0$.

source

#Nemo.divisible — Method.

divisible(x::fmpz, y::fmpz)

Return true if $x$ is divisible by $y$, otherwise return false. We require $x \neq 0$.

source

#Nemo.issquare — Method.

issquare(x::fmpz)

Return true if $x$ is a square, otherwise return false.

source

isprime(::UInt)
isprime(::fmpz)

#Nemo.isprobabprime — Method.

isprobabprime(x::fmpz)

Return true if $x$ is a very probably a prime number, otherwise return false. No counterexamples are known to this test, but it is conjectured that infinitely many exist.

source

factor(::fmpz)

remove(::fmpz, y:fmpz)

#Nemo.divisor_lenstra — Method.

divisor_lenstra(n::fmpz, r::fmpz, m::fmpz)

If $n$ has a factor which lies in the residue class $r (\mod m)$ for $0 < r < m < n$, this function returns such a factor. Otherwise it returns $0$. This is only efficient if $m$ is at least the cube root of $n$. We require gcd$(r, m) = 1$ and this condition is not checked.

source

#Nemo.fac — Method.

fac(x::Int)

Return the factorial of $x$, i.e. $x! = 1.2.3\ldots x$. We require $x \geq 0$.

source

#Nemo.risingfac — Method.

risingfac(x::fmpz, y::Int)

Return the rising factorial of $x$, i.e. $x(x + 1)(x + 2)\ldots (x + n - 1)$. If $n < 0$ we throw a DomainError().

source

#Nemo.risingfac — Method.

risingfac(x::Int, y::Int)

Return the rising factorial of $x$, i.e. $x(x + 1)(x + 2)\ldots (x + n - 1)$. If $n < 0$ we throw a DomainError().

source

#Nemo.primorial — Method.

primorial(x::Int)

Return the primorial of $n$, i.e. the product of all primes less than or equal to $n$. If $n < 0$ we throw a DomainError().

source

#Nemo.fib — Method.

fib(x::Int)

Return the $n$-th Fibonacci number $F_n$. We define $F_1 = 1$, $F_2 = 1$ and $F_{i + 1} = F_i + F_{i - 1}$ for all $i > 2$. We require $n \geq 0$. For convenience, we define $F_0 = 0$.

source

#Nemo.bell — Method.

bell(x::Int)

Return the Bell number $B_n$.

source

#Nemo.binom — Method.

binom(n::Int, k::Int)

Return the binomial coefficient $\frac{n!}{(n - k)!k!}$. If $n, k < 0$ or $k > n$ we return $0$.

source

#Nemo.moebiusmu — Method.

moebiusmu(x::fmpz)

Returns the Moebius mu function of $x$ as an \code{Int}. The value returned is either $-1$, $0$ or $1$. If $x < 0$ we throw a DomainError().

source

#Nemo.jacobi — Method.

jacobi(x::fmpz, y::fmpz)

Return the value of the Jacobi symbol $\left(\frac{x}{y}\right)$. If $y \leq x$ or $x < 0$, we throw a DomainError().

source

#Nemo.sigma — Method.

sigma(x::fmpz, y::Int)

Return the value of the sigma function, i.e. $\sum_{0 < d \;| x} d^y$. If $y < 0$ we throw a DomainError().

source

#Nemo.eulerphi — Method.

eulerphi(x::fmpz)

Return the value of the Euler phi function at $x$, i.e. the number of positive integers less than $x$ that are coprime with $x$.

source

#Nemo.numpart — Method.

numpart(x::Int)

Return the number of partitions of $x$. This function is not available on Windows 64.

source

#Nemo.numpart — Method.

numpart(x::fmpz)

Return the number of partitions of $x$. This function is not available on Windows 64.

source

Here are some examples of number theoretic functionality.

isprime(ZZ(13))
n = fac(100)
s = sigma(ZZ(128), 10)
a = eulerphi(ZZ(12480))
p = numpart(1000)
f = factor(ZZ(12))

Number digits and bases

#Base.bin — Method.

bin(n::fmpz)

Return $n$ as a binary string.

source

#Base.oct — Method.

oct(n::fmpz)

Return $n$ as a octal string.

source

#Base.dec — Method.

dec(n::fmpz)

Return $n$ as a decimal string.

source

#Base.hex — Method.

hex(n::fmpz) = base(n, 16)

Return $n$ as a hexadecimal string.

source

#Base.base — Method.

base(n::fmpz, b::Integer)

Return $n$ as a string in base $b$. We require $2 \leq b \leq 62$.

source

#Base.ndigits — Method.

ndigits(x::fmpz, b::Integer = 10)

Return the number of digits of $x$ in the base $b$ (default is $b = 10$).

source

#Nemo.nbits — Method.

nbits(x::fmpz)

Return the number of binary bits of $x$. We return zero if $x = 0$.

source

Here are some examples of writing numbers in various bases.

a = fmpz(12)

s1 = bin(a)
s2 = base(a, 13)
n1 = nbits(a)
n2 = ndigits(a, 3)

Bit twiddling

#Nemo.popcount — Method.

popcount(x::fmpz)

Return the number of ones in the binary representation of $x$.

source

#Base.prevpow2 — Method.

prevpow2(x::fmpz)

Return the previous power of $2$ up to including $x$.

source

#Base.nextpow2 — Method.

nextpow2(x::fmpz)

Return the next power of $2$ that is at least $x$.

source

#Base.trailing_zeros — Method.

trailing_zeros(x::fmpz)

Count the trailing zeros in the binary representation of $x$.

source

#Nemo.clrbit! — Method.

clrbit!(x::fmpz, c::Int)

Clear bit $c$ of $x$, where the least significant bit is the $0$-th bit. Note that this function modifies its input in-place.

source

#Nemo.setbit! — Method.

setbit!(x::fmpz, c::Int)

Set bit $c$ of $x$, where the least significant bit is the $0$-th bit. Note that this function modifies its input in-place.

source

#Nemo.combit! — Method.

combit!(x::fmpz, c::Int)

Complement bit $c$ of $x$, where the least significant bit is the $0$-th bit. Note that this function modifies its input in-place.

source

Here are some examples of bit twiddling.

a = fmpz(12)

p = popcount(a)
b = nextpow2(a)
combit!(a, 2)