math-exercises 2.0.11 → 2.0.13

package/lib/math/polynomials/rationalFrac.d.ts

@@ -1,12 +1,12 @@
-import { FractionNode } from "../../tree/nodes/operators/fractionNode";
-import { Polynomial } from "./polynomial";
-import { Rational } from "../numbers/rationals/rational";
-import { Integer } from "../numbers/integer/integer";
-export declare class RationalFrac {
-    num: Polynomial;
-    denum: Polynomial;
-    constructor(num: Polynomial, denum: Polynomial);
-    toTree(): FractionNode;
-    simplify(): Rational | Integer | RationalFrac;
-}
+import { FractionNode } from "../../tree/nodes/operators/fractionNode";
+import { Polynomial } from "./polynomial";
+import { Rational } from "../numbers/rationals/rational";
+import { Integer } from "../numbers/integer/integer";
+export declare class RationalFrac {
+    num: Polynomial;
+    denum: Polynomial;
+    constructor(num: Polynomial, denum: Polynomial);
+    toTree(): FractionNode;
+    simplify(): Rational | Integer | RationalFrac;
+}
 //# sourceMappingURL=rationalFrac.d.ts.map

package/lib/math/polynomials/rationalFrac.js

@@ -1,50 +1,50 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.RationalFrac = void 0;
-const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
-const rational_1 = require("../numbers/rationals/rational");
-const nombre_1 = require("../numbers/nombre");
-const integer_1 = require("../numbers/integer/integer");
-const gcd_1 = require("../utils/arithmetic/gcd");
-class RationalFrac {
-    constructor(num, denum) {
-        this.num = num;
-        this.denum = denum;
-    }
-    toTree() {
-        return new fractionNode_1.FractionNode(this.num.toTree(), this.denum.toTree());
-    }
-    simplify() {
-        if (this.num.coefficients.length === 1 && this.num.coefficients[0] === 0)
-            return new integer_1.Integer(0);
-        const numCoeffs = this.num.coefficients.filter((c) => c !== 0);
-        const numPGCD = numCoeffs.length > 1 ? (0, gcd_1.gcd)(...numCoeffs) : numCoeffs[0];
-        const denumCoeffs = this.denum.coefficients.filter((c) => c !== 0);
-        const denumPGCD = denumCoeffs.length > 1 ? (0, gcd_1.gcd)(...denumCoeffs) : denumCoeffs[0];
-        const rational = new rational_1.Rational(numPGCD, denumPGCD);
-        if (rational.isIrreductible()) {
-            return this;
-        }
-        const simplifiedRational = rational.simplify();
-        const simplifiedNum = this.num.scalarDivide(numPGCD);
-        const simplifiedDenum = this.denum.scalarDivide(denumPGCD);
-        if (simplifiedDenum.equals(simplifiedNum)) {
-            return simplifiedRational;
-        }
-        else {
-            const denumHasOnlyMinus = simplifiedDenum.coefficients.every((coeff) => coeff <= 0);
-            const trueDenum = denumHasOnlyMinus
-                ? simplifiedDenum.times(-1)
-                : simplifiedDenum;
-            if (simplifiedRational.type === nombre_1.NumberType.Integer) {
-                const int = simplifiedRational;
-                return new RationalFrac(simplifiedNum.times(int.value * (denumHasOnlyMinus ? -1 : 1)), trueDenum);
-            }
-            else {
-                const frac = simplifiedRational;
-                return new RationalFrac(simplifiedNum.times(frac.num * (denumHasOnlyMinus ? -1 : 1)), trueDenum.times(frac.denum));
-            }
-        }
-    }
-}
-exports.RationalFrac = RationalFrac;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RationalFrac = void 0;
+const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
+const rational_1 = require("../numbers/rationals/rational");
+const nombre_1 = require("../numbers/nombre");
+const integer_1 = require("../numbers/integer/integer");
+const gcd_1 = require("../utils/arithmetic/gcd");
+class RationalFrac {
+    constructor(num, denum) {
+        this.num = num;
+        this.denum = denum;
+    }
+    toTree() {
+        return new fractionNode_1.FractionNode(this.num.toTree(), this.denum.toTree());
+    }
+    simplify() {
+        if (this.num.coefficients.length === 1 && this.num.coefficients[0] === 0)
+            return new integer_1.Integer(0);
+        const numCoeffs = this.num.coefficients.filter((c) => c !== 0);
+        const numPGCD = numCoeffs.length > 1 ? (0, gcd_1.gcd)(...numCoeffs) : numCoeffs[0];
+        const denumCoeffs = this.denum.coefficients.filter((c) => c !== 0);
+        const denumPGCD = denumCoeffs.length > 1 ? (0, gcd_1.gcd)(...denumCoeffs) : denumCoeffs[0];
+        const rational = new rational_1.Rational(numPGCD, denumPGCD);
+        if (rational.isIrreductible()) {
+            return this;
+        }
+        const simplifiedRational = rational.simplify();
+        const simplifiedNum = this.num.scalarDivide(numPGCD);
+        const simplifiedDenum = this.denum.scalarDivide(denumPGCD);
+        if (simplifiedDenum.equals(simplifiedNum)) {
+            return simplifiedRational;
+        }
+        else {
+            const denumHasOnlyMinus = simplifiedDenum.coefficients.every((coeff) => coeff <= 0);
+            const trueDenum = denumHasOnlyMinus
+                ? simplifiedDenum.times(-1)
+                : simplifiedDenum;
+            if (simplifiedRational.type === nombre_1.NumberType.Integer) {
+                const int = simplifiedRational;
+                return new RationalFrac(simplifiedNum.times(int.value * (denumHasOnlyMinus ? -1 : 1)), trueDenum);
+            }
+            else {
+                const frac = simplifiedRational;
+                return new RationalFrac(simplifiedNum.times(frac.num * (denumHasOnlyMinus ? -1 : 1)), trueDenum.times(frac.denum));
+            }
+        }
+    }
+}
+exports.RationalFrac = RationalFrac;

package/lib/math/polynomials/trinom.d.ts

@@ -1,34 +1,34 @@
-import { NumberNode } from "../../tree/nodes/numbers/numberNode";
-import { AddNode } from "../../tree/nodes/operators/addNode";
-import { FractionNode } from "../../tree/nodes/operators/fractionNode";
-import { MultiplyNode } from "../../tree/nodes/operators/multiplyNode";
-import { Point } from "../geometry/point";
-import { MathSet } from "../sets/mathSet";
-import { Polynomial } from "./polynomial";
-import { OppositeNode } from "../../tree/nodes/functions/oppositeNode";
-import { AlgebraicNode } from "../../tree/nodes/algebraicNode";
-export declare abstract class TrinomConstructor {
-    static random(domainA?: MathSet, domainB?: MathSet, domainC?: MathSet): Trinom;
-    static randomCanonical(domainA?: MathSet, domainAlpha?: MathSet, domainBeta?: MathSet): Trinom;
-    static randomFactorized(domainA?: MathSet, domainX1?: MathSet, domainX2?: MathSet): Trinom;
-}
-export declare class Trinom extends Polynomial {
-    a: number;
-    b: number;
-    c: number;
-    variable: string;
-    constructor(a: number, b: number, c: number, variable?: string);
-    getDelta(): number;
-    getDeltaNode(): NumberNode;
-    getRoots(): number[];
-    getRootsNode(): AlgebraicNode[];
-    getRootsEquationSolutionTex(): string;
-    getAlpha(): number;
-    getAlphaNode(): NumberNode | FractionNode | OppositeNode;
-    getBeta(): number;
-    getBetaNode(): NumberNode | FractionNode | OppositeNode;
-    getFactorizedForm(): AlgebraicNode | MultiplyNode;
-    getCanonicalForm(): MultiplyNode | AddNode;
-    getSommet(): Point;
-}
+import { NumberNode } from "../../tree/nodes/numbers/numberNode";
+import { AddNode } from "../../tree/nodes/operators/addNode";
+import { FractionNode } from "../../tree/nodes/operators/fractionNode";
+import { MultiplyNode } from "../../tree/nodes/operators/multiplyNode";
+import { Point } from "../geometry/point";
+import { MathSet } from "../sets/mathSet";
+import { Polynomial } from "./polynomial";
+import { OppositeNode } from "../../tree/nodes/functions/oppositeNode";
+import { AlgebraicNode } from "../../tree/nodes/algebraicNode";
+export declare abstract class TrinomConstructor {
+    static random(domainA?: MathSet, domainB?: MathSet, domainC?: MathSet): Trinom;
+    static randomCanonical(domainA?: MathSet, domainAlpha?: MathSet, domainBeta?: MathSet): Trinom;
+    static randomFactorized(domainA?: MathSet, domainX1?: MathSet, domainX2?: MathSet): Trinom;
+}
+export declare class Trinom extends Polynomial {
+    a: number;
+    b: number;
+    c: number;
+    variable: string;
+    constructor(a: number, b: number, c: number, variable?: string);
+    getDelta(): number;
+    getDeltaNode(): NumberNode;
+    getRoots(): number[];
+    getRootsNode(): AlgebraicNode[];
+    getRootsEquationSolutionTex(): string;
+    getAlpha(): number;
+    getAlphaNode(): NumberNode | FractionNode | OppositeNode;
+    getBeta(): number;
+    getBetaNode(): NumberNode | FractionNode | OppositeNode;
+    getFactorizedForm(): AlgebraicNode;
+    getCanonicalForm(): MultiplyNode | AddNode;
+    getSommet(): Point;
+}
 //# sourceMappingURL=trinom.d.ts.map

package/lib/math/polynomials/trinom.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"trinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/trinom.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AACjE,OAAO,EAAE,OAAO,EAAE,MAAM,oCAAoC,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAIvE,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAO1C,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAEvE,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAE/D,8BAAsB,iBAAiB;IACrC,MAAM,CAAC,MAAM,CACX,OAAO,GAAE,OAER,EACD,OAAO,GAAE,OAAqC,EAC9C,OAAO,GAAE,OAAqC,GAC7C,MAAM;IAST,MAAM,CAAC,eAAe,CACpB,OAAO,GAAE,OAER,EACD,WAAW,GAAE,OAAqC,EAClD,UAAU,GAAE,OAAqC,GAChD,MAAM;IAUT,MAAM,CAAC,gBAAgB,CACrB,OAAO,GAAE,OAER,EACD,QAAQ,GAAE,OAAqC,EAC/C,QAAQ,GAAE,OAAqC,GAC9C,MAAM;CAcV;AAED,qBAAa,MAAO,SAAQ,UAAU;IACpC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;gBACL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAQnE,QAAQ;IAGR,YAAY,IAAI,UAAU;IAI1B,QAAQ;IAUR,YAAY,IAAI,aAAa,EAAE;IAoD/B,2BAA2B;IAO3B,QAAQ;IAGR,YAAY;IAIZ,OAAO;IAIP,WAAW;IAIX,iBAAiB;IA4CjB,gBAAgB;IAsBhB,SAAS;CAGV"}
+{"version":3,"file":"trinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/trinom.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AACjE,OAAO,EAAE,OAAO,EAAE,MAAM,oCAAoC,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAIvE,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAO1C,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAEvE,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAE/D,8BAAwB,iBAAiB;IACvC,MAAM,CAAC,MAAM,CACX,OAAO,GAAE,OAER,EACD,OAAO,GAAE,OAAqC,EAC9C,OAAO,GAAE,OAAqC,GAC7C,MAAM;IAST,MAAM,CAAC,eAAe,CACpB,OAAO,GAAE,OAER,EACD,WAAW,GAAE,OAAqC,EAClD,UAAU,GAAE,OAAqC,GAChD,MAAM;IAUT,MAAM,CAAC,gBAAgB,CACrB,OAAO,GAAE,OAER,EACD,QAAQ,GAAE,OAAqC,EAC/C,QAAQ,GAAE,OAAqC,GAC9C,MAAM;CAcV;AAED,qBAAa,MAAO,SAAQ,UAAU;IACpC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;gBACL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAQnE,QAAQ;IAGR,YAAY,IAAI,UAAU;IAI1B,QAAQ;IAUR,YAAY,IAAI,aAAa,EAAE;IAoD/B,2BAA2B;IAO3B,QAAQ;IAGR,YAAY;IAIZ,OAAO;IAIP,WAAW;IAIX,iBAAiB;IA4CjB,gBAAgB;IAsBhB,SAAS;CAGV"}

package/lib/math/polynomials/trinom.js

@@ -1,176 +1,176 @@
-"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 integer_1 = require("../numbers/integer/integer");
-const rational_1 = require("../numbers/rationals/rational");
-const real_1 = require("../numbers/reals/real");
-const discreteSet_1 = require("../sets/discreteSet");
-const intervals_1 = require("../sets/intervals/intervals");
-const polynomial_1 = require("./polynomial");
-const oppositeNode_1 = require("../../tree/nodes/functions/oppositeNode");
-const gcd_1 = require("../utils/arithmetic/gcd");
-class TrinomConstructor {
-    static random(domainA = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)])), domainB = new intervals_1.Interval("[[-10; 10]]"), domainC = new intervals_1.Interval("[[-10; 10]]")) {
-        const a = domainA.getRandomElement();
-        const b = domainB.getRandomElement();
-        const c = domainC.getRandomElement();
-        if (a === null || b === null || c === null)
-            throw Error("received null in random trinom");
-        return new Trinom(a.value, b.value, c.value);
-    }
-    static randomCanonical(domainA = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)])), domainAlpha = new intervals_1.Interval("[[-10; 10]]"), domainBeta = new intervals_1.Interval("[[-10; 10]]")) {
-        const a = domainA.getRandomElement();
-        const alpha = domainAlpha.getRandomElement();
-        const beta = domainBeta.getRandomElement();
-        if (a === null || alpha === null || beta === null)
-            throw Error("received null in random canonical");
-        const b = -2 * a.value * alpha.value;
-        const c = a.value * alpha.value ** 2 + beta.value;
-        return new Trinom(a.value, b, c);
-    }
-    static randomFactorized(domainA = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)])), domainX1 = new intervals_1.Interval("[[-10; 10]]"), domainX2 = new intervals_1.Interval("[[-10; 10]]")) {
-        const a = domainA.getRandomElement();
-        const x1 = domainX1.getRandomElement();
-        const x2 = domainX2.getRandomElement();
-        if (a === null || x1 === null || x2 === null)
-            throw Error("received null in random factorized");
-        //a*x^2 + ax*-x2 + a*-x1*x + a*-x1*-x2
-        return new Trinom(a.value, -a.value * (x1.value + x2.value), a.value * x1.value * x2.value);
-    }
-}
-exports.TrinomConstructor = TrinomConstructor;
-class Trinom extends polynomial_1.Polynomial {
-    constructor(a, b, c, variable = "x") {
-        super([c, b, a], variable);
-        this.a = a;
-        this.b = b;
-        this.c = c;
-        this.variable = variable;
-    }
-    getDelta() {
-        return this.b ** 2 - 4 * this.a * this.c;
-    }
-    getDeltaNode() {
-        return new numberNode_1.NumberNode(this.getDelta());
-    }
-    getRoots() {
-        const delta = this.getDelta();
-        if (delta < 0)
-            return [];
-        if (delta === 0)
-            return [-this.b / (2 * this.a)];
-        return [
-            (-this.b - Math.sqrt(delta)) / (2 * this.a),
-            (-this.b + Math.sqrt(delta)) / (2 * this.a),
-        ];
-    }
-    getRootsNode() {
-        const delta = this.getDelta();
-        if (delta < 0)
-            return [];
-        if (delta === 0)
-            return [new rational_1.Rational(-this.b, 2 * this.a).simplify().toTree()];
-        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)
-                .simplify()
-                .toTree();
-            const subNode = new rational_1.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 denum = 2 * this.a;
-        let trueB = this.b;
-        const pgcd = (0, gcd_1.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)));
-        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);
-        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_1.FractionNode(addNode, new numberNode_1.NumberNode(denum)),
-                    new fractionNode_1.FractionNode(subNode, new numberNode_1.NumberNode(denum)),
-                ];
-        }
-    }
-    getRootsEquationSolutionTex() {
-        const roots = this.getRootsNode();
-        if (!roots.length)
-            return `S=\\emptyset`;
-        if (roots.length === 1)
-            return `S=\\left\\{${roots[0].toTex()}\\right\\}`;
-        return `S=\\left\\{${roots[0].toTex()};${roots[1].toTex()}\\right\\}`;
-    }
-    getAlpha() {
-        return -this.b / (2 * this.a);
-    }
-    getAlphaNode() {
-        return new rational_1.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();
-    }
-    getFactorizedForm() {
-        const roots = this.getRootsNode();
-        if (!roots.length)
-            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]))));
-        }
-        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]))));
-        }
-        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]))));
-        }
-        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]))));
-        }
-    }
-    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())));
-        }
-        else {
-            square = new powerNode_1.SquareNode(new variableNode_1.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), new numberNode_1.NumberNode(this.getBeta()))
-            : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), square);
-    }
-    getSommet() {
-        return new point_1.Point("S", this.getAlphaNode(), this.getBetaNode());
-    }
-}
-exports.Trinom = Trinom;
+"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 integer_1 = require("../numbers/integer/integer");
+const rational_1 = require("../numbers/rationals/rational");
+const real_1 = require("../numbers/reals/real");
+const discreteSet_1 = require("../sets/discreteSet");
+const intervals_1 = require("../sets/intervals/intervals");
+const polynomial_1 = require("./polynomial");
+const oppositeNode_1 = require("../../tree/nodes/functions/oppositeNode");
+const gcd_1 = require("../utils/arithmetic/gcd");
+class TrinomConstructor {
+    static random(domainA = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)])), domainB = new intervals_1.Interval("[[-10; 10]]"), domainC = new intervals_1.Interval("[[-10; 10]]")) {
+        const a = domainA.getRandomElement();
+        const b = domainB.getRandomElement();
+        const c = domainC.getRandomElement();
+        if (a === null || b === null || c === null)
+            throw Error("received null in random trinom");
+        return new Trinom(a.value, b.value, c.value);
+    }
+    static randomCanonical(domainA = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)])), domainAlpha = new intervals_1.Interval("[[-10; 10]]"), domainBeta = new intervals_1.Interval("[[-10; 10]]")) {
+        const a = domainA.getRandomElement();
+        const alpha = domainAlpha.getRandomElement();
+        const beta = domainBeta.getRandomElement();
+        if (a === null || alpha === null || beta === null)
+            throw Error("received null in random canonical");
+        const b = -2 * a.value * alpha.value;
+        const c = a.value * alpha.value ** 2 + beta.value;
+        return new Trinom(a.value, b, c);
+    }
+    static randomFactorized(domainA = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)])), domainX1 = new intervals_1.Interval("[[-10; 10]]"), domainX2 = new intervals_1.Interval("[[-10; 10]]")) {
+        const a = domainA.getRandomElement();
+        const x1 = domainX1.getRandomElement();
+        const x2 = domainX2.getRandomElement();
+        if (a === null || x1 === null || x2 === null)
+            throw Error("received null in random factorized");
+        //a*x^2 + ax*-x2 + a*-x1*x + a*-x1*-x2
+        return new Trinom(a.value, -a.value * (x1.value + x2.value), a.value * x1.value * x2.value);
+    }
+}
+exports.TrinomConstructor = TrinomConstructor;
+class Trinom extends polynomial_1.Polynomial {
+    constructor(a, b, c, variable = "x") {
+        super([c, b, a], variable);
+        this.a = a;
+        this.b = b;
+        this.c = c;
+        this.variable = variable;
+    }
+    getDelta() {
+        return this.b ** 2 - 4 * this.a * this.c;
+    }
+    getDeltaNode() {
+        return new numberNode_1.NumberNode(this.getDelta());
+    }
+    getRoots() {
+        const delta = this.getDelta();
+        if (delta < 0)
+            return [];
+        if (delta === 0)
+            return [-this.b / (2 * this.a)];
+        return [
+            (-this.b - Math.sqrt(delta)) / (2 * this.a),
+            (-this.b + Math.sqrt(delta)) / (2 * this.a),
+        ];
+    }
+    getRootsNode() {
+        const delta = this.getDelta();
+        if (delta < 0)
+            return [];
+        if (delta === 0)
+            return [new rational_1.Rational(-this.b, 2 * this.a).simplify().toTree()];
+        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)
+                .simplify()
+                .toTree();
+            const subNode = new rational_1.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 denum = 2 * this.a;
+        let trueB = this.b;
+        const pgcd = (0, gcd_1.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)));
+        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);
+        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_1.FractionNode(addNode, new numberNode_1.NumberNode(denum)),
+                    new fractionNode_1.FractionNode(subNode, new numberNode_1.NumberNode(denum)),
+                ];
+        }
+    }
+    getRootsEquationSolutionTex() {
+        const roots = this.getRootsNode();
+        if (!roots.length)
+            return `S=\\emptyset`;
+        if (roots.length === 1)
+            return `S=\\left\\{${roots[0].toTex()}\\right\\}`;
+        return `S=\\left\\{${roots[0].toTex()};${roots[1].toTex()}\\right\\}`;
+    }
+    getAlpha() {
+        return -this.b / (2 * this.a);
+    }
+    getAlphaNode() {
+        return new rational_1.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();
+    }
+    getFactorizedForm() {
+        const roots = this.getRootsNode();
+        if (!roots.length)
+            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]))));
+        }
+        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]))));
+        }
+        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]))));
+        }
+        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]))));
+        }
+    }
+    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())));
+        }
+        else {
+            square = new powerNode_1.SquareNode(new variableNode_1.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), new numberNode_1.NumberNode(this.getBeta()))
+            : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), square);
+    }
+    getSommet() {
+        return new point_1.Point("S", this.getAlphaNode(), this.getBetaNode());
+    }
+}
+exports.Trinom = Trinom;

package/lib/math/sequences/arithmeticSequence.js

@@ -1 +1 @@
-"use strict";
+"use strict";

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

@@ -1,14 +1,14 @@
-import { MultiplyNode } from '../../tree/nodes/operators/multiplyNode';
-import { Nombre, NumberType } from '../numbers/nombre';
-export declare abstract class GeometricSequenceConstructor {
-    static random(reasonType?: NumberType): GeometricSequence;
-    static randomWithLimit(reasonType?: NumberType): GeometricSequence;
-}
-export declare class GeometricSequence {
-    firstTerm: Nombre;
-    reason: Nombre;
-    constructor(firstTerm: Nombre, reason: Nombre);
-    getLimit(): string | null;
-    toTree(): MultiplyNode;
-}
+import { MultiplyNode } from '../../tree/nodes/operators/multiplyNode';
+import { Nombre, NumberType } from '../numbers/nombre';
+export declare abstract class GeometricSequenceConstructor {
+    static random(reasonType?: NumberType): GeometricSequence;
+    static randomWithLimit(reasonType?: NumberType): GeometricSequence;
+}
+export declare class GeometricSequence {
+    firstTerm: Nombre;
+    reason: Nombre;
+    constructor(firstTerm: Nombre, reason: Nombre);
+    getLimit(): string | null;
+    toTree(): MultiplyNode;
+}
 //# sourceMappingURL=geometricSequence.d.ts.map