Arithmetic with numbers in cycles.

Returns remainder from integer division.

Optimization for tail calls preserving lists.

In modular arithmetic, a number is a primitive root modulo  if every number coprime to is congruent to a power of modulo .

In computer science and mathematical logic, satisfiability modulo theories is the problem of determining whether a mathematical formula is satisfiable.

In modular arithmetic, the integers coprime (relatively prime) to n from the set of n non-negative integers form a group under multiplication modulo n, called the multiplicative group of integers modulo n.