math-exercises 2.2.98 → 3.0.2

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

@@ -1,30 +1,27 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Rational = exports.RationalConstructor = void 0;
-const coprimesOf_1 = require("../../../math/utils/arithmetic/coprimesOf");
-const gcd_1 = require("../../../math/utils/arithmetic/gcd");
-const lcd_1 = require("../../../math/utils/arithmetic/lcd");
-const randint_1 = require("../../../math/utils/random/randint");
-const round_1 = require("../../../math/utils/round");
-const oppositeNode_1 = require("../../../tree/nodes/functions/oppositeNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
-const coinFlip_1 = require("../../../utils/alea/coinFlip");
-const random_1 = require("../../../utils/alea/random");
-const shuffle_1 = require("../../../utils/alea/shuffle");
-const doWhile_1 = require("../../../utils/doWhile");
-const decimal_1 = require("../decimals/decimal");
-const integer_1 = require("../integer/integer");
-const nombre_1 = require("../nombre");
-class RationalConstructor {
+import { coprimesOf } from "../../../math/utils/arithmetic/coprimesOf.js";
+import { gcd } from "../../../math/utils/arithmetic/gcd.js";
+import { lcd } from "../../../math/utils/arithmetic/lcd.js";
+import { randint } from "../../../math/utils/random/randint.js";
+import { round } from "../../../math/utils/round.js";
+import { OppositeNode } from "../../../tree/nodes/functions/oppositeNode.js";
+import { NumberNode } from "../../../tree/nodes/numbers/numberNode.js";
+import { FractionNode } from "../../../tree/nodes/operators/fractionNode.js";
+import { coinFlip } from "../../../utils/alea/coinFlip.js";
+import { random } from "../../../utils/alea/random.js";
+import { shuffle } from "../../../utils/alea/shuffle.js";
+import { doWhile } from "../../../utils/doWhile.js";
+import { Decimal } from "../decimals/decimal.js";
+import { Integer } from "../integer/integer.js";
+import { NumberType } from "../nombre.js";
+export class RationalConstructor {
     /**
      * @param maxGcd max number by which the fraction is simplifiable
      */
     static randomSimplifiable(maxGcd = 10) {
-        const gcd = (0, randint_1.randint)(2, maxGcd);
-        const max = (0, randint_1.randint)(3, 11);
-        const min = (0, random_1.random)((0, coprimesOf_1.coprimesOf)(max));
-        let [num, denum] = (0, shuffle_1.shuffle)([gcd * min, gcd * max]);
+        const gcd = randint(2, maxGcd);
+        const max = randint(3, 11);
+        const min = random(coprimesOf(max));
+        let [num, denum] = shuffle([gcd * min, gcd * max]);
         if (denum === gcd) {
             //si 10/2 on transforme en 2/10
             return new Rational(denum, num);
@@ -32,45 +29,50 @@ class RationalConstructor {
         return new Rational(num, denum);
     }
     static randomIrreductible(max = 11, { onlySupOne = false } = {}) {
-        const a = (0, randint_1.randint)(2, max);
-        const b = (0, random_1.random)([...(0, coprimesOf_1.coprimesOf)(a), 1]);
+        const a = randint(2, max);
+        const b = random([...coprimesOf(a), 1]);
         if (b === 1)
             return new Rational(b, a);
         if (onlySupOne)
             return new Rational(a, b);
-        const [num, denum] = (0, shuffle_1.shuffle)([a, b]);
+        const [num, denum] = shuffle([a, b]);
         return new Rational(num, denum);
     }
     static randomIrreductibleProba(maxDenum = 11) {
-        const b = (0, randint_1.randint)(2, maxDenum);
-        const a = (0, randint_1.randint)(1, b);
+        const b = randint(2, maxDenum);
+        const a = randint(1, b);
         return new Rational(a, b).simplify();
     }
     static randomIrreductibleWithSign(max = 11) {
-        const sign = (0, coinFlip_1.coinFlip)() ? 1 : -1;
-        const a = (0, randint_1.randint)(2, max);
-        const b = (0, random_1.random)([...(0, coprimesOf_1.coprimesOf)(a), 1]);
+        const sign = coinFlip() ? 1 : -1;
+        const a = randint(2, max);
+        const b = random([...coprimesOf(a), 1]);
         if (b === 1)
             return new Rational(sign * b, a);
-        const [num, denum] = (0, shuffle_1.shuffle)([a, b]);
+        const [num, denum] = shuffle([a, b]);
         return new Rational(sign * num, denum);
     }
     static randomPureRational(max = 20) {
-        const frac = (0, doWhile_1.doWhile)(() => RationalConstructor.randomIrreductible(max), (x) => (0, round_1.round)(x.value, 10) === x.value);
+        const frac = doWhile(() => RationalConstructor.randomIrreductible(max), (x) => round(x.value, 10) === x.value);
         return frac;
     }
 }
-exports.RationalConstructor = RationalConstructor;
-class Rational {
+export class Rational {
+    num;
+    denum;
+    tex;
+    value;
+    isSimplified;
+    type;
     constructor(numerator, denumerator) {
         if (denumerator === 0)
             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.isSimplified = Math.abs(gcd(numerator, denumerator)) === 1;
         this.tex = `${this.num < 0 ? "-" : ""}\\frac{${this.num < 0 ? -this.num : this.num}}{${this.denum}}`;
-        this.type = nombre_1.NumberType.Rational;
+        this.type = NumberType.Rational;
     }
     equals(n) {
         return this.value === n.value;
@@ -80,13 +82,13 @@ class Rational {
     }
     add(nb) {
         switch (nb.type) {
-            case nombre_1.NumberType.Integer: {
+            case NumberType.Integer: {
                 const num = this.num + this.denum * nb.value;
                 return new Rational(num, this.denum).simplify();
             }
-            case nombre_1.NumberType.Rational: {
+            case NumberType.Rational: {
                 const rational = nb;
-                const ppcm = (0, lcd_1.lcd)(rational.denum, this.denum);
+                const ppcm = lcd(rational.denum, this.denum);
                 const num = this.num * (ppcm / this.denum) +
                     rational.num * (ppcm / rational.denum);
                 return new Rational(num, ppcm).simplify();
@@ -96,12 +98,12 @@ class Rational {
     }
     multiply(nb) {
         switch (nb.type) {
-            case nombre_1.NumberType.Integer: {
+            case NumberType.Integer: {
                 const num = this.num * nb.value;
                 const denum = this.denum;
                 return new Rational(num, denum).simplify();
             }
-            case nombre_1.NumberType.Rational: {
+            case NumberType.Rational: {
                 const rational = nb;
                 const num = this.num * rational.num;
                 const denum = this.denum * rational.denum;
@@ -116,11 +118,11 @@ class Rational {
     }
     divide(nb) {
         switch (nb.type) {
-            case nombre_1.NumberType.Integer: {
+            case NumberType.Integer: {
                 const denum = this.denum * nb.value;
                 return new Rational(this.num, denum).simplify();
             }
-            case nombre_1.NumberType.Rational: {
+            case NumberType.Rational: {
                 const rational = nb;
                 const num = this.num * rational.denum;
                 const denum = this.denum * rational.num;
@@ -134,29 +136,28 @@ class Rational {
     }
     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));
-        return new fractionNode_1.FractionNode(new numberNode_1.NumberNode(this.num), new numberNode_1.NumberNode(this.denum), opts);
+            return new OppositeNode(new FractionNode(new NumberNode(-this.num), new NumberNode(this.denum), opts));
+        return new FractionNode(new NumberNode(this.num), new NumberNode(this.denum), opts);
     }
     isIrreductible() {
-        return this.denum !== 1 && (0, gcd_1.gcd)(this.num, this.denum) === 1;
+        return this.denum !== 1 && gcd(this.num, this.denum) === 1;
     }
     simplify() {
         const sign = this.num * this.denum > 0 ? 1 : -1;
         let intNum = this.num;
         let intDenum = this.denum;
         if (Math.floor(intNum) !== intNum || Math.floor(intDenum) !== intDenum) {
-            const numDec = new decimal_1.Decimal(intNum);
-            const denumDec = new decimal_1.Decimal(intDenum);
+            const numDec = new Decimal(intNum);
+            const denumDec = new Decimal(intDenum);
             const numPrec = numDec.precision;
             const denumPrec = denumDec.precision;
             const totalPrec = Math.max(numPrec, denumPrec);
             intNum = numDec.multiplyByPowerOfTen(totalPrec).value;
             intDenum = denumDec.multiplyByPowerOfTen(totalPrec).value;
         }
-        const div = Math.abs((0, gcd_1.gcd)(intNum, intDenum));
+        const div = Math.abs(gcd(intNum, intDenum));
         if (Math.abs(intDenum) === div)
-            return new integer_1.Integer(intNum / intDenum);
+            return new Integer(intNum / intDenum);
         return new Rational((sign * Math.abs(intNum)) / div, Math.abs(intDenum) / div);
     }
 }
-exports.Rational = Rational;

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

@@ -1,9 +1,9 @@
-import { OppositeNode } from '../../../tree/nodes/functions/oppositeNode';
-import { NumberNode } from '../../../tree/nodes/numbers/numberNode';
-import { AddNode } from '../../../tree/nodes/operators/addNode';
-import { MultiplyNode } from '../../../tree/nodes/operators/multiplyNode';
-import { SubstractNode } from '../../../tree/nodes/operators/substractNode';
-import { Nombre } from '../nombre';
+import { OppositeNode } from "../../../tree/nodes/functions/oppositeNode.js";
+import { NumberNode } from "../../../tree/nodes/numbers/numberNode.js";
+import { AddNode } from "../../../tree/nodes/operators/addNode.js";
+import { MultiplyNode } from "../../../tree/nodes/operators/multiplyNode.js";
+import { SubstractNode } from "../../../tree/nodes/operators/substractNode.js";
+import { Nombre } from "../nombre.js";
 /**
  * element of Q(x)
  * exp 2+3sqrt(5)
@@ -13,6 +13,6 @@ export declare class ExtendedRingElement {
     b: number;
     algebraicElement: Nombre;
     constructor(a: number, b: number, algebraicElement: Nombre);
-    toTree(): import("../../../tree/nodes/algebraicNode").AlgebraicNode | NumberNode | SubstractNode | AddNode | MultiplyNode | OppositeNode<import("../../../tree/nodes/algebraicNode").AlgebraicNode>;
+    toTree(): import("../../../tree/nodes/algebraicNode.js").AlgebraicNode | NumberNode | SubstractNode | AddNode | MultiplyNode | OppositeNode<import("../../../tree/nodes/algebraicNode.js").AlgebraicNode>;
 }
 //# 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":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AACvE,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,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"}
+{"version":3,"file":"extendedRingElement.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/reals/extendedRingElement.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,4CAA4C,CAAC;AAC1E,OAAO,EAAE,UAAU,EAAE,MAAM,wCAAwC,CAAC;AACpE,OAAO,EAAE,OAAO,EAAE,MAAM,uCAAuC,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,4CAA4C,CAAC;AAC1E,OAAO,EAAE,aAAa,EAAE,MAAM,6CAA6C,CAAC;AAC5E,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC;;;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;CA8BP"}

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

@@ -1,16 +1,19 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ExtendedRingElement = void 0;
-const oppositeNode_1 = require("../../../tree/nodes/functions/oppositeNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const substractNode_1 = require("../../../tree/nodes/operators/substractNode");
+import { OppositeNode } from "../../../tree/nodes/functions/oppositeNode.js";
+import { NumberNode } from "../../../tree/nodes/numbers/numberNode.js";
+import { AddNode } from "../../../tree/nodes/operators/addNode.js";
+import { MultiplyNode } from "../../../tree/nodes/operators/multiplyNode.js";
+import { SubstractNode } from "../../../tree/nodes/operators/substractNode.js";
 /**
  * element of Q(x)
  * exp 2+3sqrt(5)
  */
-class ExtendedRingElement {
+export class ExtendedRingElement {
+    //elementType
+    //add another element of ring
+    //divide by number
+    a;
+    b;
+    algebraicElement;
     constructor(a, b, algebraicElement) {
         this.a = a;
         this.b = b;
@@ -18,24 +21,23 @@ class ExtendedRingElement {
     }
     toTree() {
         if (this.b === 0) {
-            return new numberNode_1.NumberNode(this.a);
+            return new NumberNode(this.a);
         }
         else {
             if (this.a === 0) {
                 if (this.b === 1)
                     return this.algebraicElement.toTree();
                 if (this.b === -1)
-                    return new oppositeNode_1.OppositeNode(this.algebraicElement.toTree());
-                return new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.b), this.algebraicElement.toTree());
+                    return new OppositeNode(this.algebraicElement.toTree());
+                return new MultiplyNode(new NumberNode(this.b), this.algebraicElement.toTree());
             }
             else {
                 if (this.b === 1)
-                    return new addNode_1.AddNode(new numberNode_1.NumberNode(this.a), this.algebraicElement.toTree());
+                    return new AddNode(new NumberNode(this.a), this.algebraicElement.toTree());
                 if (this.b === -1)
-                    return new substractNode_1.SubstractNode(new numberNode_1.NumberNode(this.a), this.algebraicElement.toTree());
-                return new addNode_1.AddNode(new numberNode_1.NumberNode(this.a), this.algebraicElement.toTree());
+                    return new SubstractNode(new NumberNode(this.a), this.algebraicElement.toTree());
+                return new AddNode(new NumberNode(this.a), this.algebraicElement.toTree());
             }
         }
     }
 }
-exports.ExtendedRingElement = ExtendedRingElement;

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

@@ -1,6 +1,6 @@
-import { AlgebraicNode } from "../../../tree/nodes/algebraicNode";
-import { SqrtNode } from "../../../tree/nodes/functions/sqrtNode";
-import { Nombre, NumberType } from "../nombre";
+import { AlgebraicNode } from "../../../tree/nodes/algebraicNode.js";
+import { SqrtNode } from "../../../tree/nodes/functions/sqrtNode.js";
+import { Nombre, NumberType } from "../nombre.js";
 export declare abstract class RealConstructor {
     static random(): SquareRoot | Real;
 }

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":"AAGA,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,EAAE,QAAQ,EAAE,MAAM,qCAAqC,CAAC;AAU/D,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,CAAC,CAAC,EAAE,MAAM;IAGhB,MAAM,IAAI,aAAa;CAIxB;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;IAkBvC,sDAAsD;IACtD,aAAa,IAAI,MAAM;IAMvB,QAAQ,IAAI,MAAM;IA4BlB,KAAK,IAAI,MAAM;IAIf,MAAM;CAGP"}
+{"version":3,"file":"real.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/reals/real.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAClE,OAAO,EAAE,QAAQ,EAAE,MAAM,wCAAwC,CAAC;AAUlE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAClD,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,CAAC,CAAC,EAAE,MAAM;IAGhB,MAAM,IAAI,aAAa;CAIxB;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;IAkBvC,sDAAsD;IACtD,aAAa,IAAI,MAAM;IAMvB,QAAQ,IAAI,MAAM;IA4BlB,KAAK,IAAI,MAAM;IAIf,MAAM;CAGP"}

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

@@ -1,22 +1,19 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SquareRoot = exports.SquareRootConstructor = exports.Real = exports.RealConstructor = void 0;
-const isSquare_1 = require("../../../math/utils/arithmetic/isSquare");
-const primeFactors_1 = require("../../../math/utils/arithmetic/primeFactors");
-const randint_1 = require("../../../math/utils/random/randint");
-const sqrtNode_1 = require("../../../tree/nodes/functions/sqrtNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const piNode_1 = require("../../../tree/nodes/numbers/piNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const diceFlip_1 = require("../../../utils/alea/diceFlip");
-const random_1 = require("../../../utils/alea/random");
-const decimal_1 = require("../decimals/decimal");
-const integer_1 = require("../integer/integer");
-const primes_1 = require("../integer/primes");
-const nombre_1 = require("../nombre");
-class RealConstructor {
+import { isSquare } from "../../../math/utils/arithmetic/isSquare.js";
+import { primeFactors } from "../../../math/utils/arithmetic/primeFactors.js";
+import { randint } from "../../../math/utils/random/randint.js";
+import { SqrtNode } from "../../../tree/nodes/functions/sqrtNode.js";
+import { NumberNode } from "../../../tree/nodes/numbers/numberNode.js";
+import { PiNode } from "../../../tree/nodes/numbers/piNode.js";
+import { MultiplyNode } from "../../../tree/nodes/operators/multiplyNode.js";
+import { diceFlip } from "../../../utils/alea/diceFlip.js";
+import { random } from "../../../utils/alea/random.js";
+import { Decimal } from "../decimals/decimal.js";
+import { Integer } from "../integer/integer.js";
+import { primes } from "../integer/primes.js";
+import { NumberType } from "../nombre.js";
+export class RealConstructor {
     static random() {
-        const dice = (0, diceFlip_1.diceFlip)(2);
+        const dice = diceFlip(2);
         switch (dice) {
             case 0:
                 return new Real(Math.PI, "\\pi");
@@ -26,43 +23,44 @@ class RealConstructor {
         return new Real(Math.PI, "\\pi");
     }
 }
-exports.RealConstructor = RealConstructor;
-class Real {
+export class Real {
+    value;
+    tex;
+    type;
     constructor(value, tex) {
         this.value = value;
         this.tex = tex;
-        this.type = nombre_1.NumberType.Real;
+        this.type = NumberType.Real;
     }
     equals(n) {
         return this.value === n.value;
     }
     toTree() {
         if (this.tex === "\\pi")
-            return piNode_1.PiNode;
-        return new numberNode_1.NumberNode(this.value);
+            return PiNode;
+        return new NumberNode(this.value);
     }
 }
-exports.Real = Real;
-class SquareRootConstructor {
+export class SquareRootConstructor {
     /**
      * @returns simplifiable square root type sqrt(c)=a*sqrt(b)
      */
     static randomSimplifiable({ allowPerfectSquare = false, maxSquare = 11, }) {
-        const a = (0, randint_1.randint)(2, maxSquare);
+        const a = randint(2, maxSquare);
         let b;
         let bMin = allowPerfectSquare ? 1 : 2;
         do {
-            b = (0, randint_1.randint)(bMin, maxSquare);
-        } while (b % (a * a) === 0 || (0, isSquare_1.isSquare)(b));
+            b = randint(bMin, maxSquare);
+        } while (b % (a * a) === 0 || isSquare(b));
         return new SquareRoot(a * a * b);
     }
     static randomIrreductible(max = 15) {
-        const a = (0, random_1.random)(primes_1.primes.filter((p) => p < max));
+        const a = random(primes.filter((p) => p < max));
         return new SquareRoot(a);
     }
 }
-exports.SquareRootConstructor = SquareRootConstructor;
-class SquareRoot extends Real {
+export class SquareRoot extends Real {
+    operand;
     constructor(operand) {
         super(Math.sqrt(operand), `\\sqrt{${operand}}`);
         this.operand = operand;
@@ -76,7 +74,7 @@ class SquareRoot extends Real {
     getSimplifiedCoeffs() {
         if (this.operand === 0)
             return [1, 0];
-        const factors = (0, primeFactors_1.primeFactors)(this.operand);
+        const factors = primeFactors(this.operand);
         // finds primes with even exponents
         const multiples = [1];
         for (let i = 0; i < factors.length - 1; i++) {
@@ -93,17 +91,17 @@ class SquareRoot extends Real {
     /**simplifier les carrés parfaits mais pas le reste */
     basicSimplify() {
         if (Math.sqrt(this.operand) === this.operand) {
-            return new integer_1.Integer(this.operand);
+            return new Integer(this.operand);
         }
         return this;
     }
     simplify() {
         if (this.operand === 0)
-            return new integer_1.Integer(0);
+            return new Integer(0);
         if (this.operand === 1)
-            return new integer_1.Integer(1);
+            return new Integer(1);
         if (Math.floor(this.operand) !== this.operand)
-            return new decimal_1.Decimal(Math.sqrt(this.operand));
+            return new Decimal(Math.sqrt(this.operand));
         const [outsideSqrt, insideSqrt] = this.getSimplifiedCoeffs();
         const simplified = insideSqrt !== 1
             ? new Real(outsideSqrt * Math.sqrt(insideSqrt), `${outsideSqrt === 1 ? "" : `${outsideSqrt}`}\\sqrt{${insideSqrt}}`)
@@ -111,9 +109,9 @@ class SquareRoot extends Real {
         simplified.toTree = () => {
             return insideSqrt !== 1
                 ? outsideSqrt === 1
-                    ? new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(insideSqrt))
-                    : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(outsideSqrt), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(insideSqrt)))
-                : new numberNode_1.NumberNode(outsideSqrt);
+                    ? new SqrtNode(new NumberNode(insideSqrt))
+                    : new MultiplyNode(new NumberNode(outsideSqrt), new SqrtNode(new NumberNode(insideSqrt)))
+                : new NumberNode(outsideSqrt);
         };
         return simplified;
     }
@@ -121,7 +119,6 @@ class SquareRoot extends Real {
         return this.tex;
     }
     toTree() {
-        return new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(this.operand));
+        return new SqrtNode(new NumberNode(this.operand));
     }
 }
-exports.SquareRoot = SquareRoot;

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

@@ -1,6 +1,6 @@
-import { Nombre } from "../numbers/nombre";
-import { Polynomial } from "./polynomial";
-import { Trinom } from "./trinom";
+import { Nombre } from "../numbers/nombre.js";
+import { Polynomial } from "./polynomial.js";
+import { Trinom } from "./trinom.js";
 export declare abstract class AffineConstructor {
     static fromCoeffs(coeffs: number[]): Affine;
     static random(aOpts?: {

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

@@ -1 +1 @@
-{"version":3,"file":"affine.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/affine.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAG3C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAElC,8BAAsB,iBAAiB;IACrC,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAG3C,MAAM,CAAC,MAAM,CACX,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC3D,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC1D,MAAM;IAcT,MAAM,CAAC,gBAAgB,CACrB,EAAE,EAAE,MAAM,EACV,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC3D,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC1D,MAAM,EAAE;CAWZ;AAED,qBAAa,MAAO,SAAQ,UAAU;IACpC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;gBAEL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAOxD,OAAO,IAAI,MAAM;IAIjB,MAAM,IAAI,MAAM;IAMhB,KAAK,CAAC,CAAC,EAAE,MAAM;IAIf,QAAQ,IAAI,MAAM;IAIlB,iBAAiB,IAAI,MAAM;IAI3B,aAAa;CAGd"}
+{"version":3,"file":"affine.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/affine.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAG9C,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,8BAAsB,iBAAiB;IACrC,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAG3C,MAAM,CAAC,MAAM,CACX,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC3D,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC1D,MAAM;IAcT,MAAM,CAAC,gBAAgB,CACrB,EAAE,EAAE,MAAM,EACV,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC3D,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC1D,MAAM,EAAE;CAWZ;AAED,qBAAa,MAAO,SAAQ,UAAU;IACpC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;gBAEL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAOxD,OAAO,IAAI,MAAM;IAIjB,MAAM,IAAI,MAAM;IAMhB,KAAK,CAAC,CAAC,EAAE,MAAM;IAIf,QAAQ,IAAI,MAAM;IAIlB,iBAAiB,IAAI,MAAM;IAI3B,aAAa;CAGd"}

package/lib/math/polynomials/affine.js

@@ -1,18 +1,15 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Affine = exports.AffineConstructor = void 0;
-const colors_1 = require("../../geogebra/colors");
-const rational_1 = require("../numbers/rationals/rational");
-const randint_1 = require("../utils/random/randint");
-const polynomial_1 = require("./polynomial");
-const trinom_1 = require("./trinom");
-class AffineConstructor {
+import { randomColor } from "../../geogebra/colors.js";
+import { Rational } from "../numbers/rationals/rational.js";
+import { randint } from "../utils/random/randint.js";
+import { Polynomial } from "./polynomial.js";
+import { Trinom } from "./trinom.js";
+export class AffineConstructor {
     static fromCoeffs(coeffs) {
         return new Affine(coeffs[1], coeffs[0]);
     }
     static random(aOpts, bOpts) {
-        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 a = randint(aOpts?.min ?? -9, aOpts?.max ?? 10, aOpts?.excludes ?? [0]);
+        const b = randint(bOpts?.min ?? -9, bOpts?.max ?? 10, bOpts?.excludes ?? []);
         return new Affine(a, b);
     }
     static differentRandoms(nb, aOpts, bOpts) {
@@ -27,8 +24,10 @@ class AffineConstructor {
         return res;
     }
 }
-exports.AffineConstructor = AffineConstructor;
-class Affine extends polynomial_1.Polynomial {
+export class Affine extends Polynomial {
+    a;
+    b;
+    variable;
     constructor(a, b, variable = "x") {
         super([b, a], variable);
         this.a = a;
@@ -36,10 +35,10 @@ class Affine extends polynomial_1.Polynomial {
         this.variable = variable;
     }
     getRoot() {
-        return new rational_1.Rational(-this.b, this.a).simplify();
+        return new Rational(-this.b, this.a).simplify();
     }
     square() {
-        return new trinom_1.Trinom(this.a ** 2, 2 * this.a * this.b, this.b ** 2, {
+        return new Trinom(this.a ** 2, 2 * this.a * this.b, this.b ** 2, {
             variable: this.variable,
         });
     }
@@ -53,7 +52,6 @@ class Affine extends polynomial_1.Polynomial {
         return `y=${this.toTex()}`;
     }
     toGGBCommands() {
-        return [`f(x) = ${this.toString()}`, `SetColor(f, "${(0, colors_1.randomColor)()}")`];
+        return [`f(x) = ${this.toString()}`, `SetColor(f, "${randomColor()}")`];
     }
 }
-exports.Affine = Affine;

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

@@ -1,6 +1,6 @@
-import { AlgebraicNode } from "../../tree/nodes/algebraicNode";
-import { NodeIdentifiers } from "../../tree/nodes/nodeConstructor";
-import { IntervalNode } from "../../tree/nodes/sets/intervalNode";
+import { AlgebraicNode } from "../../tree/nodes/algebraicNode.js";
+import { NodeIdentifiers } from "../../tree/nodes/nodeConstructor.js";
+import { IntervalNode } from "../../tree/nodes/sets/intervalNode.js";
 export declare abstract class GeneralAffineConstructor {
     static fromIdentifiers(identifiers: GeneralAffineIdentifiers): GeneralAffine;
     static randomInts({ allowBNull }: {
@@ -22,7 +22,7 @@ export declare class GeneralAffine {
     getRoot(): AlgebraicNode;
     getPositiveInterval(): IntervalNode;
     getNegativeInterval(): IntervalNode;
-    toTree(): import("../../tree/nodes/operators/addNode").AddNode | import("../../tree/nodes/operators/multiplyNode").MultiplyNode;
+    toTree(): import("../../tree/nodes/operators/addNode.js").AddNode | import("../../tree/nodes/operators/multiplyNode.js").MultiplyNode;
     xIntersect(aff: GeneralAffine): AlgebraicNode | undefined;
     opposite(): GeneralAffine;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"generalAffine.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/generalAffine.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAG/D,OAAO,EAEL,eAAe,EAEhB,MAAM,kCAAkC,CAAC;AAU1C,OAAO,EAAE,YAAY,EAAE,MAAM,oCAAoC,CAAC;AAKlE,8BAAsB,wBAAwB;IAC5C,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,wBAAwB;IAM5D,MAAM,CAAC,UAAU,CAAC,EAAE,UAAiB,EAAE;;KAAA,EAAE,QAAQ,SAAM;CAOxD;AACD,MAAM,MAAM,wBAAwB,GAAG;IACrC,EAAE,EAAE,QAAQ,CAAC;IACb,CAAC,EAAE,eAAe,CAAC;IACnB,CAAC,EAAE,eAAe,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC;AACF,qBAAa,aAAa;IACxB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;gBAGf,CAAC,EAAE,MAAM,GAAG,aAAa,EACzB,CAAC,EAAE,MAAM,GAAG,aAAa,EACzB,QAAQ,GAAE,MAAY;IAUxB,aAAa,IAAI,wBAAwB;IAQzC,OAAO,IAAI,aAAa;IAGxB,mBAAmB,IAAI,YAAY;IAQnC,mBAAmB,IAAI,YAAY;IASnC,MAAM;IAMN,UAAU,CAAC,GAAG,EAAE,aAAa;IAI7B,QAAQ;CAMT"}
+{"version":3,"file":"generalAffine.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/generalAffine.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAGlE,OAAO,EAEL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAU7C,OAAO,EAAE,YAAY,EAAE,MAAM,uCAAuC,CAAC;AAKrE,8BAAsB,wBAAwB;IAC5C,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,wBAAwB;IAM5D,MAAM,CAAC,UAAU,CAAC,EAAE,UAAiB,EAAE;;KAAA,EAAE,QAAQ,SAAM;CAOxD;AACD,MAAM,MAAM,wBAAwB,GAAG;IACrC,EAAE,EAAE,QAAQ,CAAC;IACb,CAAC,EAAE,eAAe,CAAC;IACnB,CAAC,EAAE,eAAe,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC;AACF,qBAAa,aAAa;IACxB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;gBAGf,CAAC,EAAE,MAAM,GAAG,aAAa,EACzB,CAAC,EAAE,MAAM,GAAG,aAAa,EACzB,QAAQ,GAAE,MAAY;IAUxB,aAAa,IAAI,wBAAwB;IAQzC,OAAO,IAAI,aAAa;IAGxB,mBAAmB,IAAI,YAAY;IAQnC,mBAAmB,IAAI,YAAY;IASnC,MAAM;IAMN,UAAU,CAAC,GAAG,EAAE,aAAa;IAI7B,QAAQ;CAMT"}