Groups
Category
Level
The floor sum computes S(n,m,a,b) = sum_{i=0}^{n-1} floor((a i + b)/m) efficiently in O(log(min(a,m))) time.
The partition function p(n) counts the number of ways to write n as a sum of positive integers where order does not matter.
An ordinary generating function (OGF) encodes a sequence (a_n) as a formal power series A(x) = \sum_{n \ge 0} a_n x^n.
Stirling numbers of the first kind count permutations by their number of cycles and connect power polynomials to rising/falling factorials.
The discrete logarithm problem asks for x such that g^x โก h (mod p) in a multiplicative group modulo a prime p.
Pollard's Rho is a randomized algorithm that finds a non-trivial factor of a composite integer by walking a pseudorandom sequence modulo n and extracting a factor with a gcd.
A quadratic residue modulo an odd prime p is any a for which x^2 โก a (mod p) has a solution; exactly half of the nonzero classes are residues.
The Mรถbius function ฮผ(n) is 0 if n has a squared prime factor, otherwise it is (-1)^k where k is the number of distinct prime factors.
Summing the divisor function d(i) up to n equals counting lattice points under the hyperbola xy โค n, which can be done in O(โn) using floor-division blocks.
BerlekampโMassey (BM) finds the shortest linear recurrence that exactly fits a given sequence over a field (e.g., modulo a prime).
Gaussian elimination over GF(2) is ordinary Gaussian elimination where addition and subtraction are XOR and multiplication is AND.