@stevenvo780/st-lang 4.9.0 → 4.11.0

package/dist/reasoning/number-theory/diophantine.js

@@ -0,0 +1,87 @@
+"use strict";
+// ============================================================
+// Diofantinas lineales y fracciones continuas.
+// ============================================================
+// linearDiophantine        — soluciona a·x + b·y = c sobre enteros.
+// continuedFractionExpansion — coeficientes de la expansión simple
+//                              de num/den (Euclides clásico).
+// fromContinuedFraction    — reconstruye num/den a partir de [a0;a1,...].
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.linearDiophantine = linearDiophantine;
+exports.continuedFractionExpansion = continuedFractionExpansion;
+exports.fromContinuedFraction = fromContinuedFraction;
+const gcd_1 = require("./gcd");
+function linearDiophantine(a, b, c) {
+    if (a === 0n && b === 0n) {
+        if (c === 0n)
+            return { x: 0n, y: 0n };
+        return null;
+    }
+    if (a === 0n) {
+        if (c % b !== 0n)
+            return null;
+        return { x: 0n, y: c / b };
+    }
+    if (b === 0n) {
+        if (c % a !== 0n)
+            return null;
+        return { x: c / a, y: 0n };
+    }
+    const g = (0, gcd_1.gcd)(a, b);
+    if (c % g !== 0n)
+        return null;
+    const { x, y } = (0, gcd_1.extendedGcd)(a, b);
+    const factor = c / g;
+    return { x: x * factor, y: y * factor };
+}
+// Expansión simple de num/den. Soporta numeradores negativos
+// devolviendo el cociente "floor" en a0 (estándar matemático).
+function continuedFractionExpansion(num, den, maxLen = 64) {
+    if (den === 0n) {
+        throw new RangeError('continuedFractionExpansion: denominador 0');
+    }
+    let p = num;
+    let q = den;
+    // Normalizamos q > 0 para que floor sea consistente.
+    if (q < 0n) {
+        p = -p;
+        q = -q;
+    }
+    const result = [];
+    for (let i = 0; i < maxLen; i++) {
+        // Floor division: dividend = q * a + r, 0 <= r < q.
+        let a = p / q;
+        let r = p % q;
+        if (r < 0n) {
+            a -= 1n;
+            r += q;
+        }
+        result.push(a);
+        if (r === 0n)
+            return result;
+        p = q;
+        q = r;
+    }
+    return result;
+}
+function fromContinuedFraction(coefs) {
+    if (coefs.length === 0) {
+        throw new RangeError('fromContinuedFraction: array vacío');
+    }
+    // Recurrencia clásica: h_n = a_n·h_{n-1} + h_{n-2}; k similar.
+    // h_{-1}=1, h_{-2}=0, k_{-1}=0, k_{-2}=1.
+    let hPrev = 1n;
+    let hPrev2 = 0n;
+    let kPrev = 0n;
+    let kPrev2 = 1n;
+    for (const a of coefs) {
+        const h = a * hPrev + hPrev2;
+        const k = a * kPrev + kPrev2;
+        hPrev2 = hPrev;
+        hPrev = h;
+        kPrev2 = kPrev;
+        kPrev = k;
+    }
+    return { num: hPrev, den: kPrev };
+}
+//# sourceMappingURL=diophantine.js.map

package/dist/reasoning/number-theory/diophantine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diophantine.js","sourceRoot":"","sources":["../../../src/reasoning/number-theory/diophantine.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+CAA+C;AAC/C,+DAA+D;AAC/D,oEAAoE;AACpE,mEAAmE;AACnE,8DAA8D;AAC9D,0EAA0E;;AAI1E,8CAsBC;AAID,gEA0BC;AAED,sDAmBC;AA3ED,+BAAyC;AAEzC,SAAgB,iBAAiB,CAC/B,CAAS,EACT,CAAS,EACT,CAAS;IAET,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,EAAE;YAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;QACb,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;QAC9B,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IAC7B,CAAC;IACD,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;QACb,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;QAC9B,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;IAC7B,CAAC;IACD,MAAM,CAAC,GAAG,IAAA,SAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAA,iBAAW,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC;AAC1C,CAAC;AAED,6DAA6D;AAC7D,+DAA+D;AAC/D,SAAgB,0BAA0B,CAAC,GAAW,EAAE,GAAW,EAAE,MAAM,GAAG,EAAE;IAC9E,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;QACf,MAAM,IAAI,UAAU,CAAC,2CAA2C,CAAC,CAAC;IACpE,CAAC;IACD,IAAI,CAAC,GAAG,GAAG,CAAC;IACZ,IAAI,CAAC,GAAG,GAAG,CAAC;IACZ,qDAAqD;IACrD,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACX,CAAC,GAAG,CAAC,CAAC,CAAC;QACP,CAAC,GAAG,CAAC,CAAC,CAAC;IACT,CAAC;IACD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,oDAAoD;QACpD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YACX,CAAC,IAAI,EAAE,CAAC;YACR,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,EAAE;YAAE,OAAO,MAAM,CAAC;QAC5B,CAAC,GAAG,CAAC,CAAC;QACN,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAgB,qBAAqB,CAAC,KAAe;IACnD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,UAAU,CAAC,oCAAoC,CAAC,CAAC;IAC7D,CAAC;IACD,+DAA+D;IAC/D,0CAA0C;IAC1C,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC;QAC7B,MAAM,GAAG,KAAK,CAAC;QACf,KAAK,GAAG,CAAC,CAAC;QACV,MAAM,GAAG,KAAK,CAAC;QACf,KAAK,GAAG,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;AACpC,CAAC"}

package/dist/reasoning/number-theory/factorization.d.ts

@@ -0,0 +1,12 @@
+import { modPow } from './modular';
+export declare function factorize(n: bigint): Array<{
+    prime: bigint;
+    exponent: number;
+}>;
+export declare function divisors(n: bigint): bigint[];
+export declare function eulerPhi(n: bigint): bigint;
+export declare function mobius(n: bigint): -1 | 0 | 1;
+export declare const _internal: {
+    modPow: typeof modPow;
+};
+//# sourceMappingURL=factorization.d.ts.map

package/dist/reasoning/number-theory/factorization.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"factorization.d.ts","sourceRoot":"","sources":["../../../src/reasoning/number-theory/factorization.ts"],"names":[],"mappings":"AAaA,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAwBnC,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,CAsC/E;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAkB5C;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAU1C;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAU5C;AAID,eAAO,MAAM,SAAS;;CAAa,CAAC"}

package/dist/reasoning/number-theory/factorization.js

@@ -0,0 +1,136 @@
+"use strict";
+// ============================================================
+// Factorización entera y funciones aritméticas derivadas.
+// ============================================================
+// factorize  — combina trial-division (hasta primos pequeños),
+//              Miller-Rabin y Pollard's rho con polinomio
+//              x^2 + c para factores grandes.
+// divisors   — todos los divisores positivos en orden creciente.
+// eulerPhi   — totient de Euler: φ(n) = n · ∏ (1 - 1/p).
+// mobius     — función de Möbius: 0 si hay primo al cuadrado,
+//              (-1)^k si n = p1·...·pk con todos distintos.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports._internal = void 0;
+exports.factorize = factorize;
+exports.divisors = divisors;
+exports.eulerPhi = eulerPhi;
+exports.mobius = mobius;
+const gcd_1 = require("./gcd");
+const primality_1 = require("./primality");
+const modular_1 = require("./modular");
+const absBig = (n) => (n < 0n ? -n : n);
+// Pollard's rho con polinomio f(x) = x^2 + c (mod n).
+// Reinicia con c distinto si converge a un factor trivial.
+function pollardRho(n) {
+    if (n % 2n === 0n)
+        return 2n;
+    for (let c = 1n;; c++) {
+        let x = 2n;
+        let y = 2n;
+        let d = 1n;
+        const f = (z) => (z * z + c) % n;
+        while (d === 1n) {
+            x = f(x);
+            y = f(f(y));
+            const diff = x > y ? x - y : y - x;
+            d = (0, gcd_1.gcd)(diff, n);
+        }
+        if (d !== n)
+            return d;
+        // Trivial cycle: reintentar con otro c.
+    }
+}
+function factorize(n) {
+    if (n <= 0n) {
+        throw new RangeError(`factorize: requiere n > 0, recibido ${n}`);
+    }
+    if (n === 1n)
+        return [];
+    const result = new Map();
+    const addFactor = (p, k = 1) => {
+        const prev = result.get(p) ?? 0;
+        result.set(p, prev + k);
+    };
+    let m = n;
+    // Trial division por primos pequeños (≤ 1000) cubre la mayoría
+    // de casos de tests y deja al rho los factores grandes.
+    for (let p = 2n; p < 1000n; p++) {
+        if (m === 1n)
+            break;
+        while (m % p === 0n) {
+            addFactor(p);
+            m /= p;
+        }
+    }
+    // Resto factorizable: stack-based (rho recursivo via iterativo).
+    const stack = [];
+    if (m > 1n)
+        stack.push(m);
+    while (stack.length > 0) {
+        const cur = stack.pop();
+        if (cur === undefined || cur === 1n)
+            continue;
+        if ((0, primality_1.isPrime)(cur)) {
+            addFactor(cur);
+            continue;
+        }
+        let f = pollardRho(cur);
+        while (f === cur)
+            f = pollardRho(cur);
+        stack.push(f);
+        stack.push(cur / f);
+    }
+    return Array.from(result.entries())
+        .sort((a, b) => (a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0))
+        .map(([prime, exponent]) => ({ prime, exponent }));
+}
+function divisors(n) {
+    const a = absBig(n);
+    if (a === 0n) {
+        throw new RangeError('divisors(0) no está definido');
+    }
+    if (a === 1n)
+        return [1n];
+    const factors = factorize(a);
+    let result = [1n];
+    for (const { prime, exponent } of factors) {
+        const next = [];
+        let pk = 1n;
+        for (let k = 0; k <= exponent; k++) {
+            for (const d of result)
+                next.push(d * pk);
+            pk *= prime;
+        }
+        result = next;
+    }
+    return result.sort((a, b) => (a < b ? -1 : a > b ? 1 : 0));
+}
+function eulerPhi(n) {
+    if (n <= 0n) {
+        throw new RangeError(`eulerPhi: requiere n > 0, recibido ${n}`);
+    }
+    if (n === 1n)
+        return 1n;
+    let result = n;
+    for (const { prime } of factorize(n)) {
+        result = (result / prime) * (prime - 1n);
+    }
+    return result;
+}
+function mobius(n) {
+    if (n <= 0n) {
+        throw new RangeError(`mobius: requiere n > 0, recibido ${n}`);
+    }
+    if (n === 1n)
+        return 1;
+    const factors = factorize(n);
+    for (const { exponent } of factors) {
+        if (exponent >= 2)
+            return 0;
+    }
+    return factors.length % 2 === 0 ? 1 : -1;
+}
+// Helper para tests de millerRabin con Mersenne grandes — no exportado.
+// (kept here only as a comment-anchor for the team)
+exports._internal = { modPow: modular_1.modPow };
+//# sourceMappingURL=factorization.js.map

package/dist/reasoning/number-theory/factorization.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"factorization.js","sourceRoot":"","sources":["../../../src/reasoning/number-theory/factorization.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,0DAA0D;AAC1D,+DAA+D;AAC/D,+DAA+D;AAC/D,0DAA0D;AAC1D,8CAA8C;AAC9C,iEAAiE;AACjE,yDAAyD;AACzD,8DAA8D;AAC9D,4DAA4D;;;AA4B5D,8BAsCC;AAED,4BAkBC;AAED,4BAUC;AAED,wBAUC;AA5GD,+BAA4B;AAC5B,2CAAsC;AACtC,uCAAmC;AAEnC,MAAM,MAAM,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAExD,sDAAsD;AACtD,2DAA2D;AAC3D,SAAS,UAAU,CAAC,CAAS;IAC3B,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAI,CAAC,EAAE,EAAE,CAAC;QACvB,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,MAAM,CAAC,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;YAChB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACT,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACZ,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACnC,CAAC,GAAG,IAAA,SAAG,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACtB,wCAAwC;IAC1C,CAAC;AACH,CAAC;AAED,SAAgB,SAAS,CAAC,CAAS;IACjC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,UAAU,CAAC,uCAAuC,CAAC,EAAE,CAAC,CAAC;IACnE,CAAC;IACD,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACxB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,CAAC,GAAG,CAAC,EAAQ,EAAE;QAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC;IACF,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,+DAA+D;IAC/D,wDAAwD;IACxD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,EAAE;YAAE,MAAM;QACpB,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC;YACpB,SAAS,CAAC,CAAC,CAAC,CAAC;YACb,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;IACH,CAAC;IACD,iEAAiE;IACjE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,CAAC,GAAG,EAAE;QAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACxB,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,EAAE;YAAE,SAAS;QAC9C,IAAI,IAAA,mBAAO,EAAC,GAAG,CAAC,EAAE,CAAC;YACjB,SAAS,CAAC,GAAG,CAAC,CAAC;YACf,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QACxB,OAAO,CAAC,KAAK,GAAG;YAAE,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;SAChC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACxD,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,SAAgB,QAAQ,CAAC,CAAS;IAChC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;QACb,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;IACvD,CAAC;IACD,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IAC1B,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,MAAM,GAAa,CAAC,EAAE,CAAC,CAAC;IAC5B,KAAK,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,OAAO,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,IAAI,EAAE,GAAG,EAAE,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YAC1C,EAAE,IAAI,KAAK,CAAC;QACd,CAAC;QACD,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,SAAgB,QAAQ,CAAC,CAAS;IAChC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,EAAE,CAAC,CAAC;IAClE,CAAC;IACD,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACxB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACrC,MAAM,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAgB,MAAM,CAAC,CAAS;IAC9B,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,UAAU,CAAC,oCAAoC,CAAC,EAAE,CAAC,CAAC;IAChE,CAAC;IACD,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC;IACvB,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAC7B,KAAK,MAAM,EAAE,QAAQ,EAAE,IAAI,OAAO,EAAE,CAAC;QACnC,IAAI,QAAQ,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED,wEAAwE;AACxE,oDAAoD;AACvC,QAAA,SAAS,GAAG,EAAE,MAAM,EAAN,gBAAM,EAAE,CAAC"}

package/dist/reasoning/number-theory/gcd.d.ts

@@ -0,0 +1,8 @@
+export declare function gcd(a: bigint, b: bigint): bigint;
+export declare function lcm(a: bigint, b: bigint): bigint;
+export declare function extendedGcd(a: bigint, b: bigint): {
+    gcd: bigint;
+    x: bigint;
+    y: bigint;
+};
+//# sourceMappingURL=gcd.d.ts.map

package/dist/reasoning/number-theory/gcd.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gcd.d.ts","sourceRoot":"","sources":["../../../src/reasoning/number-theory/gcd.ts"],"names":[],"mappings":"AAUA,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAShD;AAED,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAIhD;AAKD,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CAiBvF"}

package/dist/reasoning/number-theory/gcd.js

@@ -0,0 +1,51 @@
+"use strict";
+// ============================================================
+// gcd, lcm y algoritmo extendido sobre bigint.
+// ============================================================
+// gcd(a,b) por Euclides binario-aritmético, siempre no-negativo.
+// extendedGcd devuelve coeficientes Bézout (x,y) con a·x + b·y = gcd.
+// Convención: para a=b=0 el gcd es 0 (consistente con álgebra
+// conmutativa: el único divisor común es 0).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.gcd = gcd;
+exports.lcm = lcm;
+exports.extendedGcd = extendedGcd;
+const absBig = (n) => (n < 0n ? -n : n);
+function gcd(a, b) {
+    let x = absBig(a);
+    let y = absBig(b);
+    while (y !== 0n) {
+        const r = x % y;
+        x = y;
+        y = r;
+    }
+    return x;
+}
+function lcm(a, b) {
+    if (a === 0n || b === 0n)
+        return 0n;
+    const g = gcd(a, b);
+    return absBig((a / g) * b);
+}
+// Extended Euclidean algorithm.
+// Garantiza: a·x + b·y = gcd(a,b) (con signo original conservado).
+// Si a o b son negativos, x/y se ajustan automáticamente.
+function extendedGcd(a, b) {
+    // Trabajamos con valores absolutos y ajustamos signos al final.
+    const signA = a < 0n ? -1n : 1n;
+    const signB = b < 0n ? -1n : 1n;
+    let oldR = absBig(a);
+    let r = absBig(b);
+    let oldS = 1n;
+    let s = 0n;
+    let oldT = 0n;
+    let t = 1n;
+    while (r !== 0n) {
+        const q = oldR / r;
+        [oldR, r] = [r, oldR - q * r];
+        [oldS, s] = [s, oldS - q * s];
+        [oldT, t] = [t, oldT - q * t];
+    }
+    return { gcd: oldR, x: oldS * signA, y: oldT * signB };
+}
+//# sourceMappingURL=gcd.js.map

package/dist/reasoning/number-theory/gcd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gcd.js","sourceRoot":"","sources":["../../../src/reasoning/number-theory/gcd.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+CAA+C;AAC/C,+DAA+D;AAC/D,iEAAiE;AACjE,sEAAsE;AACtE,8DAA8D;AAC9D,6CAA6C;;AAI7C,kBASC;AAED,kBAIC;AAKD,kCAiBC;AAvCD,MAAM,MAAM,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAExD,SAAgB,GAAG,CAAC,CAAS,EAAE,CAAS;IACtC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAClB,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC,GAAG,CAAC,CAAC;QACN,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAgB,GAAG,CAAC,CAAS,EAAE,CAAS;IACtC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED,gCAAgC;AAChC,mEAAmE;AACnE,0DAA0D;AAC1D,SAAgB,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,gEAAgE;IAChE,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAChC,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAChC,IAAI,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;QACnB,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,CAAC;AACzD,CAAC"}

package/dist/reasoning/number-theory/index.d.ts

@@ -0,0 +1,9 @@
+export { gcd, lcm, extendedGcd } from './gcd';
+export { modPow, modInverse, modSolve } from './modular';
+export type { Congruence } from './crt';
+export { crt } from './crt';
+export { isPrime, millerRabin, nextPrime, previousPrime, primesBelow } from './primality';
+export { factorize, divisors, eulerPhi, mobius } from './factorization';
+export { linearDiophantine, continuedFractionExpansion, fromContinuedFraction, } from './diophantine';
+export { legendreSymbol, jacobiSymbol } from './symbols';
+//# sourceMappingURL=index.d.ts.map

package/dist/reasoning/number-theory/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reasoning/number-theory/index.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,EAAE,MAAM,OAAO,CAAC;AAC9C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACzD,YAAY,EAAE,UAAU,EAAE,MAAM,OAAO,CAAC;AACxC,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAC5B,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1F,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AACxE,OAAO,EACL,iBAAiB,EACjB,0BAA0B,EAC1B,qBAAqB,GACtB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC"}

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

@@ -0,0 +1,46 @@
+"use strict";
+// ============================================================
+// ST Number Theory — barrel público.
+// ============================================================
+// Primitivas:
+//   gcd / lcm / extendedGcd            — Euclides + Bézout.
+//   modPow / modInverse / modSolve     — aritmética modular.
+//   crt                                — Chinese Remainder generalizado.
+//   isPrime / millerRabin              — primalidad determinístico-ish.
+//   nextPrime / previousPrime / primesBelow
+//   factorize / divisors / eulerPhi / mobius
+//   linearDiophantine                  — Bézout sobre ax+by=c.
+//   continuedFractionExpansion / fromContinuedFraction
+//   legendreSymbol / jacobiSymbol      — residuos cuadráticos.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.jacobiSymbol = exports.legendreSymbol = exports.fromContinuedFraction = exports.continuedFractionExpansion = exports.linearDiophantine = exports.mobius = exports.eulerPhi = exports.divisors = exports.factorize = exports.primesBelow = exports.previousPrime = exports.nextPrime = exports.millerRabin = exports.isPrime = exports.crt = exports.modSolve = exports.modInverse = exports.modPow = exports.extendedGcd = exports.lcm = exports.gcd = void 0;
+var gcd_1 = require("./gcd");
+Object.defineProperty(exports, "gcd", { enumerable: true, get: function () { return gcd_1.gcd; } });
+Object.defineProperty(exports, "lcm", { enumerable: true, get: function () { return gcd_1.lcm; } });
+Object.defineProperty(exports, "extendedGcd", { enumerable: true, get: function () { return gcd_1.extendedGcd; } });
+var modular_1 = require("./modular");
+Object.defineProperty(exports, "modPow", { enumerable: true, get: function () { return modular_1.modPow; } });
+Object.defineProperty(exports, "modInverse", { enumerable: true, get: function () { return modular_1.modInverse; } });
+Object.defineProperty(exports, "modSolve", { enumerable: true, get: function () { return modular_1.modSolve; } });
+var crt_1 = require("./crt");
+Object.defineProperty(exports, "crt", { enumerable: true, get: function () { return crt_1.crt; } });
+var primality_1 = require("./primality");
+Object.defineProperty(exports, "isPrime", { enumerable: true, get: function () { return primality_1.isPrime; } });
+Object.defineProperty(exports, "millerRabin", { enumerable: true, get: function () { return primality_1.millerRabin; } });
+Object.defineProperty(exports, "nextPrime", { enumerable: true, get: function () { return primality_1.nextPrime; } });
+Object.defineProperty(exports, "previousPrime", { enumerable: true, get: function () { return primality_1.previousPrime; } });
+Object.defineProperty(exports, "primesBelow", { enumerable: true, get: function () { return primality_1.primesBelow; } });
+var factorization_1 = require("./factorization");
+Object.defineProperty(exports, "factorize", { enumerable: true, get: function () { return factorization_1.factorize; } });
+Object.defineProperty(exports, "divisors", { enumerable: true, get: function () { return factorization_1.divisors; } });
+Object.defineProperty(exports, "eulerPhi", { enumerable: true, get: function () { return factorization_1.eulerPhi; } });
+Object.defineProperty(exports, "mobius", { enumerable: true, get: function () { return factorization_1.mobius; } });
+var diophantine_1 = require("./diophantine");
+Object.defineProperty(exports, "linearDiophantine", { enumerable: true, get: function () { return diophantine_1.linearDiophantine; } });
+Object.defineProperty(exports, "continuedFractionExpansion", { enumerable: true, get: function () { return diophantine_1.continuedFractionExpansion; } });
+Object.defineProperty(exports, "fromContinuedFraction", { enumerable: true, get: function () { return diophantine_1.fromContinuedFraction; } });
+var symbols_1 = require("./symbols");
+Object.defineProperty(exports, "legendreSymbol", { enumerable: true, get: function () { return symbols_1.legendreSymbol; } });
+Object.defineProperty(exports, "jacobiSymbol", { enumerable: true, get: function () { return symbols_1.jacobiSymbol; } });
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/reasoning/number-theory/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qCAAqC;AACrC,+DAA+D;AAC/D,cAAc;AACd,4DAA4D;AAC5D,6DAA6D;AAC7D,yEAAyE;AACzE,wEAAwE;AACxE,4CAA4C;AAC5C,6CAA6C;AAC7C,+DAA+D;AAC/D,uDAAuD;AACvD,+DAA+D;AAC/D,+DAA+D;;;AAE/D,6BAA8C;AAArC,0FAAA,GAAG,OAAA;AAAE,0FAAA,GAAG,OAAA;AAAE,kGAAA,WAAW,OAAA;AAC9B,qCAAyD;AAAhD,iGAAA,MAAM,OAAA;AAAE,qGAAA,UAAU,OAAA;AAAE,mGAAA,QAAQ,OAAA;AAErC,6BAA4B;AAAnB,0FAAA,GAAG,OAAA;AACZ,yCAA0F;AAAjF,oGAAA,OAAO,OAAA;AAAE,wGAAA,WAAW,OAAA;AAAE,sGAAA,SAAS,OAAA;AAAE,0GAAA,aAAa,OAAA;AAAE,wGAAA,WAAW,OAAA;AACpE,iDAAwE;AAA/D,0GAAA,SAAS,OAAA;AAAE,yGAAA,QAAQ,OAAA;AAAE,yGAAA,QAAQ,OAAA;AAAE,uGAAA,MAAM,OAAA;AAC9C,6CAIuB;AAHrB,gHAAA,iBAAiB,OAAA;AACjB,yHAAA,0BAA0B,OAAA;AAC1B,oHAAA,qBAAqB,OAAA;AAEvB,qCAAyD;AAAhD,yGAAA,cAAc,OAAA;AAAE,uGAAA,YAAY,OAAA"}

package/dist/reasoning/number-theory/modular.d.ts

@@ -0,0 +1,6 @@
+declare function mod(a: bigint, m: bigint): bigint;
+export declare function modPow(base: bigint, exp: bigint, m: bigint): bigint;
+export declare function modInverse(a: bigint, m: bigint): bigint | null;
+export declare function modSolve(a: bigint, b: bigint, m: bigint): bigint | null;
+export { mod };
+//# sourceMappingURL=modular.d.ts.map

package/dist/reasoning/number-theory/modular.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"modular.d.ts","sourceRoot":"","sources":["../../../src/reasoning/number-theory/modular.ts"],"names":[],"mappings":"AAUA,iBAAS,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAMzC;AAED,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAsBnE;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAO9D;AAID,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAcvE;AAGD,OAAO,EAAE,GAAG,EAAE,CAAC"}

package/dist/reasoning/number-theory/modular.js

@@ -0,0 +1,75 @@
+"use strict";
+// ============================================================
+// Aritmética modular sobre bigint.
+// ============================================================
+// modPow      — exponenciación modular por squaring.
+// modInverse  — inverso multiplicativo usando Bézout (null si no existe).
+// modSolve    — resuelve a·x ≡ b (mod m) (null si no hay solución).
+// Convención: el resultado siempre vive en [0, m) cuando m > 0.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.modPow = modPow;
+exports.modInverse = modInverse;
+exports.modSolve = modSolve;
+exports.mod = mod;
+const gcd_1 = require("./gcd");
+function mod(a, m) {
+    if (m <= 0n) {
+        throw new RangeError(`modulus must be positive, got ${m}`);
+    }
+    const r = a % m;
+    return r < 0n ? r + m : r;
+}
+function modPow(base, exp, m) {
+    if (m <= 0n) {
+        throw new RangeError(`modulus must be positive, got ${m}`);
+    }
+    if (m === 1n)
+        return 0n;
+    if (exp < 0n) {
+        // a^(-k) mod m = (a^-1)^k mod m  (si a^-1 existe).
+        const inv = modInverse(base, m);
+        if (inv === null) {
+            throw new RangeError(`modPow: base ${base} no invertible mod ${m}`);
+        }
+        return modPow(inv, -exp, m);
+    }
+    let result = 1n;
+    let b = mod(base, m);
+    let e = exp;
+    while (e > 0n) {
+        if ((e & 1n) === 1n)
+            result = (result * b) % m;
+        e >>= 1n;
+        b = (b * b) % m;
+    }
+    return result;
+}
+function modInverse(a, m) {
+    if (m <= 0n) {
+        throw new RangeError(`modulus must be positive, got ${m}`);
+    }
+    const { gcd: g, x } = (0, gcd_1.extendedGcd)(mod(a, m), m);
+    if (g !== 1n)
+        return null;
+    return mod(x, m);
+}
+// Resuelve a·x ≡ b (mod m). Solución única (mod m/gcd) cuando existe.
+// Devolvemos la solución mínima no-negativa.
+function modSolve(a, b, m) {
+    if (m <= 0n) {
+        throw new RangeError(`modulus must be positive, got ${m}`);
+    }
+    const aR = mod(a, m);
+    const bR = mod(b, m);
+    const g = (0, gcd_1.gcd)(aR, m);
+    if (bR % g !== 0n)
+        return null;
+    const aR2 = aR / g;
+    const bR2 = bR / g;
+    const m2 = m / g;
+    const inv = modInverse(aR2, m2);
+    if (inv === null)
+        return null;
+    return mod(bR2 * inv, m2);
+}
+//# sourceMappingURL=modular.js.map

package/dist/reasoning/number-theory/modular.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"modular.js","sourceRoot":"","sources":["../../../src/reasoning/number-theory/modular.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mCAAmC;AACnC,+DAA+D;AAC/D,qDAAqD;AACrD,0EAA0E;AAC1E,oEAAoE;AACpE,gEAAgE;;AAYhE,wBAsBC;AAED,gCAOC;AAID,4BAcC;AAGQ,kBAAG;AA9DZ,+BAAyC;AAEzC,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS;IAC/B,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,EAAE,CAAC,CAAC;IAC7D,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5B,CAAC;AAED,SAAgB,MAAM,CAAC,IAAY,EAAE,GAAW,EAAE,CAAS;IACzD,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,EAAE,CAAC,CAAC;IAC7D,CAAC;IACD,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACxB,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;QACb,mDAAmD;QACnD,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAChC,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;YACjB,MAAM,IAAI,UAAU,CAAC,gBAAgB,IAAI,sBAAsB,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACrB,IAAI,CAAC,GAAG,GAAG,CAAC;IACZ,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC;QACd,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE;YAAE,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,CAAC,KAAK,EAAE,CAAC;QACT,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAgB,UAAU,CAAC,CAAS,EAAE,CAAS;IAC7C,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,EAAE,CAAC,CAAC;IAC7D,CAAC;IACD,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAA,iBAAW,EAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAC1B,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnB,CAAC;AAED,sEAAsE;AACtE,6CAA6C;AAC7C,SAAgB,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IACtD,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,EAAE,CAAC,CAAC;IAC7D,CAAC;IACD,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,IAAA,SAAG,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAC/B,MAAM,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;IACnB,MAAM,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;IACnB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAChC,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC9B,OAAO,GAAG,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,CAAC,CAAC;AAC5B,CAAC"}

package/dist/reasoning/number-theory/primality.d.ts

@@ -0,0 +1,6 @@
+export declare function millerRabin(n: bigint, witnesses?: bigint[]): boolean;
+export declare function isPrime(n: bigint): boolean;
+export declare function nextPrime(n: bigint): bigint;
+export declare function previousPrime(n: bigint): bigint;
+export declare function primesBelow(n: number): bigint[];
+//# sourceMappingURL=primality.d.ts.map

package/dist/reasoning/number-theory/primality.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"primality.d.ts","sourceRoot":"","sources":["../../../src/reasoning/number-theory/primality.ts"],"names":[],"mappings":"AA4CA,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,GAAE,MAAM,EAAsB,GAAG,OAAO,CAuBvF;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAO1C;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAO3C;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAa/C;AAGD,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAmB/C"}

package/dist/reasoning/number-theory/primality.js

@@ -0,0 +1,144 @@
+"use strict";
+// ============================================================
+// Tests de primalidad.
+// ============================================================
+// isPrime       — wrapper que decide entre trial-division y Miller-Rabin
+//                 según el tamaño de n.
+// millerRabin   — test probabilístico, determinístico para los testigos
+//                 estándar hasta 3.3·10^14 (con la lista de testigos
+//                 [2,3,5,7,11,13,17,19,23,29,31,37]).
+// nextPrime / previousPrime — siguiente/previo primo respecto a n.
+// primesBelow   — criba de Eratóstenes hasta n (n: number, exclusivo).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.millerRabin = millerRabin;
+exports.isPrime = isPrime;
+exports.nextPrime = nextPrime;
+exports.previousPrime = previousPrime;
+exports.primesBelow = primesBelow;
+const modular_1 = require("./modular");
+const SMALL_PRIMES = [
+    2n,
+    3n,
+    5n,
+    7n,
+    11n,
+    13n,
+    17n,
+    19n,
+    23n,
+    29n,
+    31n,
+    37n,
+    41n,
+    43n,
+    47n,
+    53n,
+    59n,
+    61n,
+    67n,
+    71n,
+    73n,
+    79n,
+    83n,
+    89n,
+    97n,
+];
+// Testigos suficientes (determinísticos) para n < 3,317,044,064,679,887,385,961,981.
+const DEFAULT_WITNESSES = [2n, 3n, 5n, 7n, 11n, 13n, 17n, 19n, 23n, 29n, 31n, 37n];
+function millerRabin(n, witnesses = DEFAULT_WITNESSES) {
+    if (n < 2n)
+        return false;
+    if (n < 4n)
+        return true;
+    if ((n & 1n) === 0n)
+        return false;
+    // Escribir n-1 = 2^s · d con d impar.
+    let d = n - 1n;
+    let s = 0n;
+    while ((d & 1n) === 0n) {
+        d >>= 1n;
+        s += 1n;
+    }
+    witness: for (const a0 of witnesses) {
+        const a = a0 % n;
+        if (a === 0n)
+            continue;
+        let x = (0, modular_1.modPow)(a, d, n);
+        if (x === 1n || x === n - 1n)
+            continue;
+        for (let r = 1n; r < s; r++) {
+            x = (x * x) % n;
+            if (x === n - 1n)
+                continue witness;
+        }
+        return false;
+    }
+    return true;
+}
+function isPrime(n) {
+    if (n < 2n)
+        return false;
+    for (const p of SMALL_PRIMES) {
+        if (n === p)
+            return true;
+        if (n % p === 0n)
+            return false;
+    }
+    return millerRabin(n);
+}
+function nextPrime(n) {
+    if (n < 2n)
+        return 2n;
+    let c = n + 1n;
+    if (c === 2n)
+        return 2n;
+    if ((c & 1n) === 0n)
+        c += 1n;
+    while (!isPrime(c))
+        c += 2n;
+    return c;
+}
+function previousPrime(n) {
+    if (n <= 2n) {
+        throw new RangeError('previousPrime: no hay primo menor que 2');
+    }
+    if (n === 3n)
+        return 2n;
+    let c = n - 1n;
+    if (c === 2n)
+        return 2n;
+    if ((c & 1n) === 0n)
+        c -= 1n;
+    while (c >= 2n && !isPrime(c))
+        c -= 2n;
+    if (c < 2n) {
+        throw new RangeError(`previousPrime: no hay primo menor que ${n}`);
+    }
+    return c;
+}
+// Criba de Eratóstenes. n: number (acotamos a Number por la criba).
+function primesBelow(n) {
+    if (!Number.isFinite(n) || n < 2)
+        return [];
+    const limit = Math.floor(n);
+    const sieve = new Uint8Array(limit);
+    // sieve[i] === 0  →  i es primo candidato.
+    // Marcamos 0 y 1 como compuestos.
+    sieve[0] = 1;
+    if (limit > 1)
+        sieve[1] = 1;
+    const sqrt = Math.floor(Math.sqrt(limit - 1));
+    for (let i = 2; i <= sqrt; i++) {
+        if (sieve[i] === 0) {
+            for (let j = i * i; j < limit; j += i)
+                sieve[j] = 1;
+        }
+    }
+    const out = [];
+    for (let i = 2; i < limit; i++) {
+        if (sieve[i] === 0)
+            out.push(BigInt(i));
+    }
+    return out;
+}
+//# sourceMappingURL=primality.js.map

package/dist/reasoning/number-theory/primality.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"primality.js","sourceRoot":"","sources":["../../../src/reasoning/number-theory/primality.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uBAAuB;AACvB,+DAA+D;AAC/D,yEAAyE;AACzE,wCAAwC;AACxC,wEAAwE;AACxE,qEAAqE;AACrE,sDAAsD;AACtD,mEAAmE;AACnE,uEAAuE;;AAmCvE,kCAuBC;AAED,0BAOC;AAED,8BAOC;AAED,sCAaC;AAGD,kCAmBC;AA/GD,uCAAmC;AAEnC,MAAM,YAAY,GAAG;IACnB,EAAE;IACF,EAAE;IACF,EAAE;IACF,EAAE;IACF,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;CACJ,CAAC;AAEF,qFAAqF;AACrF,MAAM,iBAAiB,GAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAE7F,SAAgB,WAAW,CAAC,CAAS,EAAE,YAAsB,iBAAiB;IAC5E,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,KAAK,CAAC;IACzB,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,IAAI,CAAC;IACxB,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC;IAClC,sCAAsC;IACtC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACf,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;QACvB,CAAC,KAAK,EAAE,CAAC;QACT,CAAC,IAAI,EAAE,CAAC;IACV,CAAC;IACD,OAAO,EAAE,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,EAAE;YAAE,SAAS;QACvB,IAAI,CAAC,GAAG,IAAA,gBAAM,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;YAAE,SAAS;QACvC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAChB,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;gBAAE,SAAS,OAAO,CAAC;QACrC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAgB,OAAO,CAAC,CAAS;IAC/B,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,KAAK,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE;YAAE,OAAO,KAAK,CAAC;IACjC,CAAC;IACD,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAED,SAAgB,SAAS,CAAC,CAAS;IACjC,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IACtB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACf,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACxB,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE;QAAE,CAAC,IAAI,EAAE,CAAC;IAC7B,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,CAAC,IAAI,EAAE,CAAC;IAC5B,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAgB,aAAa,CAAC,CAAS;IACrC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,UAAU,CAAC,yCAAyC,CAAC,CAAC;IAClE,CAAC;IACD,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACf,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACxB,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE;QAAE,CAAC,IAAI,EAAE,CAAC;IAC7B,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,CAAC,IAAI,EAAE,CAAC;IACvC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACX,MAAM,IAAI,UAAU,CAAC,yCAAyC,CAAC,EAAE,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,oEAAoE;AACpE,SAAgB,WAAW,CAAC,CAAS;IACnC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IACpC,2CAA2C;IAC3C,kCAAkC;IAClC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,IAAI,KAAK,GAAG,CAAC;QAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC;gBAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}