Standard Commutative Rings#
Integers#
- Ring \(\ZZ\) of Integers
- Elements of the ring \(\ZZ\) of integers
- Cython wrapper for bernmm library
- Bernoulli numbers modulo p
- Integer factorization functions
- Basic arithmetic with C integers
- Fast decomposition of small integers into sums of squares
- Fast Arithmetic Functions
- Generic implementation of powering
- Utility classes for multi-modular algorithms
- Miscellaneous arithmetic functions
CRT()
CRT_basis()
CRT_list()
CRT_vectors()
Euler_Phi
GCD()
Moebius
Sigma
XGCD()
algdep()
algebraic_dependency()
bernoulli()
binomial()
binomial_coefficients()
continuant()
crt()
dedekind_psi()
dedekind_sum()
differences()
divisors()
eratosthenes()
factor()
factorial()
falling_factorial()
four_squares()
fundamental_discriminant()
gauss_sum()
gcd()
get_gcd()
get_inverse_mod()
hilbert_conductor()
hilbert_conductor_inverse()
hilbert_symbol()
integer_ceil()
integer_floor()
integer_trunc()
inverse_mod()
is_power_of_two()
is_prime()
is_prime_power()
is_pseudoprime()
is_pseudoprime_power()
is_square()
is_squarefree()
jacobi_symbol()
kronecker()
kronecker_symbol()
legendre_symbol()
mqrr_rational_reconstruction()
multinomial()
multinomial_coefficients()
next_prime()
next_prime_power()
next_probable_prime()
nth_prime()
number_of_divisors()
odd_part()
power_mod()
previous_prime()
previous_prime_power()
prime_divisors()
prime_factors()
prime_powers()
prime_to_m_part()
primes()
primes_first_n()
primitive_root()
quadratic_residues()
radical()
random_prime()
rational_reconstruction()
rising_factorial()
sort_complex_numbers_for_display()
squarefree_divisors()
subfactorial()
sum_of_k_squares()
three_squares()
trial_division()
two_squares()
valuation()
xgcd()
xkcd()
xlcm()