math-exercises 2.0.1 → 2.0.2

package/lib/math/numbers/integer/primes.js

@@ -1,4 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.primes = void 0;
-exports.primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97];
+exports.primes = [
+    2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
+    73, 79, 83, 89, 97,
+];

package/lib/math/numbers/nombre.d.ts

@@ -1,23 +1,18 @@
-import { Node } from '../../tree/nodes/node';
-import { FractionNodeOptions } from '../../tree/nodes/operators/fractionNode';
-import { Integer } from './integer/integer';
+import { Node, NodeOptions } from "../../tree/nodes/node";
+import { Integer } from "./integer/integer";
 export declare enum NumberType {
     Integer = 0,
     Decimal = 1,
     Rational = 2,
     Real = 3
 }
-type ToTreeOpts = {
-    FractionNodeOpts?: FractionNodeOptions;
-};
 export interface Nombre {
     value: number;
     tex: string;
     type: NumberType;
-    toTree: (opts?: ToTreeOpts) => Node;
+    toTree: (opts?: NodeOptions) => Node;
 }
 export declare abstract class NombreConstructor {
     static random(): import("./decimals/decimal").Decimal | Integer | import("./rationals/rational").Rational | import("./reals/real").Real;
 }
-export {};
 //# sourceMappingURL=nombre.d.ts.map

package/lib/math/numbers/nombre.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"nombre.d.ts","sourceRoot":"","sources":["../../../src/math/numbers/nombre.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAC7C,OAAO,EAAE,mBAAmB,EAAE,MAAM,yCAAyC,CAAC;AAI9E,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAI5C,oBAAY,UAAU;IACpB,OAAO,IAAA;IACP,OAAO,IAAA;IACP,QAAQ,IAAA;IACR,IAAI,IAAA;CACL;AAED,KAAK,UAAU,GAAG;IAChB,gBAAgB,CAAC,EAAE,mBAAmB,CAAC;CACxC,CAAC;AACF,MAAM,WAAW,MAAM;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,UAAU,CAAC;IACjB,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,UAAU,KAAK,IAAI,CAAC;CACrC;AAED,8BAAsB,iBAAiB;IACrC,MAAM,CAAC,MAAM;CAad"}
+{"version":3,"file":"nombre.d.ts","sourceRoot":"","sources":["../../../src/math/numbers/nombre.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAI1D,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAI5C,oBAAY,UAAU;IACpB,OAAO,IAAA;IACP,OAAO,IAAA;IACP,QAAQ,IAAA;IACR,IAAI,IAAA;CACL;AAED,MAAM,WAAW,MAAM;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,UAAU,CAAC;IACjB,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,IAAI,CAAC;CACtC;AAED,8BAAsB,iBAAiB;IACrC,MAAM,CAAC,MAAM;CAkBd"}

package/lib/math/numbers/nombre.js

@@ -16,7 +16,12 @@ var NumberType;
 })(NumberType = exports.NumberType || (exports.NumberType = {}));
 class NombreConstructor {
     static random() {
-        const type = (0, random_1.random)([NumberType.Decimal, NumberType.Decimal, NumberType.Rational, NumberType.Real]);
+        const type = (0, random_1.random)([
+            NumberType.Decimal,
+            NumberType.Decimal,
+            NumberType.Rational,
+            NumberType.Real,
+        ]);
         switch (type) {
             case NumberType.Integer:
                 return new integer_1.Integer((0, randint_1.randint)(-9, 10));

package/lib/math/numbers/rationals/rational.d.ts

@@ -1,9 +1,6 @@
-import { Node } from '../../../tree/nodes/node';
-import { FractionNodeOptions } from '../../../tree/nodes/operators/fractionNode';
-import { Nombre, NumberType } from '../nombre';
-type ToTreeOpts = {
-    FractionNodeOpts?: FractionNodeOptions;
-};
+import { Node, NodeOptions } from "../../../tree/nodes/node";
+import { Integer } from "../integer/integer";
+import { Nombre, NumberType } from "../nombre";
 export declare abstract class RationalConstructor {
     /**
      * @param maxGcd max number by which the fraction is simplifiable
@@ -22,11 +19,11 @@ export declare class Rational implements Nombre {
     constructor(numerator: number, denumerator: number);
     toTex(): string;
     add(nb: Nombre): Nombre;
-    multiply(nb: Nombre): Nombre;
+    multiply(nb: Nombre): Rational | Integer;
     divide(nb: Nombre): Nombre;
     opposite(): Rational;
-    toTree(opts?: ToTreeOpts): Node;
-    simplify(): Nombre;
+    toTree(opts?: NodeOptions): Node;
+    isIrreductible(): boolean;
+    simplify(): Integer | Rational;
 }
-export {};
 //# sourceMappingURL=rational.d.ts.map

package/lib/math/numbers/rationals/rational.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rational.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/rationals/rational.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAE7C,OAAO,EAAgB,mBAAmB,EAAE,MAAM,yCAAyC,CAAC;AAM5F,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE/C,KAAK,UAAU,GAAG;IAChB,gBAAgB,CAAC,EAAE,mBAAmB,CAAC;CACxC,CAAC;AACF,8BAAsB,mBAAmB;IACvC;;OAEG;IACH,MAAM,CAAC,kBAAkB,CAAC,MAAM,GAAE,MAAW;IAW7C,MAAM,CAAC,kBAAkB,CAAC,GAAG,GAAE,MAAW;IAO1C,MAAM,CAAC,0BAA0B,CAAC,GAAG,GAAE,MAAW;CAQnD;AAED,qBAAa,QAAS,YAAW,MAAM;IACrC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,OAAO,CAAC;IACtB,IAAI,EAAE,UAAU,CAAC;gBAEL,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAUlD,KAAK;IAIL,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgBvB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgB5B,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgB1B,QAAQ,IAAI,QAAQ;IAIpB,MAAM,CAAC,IAAI,CAAC,EAAE,UAAU,GAAG,IAAI;IAQ/B,QAAQ,IAAI,MAAM;CAMnB"}
+{"version":3,"file":"rational.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/rationals/rational.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAM1D,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAE7C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE/C,8BAAsB,mBAAmB;IACvC;;OAEG;IACH,MAAM,CAAC,kBAAkB,CAAC,MAAM,GAAE,MAAW;IAW7C,MAAM,CAAC,kBAAkB,CAAC,GAAG,GAAE,MAAW;IAO1C,MAAM,CAAC,0BAA0B,CAAC,GAAG,GAAE,MAAW;CAQnD;AAED,qBAAa,QAAS,YAAW,MAAM;IACrC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,OAAO,CAAC;IACtB,IAAI,EAAE,UAAU,CAAC;gBAEL,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAYlD,KAAK;IAML,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAkBvB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,OAAO;IAgBxC,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgB1B,QAAQ,IAAI,QAAQ;IAIpB,MAAM,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,IAAI;IAgBhC,cAAc;IAId,QAAQ,IAAI,OAAO,GAAG,QAAQ;CAY/B"}

package/lib/math/numbers/rationals/rational.js

@@ -50,16 +50,16 @@ exports.RationalConstructor = RationalConstructor;
 class Rational {
     constructor(numerator, denumerator) {
         if (denumerator === 0)
-            throw Error('division by zero');
+            throw Error("division by zero");
         this.num = numerator;
         this.denum = denumerator;
         this.value = numerator / denumerator;
         this.isSimplified = Math.abs((0, gcd_1.gcd)(numerator, denumerator)) === 1;
-        this.tex = `${this.num < 0 ? '-' : ''}\\frac{${this.num < 0 ? -this.num : this.num}}{${this.denum}}`;
+        this.tex = `${this.num < 0 ? "-" : ""}\\frac{${this.num < 0 ? -this.num : this.num}}{${this.denum}}`;
         this.type = nombre_1.NumberType.Rational;
     }
     toTex() {
-        return `${this.num < 0 ? '-' : ''}\\frac{${this.num < 0 ? -this.num : this.num}}{${this.denum}}`;
+        return `${this.num < 0 ? "-" : ""}\\frac{${this.num < 0 ? -this.num : this.num}}{${this.denum}}`;
     }
     add(nb) {
         switch (nb.type) {
@@ -70,11 +70,12 @@ class Rational {
             case nombre_1.NumberType.Rational: {
                 const rational = nb;
                 const ppcm = (0, lcd_1.lcd)(rational.denum, this.denum);
-                const num = this.num * (ppcm / this.denum) + rational.num * (ppcm / rational.denum);
+                const num = this.num * (ppcm / this.denum) +
+                    rational.num * (ppcm / rational.denum);
                 return new Rational(num, ppcm).simplify();
             }
         }
-        throw Error('not implemented yet');
+        throw Error("not implemented yet");
     }
     multiply(nb) {
         switch (nb.type) {
@@ -90,7 +91,7 @@ class Rational {
                 return new Rational(num, denum).simplify();
             }
         }
-        throw Error('not implemented yet');
+        throw Error("not implemented yet");
     }
     divide(nb) {
         switch (nb.type) {
@@ -105,18 +106,23 @@ class Rational {
                 return new Rational(num, denum).simplify();
             }
         }
-        throw Error('not implemented yet');
+        throw Error("not implemented yet");
     }
     opposite() {
         return new Rational(-this.num, this.denum);
     }
     toTree(opts) {
         if (this.num < 0)
-            return new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-this.num), new numberNode_1.NumberNode(this.denum), opts?.FractionNodeOpts));
-        return new fractionNode_1.FractionNode(new numberNode_1.NumberNode(this.num), new numberNode_1.NumberNode(this.denum), opts?.FractionNodeOpts);
+            return new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-this.num), new numberNode_1.NumberNode(this.denum), opts));
+        return new fractionNode_1.FractionNode(new numberNode_1.NumberNode(this.num), new numberNode_1.NumberNode(this.denum), opts);
+    }
+    isIrreductible() {
+        return this.denum !== 1 && (0, gcd_1.gcd)(this.num, this.denum) === 1;
     }
     simplify() {
-        const sign = (this.num > 0 && this.denum > 0) || (this.num < 0 && this.denum < 0) ? 1 : -1;
+        const sign = (this.num > 0 && this.denum > 0) || (this.num < 0 && this.denum < 0)
+            ? 1
+            : -1;
         const div = Math.abs((0, gcd_1.gcd)(this.num, this.denum));
         if (Math.abs(this.denum) === div)
             return new integer_1.Integer(this.num / this.denum);

package/lib/math/numbers/reals/extendedRingElement.d.ts

@@ -1,3 +1,5 @@
+import { NumberNode } from '../../../tree/nodes/numbers/numberNode';
+import { SubstractNode } from '../../../tree/nodes/operators/substractNode';
 import { Nombre } from '../nombre';
 /**
  * element of Q(x)
@@ -8,6 +10,6 @@ export declare class ExtendedRingElement {
     b: number;
     algebraicElement: Nombre;
     constructor(a: number, b: number, algebraicElement: Nombre);
-    toTree(): import("../../../tree/nodes/node").Node;
+    toTree(): import("../../../tree/nodes/node").Node | NumberNode | SubstractNode;
 }
 //# sourceMappingURL=extendedRingElement.d.ts.map

package/lib/math/numbers/reals/extendedRingElement.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"extendedRingElement.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/reals/extendedRingElement.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAEnC;;;GAGG;AACH,qBAAa,mBAAmB;IAM9B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,gBAAgB,EAAE,MAAM,CAAC;gBACb,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM;IAM1D,MAAM;CAeP"}
+{"version":3,"file":"extendedRingElement.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/reals/extendedRingElement.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AAGjE,OAAO,EAAE,aAAa,EAAE,MAAM,0CAA0C,CAAC;AACzE,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAEnC;;;GAGG;AACH,qBAAa,mBAAmB;IAM9B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,gBAAgB,EAAE,MAAM,CAAC;gBACb,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM;IAM1D,MAAM;CAeP"}

package/lib/math/numbers/reals/real.d.ts

@@ -14,7 +14,7 @@ export declare abstract class SquareRootConstructor {
     /**
      * @returns simplifiable square root type sqrt(c)=a*sqrt(b)
      */
-    static randomSimplifiable({ allowPerfectSquare, maxSquare }: {
+    static randomSimplifiable({ allowPerfectSquare, maxSquare, }: {
         allowPerfectSquare?: boolean | undefined;
         maxSquare?: number | undefined;
     }): SquareRoot;
@@ -23,6 +23,7 @@ export declare abstract class SquareRootConstructor {
 export declare class SquareRoot extends Real {
     operand: number;
     constructor(operand: number);
+    isSimplifiable(): boolean;
     getSimplifiedCoeffs(): [number, number];
     simplify(): Nombre;
     toTex(): string;

package/lib/math/numbers/reals/real.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"real.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/reals/real.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAQ7C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC/C,8BAAsB,eAAe;IACnC,MAAM,CAAC,MAAM;CAUd;AACD,qBAAa,IAAK,YAAW,MAAM;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,UAAU,CAAC;gBACL,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM;IAKtC,MAAM,IAAI,IAAI;CAIf;AAED,8BAAsB,qBAAqB;IACzC;;OAEG;IACH,MAAM,CAAC,kBAAkB,CAAC,EAAE,kBAA0B,EAAE,SAAc,EAAE;;;KAAA,GAAG,UAAU;IASrF,MAAM,CAAC,kBAAkB,CAAC,GAAG,GAAE,MAAW,GAAG,UAAU;CAIxD;AAED,qBAAa,UAAW,SAAQ,IAAI;IAClC,OAAO,EAAE,MAAM,CAAC;gBACJ,OAAO,EAAE,MAAM;IAK3B,mBAAmB,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;IAevC,QAAQ,IAAI,MAAM;IAqBlB,KAAK,IAAI,MAAM;IAIf,MAAM,IAAI,IAAI;CAGf"}
+{"version":3,"file":"real.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/reals/real.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAQ7C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC/C,8BAAsB,eAAe;IACnC,MAAM,CAAC,MAAM;CAUd;AACD,qBAAa,IAAK,YAAW,MAAM;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,UAAU,CAAC;gBACL,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM;IAKtC,MAAM,IAAI,IAAI;CAIf;AAED,8BAAsB,qBAAqB;IACzC;;OAEG;IACH,MAAM,CAAC,kBAAkB,CAAC,EACxB,kBAA0B,EAC1B,SAAc,GACf;;;KAAA,GAAG,UAAU;IASd,MAAM,CAAC,kBAAkB,CAAC,GAAG,GAAE,MAAW,GAAG,UAAU;CAIxD;AAED,qBAAa,UAAW,SAAQ,IAAI;IAClC,OAAO,EAAE,MAAM,CAAC;gBACJ,OAAO,EAAE,MAAM;IAK3B,cAAc;IAMd,mBAAmB,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;IAiBvC,QAAQ,IAAI,MAAM;IAyBlB,KAAK,IAAI,MAAM;IAIf,MAAM,IAAI,IAAI;CAGf"}

package/lib/math/numbers/reals/real.js

@@ -43,7 +43,7 @@ class SquareRootConstructor {
     /**
      * @returns simplifiable square root type sqrt(c)=a*sqrt(b)
      */
-    static randomSimplifiable({ allowPerfectSquare = false, maxSquare = 11 }) {
+    static randomSimplifiable({ allowPerfectSquare = false, maxSquare = 11, }) {
         const a = (0, randint_1.randint)(2, maxSquare);
         let b;
         let bMin = allowPerfectSquare ? 1 : 2;
@@ -63,7 +63,15 @@ class SquareRoot extends Real {
         super(Math.sqrt(operand), `\\sqrt{${operand}}`);
         this.operand = operand;
     }
+    isSimplifiable() {
+        if (this.operand === 0 || this.operand === 1)
+            return true;
+        const [a, b] = this.getSimplifiedCoeffs();
+        return a !== 1;
+    }
     getSimplifiedCoeffs() {
+        if (this.operand === 0)
+            return [1, 0];
         const factors = (0, primeFactors_1.primeFactors)(this.operand);
         // finds primes with even exponents
         const multiples = [1];
@@ -81,6 +89,8 @@ class SquareRoot extends Real {
     simplify() {
         if (this.operand === 0)
             return new integer_1.Integer(0);
+        if (this.operand === 1)
+            return new integer_1.Integer(1);
         const [outsideSqrt, insideSqrt] = this.getSimplifiedCoeffs();
         const simplified = insideSqrt !== 1
             ? new Real(outsideSqrt * Math.sqrt(insideSqrt), `${outsideSqrt === 1 ? "" : `${outsideSqrt}`}\\sqrt{${insideSqrt}}`)

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

@@ -1,4 +1,5 @@
-import { Node } from '../../tree/nodes/node';
+import { Node, NodeOptions } from "../../tree/nodes/node";
+import { NumberNode } from "../../tree/nodes/numbers/numberNode";
 export declare abstract class PolynomialConstructor {
     static randomWithOrder(order: number, variable?: string): Polynomial;
     static random(maxOrder: number, variable?: string): Polynomial;
@@ -11,7 +12,7 @@ export declare abstract class PolynomialConstructor {
      */
     static randomWithLength(maxOrder: number, length: number, variable?: string): Polynomial;
     static randomWithLengthAndSameSigns(maxOrder: number, length: number, variable?: string): Polynomial;
-    static randomNoFI(maxOrder: number, to: '+\\infty' | '-\\infty', length?: number, variable?: string): Polynomial;
+    static randomNoFI(maxOrder: number, to: "+\\infty" | "-\\infty", length?: number, variable?: string): Polynomial;
 }
 export declare class Polynomial {
     degree: number;
@@ -28,15 +29,17 @@ export declare class Polynomial {
     constructor(coefficients: number[], variable?: string);
     equals(P: Polynomial): boolean;
     getRoots(): number[];
-    add(P: Polynomial): Polynomial;
+    add(P: Polynomial | number): Polynomial;
     times(nb: number): Polynomial;
     multiply(Q: Polynomial): Polynomial;
+    scalarDivide(n: number): Polynomial;
     opposite(): Polynomial;
     derivate(): Polynomial;
-    integrate(): Polynomial;
+    integrateToNode(opts?: NodeOptions): Node;
     calculate(x: number): number;
-    getLimit(to: '+\\infty' | '-\\infty'): string;
-    toTree(): Node;
+    getLimit(to: "+\\infty" | "-\\infty"): string;
+    getLimitNode(to: "+\\infty" | "-\\infty"): NumberNode | import("../../tree/nodes/numbers/constantNode").ConstantNode;
+    toTree(opts?: NodeOptions): Node;
     toTex(): string;
     toString(): string;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"polynomial.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/polynomial.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAW7C,8BAAsB,qBAAqB;IACzC,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAa5D,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IActD;;;;;;OAMG;IACH,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAmBhF,MAAM,CAAC,4BAA4B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAmB5F,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,GAAG,UAAU,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;CAyBzG;AAED,qBAAa,UAAU;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;OAIG;gBACS,YAAY,EAAE,MAAM,EAAE,EAAE,QAAQ,GAAE,MAAY;IAS1D,MAAM,CAAC,CAAC,EAAE,UAAU,GAAG,OAAO;IAG9B,QAAQ,IAAI,MAAM,EAAE;IAkCpB,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAkB9B,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU;IAO7B,QAAQ,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAsBnC,QAAQ,IAAI,UAAU;IAOtB,QAAQ,IAAI,UAAU;IAQtB,SAAS,IAAI,UAAU;IAMvB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAM5B,QAAQ,CAAC,EAAE,EAAE,UAAU,GAAG,UAAU,GAAG,MAAM;IAiB7C,MAAM,IAAI,IAAI;IAmCd,KAAK,IAAI,MAAM;IAkBf,QAAQ,IAAI,MAAM;CAGnB"}
+{"version":3,"file":"polynomial.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/polynomial.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AAejE,8BAAsB,qBAAqB;IACzC,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAa5D,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IActD;;;;;;OAMG;IACH,MAAM,CAAC,gBAAgB,CACrB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,QAAQ,GAAE,MAAY;IAoBxB,MAAM,CAAC,4BAA4B,CACjC,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,QAAQ,GAAE,MAAY;IAqBxB,MAAM,CAAC,UAAU,CACf,QAAQ,EAAE,MAAM,EAChB,EAAE,EAAE,UAAU,GAAG,UAAU,EAC3B,MAAM,CAAC,EAAE,MAAM,EACf,QAAQ,GAAE,MAAY;CAmCzB;AAED,qBAAa,UAAU;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;OAIG;gBACS,YAAY,EAAE,MAAM,EAAE,EAAE,QAAQ,GAAE,MAAY;IAY1D,MAAM,CAAC,CAAC,EAAE,UAAU,GAAG,OAAO;IAM9B,QAAQ,IAAI,MAAM,EAAE;IAkCpB,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,GAAG,UAAU;IAyBvC,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU;IAQ7B,QAAQ,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAuBnC,YAAY,CAAC,CAAC,EAAE,MAAM,GAAG,UAAU;IAMnC,QAAQ,IAAI,UAAU;IAOtB,QAAQ,IAAI,UAAU;IAmBtB,eAAe,CAAC,IAAI,CAAC,EAAE,WAAW;IA+BlC,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAO5B,QAAQ,CAAC,EAAE,EAAE,UAAU,GAAG,UAAU,GAAG,MAAM;IAiB7C,YAAY,CAAC,EAAE,EAAE,UAAU,GAAG,UAAU;IAiBxC,MAAM,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,IAAI;IAuChC,KAAK,IAAI,MAAM;IAyBf,QAAQ,IAAI,MAAM;CAGnB"}

package/lib/math/polynomials/polynomial.js

@@ -9,10 +9,12 @@ const powerNode_1 = require("../../tree/nodes/operators/powerNode");
 const variableNode_1 = require("../../tree/nodes/variables/variableNode");
 const randint_1 = require("../../math/utils/random/randint");
 const coinFlip_1 = require("../../utils/coinFlip");
+const rational_1 = require("../numbers/rationals/rational");
+const infiniteNode_1 = require("../../tree/nodes/numbers/infiniteNode");
 class PolynomialConstructor {
-    static randomWithOrder(order, variable = 'x') {
+    static randomWithOrder(order, variable = "x") {
         if (order < 0) {
-            throw Error('Order must be a non-negative integer');
+            throw Error("Order must be a non-negative integer");
         }
         const coefficients = [];
         for (let i = 0; i <= order - 1; i++) {
@@ -21,9 +23,9 @@ class PolynomialConstructor {
         coefficients.push((0, randint_1.randint)(-9, 10, [0]));
         return new Polynomial(coefficients, variable);
     }
-    static random(maxOrder, variable = 'x') {
+    static random(maxOrder, variable = "x") {
         if (maxOrder < 0) {
-            throw Error('Order must be a non-negative integer');
+            throw Error("Order must be a non-negative integer");
         }
         const order = (0, randint_1.randint)(1, maxOrder + 1);
         const coefficients = [];
@@ -40,9 +42,9 @@ class PolynomialConstructor {
      * @param variable
      * @returns
      */
-    static randomWithLength(maxOrder, length, variable = 'x') {
+    static randomWithLength(maxOrder, length, variable = "x") {
         if (maxOrder < 0) {
-            throw Error('Order must be a non-negative integer');
+            throw Error("Order must be a non-negative integer");
         }
         const order = (0, randint_1.randint)(1, maxOrder + 1);
         const coefficients = [];
@@ -59,9 +61,9 @@ class PolynomialConstructor {
         coefficients.push((0, randint_1.randint)(-9, 10, [0]));
         return new Polynomial(coefficients, variable);
     }
-    static randomWithLengthAndSameSigns(maxOrder, length, variable = 'x') {
+    static randomWithLengthAndSameSigns(maxOrder, length, variable = "x") {
         if (maxOrder < 0) {
-            throw Error('Order must be a non-negative integer');
+            throw Error("Order must be a non-negative integer");
         }
         const order = (0, randint_1.randint)(1, maxOrder + 1);
         const coefficients = [];
@@ -79,13 +81,13 @@ class PolynomialConstructor {
         coefficients.push(sign * (0, randint_1.randint)(0, 10, [0]));
         return new Polynomial(coefficients, variable);
     }
-    static randomNoFI(maxOrder, to, length, variable = 'x') {
+    static randomNoFI(maxOrder, to, length, variable = "x") {
         if (maxOrder < 0) {
-            throw Error('Order must be a non-negative integer');
+            throw Error("Order must be a non-negative integer");
         }
         const order = (0, randint_1.randint)(1, maxOrder + 1);
         const fixedLength = length ?? order;
-        if (to === '+\\infty') {
+        if (to === "+\\infty") {
             return PolynomialConstructor.randomWithLengthAndSameSigns(maxOrder, fixedLength, variable);
         }
         //en -infini les degrés de parité différentes doivent avoir un signe différent
@@ -112,18 +114,20 @@ class Polynomial {
      * @param coefficients coefficients[i] est le coeff de x^i
      * @param variable
      */
-    constructor(coefficients, variable = 'x') {
+    constructor(coefficients, variable = "x") {
         if (coefficients.length === 0)
-            throw Error('coeffs must be not null');
-        if (coefficients.length > 1 && coefficients[coefficients.length - 1] === 0) {
-            throw Error('n-th coeff must be not null');
+            throw Error("coeffs must be not null");
+        if (coefficients.length > 1 &&
+            coefficients[coefficients.length - 1] === 0) {
+            throw Error("n-th coeff must be not null");
         }
         this.coefficients = coefficients;
         this.variable = variable;
         this.degree = coefficients.length - 1;
     }
     equals(P) {
-        return P.degree === this.degree && this.coefficients.every((coeff, i) => coeff === P.coefficients[i]);
+        return (P.degree === this.degree &&
+            this.coefficients.every((coeff, i) => coeff === P.coefficients[i]));
     }
     getRoots() {
         const roots = [];
@@ -154,11 +158,14 @@ class Polynomial {
         }
         else {
             //méthode de Newton-Raphson ou des bibliothèques de calcul symbolique pour obtenir les racines.
-            throw Error('general roots not implemented yet');
+            throw Error("general roots not implemented yet");
         }
         return roots.sort((a, b) => a - b);
     }
     add(P) {
+        if (typeof P === "number") {
+            return new Polynomial([this.coefficients[0] + P, ...this.coefficients.slice(1)], this.variable);
+        }
         if (P.variable !== this.variable)
             throw Error("Can't add two polynomials with different variables");
         const maxDegree = Math.max(P.degree, this.degree);
@@ -203,19 +210,50 @@ class Polynomial {
         }
         return new Polynomial(res.slice(0, firstNonZeroIndex), this.variable);
     }
+    scalarDivide(n) {
+        return new Polynomial(this.coefficients.map((coeff) => coeff / n), this.variable);
+    }
     opposite() {
         return new Polynomial(this.coefficients.map((coeff) => -coeff), this.variable);
     }
     derivate() {
+        if (this.coefficients.length === 1)
+            return new Polynomial([0], this.variable);
         const res = [];
         for (let i = 1; i < this.coefficients.length; i++)
             res.push(i * this.coefficients[i]);
         return new Polynomial(res, this.variable);
     }
-    integrate() {
-        const newCoefficients = this.coefficients.map((coeff, exp) => coeff / (exp + 1));
-        newCoefficients.unshift(0);
-        return new Polynomial(newCoefficients, this.variable);
+    // integrate(): Polynomial {
+    //   const newCoefficients = this.coefficients.map(
+    //     (coeff, exp) => coeff / (exp + 1),
+    //   );
+    //   newCoefficients.unshift(0);
+    //   return new Polynomial(newCoefficients, this.variable);
+    // }
+    integrateToNode(opts) {
+        let integralPolynomial = new variableNode_1.VariableNode("C");
+        for (let i = 0; i < this.degree + 1; i++) {
+            const coeff = this.coefficients[i];
+            if (coeff === 0)
+                continue;
+            const nodeCoeff = new rational_1.Rational(coeff, i + 1).simplify().toTree();
+            const powerNode = i + 1 === 1
+                ? new variableNode_1.VariableNode("x")
+                : new powerNode_1.PowerNode(new variableNode_1.VariableNode("x"), new numberNode_1.NumberNode(i + 1), opts);
+            let terme;
+            if (nodeCoeff.toTex() === "1")
+                terme = powerNode;
+            else if (nodeCoeff.toTex() === "-1")
+                terme = new oppositeNode_1.OppositeNode(powerNode, opts);
+            else {
+                terme = new multiplyNode_1.MultiplyNode(nodeCoeff, i + 1 === 1
+                    ? new variableNode_1.VariableNode("x")
+                    : new powerNode_1.PowerNode(new variableNode_1.VariableNode("x"), new numberNode_1.NumberNode(i + 1), opts), opts);
+            }
+            integralPolynomial = new addNode_1.AddNode(terme, integralPolynomial, opts);
+        }
+        return integralPolynomial;
     }
     calculate(x) {
         let res = 0;
@@ -226,26 +264,48 @@ class Polynomial {
     getLimit(to) {
         const leadingCoeff = this.coefficients[this.coefficients.length - 1];
         if (this.degree === 0)
-            return leadingCoeff + '';
-        if (to === '+\\infty') {
+            return leadingCoeff + "";
+        if (to === "+\\infty") {
+            if (leadingCoeff > 0)
+                return "+\\infty";
+            return "-\\infty";
+        }
+        else {
+            if (leadingCoeff > 0) {
+                if (this.degree % 2 === 0)
+                    return "+\\infty";
+                return "-\\infty";
+            }
+            else {
+                if (this.degree % 2 === 0)
+                    return "-\\infty";
+                return "+\\infty";
+            }
+        }
+    }
+    getLimitNode(to) {
+        const leadingCoeff = this.coefficients[this.coefficients.length - 1];
+        if (this.degree === 0)
+            return new numberNode_1.NumberNode(leadingCoeff);
+        if (to === "+\\infty") {
             if (leadingCoeff > 0)
-                return '+\\infty';
-            return '-\\infty';
+                return infiniteNode_1.PlusInfinityNode;
+            return infiniteNode_1.MinusInfinityNode;
         }
         else {
             if (leadingCoeff > 0) {
                 if (this.degree % 2 === 0)
-                    return '+\\infty';
-                return '-\\infty';
+                    return infiniteNode_1.PlusInfinityNode;
+                return infiniteNode_1.MinusInfinityNode;
             }
             else {
                 if (this.degree % 2 === 0)
-                    return '-\\infty';
-                return '+\\infty';
+                    return infiniteNode_1.MinusInfinityNode;
+                return infiniteNode_1.PlusInfinityNode;
             }
         }
     }
-    toTree() {
+    toTree(opts) {
         const recursive = (cursor) => {
             const coeff = this.coefficients[cursor];
             if (coeff === 0)
@@ -254,7 +314,7 @@ class Polynomial {
                 return new numberNode_1.NumberNode(coeff);
             }
             const monome = cursor > 1
-                ? new powerNode_1.PowerNode(new variableNode_1.VariableNode(this.variable), new numberNode_1.NumberNode(cursor))
+                ? new powerNode_1.PowerNode(new variableNode_1.VariableNode(this.variable), new numberNode_1.NumberNode(cursor), opts)
                 : new variableNode_1.VariableNode(this.variable);
             let res;
             if (coeff === 1)
@@ -262,7 +322,7 @@ class Polynomial {
             else if (coeff === -1)
                 res = new oppositeNode_1.OppositeNode(monome);
             else
-                res = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff), monome);
+                res = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff), monome, opts);
             let nextCoeff;
             for (let i = cursor - 1; i > -1; i--) {
                 if (this.coefficients[i]) {
@@ -280,7 +340,7 @@ class Polynomial {
         return recursive(this.degree);
     }
     toTex() {
-        let s = '';
+        let s = "";
         for (let i = this.degree; i > -1; i--) {
             const coeff = this.coefficients[i];
             if (coeff === 0)
@@ -288,10 +348,17 @@ class Polynomial {
             if (i === 0)
                 s += coeff > 0 ? `+${coeff}` : coeff;
             else if (i === this.degree) {
-                s += coeff === 1 ? '' : coeff === -1 ? '-' : coeff;
+                s += coeff === 1 ? "" : coeff === -1 ? "-" : coeff;
             }
             else {
-                s += coeff === 1 ? '+' : coeff === -1 ? '-' : coeff > 0 ? `+${coeff}` : coeff;
+                s +=
+                    coeff === 1
+                        ? "+"
+                        : coeff === -1
+                            ? "-"
+                            : coeff > 0
+                                ? `+${coeff}`
+                                : coeff;
             }
             //x^n
             if (i === 0)

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

@@ -0,0 +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(): Integer | Rational | RationalFrac;
+}
+//# sourceMappingURL=rationalFrac.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rationalFrac.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/rationalFrac.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAEvE,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAEzD,OAAO,EAAE,OAAO,EAAE,MAAM,4BAA4B,CAAC;AAErD,qBAAa,YAAY;IACvB,GAAG,EAAE,UAAU,CAAC;IAChB,KAAK,EAAE,UAAU,CAAC;gBACN,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU;IAI9C,MAAM;IAGN,QAAQ;CAuCT"}

package/lib/math/polynomials/rationalFrac.js

@@ -0,0 +1,50 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RationalFrac = void 0;
+const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
+const mathjs_1 = require("mathjs");
+const rational_1 = require("../numbers/rationals/rational");
+const nombre_1 = require("../numbers/nombre");
+const integer_1 = require("../numbers/integer/integer");
+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, mathjs_1.gcd)(...numCoeffs) : numCoeffs[0];
+        const denumCoeffs = this.denum.coefficients.filter((c) => c !== 0);
+        const denumPGCD = denumCoeffs.length > 1 ? (0, mathjs_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;