Script File
number_theory.at
Definitions in source order
primes
L5
primes : inf_listfinally prefix the unique even primeL18
factorization
L20
factorization (int n) = [int,int](prime,exponent)
easy_factors
L33
easy_factors (int n, int limit) = ([int,int],int)find prime factors up to |limit| and quotient that might be 1 or composite
(factors,quotient)
prime_divisors
L45
prime_divisors (int n) = [int]divisors
L49
divisors (int n) = [int]all divisors, unsorted but in order compatible with divisibility relation
invertibles_modulo
L56
invertibles_modulo (int n) = [int]phi
L60
phi (int n) = intEuler totient function
gcd_Bezout_coef
L63
gcd_Bezout_coef (int !a, int !b) = (int,int)(d,s) such that d=s*a mod b
Bezout
L70
Bezout ((int,int) (a,b):pair) = (int,int,int)(d,s,t) with d=s*a+t*b)
inverse_mod
L74
inverse_mod ((int,int) pair) = intpower_mod
L81
power_mod (int x, int k, int n) = inttest_Fermat
L94
test_Fermat (int x, int p) = boolprime_candidats_after
L96
prime_candidats_after (int n, [int] sieve_primes) = [int]search_probable_prime
L107
search_probable_prime ([int] sieve_primes, [int] Fermat_bases) = (int->int)phi_data type
L117
set_type phi_data = (int n, int phi_n, [int] prime_factors_phi)
Fields: n, phi_n, prime_factors_phi
phi_data_of
L119
phi_data_of (int n) = phi_dataprime_phi_data
L122
prime_phi_data (int p) = phi_datais_multiplicative_generator 2 overloads
L124
is_multiplicative_generator (int i, phi_data(n,phi,factors)) = boolL127
is_multiplicative_generator (int i, int n) = boolsearch_probable_generator 2 overloads
L130
search_probable_generator (phi_data d) = intL136
search_probable_generator (int n) = intexpand
L141
expand (int_poly(X,a,), int k) = int_polysubstitute X^k for X
cyclotomic_polynomial
L144
cyclotomic_polynomial (int n) = int_polyis_prime
L153
is_prime(int n) = boolGenerated from atlas-scripts at commit 7e1b958 (2026-09-17).