Expand description
mathematical datas
Structs§
- 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 - Polynomial
- PowPrec
- Prime
List - Prime
Table - Quotient
Array - store with index ${\lfloor\frac{n}{i}\rfloor \mid i=1,2,\ldots,n}$
- Small
ModMemorized Factorial - Sparse
Matrix - Subset
Convolve
Enums§
Traits§
- Black
BoxM IntMatrix - Black
BoxMatrix - Convolve
Steps - Formal
Power Series Coefficient - Formal
Power Series Coefficient Sqrt - MInt
Matrix
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_
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