math-exercises 1.3.4 → 1.3.5

package/lib/math/polynomials/affine.js

@@ -0,0 +1,42 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Affine = exports.AffineConstructor = void 0;
+const rational_1 = require("../../numbers/rationals/rational");
+const intervals_1 = require("../../sets/intervals/intervals");
+const polynomial_1 = require("./polynomial");
+const discreteSet_1 = require("../../sets/discreteSet");
+const integer_1 = require("../../numbers/integer/integer");
+class AffineConstructor {
+    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]]')) {
+        const a = domainA.getRandomElement();
+        const b = domainB.getRandomElement();
+        return new Affine(a.value, b.value);
+    }
+    static differentRandoms(nb, domainA = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)])), domainB = new intervals_1.Interval('[[-10; 10]]')) {
+        const res = [];
+        for (let i = 0; i < nb; i++) {
+            let aff;
+            do {
+                aff = AffineConstructor.random(domainA, domainB);
+            } while (res.some((affine) => affine.equals(aff)));
+            res.push(aff);
+        }
+        return res;
+    }
+}
+exports.AffineConstructor = AffineConstructor;
+class Affine extends polynomial_1.Polynomial {
+    constructor(a, b, variable = 'x') {
+        super([b, a], variable);
+        this.a = a;
+        this.b = b;
+        this.variable = variable;
+    }
+    getRoot() {
+        return new rational_1.Rational(-this.b, this.a).simplify();
+    }
+    toString() {
+        return super.toTex();
+    }
+}
+exports.Affine = Affine;

package/lib/math/polynomials/polynomial.js

@@ -0,0 +1,125 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Polynomial = void 0;
+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 oppositeNode_1 = require("../../tree/nodes/functions/oppositeNode");
+const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+class Polynomial {
+    /**
+     *
+     * @param coefficients coefficients[i] est le coeff de x^i
+     * @param variable
+     */
+    constructor(coefficients, variable = 'x') {
+        if (coefficients.length === 0)
+            throw Error('coeffs must be not null');
+        if (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]);
+    }
+    getRoots() { }
+    add(P) {
+        if (P.variable !== this.variable)
+            throw Error("Can't add two polynomials with different variables");
+        const newDegree = P.degree === this.degree && P.coefficients[P.degree] === -this.coefficients[this.degree]
+            ? P.degree - 1
+            : Math.max(P.degree, this.degree);
+        const res = [];
+        for (let i = 0; i < newDegree + 1; i++) {
+            res[i] = P.coefficients[i] + this.coefficients[i];
+        }
+        return new Polynomial(res, this.variable);
+    }
+    times(nb) {
+        return new Polynomial(this.coefficients.map((coeff) => coeff * nb), this.variable);
+    }
+    multiply(Q) {
+        if (Q.variable !== this.variable)
+            throw Error("Can't multiply two polynomials with different variables");
+        const p = this.degree;
+        const q = Q.degree;
+        const res = Array.apply(0, new Array(this.degree)).map((i) => 0);
+        for (let k = 0; k <= p + q; k++) {
+            let sum = 0;
+            for (let m = 0; m <= k; m++) {
+                sum += (this.coefficients[m] || 0) * (Q.coefficients[k - m] || 0);
+            }
+            res[k] = sum;
+        }
+        return new Polynomial(res, this.variable);
+    }
+    opposite() {
+        return new Polynomial(this.coefficients.map((coeff) => -coeff), this.variable);
+    }
+    toTree() {
+        const recursive = (cursor) => {
+            const coeff = this.coefficients[cursor];
+            if (coeff === 0)
+                return recursive(cursor - 1);
+            if (cursor === 0) {
+                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 variableNode_1.VariableNode(this.variable);
+            let res;
+            if (coeff === 1)
+                res = monome;
+            else if (coeff === -1)
+                res = new oppositeNode_1.OppositeNode(monome);
+            else
+                res = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff), monome);
+            let nextCoeff;
+            for (let i = cursor - 1; i > -1; i--) {
+                if (this.coefficients[i]) {
+                    nextCoeff = this.coefficients[i];
+                    break;
+                }
+            }
+            if (nextCoeff) {
+                return new addNode_1.AddNode(res, recursive(cursor - 1));
+            }
+            else {
+                return res;
+            }
+        };
+        return recursive(this.degree);
+    }
+    toTex() {
+        let s = '';
+        for (let i = this.degree; i > -1; i--) {
+            const coeff = this.coefficients[i];
+            if (coeff === 0)
+                continue;
+            if (i === 0)
+                s += coeff > 0 ? `+${coeff}` : coeff;
+            else if (i === this.degree) {
+                s += coeff === 1 ? '' : coeff === -1 ? '-' : coeff;
+            }
+            else {
+                s += coeff === 1 ? '+' : coeff === -1 ? '-' : coeff > 0 ? `+${coeff}` : coeff;
+            }
+            //x^n
+            if (i === 0)
+                continue;
+            if (i === 1)
+                s += this.variable;
+            else
+                s += `${this.variable}^{${i}}`;
+        }
+        return s;
+    }
+    toString() {
+        return this.toTex();
+    }
+}
+exports.Polynomial = Polynomial;

package/lib/math/sequences/arithmeticSequence.js

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

package/lib/math/sequences/geometricSequence.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GeometricSequenceConstructor = void 0;
+class GeometricSequenceConstructor {
+    static random() {
+    }
+}
+exports.GeometricSequenceConstructor = GeometricSequenceConstructor;

package/lib/math/sequences/sequence.js

@@ -0,0 +1,18 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Sequence = void 0;
+var SequenceType;
+(function (SequenceType) {
+    SequenceType[SequenceType["arithmetic"] = 0] = "arithmetic";
+    SequenceType[SequenceType["geometric"] = 1] = "geometric";
+})(SequenceType || (SequenceType = {}));
+class Sequence {
+    constructor(type, firstTerm, reason) {
+        this.type = type;
+        this.firstTerm = firstTerm;
+        this.reason = reason;
+        this.
+        ;
+    }
+}
+exports.Sequence = Sequence;

package/lib/math/sets/discreteSet.js

@@ -0,0 +1,28 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DiscreteSet = void 0;
+const random_1 = require("../utils/random");
+class DiscreteSet {
+    constructor(elements) {
+        this.elements = Array.from(new Set(elements));
+        let tex = "\\{";
+        this.elements.forEach((el, index) => {
+            tex += el.tex;
+            if (index < this.elements.length - 1)
+                tex += ";";
+            else
+                tex += "\\}";
+        });
+        this.tex = tex;
+    }
+    toTex() {
+        return this.tex;
+    }
+    includes(el) {
+        return this.elements.some((nb) => nb.value === el.value && nb.tex === el.tex);
+    }
+    getRandomElement() {
+        return (0, random_1.random)(this.elements);
+    }
+}
+exports.DiscreteSet = DiscreteSet;

package/lib/math/sets/emptySet.js

@@ -0,0 +1,6 @@
+"use strict";
+// import { MathSetInterface } from "./mathSetInterface";
+// export abstract class EmptySet implements MathSetInterface {
+//   tex: string = "\\emptyset";
+//   getRandomElement = () => null;
+// }

package/lib/math/sets/intervals/intervals.js

@@ -0,0 +1,104 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Interval = void 0;
+const epsilon_1 = require("../../numbers/epsilon");
+const nombre_1 = require("../../numbers/nombre");
+const round_1 = require("../../mathutils/round");
+const mathSet_1 = require("../mathSet");
+const integer_1 = require("../../numbers/integer/integer");
+const real_1 = require("../../numbers/reals/real");
+var BoundType;
+(function (BoundType) {
+    BoundType["OO"] = "]a;b[";
+    BoundType["OF"] = "]a;b]";
+    BoundType["FO"] = "[a;b[";
+    BoundType["FF"] = "[a;b]";
+})(BoundType || (BoundType = {}));
+class Interval {
+    /**
+     * [[a; b]] pour un interval d'integer;  [a;b] pour des réels
+     */
+    constructor(tex = '[-10; 10]') {
+        if (!tex.includes(';'))
+            throw Error('wrong interval format');
+        this.tex = tex;
+        const isInt = tex[1] === '[' || tex[1] === ']';
+        this.type = isInt ? nombre_1.NumberType.Integer : nombre_1.NumberType.Real;
+        const left = tex[0];
+        const right = tex[tex.length - 1];
+        const [a, b] = tex.slice(isInt ? 2 : 1, isInt ? tex.length - 2 : tex.length - 1).split(';');
+        switch (`${left}a;b${right}`) {
+            case '[a;b]':
+                this.boundType = BoundType.FF;
+                break;
+            case ']a;b[':
+                this.boundType = BoundType.OO;
+                break;
+            case '[a;b[':
+                this.boundType = BoundType.FO;
+                break;
+            case ']a;b]':
+                this.boundType = BoundType.OF;
+                break;
+            default:
+                throw console.error('wrong interval format');
+        }
+        function getBound(bound) {
+            return bound === '-\\infty'
+                ? Number.NEGATIVE_INFINITY
+                : bound === '+\\infty'
+                    ? Number.POSITIVE_INFINITY
+                    : Number(bound);
+        }
+        this.min = getBound(a);
+        this.max = getBound(b);
+    }
+    // union(interval: Interval): MathSet {
+    //[a,b] [c,d]
+    //si a=c return a, max(b,d)
+    //si si b = d return min(a,c), b
+    //si a=d return c,b sauf si  OXXO
+    //si b=c return a,d sauf si XOOX
+    //si c > b ou d < a alors union disjointe avec plus petit en 1er
+    //sinon return min(a,c), max(b,d)
+    //res = a
+    // return new MathSet();
+    // }
+    exclude(nb) {
+        const rand = () => {
+            let x;
+            do {
+                x = this.getRandomElement();
+            } while (x.value === nb);
+            return x;
+        };
+        return new mathSet_1.MathSet(this.toTex() + `\\{${nb}\\}`, rand);
+    }
+    difference(set) {
+        const rand = () => {
+            let x;
+            do {
+                x = this.getRandomElement();
+            } while (set.includes(x));
+            return x;
+        };
+        return new mathSet_1.MathSet(this.toTex() + `\\ ${set.toTex()}`, rand);
+    }
+    toTex() {
+        return this.tex;
+    }
+    getRandomElement(precision = this.type === nombre_1.NumberType.Integer ? 0 : 2) {
+        if (this.min === -Infinity || this.max === Infinity)
+            throw Error("Can't chose amongst infinity");
+        let min = this.boundType === BoundType.OO || this.boundType === BoundType.OF ? this.min + epsilon_1.EPSILON : this.min;
+        let max = this.boundType === BoundType.OO || this.boundType === BoundType.FO ? this.max - epsilon_1.EPSILON : this.max;
+        const value = (0, round_1.round)(min + Math.random() * (max - this.min), precision);
+        switch (this.type) {
+            case nombre_1.NumberType.Integer:
+                return new integer_1.Integer(value);
+            default:
+                return new real_1.Real(value, value.toString());
+        }
+    }
+}
+exports.Interval = Interval;

package/lib/math/sets/mathSet.js

@@ -0,0 +1,10 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MathSet = void 0;
+class MathSet {
+    constructor(tex, getRandomElement) {
+        this.tex = tex;
+        this.getRandomElement = getRandomElement;
+    }
+}
+exports.MathSet = MathSet;

package/lib/math/sets/mathSetInterface.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/lib/math/trigonometry/remarkableValue.js

@@ -0,0 +1,29 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RemarkableValueConstructor = void 0;
+const randint_1 = require("../mathutils/random/randint");
+const numberNode_1 = require("../tree/nodes/numbers/numberNode");
+const piNode_1 = require("../tree/nodes/numbers/piNode");
+const addNode_1 = require("../tree/nodes/operators/addNode");
+const multiplyNode_1 = require("../tree/nodes/operators/multiplyNode");
+const simplify_1 = require("../tree/parsers/simplify");
+const random_1 = require("../utils/random");
+const remarkableValues_1 = require("./remarkableValues");
+class RemarkableValueConstructor {
+}
+exports.RemarkableValueConstructor = RemarkableValueConstructor;
+RemarkableValueConstructor.mainInterval = () => {
+    const randValue = (0, random_1.random)(remarkableValues_1.remarkableTrigoValues);
+    return randValue;
+    // return new RemarkableValue(randValue.angle, randValue.cos, randValue.sin);
+};
+RemarkableValueConstructor.simplifiable = () => {
+    const randValue = (0, random_1.random)(remarkableValues_1.remarkableTrigoValues);
+    const toAdd = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-3, 4) * 2), piNode_1.PiNode);
+    const newAngle = (0, simplify_1.simplifyNode)(new addNode_1.AddNode(randValue.angle, toAdd));
+    return {
+        angle: newAngle,
+        cos: randValue.cos,
+        sin: randValue.sin,
+    };
+};

package/lib/math/trigonometry/remarkableValues.js

@@ -0,0 +1,51 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.remarkableTrigoValues = void 0;
+const oppositeNode_1 = require("../tree/nodes/functions/oppositeNode");
+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 fractionNode_1 = require("../tree/nodes/operators/fractionNode");
+const multiplyNode_1 = require("../tree/nodes/operators/multiplyNode");
+exports.remarkableTrigoValues = [
+    {
+        angle: new numberNode_1.NumberNode(0),
+        cos: new numberNode_1.NumberNode(1),
+        sin: new numberNode_1.NumberNode(0),
+    },
+    {
+        angle: new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(6)),
+        cos: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)), new numberNode_1.NumberNode(2)),
+        sin: new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new numberNode_1.NumberNode(2)),
+    },
+    {
+        angle: new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(4)),
+        cos: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2)),
+        sin: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2)),
+    },
+    {
+        angle: new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(3)),
+        cos: new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new numberNode_1.NumberNode(2)),
+        sin: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)), new numberNode_1.NumberNode(2)),
+    },
+    {
+        angle: new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(2)),
+        cos: new numberNode_1.NumberNode(0),
+        sin: new numberNode_1.NumberNode(1),
+    },
+    {
+        angle: new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(2), piNode_1.PiNode), new numberNode_1.NumberNode(3)),
+        cos: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new numberNode_1.NumberNode(2))),
+        sin: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)), new numberNode_1.NumberNode(2)),
+    },
+    {
+        angle: new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(3), piNode_1.PiNode), new numberNode_1.NumberNode(4)),
+        cos: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2))),
+        sin: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2)),
+    },
+    {
+        angle: piNode_1.PiNode,
+        cos: new numberNode_1.NumberNode(-1),
+        sin: new numberNode_1.NumberNode(0),
+    },
+];

package/lib/math/utils/arithmetic/coprimesOf.js

@@ -0,0 +1,13 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.coprimesOf = void 0;
+const gcd_1 = require("./gcd");
+const coprimesOf = (nb) => {
+    let coprimes = [];
+    for (let i = 2; i <= nb; i++) {
+        if ((0, gcd_1.gcd)(nb, i) === 1)
+            coprimes.push(i);
+    }
+    return coprimes;
+};
+exports.coprimesOf = coprimesOf;

package/lib/math/utils/arithmetic/dividersOf.js

@@ -0,0 +1,12 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.dividersOf = void 0;
+const dividersOf = (nb) => {
+    let divisors = [];
+    for (let i = 1; i <= nb; i++) {
+        if (nb % i === 0)
+            divisors.push(i);
+    }
+    return divisors;
+};
+exports.dividersOf = dividersOf;

package/lib/math/utils/arithmetic/gcd.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.gcd = void 0;
+function gcd(a, b) {
+    return b ? gcd(b, a % b) : a;
+}
+exports.gcd = gcd;

package/lib/math/utils/arithmetic/isSquare.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isSquare = void 0;
+const isSquare = (a) => {
+    return a > 0 && Math.sqrt(a) % 1 === 0;
+};
+exports.isSquare = isSquare;

package/lib/math/utils/arithmetic/lcd.js

@@ -0,0 +1,12 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.lcd = void 0;
+function lcd(a, b) {
+    const max = Math.max(a, b);
+    for (let i = max; i < a * b; i++) {
+        if (i % a === 0 && i % b === 0)
+            return i;
+    }
+    return a * b;
+}
+exports.lcd = lcd;

package/lib/math/utils/arithmetic/nonCoprimesOf.js

@@ -0,0 +1,13 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.nonCoprimesOf = void 0;
+const gcd_1 = require("./gcd");
+const nonCoprimesOf = (nb) => {
+    let nonCoprimes = [];
+    for (let i = 1; i <= nb; i++) {
+        if ((0, gcd_1.gcd)(nb, i) !== 1)
+            nonCoprimes.push(i);
+    }
+    return nonCoprimes;
+};
+exports.nonCoprimesOf = nonCoprimesOf;

package/lib/math/utils/arithmetic/nonDividersOf.js

@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.nonDivisorOf = void 0;
+const dividersOf_1 = require("./dividersOf");
+const nonDivisorOf = (nb) => {
+    let nonDividers = [];
+    let dividers = (0, dividersOf_1.dividersOf)(nb);
+    for (let i = 2; i < nb; i++) {
+        if (nb % i !== 0)
+            nonDividers.push(i);
+    }
+    return nonDividers;
+};
+exports.nonDivisorOf = nonDivisorOf;

package/lib/math/utils/arithmetic/primeFactors.js

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.primeFactors = void 0;
+/***
+ * returns array of prime factors
+ * e.g 12 -> [2, 2, 3]
+ */
+const primeFactors = (a) => {
+    const factors = [];
+    let divisor = 2;
+    while (a >= 2) {
+        if (a % divisor === 0) {
+            factors.push(divisor);
+            a = a / divisor;
+        }
+        else {
+            divisor++;
+        }
+    }
+    return factors;
+};
+exports.primeFactors = primeFactors;

package/lib/math/utils/decimals/decimalPartLengthOf.js

@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.decimalPartLengthOf = void 0;
+const decimalPartLengthOf = (x) => {
+    function hasFraction(x) {
+        return Math.abs(Math.round(x) - x) > 1e-10;
+    }
+    let count = 0;
+    // multiply by increasing powers of 10 until the fractional part is ~ 0
+    while (hasFraction(x * 10 ** count) && isFinite(10 ** count))
+        count++;
+    return count;
+};
+exports.decimalPartLengthOf = decimalPartLengthOf;

package/lib/math/utils/random/randTupleInt.js

@@ -0,0 +1,30 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.distinctRandTupleInt = exports.randTupleInt = void 0;
+const arrayEqual_1 = require("../../utils/arrayEqual");
+const randint_1 = require("./randint");
+/**
+ * @param size tuple length
+ * @param options
+ * @returns array of size nb with contents = randint(from, to, exxcludes)
+ */
+const randTupleInt = (size, options) => {
+    const res = [];
+    for (let i = 0; i < size; i++) {
+        res.push((0, randint_1.randint)(options.from, options.to, options.excludes));
+    }
+    return res;
+};
+exports.randTupleInt = randTupleInt;
+const distinctRandTupleInt = (nb, size, options) => {
+    const res = [];
+    for (let i = 0; i < nb; i++) {
+        let newTuple;
+        do {
+            newTuple = (0, exports.randTupleInt)(size, options);
+        } while (res.some(tuple => (0, arrayEqual_1.arrayEqual)(tuple, newTuple)));
+        res.push(newTuple);
+    }
+    return res;
+};
+exports.distinctRandTupleInt = distinctRandTupleInt;

package/lib/math/utils/random/randint.js

@@ -0,0 +1,18 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.randint = void 0;
+/**
+ * @returns random [[a, b[[
+ */
+const randint = (a, b, excludes) => {
+    if (b === undefined)
+        return Math.floor(Math.random() * a);
+    if (!excludes)
+        return a + Math.floor(Math.random() * (b - a));
+    let res;
+    do {
+        res = a + Math.floor(Math.random() * (b - a));
+    } while (excludes.includes(res));
+    return res;
+};
+exports.randint = randint;

package/lib/math/utils/round.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.round = void 0;
+const epsilon_1 = require("../numbers/epsilon");
+function round(x, precision) {
+    return Math.round((x + epsilon_1.EPSILON) * Math.pow(10, precision)) / Math.pow(10, precision);
+}
+exports.round = round;

package/lib/mathutils/random/randTupleInt.js

@@ -0,0 +1,30 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.distinctRandTupleInt = exports.randTupleInt = void 0;
+const arrayEqual_1 = require("../../utils/arrayEqual");
+const randint_1 = require("./randint");
+/**
+ * @param size tuple length
+ * @param options
+ * @returns array of size nb with contents = randint(from, to, exxcludes)
+ */
+const randTupleInt = (size, options) => {
+    const res = [];
+    for (let i = 0; i < size; i++) {
+        res.push((0, randint_1.randint)(options.from, options.to, options.excludes));
+    }
+    return res;
+};
+exports.randTupleInt = randTupleInt;
+const distinctRandTupleInt = (nb, size, options) => {
+    const res = [];
+    for (let i = 0; i < nb; i++) {
+        let newTuple;
+        do {
+            newTuple = (0, exports.randTupleInt)(size, options);
+        } while (res.some(tuple => (0, arrayEqual_1.arrayEqual)(tuple, newTuple)));
+        res.push(newTuple);
+    }
+    return res;
+};
+exports.distinctRandTupleInt = distinctRandTupleInt;