@stevenvo780/st-lang 4.9.0 → 4.11.0

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

@@ -0,0 +1,3 @@
+export declare function legendreSymbol(a: bigint, p: bigint): -1 | 0 | 1;
+export declare function jacobiSymbol(a: bigint, n: bigint): -1 | 0 | 1;
+//# sourceMappingURL=symbols.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"symbols.d.ts","sourceRoot":"","sources":["../../../src/reasoning/number-theory/symbols.ts"],"names":[],"mappings":"AAWA,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAY/D;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAwB7D"}

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

@@ -0,0 +1,57 @@
+"use strict";
+// ============================================================
+// Símbolos de Legendre y Jacobi.
+// ============================================================
+// legendreSymbol(a, p): a^((p-1)/2) mod p, normalizado a {-1, 0, 1}.
+//                      Requiere p primo impar.
+// jacobiSymbol(a, n):  generalización a n impar > 0 vía reciprocidad
+//                      cuadrática. Coincide con Legendre cuando n es
+//                      primo y siempre satisface jacobi(a,n) ∈ {-1,0,1}.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.legendreSymbol = legendreSymbol;
+exports.jacobiSymbol = jacobiSymbol;
+const modular_1 = require("./modular");
+function legendreSymbol(a, p) {
+    if (p < 3n || (p & 1n) === 0n) {
+        throw new RangeError(`legendreSymbol: p debe ser primo impar, recibido ${p}`);
+    }
+    const aR = (0, modular_1.mod)(a, p);
+    if (aR === 0n)
+        return 0;
+    const r = (0, modular_1.modPow)(aR, (p - 1n) / 2n, p);
+    if (r === 1n)
+        return 1;
+    if (r === p - 1n)
+        return -1;
+    // Si p no es primo, modPow no garantiza ±1; lo reportamos como 0
+    // (el contrato exige p primo, pero somos defensivos).
+    return 0;
+}
+function jacobiSymbol(a, n) {
+    if (n <= 0n || (n & 1n) === 0n) {
+        throw new RangeError(`jacobiSymbol: n debe ser positivo impar, recibido ${n}`);
+    }
+    let aR = (0, modular_1.mod)(a, n);
+    let nR = n;
+    let result = 1;
+    while (aR !== 0n) {
+        while ((aR & 1n) === 0n) {
+            aR >>= 1n;
+            const r = nR & 7n; // nR mod 8
+            if (r === 3n || r === 5n)
+                result = -result;
+        }
+        // Swap (a,n).
+        const tmp = aR;
+        aR = nR;
+        nR = tmp;
+        if ((aR & 3n) === 3n && (nR & 3n) === 3n) {
+            result = -result;
+        }
+        aR = aR % nR;
+    }
+    if (nR === 1n)
+        return result;
+    return 0;
+}
+//# sourceMappingURL=symbols.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"symbols.js","sourceRoot":"","sources":["../../../src/reasoning/number-theory/symbols.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iCAAiC;AACjC,+DAA+D;AAC/D,qEAAqE;AACrE,+CAA+C;AAC/C,qEAAqE;AACrE,qEAAqE;AACrE,yEAAyE;;AAIzE,wCAYC;AAED,oCAwBC;AAxCD,uCAAwC;AAExC,SAAgB,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;QAC9B,MAAM,IAAI,UAAU,CAAC,oDAAoD,CAAC,EAAE,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,EAAE,GAAG,IAAA,aAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,IAAA,gBAAM,EAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;IACvC,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;QAAE,OAAO,CAAC,CAAC,CAAC;IAC5B,iEAAiE;IACjE,sDAAsD;IACtD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAgB,YAAY,CAAC,CAAS,EAAE,CAAS;IAC/C,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,MAAM,IAAI,UAAU,CAAC,qDAAqD,CAAC,EAAE,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,EAAE,GAAG,IAAA,aAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,MAAM,GAAW,CAAC,CAAC;IACvB,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QACjB,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;YACxB,EAAE,KAAK,EAAE,CAAC;YACV,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,WAAW;YAC9B,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE;gBAAE,MAAM,GAAG,CAAC,MAAgB,CAAC;QACvD,CAAC;QACD,cAAc;QACd,MAAM,GAAG,GAAG,EAAE,CAAC;QACf,EAAE,GAAG,EAAE,CAAC;QACR,EAAE,GAAG,GAAG,CAAC;QACT,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;YACzC,MAAM,GAAG,CAAC,MAAgB,CAAC;QAC7B,CAAC;QACD,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IACD,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,MAAM,CAAC;IAC7B,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/reasoning/real-analysis/index.d.ts

@@ -0,0 +1,127 @@
+export type RealFn = (x: number) => number;
+export interface LimitClaim {
+    fn: RealFn;
+    point: number;
+    value: number;
+}
+export interface LimitVerification {
+    holds: boolean;
+    counterexample?: number;
+    suggestedDelta?: number;
+}
+/**
+ * Verifica numéricamente la afirmación
+ *   ∀ε>0 ∃δ>0 ∀x (0 < |x-point| < δ → |fn(x)-value| < ε)
+ * para el ε dado. Devuelve δ sugerido (o counterexample si falla
+ * incluso con δ extremadamente pequeño).
+ *
+ * Estrategia: bisecta δ desde 1 hacia abajo, muestreando puntos en
+ * (point-δ, point) ∪ (point, point+δ); si todos cumplen |f(x)-L|<ε,
+ * δ es válido. Si no encontramos δ válido tras `maxIter` iteraciones,
+ * el último x que falló se reporta como counterexample.
+ */
+export declare function verifyLimit(claim: LimitClaim, epsilon: number, deltaFinder?: (eps: number) => number): LimitVerification;
+/**
+ * Encuentra (o detecta divergencia/indeterminación de) lim_{x→point} fn(x)
+ * por muestreo bilateral con refinamiento sucesivo.
+ *
+ * Devuelve:
+ *   • número L si las dos colas convergen al mismo valor con tolerancia
+ *   • 'diverges' si crece sin cota
+ *   • 'unknown' si las colas no coinciden (límite no existe / discontinuidad de salto)
+ */
+export declare function findLimit(fn: RealFn, point: number, opts?: {
+    tolerance?: number;
+    samples?: number;
+}): number | 'diverges' | 'unknown';
+/**
+ * fn es continua en `point` si lim_{x→point} fn(x) = fn(point) con tol `eps`.
+ */
+export declare function isContinuousAt(fn: RealFn, point: number, eps?: number): boolean;
+/**
+ * Verificación numérica de continuidad uniforme en [a,b]:
+ *   ∀ε ∃δ ∀x,y∈[a,b] (|x-y|<δ → |f(x)-f(y)|<ε)
+ * Estrategia: para cada δ candidato muestreamos pares (x_i, x_i+δ)
+ * cubriendo el intervalo y verificamos que |f(x)-f(x+δ)| < eps en todos.
+ */
+export declare function isUniformlyContinuous(fn: RealFn, domain: [number, number], eps?: number): boolean;
+/**
+ * Detecta puntos de discontinuidad por muestreo + chequeo local.
+ */
+export declare function findDiscontinuities(fn: RealFn, domain: [number, number], samples?: number): number[];
+export interface Derivative {
+    value: number;
+    method: 'forward' | 'backward' | 'central' | 'richardson';
+}
+export declare function derivative(fn: RealFn, x: number, opts?: {
+    h?: number;
+    method?: Derivative['method'];
+}): Derivative;
+/**
+ * n-ésima derivada por diferencias finitas centrales iteradas (fórmula
+ * con coeficientes binomiales con signo alternado).
+ *
+ *   f^(n)(x) ≈ (1/h^n) · Σ_{k=0..n} (-1)^k C(n,k) f(x + (n/2 - k)·h)
+ */
+export declare function nthDerivative(fn: RealFn, x: number, n: number, h?: number): number;
+/**
+ * Diferenciable en `point` si las derivadas laterales coinciden con tolerancia.
+ */
+export declare function isDifferentiableAt(fn: RealFn, point: number, eps?: number): boolean;
+/**
+ * Encuentra puntos críticos (f'(x) ≈ 0) por bisección en cambios de signo
+ * de la derivada numérica.
+ */
+export declare function findCriticalPoints(fn: RealFn, domain: [number, number], samples?: number): number[];
+export interface Integral {
+    value: number;
+    method: 'simpson' | 'trapezoidal' | 'romberg' | 'gaussian';
+}
+export declare function integrate(fn: RealFn, from: number, to: number, opts?: {
+    method?: Integral['method'];
+    subdivisions?: number;
+}): Integral;
+export interface SeriesConvergence {
+    converges: boolean;
+    sumApprox?: number;
+    reason?: string;
+}
+/**
+ * Test de la razón sobre coeficientes de una serie Σ a_n (no Σ a_n x^n):
+ *   L = lim |a_{n+1}/a_n|
+ *   L < 1 ⇒ converge ; L > 1 ⇒ diverge ; L = 1 ⇒ indeciso.
+ */
+export declare function ratioTest(coefficients: number[]): SeriesConvergence;
+/**
+ * Test de la raíz: L = lim sup |a_n|^{1/n}.
+ */
+export declare function rootTest(coefficients: number[]): SeriesConvergence;
+export declare function partialSum(fn: (n: number) => number, terms: number): number;
+export declare function sequenceLimit(seq: (n: number) => number, opts?: {
+    maxTerms?: number;
+    tolerance?: number;
+}): {
+    converges: boolean;
+    limit?: number;
+    rate?: 'linear' | 'quadratic' | 'unknown';
+};
+/**
+ * Busca c ∈ (a,b) tal que f'(c) = (f(b)-f(a))/(b-a).
+ * Si fn es continua en [a,b] y derivable en (a,b), por MVT existe.
+ * Aquí asumimos eso y buscamos c por bisección sobre f'(x) - slope.
+ */
+export declare function meanValueTheorem(fn: RealFn, derivativeFn: RealFn, a: number, b: number, tolerance?: number): {
+    holds: boolean;
+    c?: number;
+};
+/**
+ * Polinomio de Taylor de orden N de `fn` centrado en `center`, devuelto
+ * como función. Las derivadas se calculan numéricamente con `nthDerivative`.
+ */
+export declare function taylorPolynomial(fn: RealFn, center: number, order: number): (x: number) => number;
+/**
+ * Cota grosera del resto de Lagrange: |R_n(x)| ≤ M·|x-c|^(n+1)/(n+1)!
+ * con M estimado como sup |f^(n+1)| sobre un muestreo entre c y x.
+ */
+export declare function taylorRemainderBound(fn: RealFn, center: number, x: number, order: number): number;
+//# sourceMappingURL=index.d.ts.map

package/dist/reasoning/real-analysis/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reasoning/real-analysis/index.ts"],"names":[],"mappings":"AAaA,MAAM,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;AAsB3C,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,OAAO,CAAC;IACf,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,UAAU,EACjB,OAAO,EAAE,MAAM,EACf,WAAW,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,GACpC,iBAAiB,CAmDnB;AAED;;;;;;;;GAQG;AACH,wBAAgB,SAAS,CACvB,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAA;CAAE,GAC9C,MAAM,GAAG,UAAU,GAAG,SAAS,CAoDjC;AAID;;GAEG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,GAAE,MAAoB,GAAG,OAAO,CAM5F;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,MAAM,EACV,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EACxB,GAAG,GAAE,MAAoB,GACxB,OAAO,CAwBT;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,EAAE,EAAE,MAAM,EACV,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EACxB,OAAO,GAAE,MAAwB,GAChC,MAAM,EAAE,CA4BV;AAID,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS,GAAG,YAAY,CAAC;CAC3D;AAED,wBAAgB,UAAU,CACxB,EAAE,EAAE,MAAM,EACV,CAAC,EAAE,MAAM,EACT,IAAI,CAAC,EAAE;IAAE,CAAC,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAA;CAAE,GACnD,UAAU,CAyBZ;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAclF;AAYD;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,GAAE,MAAoB,GAAG,OAAO,CAOhG;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,EAAE,EAAE,MAAM,EACV,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EACxB,OAAO,GAAE,MAAwB,GAChC,MAAM,EAAE,CAkCV;AAID,MAAM,WAAW,QAAQ;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,SAAS,GAAG,aAAa,GAAG,SAAS,GAAG,UAAU,CAAC;CAC5D;AAED,wBAAgB,SAAS,CACvB,EAAE,EAAE,MAAM,EACV,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,IAAI,CAAC,EAAE;IAAE,MAAM,CAAC,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,GAC5D,QAAQ,CAwBV;AA2DD,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,YAAY,EAAE,MAAM,EAAE,GAAG,iBAAiB,CA8BnE;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,YAAY,EAAE,MAAM,EAAE,GAAG,iBAAiB,CAsBlE;AAED,wBAAgB,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAI3E;AAID,wBAAgB,aAAa,CAC3B,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,EAC1B,IAAI,CAAC,EAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAE,GAC/C;IAAE,SAAS,EAAE,OAAO,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,WAAW,GAAG,SAAS,CAAA;CAAE,CA+BnF;AAID;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,EAAE,EAAE,MAAM,EACV,YAAY,EAAE,MAAM,EACpB,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,SAAS,GAAE,MAAa,GACvB;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,CAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CA+BhC;AAID;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAqBjG;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAcjG"}