mathfuse 1.0.0

package/dist/esm/number-theory/index.js

@@ -0,0 +1,311 @@
+/**
+ * @module number-theory
+ * Primes, GCD/LCM, combinatorics, modular arithmetic, and sequences.
+ */
+function assertNonNegInt(n, label = 'n') {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new TypeError(`${label} must be a non-negative integer`);
+    }
+}
+function assertPosInt(n, label = 'n') {
+    if (!Number.isInteger(n) || n < 1) {
+        throw new TypeError(`${label} must be a positive integer`);
+    }
+}
+/**
+ * Modular multiplication using Russian peasant algorithm to avoid overflow.
+ * Computes (a * b) % m safely for large numbers.
+ */
+function mulmod(a, b, m) {
+    let result = 0;
+    a %= m;
+    while (b > 0) {
+        if (b & 1)
+            result = (result + a) % m;
+        a = (a * 2) % m;
+        b >>= 1;
+    }
+    return result;
+}
+// ─── Primes ───────────────────────────────────────────────────────────────────
+/**
+ * Miller-Rabin primality test (deterministic for n < 3,317,044,064,679,887,385,961,981).
+ */
+export function isPrime(n) {
+    assertNonNegInt(n);
+    if (n < 2)
+        return false;
+    if (n === 2 || n === 3 || n === 5 || n === 7)
+        return true;
+    if (n % 2 === 0 || n % 3 === 0)
+        return false;
+    // Write n-1 as 2^r * d
+    let d = n - 1;
+    let r = 0;
+    while (d % 2 === 0) {
+        d >>= 1;
+        r++;
+    }
+    const powmod = (base, exp, mod) => {
+        let result = 1;
+        base %= mod;
+        while (exp > 0) {
+            if (exp & 1)
+                result = mulmod(result, base, mod);
+            base = mulmod(base, base, mod);
+            exp >>= 1;
+        }
+        return result;
+    };
+    const witnesses = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37];
+    outer: for (const a of witnesses) {
+        if (a >= n)
+            continue;
+        let x = powmod(a, d, n);
+        if (x === 1 || x === n - 1)
+            continue;
+        for (let i = 0; i < r - 1; i++) {
+            x = mulmod(x, x, n);
+            if (x === n - 1)
+                continue outer;
+        }
+        return false;
+    }
+    return true;
+}
+/**
+ * Sieve of Eratosthenes — returns all primes up to (and including) limit.
+ * @example primesUpTo(20) // [2, 3, 5, 7, 11, 13, 17, 19]
+ */
+export function primesUpTo(limit) {
+    assertNonNegInt(limit, 'limit');
+    if (limit < 2)
+        return [];
+    const sieve = new Uint8Array(limit + 1).fill(1);
+    sieve[0] = sieve[1] = 0;
+    for (let i = 2; i * i <= limit; i++) {
+        if (sieve[i]) {
+            for (let j = i * i; j <= limit; j += i)
+                sieve[j] = 0;
+        }
+    }
+    const primes = [];
+    for (let i = 2; i <= limit; i++)
+        if (sieve[i])
+            primes.push(i);
+    return primes;
+}
+/**
+ * Next prime strictly greater than n.
+ * @example nextPrime(10) // 11
+ */
+export function nextPrime(n) {
+    assertNonNegInt(n);
+    let candidate = n + 1;
+    if (candidate <= 2)
+        return 2;
+    if (candidate % 2 === 0)
+        candidate++;
+    while (!isPrime(candidate))
+        candidate += 2;
+    return candidate;
+}
+/**
+ * Prime factorization — returns sorted array of prime factors (with repeats).
+ * @example primeFactors(60) // [2, 2, 3, 5]
+ */
+export function primeFactors(n) {
+    assertPosInt(n);
+    const factors = [];
+    let remaining = n;
+    for (let f = 2; f * f <= remaining; f++) {
+        while (remaining % f === 0) {
+            factors.push(f);
+            remaining /= f;
+        }
+    }
+    if (remaining > 1)
+        factors.push(remaining);
+    return factors;
+}
+// ─── GCD / LCM ───────────────────────────────────────────────────────────────
+/**
+ * Greatest common divisor via Euclidean algorithm.
+ * @example gcd(48, 18) // 6
+ */
+export function gcd(a, b) {
+    if (!Number.isInteger(a) || !Number.isInteger(b)) {
+        throw new TypeError('gcd requires integer inputs');
+    }
+    a = Math.abs(a);
+    b = Math.abs(b);
+    while (b) {
+        [a, b] = [b, a % b];
+    }
+    return a;
+}
+/**
+ * GCD of an array of integers.
+ */
+export function gcdMany(nums) {
+    if (nums.length === 0)
+        throw new RangeError('gcdMany requires at least one number');
+    return nums.reduce(gcd);
+}
+/**
+ * Least common multiple.
+ * @example lcm(4, 6) // 12
+ */
+export function lcm(a, b) {
+    if (a === 0 || b === 0)
+        return 0;
+    return Math.abs(a) / gcd(a, b) * Math.abs(b);
+}
+/**
+ * LCM of an array of integers.
+ */
+export function lcmMany(nums) {
+    if (nums.length === 0)
+        throw new RangeError('lcmMany requires at least one number');
+    return nums.reduce(lcm);
+}
+// ─── Combinatorics ────────────────────────────────────────────────────────────
+/**
+ * Factorial n! — uses a cache for performance.
+ * @example factorial(10) // 3628800
+ */
+const factCache = [1, 1];
+export function factorial(n) {
+    assertNonNegInt(n);
+    if (n > 170)
+        throw new RangeError('factorial overflows Number for n > 170');
+    if (factCache[n] !== undefined)
+        return factCache[n];
+    for (let i = factCache.length; i <= n; i++) {
+        factCache[i] = factCache[i - 1] * i;
+    }
+    return factCache[n];
+}
+/**
+ * Binomial coefficient C(n, k) — "n choose k".
+ * @example binomial(10, 3) // 120
+ */
+export function binomial(n, k) {
+    assertNonNegInt(n, 'n');
+    assertNonNegInt(k, 'k');
+    if (k > n)
+        return 0;
+    if (k === 0 || k === n)
+        return 1;
+    k = Math.min(k, n - k);
+    let result = 1;
+    for (let i = 0; i < k; i++) {
+        result = (result * (n - i)) / (i + 1);
+    }
+    return Math.round(result);
+}
+/**
+ * Number of permutations P(n, r) = n! / (n−r)!
+ */
+export function permutations(n, r) {
+    assertNonNegInt(n, 'n');
+    assertNonNegInt(r, 'r');
+    if (r > n)
+        return 0;
+    let result = 1;
+    for (let i = n; i > n - r; i--)
+        result *= i;
+    return result;
+}
+// ─── Modular Arithmetic ───────────────────────────────────────────────────────
+/**
+ * Modular exponentiation: (base^exp) mod m
+ * @example modPow(2, 10, 1000) // 24
+ */
+export function modPow(base, exp, m) {
+    assertNonNegInt(base, 'base');
+    assertNonNegInt(exp, 'exp');
+    assertPosInt(m, 'm');
+    let result = 1;
+    base %= m;
+    while (exp > 0) {
+        if (exp & 1)
+            result = mulmod(result, base, m);
+        base = mulmod(base, base, m);
+        exp >>= 1;
+    }
+    return result;
+}
+/**
+ * Euler's totient φ(n) — count of integers in [1, n] coprime to n.
+ */
+export function eulerTotient(n) {
+    assertPosInt(n);
+    let result = n;
+    let temp = n;
+    for (let p = 2; p * p <= temp; p++) {
+        if (temp % p === 0) {
+            while (temp % p === 0)
+                temp /= p;
+            result -= result / p;
+        }
+    }
+    if (temp > 1)
+        result -= result / temp;
+    return Math.round(result);
+}
+// ─── Integer Sequences ────────────────────────────────────────────────────────
+/**
+ * Fibonacci sequence up to length n.
+ * @example fibonacci(8) // [0, 1, 1, 2, 3, 5, 8, 13]
+ */
+export function fibonacci(n) {
+    assertPosInt(n);
+    if (n === 1)
+        return [0];
+    const seq = [0, 1];
+    for (let i = 2; i < n; i++)
+        seq.push(seq[i - 1] + seq[i - 2]);
+    return seq;
+}
+/**
+ * nth Fibonacci number (0-indexed, fast doubling algorithm).
+ * @example nthFibonacci(10) // 55
+ */
+export function nthFibonacci(n) {
+    assertNonNegInt(n);
+    // Fast doubling: F(2k) = F(k)[2F(k+1) − F(k)], F(2k+1) = F(k)² + F(k+1)²
+    function fastDouble(k) {
+        if (k === 0)
+            return [0, 1];
+        const [a, b] = fastDouble(Math.floor(k / 2));
+        const c = a * (2 * b - a);
+        const d = a * a + b * b;
+        return k % 2 === 0 ? [c, d] : [d, c + d];
+    }
+    return fastDouble(n)[0];
+}
+/**
+ * Collatz sequence starting at n (stops at 1).
+ * @example collatz(6) // [6, 3, 10, 5, 16, 8, 4, 2, 1]
+ */
+export function collatz(n) {
+    assertPosInt(n);
+    const seq = [n];
+    while (n !== 1) {
+        n = n % 2 === 0 ? n / 2 : 3 * n + 1;
+        seq.push(n);
+    }
+    return seq;
+}
+/**
+ * Digital root of a positive integer (repeated digit sum until single digit).
+ * @example digitalRoot(9875) // 2
+ */
+export function digitalRoot(n) {
+    assertPosInt(n);
+    if (n % 9 === 0)
+        return 9;
+    return n % 9;
+}
+//# sourceMappingURL=index.js.map

package/dist/esm/number-theory/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/number-theory/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,SAAS,eAAe,CAAC,CAAS,EAAE,KAAK,GAAG,GAAG;IAC7C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,iCAAiC,CAAC,CAAC;IACjE,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,CAAS,EAAE,KAAK,GAAG,GAAG;IAC1C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,6BAA6B,CAAC,CAAC;IAC7D,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IAC7C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,CAAC,IAAI,CAAC,CAAC;IACP,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACrC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC,KAAK,CAAC,CAAC;IACV,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AACD,iFAAiF;AAEjF;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,CAAS;IAC/B,eAAe,CAAC,CAAC,CAAC,CAAC;IACnB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1D,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAE7C,uBAAuB;IACvB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACd,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAAC,CAAC,KAAK,CAAC,CAAC;QAAC,CAAC,EAAE,CAAC;IAAC,CAAC;IAGrC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,GAAW,EAAE,GAAW,EAAU,EAAE;QAChE,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,IAAI,GAAG,CAAC;QACZ,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;YACf,IAAI,GAAG,GAAG,CAAC;gBAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YAChD,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YAC/B,GAAG,KAAK,CAAC,CAAC;QACZ,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC/D,KAAK,EAAE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QACrB,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;YAAE,SAAS;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;gBAAE,SAAS,KAAK,CAAC;QAClC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,KAAa;IACtC,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAChC,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,CAAC;gBAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE;QAAE,IAAI,KAAK,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9D,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,eAAe,CAAC,CAAC,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC;IACtB,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC7B,IAAI,SAAS,GAAG,CAAC,KAAK,CAAC;QAAE,SAAS,EAAE,CAAC;IACrC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC;QAAE,SAAS,IAAI,CAAC,CAAC;IAC3C,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS;IACpC,YAAY,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,OAAO,SAAS,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,SAAS,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,IAAI,SAAS,GAAG,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC3C,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS;IACtC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,SAAS,CAAC,6BAA6B,CAAC,CAAC;IACrD,CAAC;IACD,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjC,OAAO,CAAC,EAAE,CAAC;QAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAAC,CAAC;IAClC,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,IAAc;IACpC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,CAAC;IACpF,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS;IACtC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,IAAc;IACpC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,CAAC;IACpF,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED,iFAAiF;AAEjF;;;GAGG;AACH,MAAM,SAAS,GAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnC,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,eAAe,CAAC,CAAC,CAAC,CAAC;IACnB,IAAI,CAAC,GAAG,GAAG;QAAE,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAC;IAC5E,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;IACpD,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;AACtB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,CAAS,EAAE,CAAS;IAC3C,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACxB,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACvB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IAC/C,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACxB,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,MAAM,IAAI,CAAC,CAAC;IAC5C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,iFAAiF;AAEjF;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,IAAY,EAAE,GAAW,EAAE,CAAS;IACzD,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC9B,eAAe,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC5B,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,IAAI,CAAC,CAAC;IACV,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;QACf,IAAI,GAAG,GAAG,CAAC;YAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC7B,GAAG,KAAK,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS;IACpC,YAAY,CAAC,CAAC,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACnB,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC;gBAAE,IAAI,IAAI,CAAC,CAAC;YACjC,MAAM,IAAI,MAAM,GAAG,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,GAAG,CAAC;QAAE,MAAM,IAAI,MAAM,GAAG,IAAI,CAAC;IACtC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAC5B,CAAC;AAED,iFAAiF;AAEjF;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,YAAY,CAAC,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9D,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS;IACpC,eAAe,CAAC,CAAC,CAAC,CAAC;IACnB,yEAAyE;IACzE,SAAS,UAAU,CAAC,CAAS;QAC3B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAC,CAAS;IAC/B,YAAY,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACf,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS;IACnC,YAAY,CAAC,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,CAAC,GAAG,CAAC,CAAC;AACf,CAAC"}

package/dist/esm/numerical/index.d.ts

@@ -0,0 +1,95 @@
+/**
+ * @module numerical
+ * Root finding, numerical integration, differentiation, and interpolation.
+ */
+export type Fn = (x: number) => number;
+export interface RootResult {
+    root: number;
+    iterations: number;
+    converged: boolean;
+    error: number;
+}
+/**
+ * Bisection method — guaranteed convergence on a bracketed root.
+ * @param f - continuous function
+ * @param a - left bracket
+ * @param b - right bracket (f(a) and f(b) must have opposite signs)
+ */
+export declare function bisection(f: Fn, a: number, b: number, tol?: number, maxIter?: number): RootResult;
+/**
+ * Newton-Raphson method — fast quadratic convergence near smooth roots.
+ * @param f - function
+ * @param df - derivative (if omitted, estimated numerically)
+ */
+export declare function newtonRaphson(f: Fn, x0: number, df?: Fn, tol?: number, maxIter?: number): RootResult;
+/**
+ * Brent's method — combines bisection, secant, and inverse quadratic interpolation.
+ * Robust and fast — the recommended general-purpose root finder.
+ */
+export declare function brent(f: Fn, a: number, b: number, tol?: number, maxIter?: number): RootResult;
+/**
+ * First derivative using central differences (O(h²) accuracy).
+ */
+export declare function derivative(f: Fn, x: number, h?: number): number;
+/**
+ * Second derivative using central differences.
+ */
+export declare function secondDerivative(f: Fn, x: number, h?: number): number;
+/**
+ * Gradient of a multivariate function at point x.
+ * @param f - function accepting a vector and returning a scalar
+ * @param x - point at which to compute the gradient
+ */
+export declare function gradient(f: (x: number[]) => number, x: number[], h?: number): number[];
+/**
+ * Adaptive Simpson's rule — highly accurate for smooth functions.
+ */
+export declare function integrate(f: Fn, a: number, b: number, tol?: number, maxDepth?: number): number;
+/**
+ * Gauss-Legendre quadrature (5-point) — excellent for polynomials and smooth functions.
+ * @param f - function to integrate
+ * @param a - lower bound
+ * @param b - upper bound
+ */
+export declare function gaussLegendre(f: Fn, a: number, b: number): number;
+/**
+ * Linear interpolation between two points.
+ */
+export declare function lerp(a: number, b: number, t: number): number;
+/**
+ * Inverse lerp — find t such that lerp(a, b, t) === value.
+ */
+export declare function inverseLerp(a: number, b: number, value: number): number;
+/**
+ * Linear interpolation from a data table (sorted x values required).
+ * @param xs - sorted x values
+ * @param ys - corresponding y values
+ * @param x - query x value
+ */
+export declare function tableInterpolate(xs: number[], ys: number[], x: number): number;
+/**
+ * Lagrange polynomial interpolation at a query point.
+ */
+export declare function lagrange(xs: number[], ys: number[], x: number): number;
+/**
+ * Clamp a value to [min, max].
+ */
+export declare function clamp(value: number, min: number, max: number): number;
+/**
+ * Round to n decimal places.
+ */
+export declare function roundTo(value: number, decimals: number): number;
+/**
+ * Check if two floats are approximately equal.
+ */
+export declare function approxEqual(a: number, b: number, relTol?: number, absTol?: number): boolean;
+/**
+ * Map a value from one range to another.
+ * @example remap(5, 0, 10, 0, 100) // 50
+ */
+export declare function remap(value: number, inMin: number, inMax: number, outMin: number, outMax: number): number;
+/**
+ * Sum of an array using compensated Kahan summation (reduces floating-point error).
+ */
+export declare function kahanSum(data: number[]): number;
+//# sourceMappingURL=index.d.ts.map

package/dist/esm/numerical/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/numerical/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;AAGvC,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CACvB,CAAC,EAAE,EAAE,EACL,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,GAAG,SAAQ,EACX,OAAO,SAAM,GACZ,UAAU,CAgBZ;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAC3B,CAAC,EAAE,EAAE,EACL,EAAE,EAAE,MAAM,EACV,EAAE,CAAC,EAAE,EAAE,EACP,GAAG,SAAQ,EACX,OAAO,SAAM,GACZ,UAAU,CAeZ;AAED;;;GAGG;AACH,wBAAgB,KAAK,CACnB,CAAC,EAAE,EAAE,EACL,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,GAAG,SAAQ,EACX,OAAO,SAAM,GACZ,UAAU,CAkCZ;AAGD;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,SAAO,GAAG,MAAM,CAE7D;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,SAAO,GAAG,MAAM,CAEnE;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CACtB,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,MAAM,EAC1B,CAAC,EAAE,MAAM,EAAE,EACX,CAAC,SAAO,GACP,MAAM,EAAE,CAMV;AAGD;;GAEG;AACH,wBAAgB,SAAS,CACvB,CAAC,EAAE,EAAE,EACL,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,GAAG,SAAO,EACV,QAAQ,SAAK,GACZ,MAAM,CAiCR;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAajE;AAGD;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAE5D;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAGvE;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAY9E;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAetE;AAGD;;GAEG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAErE;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAG/D;AAED;;GAEG;AACH,wBAAgB,WAAW,CACzB,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,MAAM,SAAO,EACb,MAAM,SAAI,GACT,OAAO,CAET;AAED;;;GAGG;AACH,wBAAgB,KAAK,CACnB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,GACb,MAAM,CAER;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAS/C"}