Modules List

Here is a list of all documented modules with brief descriptions:

Mdivisors	Work with the divisors of an integer
Meuler_totient	Compute Euler's totient function \(\phi\)
Mbase	Basic functionality used frequently throughout the whole library
Mint128	128-bit integers
Mmodulo	Function templates for modular arithmetic
Mchinese_remainder	Solve systems of modular congruences using the Chinese remainder theorem
Mbinomial_coefficient	Compute binomial coefficients
Mfigurate_number	Computes figurate numbers in two and three dimensions
Mpythagorean_triple	Generate primitive Pythagorean triples
Mturan_number	Compute the number of edges in a Turan graph
Mcontinued_fraction	Contininued fraction expansion for quadratic irrationals
Mdiophantine	Algorithms to solve diophantine equations
Mpell_equation	Finds integer solutions to Pell's equation
Mprime_decomposition	Function templates to decompose a natural number into its unique prime decomposition
Mprime_generation	Generate prime numbers
Mlucas_sequence	Compute terms of Lucas sequences
Mprime_test	Test whether a given number is prime
Mmatrix	Represents a matrix whose dimensions are compile time constants
Mmod_int	Represents an integer modulo another integer
Mrational	Provides a class template for rational numbers