Expand description
mathematical datas
Modules§
- arbitrary_
mod_ 🔒binomial - berlekamp_
massey 🔒 - bitwise_
transform 🔒 - bitwiseand_
convolve 🔒 - bitwiseor_
convolve 🔒 - bitwisexor_
convolve 🔒 - black_
box_ 🔒matrix - convolve_
steps 🔒 - discrete_
logarithm 🔒 - factorial 🔒
- fast_
fourier_ 🔒transform - floor_
sum 🔒 - formal_
power_ 🔒series - garner 🔒
- gcd 🔒
- gcd_
convolve 🔒 - lagrange_
interpolation 🔒 - lcm_
convolve 🔒 - linear_
congruence 🔒 - linear_
diophantine 🔒 - matrix 🔒
- miller_
rabin 🔒 - mint_
matrix 🔒 - mod_
sqrt 🔒 - number_
theoretic_ 🔒transform - polynomial 🔒
- pow_
prec 🔒 - prime 🔒
- prime_
factors 🔒 - prime_
list 🔒 - prime_
table 🔒 - primitive_
root 🔒 - quotient_
array 🔒 - relaxed_
convolution 🔒 - subset_
convolve 🔒
Structs§
- Arbitrary
ModBinomial - Bitwiseand
Convolve - Bitwiseor
Convolve - Bitwisexor
Convolve - Black
BoxMatrix Impl - Convolve
- Euler
PhiTable - Formal
Power Series - Garner
- Garner’s algorithm with precomputation for fixed moduli.
- GcdConvolve
- LcmConvolve
- Matrix
- Memorized
Factorial - Online
Subset Mobius Transform - Online
Subset Zeta Transform - Online
Superset Mobius Transform - Online
Superset Zeta Transform - Polynomial
- PowPrec
- Prime
List - Prime
Table - Quotient
Array - store with index ${\lfloor\frac{n}{i}\rfloor \mid i=1,2,\ldots,n}$
- Relaxed
Convolution - Sparse
Matrix - Subset
Convolve
Enums§
Traits§
- Black
BoxM IntMatrix - Black
BoxMatrix - Convolve
Steps - Formal
Power Series Coefficient - Formal
Power Series Coefficient Sqrt - MInt
Matrix - NttReuse
Functions§
- berlekamp_
massey - bitwise_
transform - check_
primitive_ root - discrete_
logarithm - a^x ≡ b (mod n)
- discrete_
logarithm_ prime_ mod - divisors
- euler_
phi - extgcd
- extgcd_
binary - extgcd_
recurse - floor_
power_ sum - $$\sum_{i=0}^{n-1}x^iy^{\left\lfloor\frac{a\times i+b}{m}\right\rfloor}$$
- floor_
sum - Sum of Floor of Linear mod 2^64
- floor_
sum_ i64 - Sum of Floor of Linear mod 2^64
- floor_
sum_ polynomial - $$\sum_{i=0}^{n-1}i^X\left\lfloor\frac{a\times i+b}{m}\right\rfloor^Y$$
- floor_
sum_ polynomial_ i64 - $$\sum_{i=l}^{r-1}i^X\left\lfloor\frac{a\times i+b}{m}\right\rfloor^Y$$
- floor_
sum_ range_ freq - gcd
- binary gcd
- gcd_
loop - highly_
composite_ number - [(hcn, #divisor)]
- lagrange_
interpolation - lagrange_
interpolation_ polynomial - lcm
- miller_
rabin - miller_
rabin_ with_ br - modinv
- modinv_
extgcd_ binary - 0 < a < p, gcd(a, p) == 1, p is prime > 2
- modinv_
recurse - moebius
- g(d) = Sigma mu(d) * f(n/d)
- prime_
factors - prime_
factors_ flatten - primitive_
root - solve_
linear_ congruence - return: (y,z)
- solve_
linear_ diophantine - Solve ax + by = c
- solve_
simultaneous_ linear_ congruence - return: (y,z)
- with_
prime_ list