math-exercises 2.0.1 → 2.0.3

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

@@ -1,126 +1,132 @@
-"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 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/coinFlip");
-const random_1 = require("../../../utils/random");
-const shuffle_1 = require("../../../utils/shuffle");
-const integer_1 = require("../integer/integer");
-const nombre_1 = require("../nombre");
-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]);
-        if (denum === gcd) {
-            //si 10/2 on transforme en 2/10
-            return new Rational(denum, num);
-        }
-        return new Rational(num, denum);
-    }
-    static randomIrreductible(max = 11) {
-        const a = (0, randint_1.randint)(2, max);
-        const b = (0, random_1.random)([...(0, coprimesOf_1.coprimesOf)(a), 1]);
-        if (b === 1)
-            return new Rational(b, a);
-        const [num, denum] = (0, shuffle_1.shuffle)([a, b]);
-        return new Rational(num, denum);
-    }
-    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]);
-        if (b === 1)
-            return new Rational(sign * b, a);
-        const [num, denum] = (0, shuffle_1.shuffle)([a, b]);
-        return new Rational(sign * num, denum);
-    }
-}
-exports.RationalConstructor = RationalConstructor;
-class Rational {
-    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.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}}`;
-    }
-    add(nb) {
-        switch (nb.type) {
-            case nombre_1.NumberType.Integer: {
-                const num = this.num + this.denum * nb.value;
-                return new Rational(num, this.denum).simplify();
-            }
-            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);
-                return new Rational(num, ppcm).simplify();
-            }
-        }
-        throw Error('not implemented yet');
-    }
-    multiply(nb) {
-        switch (nb.type) {
-            case nombre_1.NumberType.Integer: {
-                const num = this.num * nb.value;
-                const denum = this.denum;
-                return new Rational(num, denum).simplify();
-            }
-            case nombre_1.NumberType.Rational: {
-                const rational = nb;
-                const num = this.num * rational.num;
-                const denum = this.denum * rational.denum;
-                return new Rational(num, denum).simplify();
-            }
-        }
-        throw Error('not implemented yet');
-    }
-    divide(nb) {
-        switch (nb.type) {
-            case nombre_1.NumberType.Integer: {
-                const denum = this.denum * nb.value;
-                return new Rational(this.num, denum).simplify();
-            }
-            case nombre_1.NumberType.Rational: {
-                const rational = nb;
-                const num = this.num * rational.denum;
-                const denum = this.denum * rational.num;
-                return new Rational(num, denum).simplify();
-            }
-        }
-        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);
-    }
-    simplify() {
-        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);
-        return new Rational((sign * Math.abs(this.num)) / div, Math.abs(this.denum) / div);
-    }
-}
-exports.Rational = Rational;
+"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 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/coinFlip");
+const random_1 = require("../../../utils/random");
+const shuffle_1 = require("../../../utils/shuffle");
+const integer_1 = require("../integer/integer");
+const nombre_1 = require("../nombre");
+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]);
+        if (denum === gcd) {
+            //si 10/2 on transforme en 2/10
+            return new Rational(denum, num);
+        }
+        return new Rational(num, denum);
+    }
+    static randomIrreductible(max = 11) {
+        const a = (0, randint_1.randint)(2, max);
+        const b = (0, random_1.random)([...(0, coprimesOf_1.coprimesOf)(a), 1]);
+        if (b === 1)
+            return new Rational(b, a);
+        const [num, denum] = (0, shuffle_1.shuffle)([a, b]);
+        return new Rational(num, denum);
+    }
+    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]);
+        if (b === 1)
+            return new Rational(sign * b, a);
+        const [num, denum] = (0, shuffle_1.shuffle)([a, b]);
+        return new Rational(sign * num, denum);
+    }
+}
+exports.RationalConstructor = RationalConstructor;
+class Rational {
+    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.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}}`;
+    }
+    add(nb) {
+        switch (nb.type) {
+            case nombre_1.NumberType.Integer: {
+                const num = this.num + this.denum * nb.value;
+                return new Rational(num, this.denum).simplify();
+            }
+            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);
+                return new Rational(num, ppcm).simplify();
+            }
+        }
+        throw Error("not implemented yet");
+    }
+    multiply(nb) {
+        switch (nb.type) {
+            case nombre_1.NumberType.Integer: {
+                const num = this.num * nb.value;
+                const denum = this.denum;
+                return new Rational(num, denum).simplify();
+            }
+            case nombre_1.NumberType.Rational: {
+                const rational = nb;
+                const num = this.num * rational.num;
+                const denum = this.denum * rational.denum;
+                return new Rational(num, denum).simplify();
+            }
+        }
+        throw Error("not implemented yet");
+    }
+    divide(nb) {
+        switch (nb.type) {
+            case nombre_1.NumberType.Integer: {
+                const denum = this.denum * nb.value;
+                return new Rational(this.num, denum).simplify();
+            }
+            case nombre_1.NumberType.Rational: {
+                const rational = nb;
+                const num = this.num * rational.denum;
+                const denum = this.denum * rational.num;
+                return new Rational(num, denum).simplify();
+            }
+        }
+        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));
+        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 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);
+        return new Rational((sign * Math.abs(this.num)) / div, Math.abs(this.denum) / div);
+    }
+}
+exports.Rational = Rational;

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

@@ -1,13 +1,15 @@
-import { Nombre } from '../nombre';
-/**
- * element of Q(x)
- * exp 2+3sqrt(5)
- */
-export declare class ExtendedRingElement {
-    a: number;
-    b: number;
-    algebraicElement: Nombre;
-    constructor(a: number, b: number, algebraicElement: Nombre);
-    toTree(): import("../../../tree/nodes/node").Node;
-}
+import { NumberNode } from '../../../tree/nodes/numbers/numberNode';
+import { SubstractNode } from '../../../tree/nodes/operators/substractNode';
+import { Nombre } from '../nombre';
+/**
+ * element of Q(x)
+ * exp 2+3sqrt(5)
+ */
+export declare class ExtendedRingElement {
+    a: number;
+    b: number;
+    algebraicElement: Nombre;
+    constructor(a: number, b: number, algebraicElement: Nombre);
+    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/extendedRingElement.js

@@ -1,41 +1,41 @@
-"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");
-/**
- * element of Q(x)
- * exp 2+3sqrt(5)
- */
-class ExtendedRingElement {
-    constructor(a, b, algebraicElement) {
-        this.a = a;
-        this.b = b;
-        this.algebraicElement = algebraicElement;
-    }
-    toTree() {
-        if (this.b === 0) {
-            return new numberNode_1.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());
-            }
-            else {
-                if (this.b === 1)
-                    return new addNode_1.AddNode(new numberNode_1.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());
-            }
-        }
-    }
-}
-exports.ExtendedRingElement = ExtendedRingElement;
+"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");
+/**
+ * element of Q(x)
+ * exp 2+3sqrt(5)
+ */
+class ExtendedRingElement {
+    constructor(a, b, algebraicElement) {
+        this.a = a;
+        this.b = b;
+        this.algebraicElement = algebraicElement;
+    }
+    toTree() {
+        if (this.b === 0) {
+            return new numberNode_1.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());
+            }
+            else {
+                if (this.b === 1)
+                    return new addNode_1.AddNode(new numberNode_1.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());
+            }
+        }
+    }
+}
+exports.ExtendedRingElement = ExtendedRingElement;

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

@@ -1,31 +1,32 @@
-import { Node } from "../../../tree/nodes/node";
-import { Nombre, NumberType } from "../nombre";
-export declare abstract class RealConstructor {
-    static random(): Real;
-}
-export declare class Real implements Nombre {
-    value: number;
-    tex: string;
-    type: NumberType;
-    constructor(value: number, tex: string);
-    toTree(): Node;
-}
-export declare abstract class SquareRootConstructor {
-    /**
-     * @returns simplifiable square root type sqrt(c)=a*sqrt(b)
-     */
-    static randomSimplifiable({ allowPerfectSquare, maxSquare }: {
-        allowPerfectSquare?: boolean | undefined;
-        maxSquare?: number | undefined;
-    }): SquareRoot;
-    static randomIrreductible(max?: number): SquareRoot;
-}
-export declare class SquareRoot extends Real {
-    operand: number;
-    constructor(operand: number);
-    getSimplifiedCoeffs(): [number, number];
-    simplify(): Nombre;
-    toTex(): string;
-    toTree(): Node;
-}
+import { Node } from "../../../tree/nodes/node";
+import { Nombre, NumberType } from "../nombre";
+export declare abstract class RealConstructor {
+    static random(): Real;
+}
+export declare class Real implements Nombre {
+    value: number;
+    tex: string;
+    type: NumberType;
+    constructor(value: number, tex: string);
+    toTree(): Node;
+}
+export declare abstract class SquareRootConstructor {
+    /**
+     * @returns simplifiable square root type sqrt(c)=a*sqrt(b)
+     */
+    static randomSimplifiable({ allowPerfectSquare, maxSquare, }: {
+        allowPerfectSquare?: boolean | undefined;
+        maxSquare?: number | undefined;
+    }): SquareRoot;
+    static randomIrreductible(max?: number): SquareRoot;
+}
+export declare class SquareRoot extends Real {
+    operand: number;
+    constructor(operand: number);
+    isSimplifiable(): boolean;
+    getSimplifiedCoeffs(): [number, number];
+    simplify(): Nombre;
+    toTex(): string;
+    toTree(): Node;
+}
 //# sourceMappingURL=real.d.ts.map

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"}