math-exercises 2.2.97 → 3.0.0

package/lib/math/polynomials/trinom.js

@@ -1,65 +1,62 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Trinom = exports.TrinomConstructor = void 0;
-const sqrtNode_1 = require("../../tree/nodes/functions/sqrtNode");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
-const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const powerNode_1 = require("../../tree/nodes/operators/powerNode");
-const variableNode_1 = require("../../tree/nodes/variables/variableNode");
-const point_1 = require("../geometry/point");
-const rational_1 = require("../numbers/rationals/rational");
-const real_1 = require("../numbers/reals/real");
-const polynomial_1 = require("./polynomial");
-const oppositeNode_1 = require("../../tree/nodes/functions/oppositeNode");
-const gcd_1 = require("../utils/arithmetic/gcd");
-const randint_1 = require("../utils/random/randint");
-const random_1 = require("../../utils/alea/random");
-const colors_1 = require("../../geogebra/colors");
-class TrinomConstructor {
+import { SqrtNode } from "../../tree/nodes/functions/sqrtNode.js";
+import { NumberNode } from "../../tree/nodes/numbers/numberNode.js";
+import { AddNode } from "../../tree/nodes/operators/addNode.js";
+import { FractionNode } from "../../tree/nodes/operators/fractionNode.js";
+import { MultiplyNode } from "../../tree/nodes/operators/multiplyNode.js";
+import { SquareNode } from "../../tree/nodes/operators/powerNode.js";
+import { VariableNode } from "../../tree/nodes/variables/variableNode.js";
+import { Point } from "../geometry/point.js";
+import { Rational } from "../numbers/rationals/rational.js";
+import { SquareRoot } from "../numbers/reals/real.js";
+import { Polynomial } from "./polynomial.js";
+import { OppositeNode } from "../../tree/nodes/functions/oppositeNode.js";
+import { gcd } from "../utils/arithmetic/gcd.js";
+import { randint } from "../utils/random/randint.js";
+import { random } from "../../utils/alea/random.js";
+import { blueMain } from "../../geogebra/colors.js";
+export class TrinomConstructor {
     static random(aOpts, bOpts, cOpts) {
-        const a = (0, randint_1.randint)(aOpts?.min ?? -9, aOpts?.max ?? 10, aOpts?.excludes ?? [0]);
-        const b = (0, randint_1.randint)(bOpts?.min ?? -9, bOpts?.max ?? 10, bOpts?.excludes ?? []);
-        const c = (0, randint_1.randint)(cOpts?.min ?? -9, cOpts?.max ?? 10, cOpts?.excludes ?? []);
+        const a = randint(aOpts?.min ?? -9, aOpts?.max ?? 10, aOpts?.excludes ?? [0]);
+        const b = randint(bOpts?.min ?? -9, bOpts?.max ?? 10, bOpts?.excludes ?? []);
+        const c = randint(cOpts?.min ?? -9, cOpts?.max ?? 10, cOpts?.excludes ?? []);
         return new Trinom(a, b, c);
     }
     static randomCanonical(aOpts, alphaOpts, betaOpts) {
         const a = aOpts?.from
-            ? (0, random_1.random)(aOpts.from)
-            : (0, randint_1.randint)(aOpts?.min ?? -9, aOpts?.max ?? 10, aOpts?.excludes ?? [0]);
-        const alpha = (0, randint_1.randint)(alphaOpts?.min ?? -9, alphaOpts?.max ?? 10, alphaOpts?.excludes ?? []);
-        const beta = (0, randint_1.randint)(betaOpts?.min ?? -9, betaOpts?.max ?? 10, betaOpts?.excludes ?? []);
+            ? random(aOpts.from)
+            : randint(aOpts?.min ?? -9, aOpts?.max ?? 10, aOpts?.excludes ?? [0]);
+        const alpha = randint(alphaOpts?.min ?? -9, alphaOpts?.max ?? 10, alphaOpts?.excludes ?? []);
+        const beta = randint(betaOpts?.min ?? -9, betaOpts?.max ?? 10, betaOpts?.excludes ?? []);
         const b = -2 * a * alpha;
         const c = a * alpha ** 2 + beta;
         return new Trinom(a, b, c);
     }
     static randomFactorized(aOpts, x1Opts, x2Opts) {
-        const a = (0, randint_1.randint)(aOpts?.min ?? -9, aOpts?.max ?? 10, aOpts?.excludes ?? [0]);
-        const x1 = (0, randint_1.randint)(x1Opts?.min ?? -9, x1Opts?.max ?? 10, x1Opts?.excludes ?? []);
-        const x2 = (0, randint_1.randint)(x2Opts?.min ?? -9, x2Opts?.max ?? 10, x2Opts?.excludes ?? []);
+        const a = randint(aOpts?.min ?? -9, aOpts?.max ?? 10, aOpts?.excludes ?? [0]);
+        const x1 = randint(x1Opts?.min ?? -9, x1Opts?.max ?? 10, x1Opts?.excludes ?? []);
+        const x2 = randint(x2Opts?.min ?? -9, x2Opts?.max ?? 10, x2Opts?.excludes ?? []);
         //a*x^2 - ax*x2 - a*x1*x + a*x1*x2
         return new Trinom(a, -a * (x1 + x2), a * x1 * x2);
     }
     static randomNiceRoots(nbOfRoots = 2) {
         if (nbOfRoots === 0) {
             //canonical +c
-            const a = (0, randint_1.randint)(-9, 10, [0]);
-            const root = (0, randint_1.randint)(-9, 10);
+            const a = randint(-9, 10, [0]);
+            const root = randint(-9, 10);
             //a(x-root)^2 = ax^2 -2arootx + aroot^2
-            const c = a > 0 ? a * root ** 2 + (0, randint_1.randint)(1, 6) : a * root ** 2 - (0, randint_1.randint)(1, 6);
+            const c = a > 0 ? a * root ** 2 + randint(1, 6) : a * root ** 2 - randint(1, 6);
             return new Trinom(a, -2 * a * root, c);
         }
         else if (nbOfRoots === 1) {
-            const a = (0, randint_1.randint)(-9, 10, [0]);
-            const root = (0, randint_1.randint)(-9, 10);
+            const a = randint(-9, 10, [0]);
+            const root = randint(-9, 10);
             //a(x-root)^2 = ax^2 -2arootx + aroot^2
             return new Trinom(a, -2 * a * root, a * root ** 2);
         }
         else {
-            const a = (0, randint_1.randint)(-9, 10, [0]);
-            const x1 = (0, randint_1.randint)(-9, 10, []);
-            const x2 = (0, randint_1.randint)(-9, 10, [x1]);
+            const a = randint(-9, 10, [0]);
+            const x1 = randint(-9, 10, []);
+            const x2 = randint(-9, 10, [x1]);
             return new Trinom(a, -a * (x1 + x2), a * x1 * x2);
         }
     }
@@ -67,8 +64,11 @@ class TrinomConstructor {
         return new Trinom(coeffs[2], coeffs[1], coeffs[0]);
     }
 }
-exports.TrinomConstructor = TrinomConstructor;
-class Trinom extends polynomial_1.Polynomial {
+export class Trinom extends Polynomial {
+    a;
+    b;
+    c;
+    variable;
     // roots: AlgebraicNode[];
     constructor(a, b, c, opts) {
         super([c, b, a], opts?.variable ?? "x");
@@ -81,7 +81,7 @@ class Trinom extends polynomial_1.Polynomial {
         return this.b ** 2 - 4 * this.a * this.c;
     }
     getDeltaNode() {
-        return new numberNode_1.NumberNode(this.getDelta());
+        return new NumberNode(this.getDelta());
     }
     getRoots() {
         const delta = this.getDelta();
@@ -99,7 +99,7 @@ class Trinom extends polynomial_1.Polynomial {
         if (delta < 0)
             return [];
         if (delta === 0)
-            return [new rational_1.Rational(-this.b, 2 * this.a).simplify().toTree()];
+            return [new Rational(-this.b, 2 * this.a).simplify().toTree()];
         // const root1 = new FractionNode(
         //   ,
         //   new MultiplyNode(2)
@@ -107,38 +107,38 @@ class Trinom extends polynomial_1.Polynomial {
         const sqrtDelta = Math.sqrt(delta);
         const isDeltaPerfectSquare = Math.sqrt(delta) === Math.floor(Math.sqrt(delta));
         if (isDeltaPerfectSquare) {
-            const addNode = new rational_1.Rational(-this.b + sqrtDelta, 2 * this.a)
+            const addNode = new Rational(-this.b + sqrtDelta, 2 * this.a)
                 .simplify()
                 .toTree();
-            const subNode = new rational_1.Rational(-this.b - sqrtDelta, 2 * this.a)
+            const subNode = new Rational(-this.b - sqrtDelta, 2 * this.a)
                 .simplify()
                 .toTree();
             return this.a > 0 ? [subNode, addNode] : [addNode, subNode];
         }
-        let [sqrtA, sqrtB] = new real_1.SquareRoot(delta).getSimplifiedCoeffs();
+        let [sqrtA, sqrtB] = new SquareRoot(delta).getSimplifiedCoeffs();
         let denum = 2 * this.a;
         let trueB = this.b;
-        const pgcd = (0, gcd_1.gcd)(sqrtA, trueB, denum);
+        const pgcd = gcd(sqrtA, trueB, denum);
         [sqrtA, trueB, denum] = [sqrtA, trueB, denum].map((n) => n / pgcd);
         const sqrtNode = sqrtA === 1
-            ? new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(sqrtB))
-            : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(sqrtA), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(sqrtB)));
+            ? new SqrtNode(new NumberNode(sqrtB))
+            : new MultiplyNode(new NumberNode(sqrtA), new SqrtNode(new NumberNode(sqrtB)));
         const subNode = trueB === 0
-            ? new oppositeNode_1.OppositeNode(sqrtNode)
-            : new addNode_1.AddNode(new numberNode_1.NumberNode(-trueB), new oppositeNode_1.OppositeNode(sqrtNode));
-        const addNode = trueB === 0 ? sqrtNode : new addNode_1.AddNode(new numberNode_1.NumberNode(-trueB), sqrtNode);
+            ? new OppositeNode(sqrtNode)
+            : new AddNode(new NumberNode(-trueB), new OppositeNode(sqrtNode));
+        const addNode = trueB === 0 ? sqrtNode : new AddNode(new NumberNode(-trueB), sqrtNode);
         if (denum === 1) {
             return this.a > 0 ? [subNode, addNode] : [addNode, subNode];
         }
         else {
             return this.a > 0
                 ? [
-                    new fractionNode_1.FractionNode(subNode, new numberNode_1.NumberNode(denum)),
-                    new fractionNode_1.FractionNode(addNode, new numberNode_1.NumberNode(denum)),
+                    new FractionNode(subNode, new NumberNode(denum)),
+                    new FractionNode(addNode, new NumberNode(denum)),
                 ]
                 : [
-                    new fractionNode_1.FractionNode(addNode, new numberNode_1.NumberNode(denum)),
-                    new fractionNode_1.FractionNode(subNode, new numberNode_1.NumberNode(denum)),
+                    new FractionNode(addNode, new NumberNode(denum)),
+                    new FractionNode(subNode, new NumberNode(denum)),
                 ];
         }
     }
@@ -154,13 +154,13 @@ class Trinom extends polynomial_1.Polynomial {
         return -this.b / (2 * this.a);
     }
     getAlphaNode() {
-        return new rational_1.Rational(-this.b, 2 * this.a).simplify().toTree();
+        return new Rational(-this.b, 2 * this.a).simplify().toTree();
     }
     getBeta() {
         return -this.getDelta() / (4 * this.a);
     }
     getBetaNode() {
-        return new rational_1.Rational(-this.getDelta(), 4 * this.a).simplify().toTree();
+        return new Rational(-this.getDelta(), 4 * this.a).simplify().toTree();
     }
     getFactorizedForm() {
         const roots = this.getRootsNode();
@@ -168,35 +168,35 @@ class Trinom extends polynomial_1.Polynomial {
             return this.toTree();
         if (roots.length === 1) {
             return roots[0].toTex() === "0"
-                ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), new powerNode_1.SquareNode(new variableNode_1.VariableNode("x")))
-                : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), new powerNode_1.SquareNode(new addNode_1.AddNode(new variableNode_1.VariableNode("x"), new oppositeNode_1.OppositeNode(roots[0]))));
+                ? new MultiplyNode(new NumberNode(this.a), new SquareNode(new VariableNode("x")))
+                : new MultiplyNode(new NumberNode(this.a), new SquareNode(new AddNode(new VariableNode("x"), new OppositeNode(roots[0]))));
         }
         if (roots[0].toTex() === "0") {
-            return new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), new multiplyNode_1.MultiplyNode(new variableNode_1.VariableNode("x"), new addNode_1.AddNode(new variableNode_1.VariableNode("x"), new oppositeNode_1.OppositeNode(roots[1]))));
+            return new MultiplyNode(new NumberNode(this.a), new MultiplyNode(new VariableNode("x"), new AddNode(new VariableNode("x"), new OppositeNode(roots[1]))));
         }
         else if (roots[1].toTex() === "0") {
-            return new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), new multiplyNode_1.MultiplyNode(new variableNode_1.VariableNode("x"), new addNode_1.AddNode(new variableNode_1.VariableNode("x"), new oppositeNode_1.OppositeNode(roots[0]))));
+            return new MultiplyNode(new NumberNode(this.a), new MultiplyNode(new VariableNode("x"), new AddNode(new VariableNode("x"), new OppositeNode(roots[0]))));
         }
         else {
-            return new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), new multiplyNode_1.MultiplyNode(new addNode_1.AddNode(new variableNode_1.VariableNode("x"), new oppositeNode_1.OppositeNode(roots[0])), new addNode_1.AddNode(new variableNode_1.VariableNode("x"), new oppositeNode_1.OppositeNode(roots[1]))));
+            return new MultiplyNode(new NumberNode(this.a), new MultiplyNode(new AddNode(new VariableNode("x"), new OppositeNode(roots[0])), new AddNode(new VariableNode("x"), new OppositeNode(roots[1]))));
         }
     }
     getCanonicalForm() {
         const alpha = this.getAlpha();
         let square;
         if (alpha !== 0) {
-            square = new powerNode_1.SquareNode(new addNode_1.AddNode(new variableNode_1.VariableNode(this.variable), new oppositeNode_1.OppositeNode(this.getAlphaNode()).simplify()));
+            square = new SquareNode(new AddNode(new VariableNode(this.variable), new OppositeNode(this.getAlphaNode()).simplify()));
         }
         else {
-            square = new powerNode_1.SquareNode(new variableNode_1.VariableNode(this.variable));
+            square = new SquareNode(new VariableNode(this.variable));
         }
         const beta = this.getBeta();
         return beta !== 0
-            ? new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), square), this.getBetaNode())
-            : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), square);
+            ? new AddNode(new MultiplyNode(new NumberNode(this.a), square), this.getBetaNode())
+            : new MultiplyNode(new NumberNode(this.a), square);
     }
     getSommet() {
-        return new point_1.Point("S", this.getAlphaNode(), this.getBetaNode());
+        return new Point("S", this.getAlphaNode(), this.getBetaNode());
     }
     getCoords() {
         const alpha = this.getAlpha();
@@ -236,7 +236,7 @@ class Trinom extends polynomial_1.Polynomial {
                         : ` - ${Math.abs(this.c)}`;
         return `${aString}${bString}${cString}`;
     }
-    toGGBCommands({ name, color, label } = { name: "f", color: colors_1.blueMain, label: "" }) {
+    toGGBCommands({ name, color, label } = { name: "f", color: blueMain, label: "" }) {
         const cmds = [`${name} = ${this.toString()}`];
         if (color) {
             cmds.push(`SetColor(${name}, "${color}")`);
@@ -248,4 +248,3 @@ class Trinom extends polynomial_1.Polynomial {
         return cmds;
     }
 }
-exports.Trinom = Trinom;

package/lib/math/probability/binomial.d.ts

@@ -1,4 +1,4 @@
-import { AlgebraicNode } from "../../tree/nodes/algebraicNode";
+import { AlgebraicNode } from "../../tree/nodes/algebraicNode.js";
 export declare class Binomial {
     n: number;
     p: AlgebraicNode;

package/lib/math/probability/binomial.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"binomial.d.ts","sourceRoot":"","sources":["../../../src/math/probability/binomial.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAK/D,qBAAa,QAAQ;IACnB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,aAAa,CAAC;gBACL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,aAAa;IAKvC,GAAG,CAAC,CAAC,EAAE,MAAM;IAWb,GAAG,CAAC,CAAC,EAAE,MAAM;IAWb,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;CAW1B"}
+{"version":3,"file":"binomial.d.ts","sourceRoot":"","sources":["../../../src/math/probability/binomial.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAKlE,qBAAa,QAAQ;IACnB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,aAAa,CAAC;gBACL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,aAAa;IAKvC,GAAG,CAAC,CAAC,EAAE,MAAM;IAWb,GAAG,CAAC,CAAC,EAAE,MAAM;IAWb,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;CAW1B"}

package/lib/math/probability/binomial.js

@@ -1,30 +1,28 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Binomial = void 0;
-const combination_1 = require("../utils/combinatorics/combination");
-const sum_1 = require("../utils/stats/sum");
-class Binomial {
+import { combinations } from "../utils/combinatorics/combination.js";
+import { sum } from "../utils/stats/sum.js";
+export class Binomial {
+    n;
+    p;
     constructor(n, p) {
         this.n = n;
         this.p = p;
     }
     sup(k) {
         const proba = this.p.evaluate();
-        return (0, sum_1.sum)(k, this.n, (i) => (0, combination_1.combinations)(i, this.n) *
+        return sum(k, this.n, (i) => combinations(i, this.n) *
             Math.pow(proba, i) *
             Math.pow(1 - proba, this.n - i));
     }
     inf(k) {
         const proba = this.p.evaluate();
-        return (0, sum_1.sum)(0, k, (i) => (0, combination_1.combinations)(i, this.n) *
+        return sum(0, k, (i) => combinations(i, this.n) *
             Math.pow(proba, i) *
             Math.pow(1 - proba, this.n - i));
     }
     ineq(a, b) {
         const proba = this.p.evaluate();
-        return (0, sum_1.sum)(a, b, (i) => (0, combination_1.combinations)(i, this.n) *
+        return sum(a, b, (i) => combinations(i, this.n) *
             Math.pow(proba, i) *
             Math.pow(1 - proba, this.n - i));
     }
 }
-exports.Binomial = Binomial;

package/lib/math/sequences/arithmeticSequence.d.ts

@@ -1 +1,2 @@
+export {};
 //# sourceMappingURL=arithmeticSequence.d.ts.map

package/lib/math/sequences/arithmeticSequence.js

@@ -1 +1 @@
-"use strict";
+export {};

package/lib/math/sequences/geometricSequence.d.ts

@@ -1,5 +1,5 @@
-import { MultiplyNode } from "../../tree/nodes/operators/multiplyNode";
-import { Nombre, NumberType } from "../numbers/nombre";
+import { MultiplyNode } from "../../tree/nodes/operators/multiplyNode.js";
+import { Nombre, NumberType } from "../numbers/nombre.js";
 export declare abstract class GeometricSequenceConstructor {
     static random(reasonType?: NumberType): GeometricSequence;
     static randomWithLimit(reasonType?: NumberType): GeometricSequence;

package/lib/math/sequences/geometricSequence.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"geometricSequence.d.ts","sourceRoot":"","sources":["../../../src/math/sequences/geometricSequence.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAOvE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAIvD,8BAAsB,4BAA4B;IAChD,MAAM,CAAC,MAAM,CAAC,UAAU,GAAE,UAA+B;IAoBzD,MAAM,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,UAAU;CA2B/C;AAED,qBAAa,iBAAiB;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;gBAEH,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAK7C,QAAQ;IAOR,MAAM;CASP"}
+{"version":3,"file":"geometricSequence.d.ts","sourceRoot":"","sources":["../../../src/math/sequences/geometricSequence.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,4CAA4C,CAAC;AAO1E,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAI1D,8BAAsB,4BAA4B;IAChD,MAAM,CAAC,MAAM,CAAC,UAAU,GAAE,UAA+B;IAoBzD,MAAM,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,UAAU;CA2B/C;AAED,qBAAa,iBAAiB;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;gBAEH,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAK7C,QAAQ;IAOR,MAAM;CASP"}

package/lib/math/sequences/geometricSequence.js

@@ -1,61 +1,59 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GeometricSequence = exports.GeometricSequenceConstructor = void 0;
-const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const powerNode_1 = require("../../tree/nodes/operators/powerNode");
-const variableNode_1 = require("../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../utils/alea/coinFlip");
-const random_1 = require("../../utils/alea/random");
-const decimal_1 = require("../numbers/decimals/decimal");
-const integer_1 = require("../numbers/integer/integer");
-const nombre_1 = require("../numbers/nombre");
-const rational_1 = require("../numbers/rationals/rational");
-const randint_1 = require("../utils/random/randint");
-class GeometricSequenceConstructor {
-    static random(reasonType = nombre_1.NumberType.Integer) {
+import { MultiplyNode } from "../../tree/nodes/operators/multiplyNode.js";
+import { PowerNode } from "../../tree/nodes/operators/powerNode.js";
+import { VariableNode } from "../../tree/nodes/variables/variableNode.js";
+import { coinFlip } from "../../utils/alea/coinFlip.js";
+import { random } from "../../utils/alea/random.js";
+import { DecimalConstructor } from "../numbers/decimals/decimal.js";
+import { Integer } from "../numbers/integer/integer.js";
+import { NumberType } from "../numbers/nombre.js";
+import { RationalConstructor } from "../numbers/rationals/rational.js";
+import { randint } from "../utils/random/randint.js";
+export class GeometricSequenceConstructor {
+    static random(reasonType = NumberType.Integer) {
         let reason;
         const type = reasonType ??
-            (0, random_1.random)([nombre_1.NumberType.Decimal, nombre_1.NumberType.Integer, nombre_1.NumberType.Rational]);
+            random([NumberType.Decimal, NumberType.Integer, NumberType.Rational]);
         switch (type) {
-            case nombre_1.NumberType.Decimal:
-                reason = decimal_1.DecimalConstructor.random(-9, 10);
+            case NumberType.Decimal:
+                reason = DecimalConstructor.random(-9, 10);
                 break;
-            case nombre_1.NumberType.Integer:
-                reason = new integer_1.Integer((0, randint_1.randint)(-9, 10, [0, 1]));
+            case NumberType.Integer:
+                reason = new Integer(randint(-9, 10, [0, 1]));
                 break;
-            case nombre_1.NumberType.Rational:
-                reason = rational_1.RationalConstructor.randomIrreductible();
+            case NumberType.Rational:
+                reason = RationalConstructor.randomIrreductible();
                 break;
-            case nombre_1.NumberType.Real:
+            case NumberType.Real:
                 throw Error("real geometric reason not supported yet");
         }
-        return new GeometricSequence(new integer_1.Integer((0, randint_1.randint)(-9, 10, [0, 1])), reason);
+        return new GeometricSequence(new Integer(randint(-9, 10, [0, 1])), reason);
     }
     static randomWithLimit(reasonType) {
         let reason;
         const type = reasonType ??
-            (0, random_1.random)([nombre_1.NumberType.Decimal, nombre_1.NumberType.Integer, nombre_1.NumberType.Rational]);
+            random([NumberType.Decimal, NumberType.Integer, NumberType.Rational]);
         switch (type) {
-            case nombre_1.NumberType.Decimal:
-                const precision = (0, randint_1.randint)(1, 4);
-                reason = (0, coinFlip_1.coinFlip)()
-                    ? decimal_1.DecimalConstructor.fromParts((0, coinFlip_1.coinFlip)() ? "0" : "-0", decimal_1.DecimalConstructor.randomFracPart(precision))
-                    : decimal_1.DecimalConstructor.random(1, 10);
+            case NumberType.Decimal:
+                const precision = randint(1, 4);
+                reason = coinFlip()
+                    ? DecimalConstructor.fromParts(coinFlip() ? "0" : "-0", DecimalConstructor.randomFracPart(precision))
+                    : DecimalConstructor.random(1, 10);
                 break;
-            case nombre_1.NumberType.Integer:
-                reason = new integer_1.Integer((0, randint_1.randint)(2, 10, [0, 1]));
+            case NumberType.Integer:
+                reason = new Integer(randint(2, 10, [0, 1]));
                 break;
-            case nombre_1.NumberType.Rational:
-                reason = rational_1.RationalConstructor.randomIrreductible();
+            case NumberType.Rational:
+                reason = RationalConstructor.randomIrreductible();
                 break;
-            case nombre_1.NumberType.Real:
+            case NumberType.Real:
                 throw Error("real geometric reason not supported yet");
         }
-        return new GeometricSequence(new integer_1.Integer((0, randint_1.randint)(-9, 10, [0, 1])), reason);
+        return new GeometricSequence(new Integer(randint(-9, 10, [0, 1])), reason);
     }
 }
-exports.GeometricSequenceConstructor = GeometricSequenceConstructor;
-class GeometricSequence {
+export class GeometricSequence {
+    firstTerm;
+    reason;
     constructor(firstTerm, reason) {
         this.firstTerm = firstTerm;
         this.reason = reason;
@@ -70,9 +68,8 @@ class GeometricSequence {
         return "0";
     }
     toTree() {
-        return new multiplyNode_1.MultiplyNode(this.firstTerm.toTree(), new powerNode_1.PowerNode(this.reason.toTree(), new variableNode_1.VariableNode("n")), {
+        return new MultiplyNode(this.firstTerm.toTree(), new PowerNode(this.reason.toTree(), new VariableNode("n")), {
             forceTimesSign: true,
         });
     }
 }
-exports.GeometricSequence = GeometricSequence;

package/lib/math/sequences/sequence.d.ts

@@ -1,5 +1,5 @@
-import { Node } from '../../tree/nodes/node';
-import { Integer } from '../numbers/integer/integer';
+import { Node } from "../../tree/nodes/node.js";
+import { Integer } from "../numbers/integer/integer.js";
 declare enum SequenceType {
     arithmetic = 0,
     geometric = 1,

package/lib/math/sequences/sequence.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequence.d.ts","sourceRoot":"","sources":["../../../src/math/sequences/sequence.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,4BAA4B,CAAC;AAErD,aAAK,YAAY;IACf,UAAU,IAAA;IACV,SAAS,IAAA;IACT,KAAK,IAAA;CACN;AAED,qBAAa,QAAQ;IACnB,IAAI,EAAE,YAAY,CAAC;IACnB,SAAS,EAAE,OAAO,CAAkB;IACpC,SAAS,EAAE,IAAI,CAAC;IAChB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,mBAAmB,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;gBAChC,EACV,IAAI,EACJ,iBAAiB,EACjB,eAAe,EACf,SAAS,EACT,SAAS,EACT,mBAAmB,GACpB,EAAE;QACD,IAAI,EAAE,YAAY,CAAC;QACnB,iBAAiB,CAAC,EAAE,MAAM,CAAC;QAC3B,eAAe,CAAC,EAAE,MAAM,CAAC;QACzB,SAAS,EAAE,OAAO,CAAC;QACnB,SAAS,EAAE,IAAI,CAAC;QAChB,mBAAmB,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;KAC5C;CAQF"}
+{"version":3,"file":"sequence.d.ts","sourceRoot":"","sources":["../../../src/math/sequences/sequence.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AAChD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,aAAK,YAAY;IACf,UAAU,IAAA;IACV,SAAS,IAAA;IACT,KAAK,IAAA;CACN;AAED,qBAAa,QAAQ;IACnB,IAAI,EAAE,YAAY,CAAC;IACnB,SAAS,EAAE,OAAO,CAAkB;IACpC,SAAS,EAAE,IAAI,CAAC;IAChB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,mBAAmB,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;gBAChC,EACV,IAAI,EACJ,iBAAiB,EACjB,eAAe,EACf,SAAS,EACT,SAAS,EACT,mBAAmB,GACpB,EAAE;QACD,IAAI,EAAE,YAAY,CAAC;QACnB,iBAAiB,CAAC,EAAE,MAAM,CAAC;QAC3B,eAAe,CAAC,EAAE,MAAM,CAAC;QACzB,SAAS,EAAE,OAAO,CAAC;QACnB,SAAS,EAAE,IAAI,CAAC;QAChB,mBAAmB,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;KAC5C;CAQF"}

package/lib/math/sequences/sequence.js

@@ -1,16 +1,18 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Sequence = void 0;
-const integer_1 = require("../numbers/integer/integer");
+import { Integer } from "../numbers/integer/integer.js";
 var SequenceType;
 (function (SequenceType) {
     SequenceType[SequenceType["arithmetic"] = 0] = "arithmetic";
     SequenceType[SequenceType["geometric"] = 1] = "geometric";
     SequenceType[SequenceType["other"] = 2] = "other";
 })(SequenceType || (SequenceType = {}));
-class Sequence {
+export class Sequence {
+    type;
+    firstRank = new Integer(0);
+    firstTerm;
+    recurrenceFormula;
+    explicitFormula;
+    recurrenceEvaluator;
     constructor({ type, recurrenceFormula, explicitFormula, firstRank, firstTerm, recurrenceEvaluator, }) {
-        this.firstRank = new integer_1.Integer(0);
         this.type = type;
         this.firstTerm = firstTerm;
         this.recurrenceFormula = recurrenceFormula;
@@ -19,4 +21,3 @@ class Sequence {
         this.recurrenceEvaluator = recurrenceEvaluator;
     }
 }
-exports.Sequence = Sequence;

package/lib/math/systems/generalSystem.d.ts

@@ -1,4 +1,4 @@
-import { AlgebraicNode } from "../../tree/nodes/algebraicNode";
+import { AlgebraicNode } from "../../tree/nodes/algebraicNode.js";
 export declare class GeneralSystem {
     coeffs: AlgebraicNode[][];
     constructor(coeffs: AlgebraicNode[][]);

package/lib/math/systems/generalSystem.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"generalSystem.d.ts","sourceRoot":"","sources":["../../../src/math/systems/generalSystem.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAgB/D,qBAAa,aAAa;IACxB,MAAM,EAAE,aAAa,EAAE,EAAE,CAAC;gBAWd,MAAM,EAAE,aAAa,EAAE,EAAE;IAGrC,KAAK;;;;IA4CL,KAAK;CAYN"}
+{"version":3,"file":"generalSystem.d.ts","sourceRoot":"","sources":["../../../src/math/systems/generalSystem.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAgBlE,qBAAa,aAAa;IACxB,MAAM,EAAE,aAAa,EAAE,EAAE,CAAC;gBAWd,MAAM,EAAE,aAAa,EAAE,EAAE;IAGrC,KAAK;;;;IA4CL,KAAK;CAYN"}

package/lib/math/systems/generalSystem.js

@@ -1,11 +1,9 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GeneralSystem = void 0;
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
-const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const substractNode_1 = require("../../tree/nodes/operators/substractNode");
-class GeneralSystem {
+import { AddNode, add } from "../../tree/nodes/operators/addNode.js";
+import { frac } from "../../tree/nodes/operators/fractionNode.js";
+import { multiply, } from "../../tree/nodes/operators/multiplyNode.js";
+import { substract, } from "../../tree/nodes/operators/substractNode.js";
+export class GeneralSystem {
+    coeffs;
     //coeffs[i][0]x+coeffs[i][1]y = coeffs[i][2]
     //ax+by = c
     //a2x = c2
@@ -22,47 +20,47 @@ class GeneralSystem {
             throw Error("General system resolution not implemented yet");
         const [a, b, c] = this.coeffs[0];
         const [d, e, f] = this.coeffs[1];
-        const db = (0, multiplyNode_1.multiply)(d, b);
-        const ea = (0, multiplyNode_1.multiply)(e, a);
+        const db = multiply(d, b);
+        const ea = multiply(e, a);
         let x;
         let y;
         if (b.evaluate() === 0) {
             if (a.evaluate() === 0)
                 throw Error("No solution");
-            x = (0, fractionNode_1.frac)(c, a).simplify();
+            x = frac(c, a).simplify();
             if (e.evaluate() === 0)
                 throw Error("No solution");
-            y = (0, fractionNode_1.frac)((0, substractNode_1.substract)(f, (0, multiplyNode_1.multiply)(d, x)), e).simplify();
+            y = frac(substract(f, multiply(d, x)), e).simplify();
         }
         else if (a.evaluate() === 0) {
             if (b.evaluate() === 0)
                 throw Error("No solution");
-            y = (0, fractionNode_1.frac)(c, b).simplify();
+            y = frac(c, b).simplify();
             if (d.evaluate() === 0)
                 throw Error("No solution");
-            x = (0, fractionNode_1.frac)((0, substractNode_1.substract)(f, (0, multiplyNode_1.multiply)(e, y)), d).simplify();
+            x = frac(substract(f, multiply(e, y)), d).simplify();
         }
         else if (d.evaluate() === 0) {
             if (e.evaluate() === 0)
                 throw Error("No solution");
-            y = (0, fractionNode_1.frac)(f, e).simplify();
+            y = frac(f, e).simplify();
             if (a.evaluate() === 0)
                 throw Error("No solution");
-            x = (0, fractionNode_1.frac)((0, substractNode_1.substract)(c, (0, multiplyNode_1.multiply)(b, y)), a).simplify();
+            x = frac(substract(c, multiply(b, y)), a).simplify();
         }
         else if (e.evaluate() === 0) {
             if (d.evaluate() === 0)
                 throw Error("No solution");
-            x = (0, fractionNode_1.frac)(f, d).simplify();
+            x = frac(f, d).simplify();
             if (b.evaluate() === 0)
                 throw Error("No solution");
-            y = (0, fractionNode_1.frac)((0, substractNode_1.substract)(c, (0, multiplyNode_1.multiply)(a, x)), b).simplify();
+            y = frac(substract(c, multiply(a, x)), b).simplify();
         }
         else if (db.equals(ea))
             throw Error("No solution");
         else {
-            x = (0, fractionNode_1.frac)((0, substractNode_1.substract)((0, multiplyNode_1.multiply)(b, f), (0, multiplyNode_1.multiply)(e, c)), (0, substractNode_1.substract)(db, ea)).simplify();
-            y = (0, fractionNode_1.frac)((0, substractNode_1.substract)(c, (0, multiplyNode_1.multiply)(a, x)), b).simplify();
+            x = frac(substract(multiply(b, f), multiply(e, c)), substract(db, ea)).simplify();
+            y = frac(substract(c, multiply(a, x)), b).simplify();
         }
         return {
             x,
@@ -71,9 +69,8 @@ class GeneralSystem {
     }
     toTex() {
         return `\\left\\{\\begin{matrix}
-${(0, addNode_1.add)((0, multiplyNode_1.multiply)(this.coeffs[0][0], "x"), (0, multiplyNode_1.multiply)(this.coeffs[0][1], "y")).toTex()}=${this.coeffs[0][2]} \\\\
-${new addNode_1.AddNode((0, multiplyNode_1.multiply)(this.coeffs[1][0], "x"), (0, multiplyNode_1.multiply)(this.coeffs[1][1], "y")).toTex()}=${this.coeffs[1][2]}
+${add(multiply(this.coeffs[0][0], "x"), multiply(this.coeffs[0][1], "y")).toTex()}=${this.coeffs[0][2]} \\\\
+${new AddNode(multiply(this.coeffs[1][0], "x"), multiply(this.coeffs[1][1], "y")).toTex()}=${this.coeffs[1][2]}
 \\end{matrix}\\right.`;
     }
 }
-exports.GeneralSystem = GeneralSystem;

package/lib/math/systems/system.d.ts

@@ -6,8 +6,8 @@ export declare class System {
     coeffs: number[][];
     constructor(coeffs: number[][]);
     solve(): {
-        x: import("../../tree/nodes/algebraicNode").AlgebraicNode;
-        y: import("../../tree/nodes/algebraicNode").AlgebraicNode;
+        x: import("../../tree/nodes/algebraicNode.js").AlgebraicNode;
+        y: import("../../tree/nodes/algebraicNode.js").AlgebraicNode;
     };
     toTex(): string;
 }