math-exercises 1.3.33 → 1.3.36

package/lib/mathutils/random/randTupleInt.js

@@ -1,30 +0,0 @@
-"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/mathutils/random/randint.js

@@ -1,18 +0,0 @@
-"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/mathutils/round.js

@@ -1,8 +0,0 @@
-"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/numbers/decimals/decimal.js

@@ -1,140 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Decimal = exports.DecimalConstructor = void 0;
-const randint_1 = require("../../mathutils/random/randint");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const integer_1 = require("../integer/integer");
-const nombre_1 = require("../nombre");
-class DecimalConstructor {
-    static randomFracPart(precision) {
-        let decimals = "";
-        for (let i = 0; i < precision; i++) {
-            decimals += (0, randint_1.randint)(i === precision - 1 ? 1 : 0, 10);
-        }
-        return decimals;
-    }
-    static random(min, max, precision) {
-        const int = (0, randint_1.randint)(min, max) + "";
-        const decimals = DecimalConstructor.randomFracPart(precision);
-        return DecimalConstructor.fromParts(int, decimals);
-    }
-    static fromParts(intPart, decimalPart) {
-        return new Decimal(Number("" + intPart + "." + decimalPart));
-    }
-}
-exports.DecimalConstructor = DecimalConstructor;
-class Decimal {
-    constructor(value) {
-        this.type = nombre_1.NumberType.Decimal;
-        this.value = value;
-        this.tex = value + "";
-        let [intPartString, decimalPartString] = (value + "").split(".");
-        this.intPart = Number(intPartString);
-        this.decimalPart = decimalPartString || "";
-        this.precision = this.decimalPart.length;
-    }
-    /**
-     *
-     * @param precision 0 = unité, 1 = dixieme, ... , -1 : dizaine
-     * @returns
-     */
-    round(precision) {
-        const intPartString = this.intPart + "";
-        if (precision < 0) {
-            if (precision < -intPartString.length)
-                throw Error("can't round to higher precision");
-            return new integer_1.Integer(this.intPart).round(-precision);
-        }
-        if (precision > this.precision)
-            throw Error("can't round to higher precision");
-        if (precision === this.precision)
-            return this;
-        let newFracPart = "", newIntPart = "";
-        const shouldRoundUp = Number(this.decimalPart[precision]) > 4;
-        if (shouldRoundUp) {
-            let retenue = true;
-            let i = precision - 1;
-            while (retenue) {
-                if (i > -1) {
-                    const nb = (Number(this.decimalPart[i]) + 1) % 10;
-                    if (nb || newFracPart) {
-                        newFracPart = nb.toString() + newFracPart;
-                    }
-                    if (nb !== 0) {
-                        retenue = false;
-                        for (let j = i - 1; j > -1; j--) {
-                            newFracPart = this.decimalPart[j] + newFracPart;
-                        }
-                        newIntPart = intPartString;
-                    }
-                    else
-                        i--;
-                }
-                else {
-                    const nb = (Number(intPartString[i + intPartString.length]) + 1) % 10;
-                    newIntPart = nb + "" + newIntPart;
-                    if (nb !== 0) {
-                        retenue = false;
-                        for (let j = i + intPartString.length - 1; j > -1; j--) {
-                            newIntPart = intPartString[j] + newIntPart;
-                        }
-                    }
-                    else
-                        i--;
-                }
-            }
-        }
-        else {
-            let retenue = true;
-            let i = precision - 1;
-            while (retenue) {
-                if (i > -1) {
-                    const nb = Number(this.decimalPart[i]);
-                    if (nb || newFracPart) {
-                        newFracPart = nb.toString() + newFracPart;
-                    }
-                    if (nb !== 0) {
-                        retenue = false;
-                        for (let j = i - 1; j > -1; j--) {
-                            newFracPart = this.decimalPart[j] + newFracPart;
-                        }
-                        newIntPart = intPartString;
-                    }
-                    else
-                        i--;
-                }
-                else {
-                    newIntPart = intPartString;
-                    retenue = false;
-                }
-            }
-        }
-        return DecimalConstructor.fromParts(newIntPart, newFracPart);
-    }
-    multiplyByPowerOfTen(power) {
-        let newIntPart = "", newFracPart = "";
-        if (power > -1) {
-            newIntPart = this.intPart + "";
-            for (let i = 0; i < power; i++) {
-                newIntPart += i > this.decimalPart.length - 1 ? "0" : this.decimalPart[i];
-            }
-            newFracPart = this.decimalPart.slice(power);
-        }
-        else {
-            const intPartString = this.intPart + "";
-            newFracPart = this.decimalPart;
-            for (let i = intPartString.length - 1; i > intPartString.length - 1 + power; i--) {
-                newFracPart = (i < 0 ? "0" : intPartString[i]) + newFracPart;
-            }
-            if (power + intPartString.length < 1)
-                newIntPart = "0";
-            else
-                newIntPart = intPartString.slice(0, power + intPartString.length);
-        }
-        return DecimalConstructor.fromParts(newIntPart, newFracPart);
-    }
-    toTree() {
-        return new numberNode_1.NumberNode(this.value);
-    }
-}
-exports.Decimal = Decimal;

package/lib/numbers/epsilon.js

@@ -1,10 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.EPSILON = void 0;
-function getEpsilon() {
-    var e = 1.0;
-    while (1.0 + 0.5 * e !== 1.0)
-        e *= 0.5;
-    return e;
-}
-exports.EPSILON = getEpsilon();

package/lib/numbers/integer/integer.js

@@ -1,68 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Integer = exports.IntegerConstructor = void 0;
-const randint_1 = require("../../mathutils/random/randint");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const nombre_1 = require("../nombre");
-const rational_1 = require("../rationals/rational");
-class IntegerConstructor {
-    static random(nbOfDigits) {
-        return (0, randint_1.randint)(0, 10 ** nbOfDigits);
-    }
-}
-exports.IntegerConstructor = IntegerConstructor;
-class Integer {
-    constructor(value, tex) {
-        this.value = value;
-        this.tex = tex || value + "";
-        this.type = nombre_1.NumberType.Integer;
-    }
-    toTree() {
-        return new numberNode_1.NumberNode(this.value, this.tex);
-    }
-    round(precision) {
-        const intString = this.value + "";
-        if (precision >= intString.length || precision < 1)
-            throw Error("can't round to higher precision");
-        let newInt = "";
-        const shouldRoundUp = Number(intString[intString.length - precision]) > 4;
-        if (shouldRoundUp) {
-            for (let i = 0; i < precision; i++) {
-                newInt += "0";
-            }
-            let retenue = true;
-            let i = intString.length - precision - 1;
-            while (retenue) {
-                const nb = (Number(intString[i]) + 1) % 10;
-                newInt = "" + nb + newInt;
-                if (nb === 0) {
-                    i--;
-                }
-                else {
-                    retenue = false;
-                    for (let j = i - 1; j > -1; j--) {
-                        newInt = intString[j] + newInt;
-                    }
-                }
-            }
-        }
-        else {
-            for (let i = 0; i < intString.length; i++) {
-                newInt += i < intString.length - precision ? intString[i] : "0";
-            }
-        }
-        return new Integer(Number(newInt));
-    }
-    divide(nb) {
-        switch (nb.type) {
-            case nombre_1.NumberType.Integer:
-                return new rational_1.Rational(this.value, nb.value).simplify();
-            case nombre_1.NumberType.Rational:
-                const rational = nb;
-                return new rational_1.Rational(this.value * rational.denum, rational.num).simplify();
-            default:
-                throw Error("not implemented");
-        }
-    }
-}
-exports.Integer = Integer;

package/lib/numbers/integer/power.js

@@ -1,52 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Power = void 0;
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const powerNode_1 = require("../../tree/nodes/operators/powerNode");
-const nombre_1 = require("../nombre");
-const integer_1 = require("./integer");
-class Power {
-    constructor(a, b) {
-        this.operand = a;
-        this.power = b;
-        this.value = Math.pow(a, b);
-        this.tex = `${a}^{${b}}`;
-        this.type = b < 0 ? nombre_1.NumberType.Rational : nombre_1.NumberType.Integer;
-    }
-    simplify() {
-        if (this.power === 0)
-            return new numberNode_1.NumberNode(1);
-        if (this.power === 1)
-            return new numberNode_1.NumberNode(this.operand);
-        if (this.operand === 1)
-            return new numberNode_1.NumberNode(1);
-        if (this.operand === 0)
-            return new numberNode_1.NumberNode(0);
-        if (this.operand === -1)
-            return new numberNode_1.NumberNode(this.power % 2 === 0 ? 1 : -1);
-        return this.toTree();
-    }
-    toDecimalWriting() {
-        if (this.operand !== 10)
-            throw Error("only implemented for powers of ten so far");
-        let s = "";
-        if (this.power > -1) {
-            s += "1";
-            for (let i = 0; i < this.power; i++) {
-                s += 0;
-            }
-        }
-        else {
-            s += "1";
-            for (let i = 1; i < Math.abs(this.power); i++) {
-                s = "0" + s;
-            }
-            s = "0." + s;
-        }
-        return new integer_1.Integer(Number(s), s);
-    }
-    toTree() {
-        return new powerNode_1.PowerNode(new numberNode_1.NumberNode(this.operand), new numberNode_1.NumberNode(this.power));
-    }
-}
-exports.Power = Power;

package/lib/numbers/nombre.js

@@ -1,10 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.NumberType = void 0;
-var NumberType;
-(function (NumberType) {
-    NumberType[NumberType["Integer"] = 0] = "Integer";
-    NumberType[NumberType["Decimal"] = 1] = "Decimal";
-    NumberType[NumberType["Rational"] = 2] = "Rational";
-    NumberType[NumberType["Real"] = 3] = "Real";
-})(NumberType = exports.NumberType || (exports.NumberType = {}));

package/lib/numbers/rationals/rational.js

@@ -1,113 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Rational = exports.RationalConstructor = void 0;
-const coprimesOf_1 = require("../../mathutils/arithmetic/coprimesOf");
-const gcd_1 = require("../../mathutils/arithmetic/gcd");
-const lcd_1 = require("../../mathutils/arithmetic/lcd");
-const randint_1 = require("../../mathutils/random/randint");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
-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);
-    }
-}
-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 = `\\frac{${this.num}}{${this.denum}}`;
-        this.type = nombre_1.NumberType.Rational;
-    }
-    toTex() {
-        return `\\frac{${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() {
-        return new fractionNode_1.FractionNode(new numberNode_1.NumberNode(this.num), new numberNode_1.NumberNode(this.denum));
-    }
-    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/numbers/reals/real.js

@@ -1,16 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Real = void 0;
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const nombre_1 = require("../nombre");
-class Real {
-    constructor(value, tex) {
-        this.value = value;
-        this.tex = tex;
-        this.type = nombre_1.NumberType.Real;
-    }
-    toTree() {
-        return new numberNode_1.NumberNode(this.value);
-    }
-}
-exports.Real = Real;

package/lib/numbers/reals/squareRoot.js

@@ -1,63 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SquareRoot = exports.SquareRootConstructor = void 0;
-const isSquare_1 = require("../../mathutils/arithmetic/isSquare");
-const primeFactors_1 = require("../../mathutils/arithmetic/primeFactors");
-const randint_1 = require("../../mathutils/random/randint");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const real_1 = require("./real");
-const sqrtNode_1 = require("../../tree/nodes/functions/sqrtNode");
-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);
-        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));
-        return new SquareRoot(a * a * b);
-    }
-}
-exports.SquareRootConstructor = SquareRootConstructor;
-class SquareRoot extends real_1.Real {
-    constructor(operand) {
-        super(Math.sqrt(operand), `\\sqrt{${operand}}`);
-        this.operand = operand;
-    }
-    simplify() {
-        const factors = (0, primeFactors_1.primeFactors)(this.operand);
-        // finds primes with even exponents
-        const multiples = [1];
-        for (let i = 0; i < factors.length - 1; i++) {
-            if (factors[i] === factors[i + 1]) {
-                multiples.push(factors[i]);
-                factors.splice(i, 2);
-                i--;
-            }
-        }
-        const outsideSqrt = multiples.reduce((x, y) => x * y);
-        const insideSqrt = factors.length === 0 ? 1 : factors.reduce((x, y) => x * y);
-        const simplified = insideSqrt !== 1
-            ? new real_1.Real(outsideSqrt * Math.sqrt(insideSqrt), `${outsideSqrt === 1 ? "" : `${outsideSqrt}`}\\sqrt{${insideSqrt}}`)
-            : new real_1.Real(outsideSqrt, outsideSqrt + "");
-        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);
-        };
-        return simplified;
-    }
-    toTex() {
-        return this.tex;
-    }
-    toTree() {
-        return new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(this.operand));
-    }
-}
-exports.SquareRoot = SquareRoot;

package/lib/polynomials/affine.js

@@ -1,42 +0,0 @@
-"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;