math-exercises 1.2.7 → 1.2.10

package/src/numbers/integer/integer.ts

@@ -1,72 +0,0 @@
-import { randint } from "../../mathutils/random/randint";
-import { Node } from "../../tree/nodes/node";
-import { NumberNode } from "../../tree/nodes/numbers/numberNode";
-import { Nombre, NumberType } from "../nombre";
-import { Rational } from "../rationals/rational";
-
-export abstract class IntegerConstructor {
-  static random(nbOfDigits: number) {
-    return randint(0, 10 ** nbOfDigits);
-  }
-}
-
-export class Integer implements Nombre {
-  value: number;
-  tex: string;
-  type: NumberType;
-
-  constructor(value: number, tex?: string) {
-    this.value = value;
-    this.tex = tex || value + "";
-    this.type = NumberType.Integer;
-  }
-
-  toTree(): Node {
-    return new NumberNode(this.value, this.tex);
-  }
-
-  round(precision: number) {
-    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: Nombre): Nombre {
-    switch (nb.type) {
-      case NumberType.Integer:
-        return new Rational(this.value, nb.value).simplify();
-      case NumberType.Rational:
-        const rational = nb as Rational;
-        return new Rational(this.value * rational.denum, rational.num).simplify();
-      default:
-        throw Error("not implemented");
-    }
-  }
-}

package/src/numbers/integer/power.ts

@@ -1,49 +0,0 @@
-import { Node } from "../../tree/nodes/node";
-import { NumberNode } from "../../tree/nodes/numbers/numberNode";
-import { PowerNode } from "../../tree/nodes/operators/powerNode";
-import { Nombre, NumberType } from "../nombre";
-import { Integer } from "./integer";
-
-export class Power implements Nombre {
-  value: number;
-  tex: string;
-  type: NumberType;
-  operand: number;
-  power: number;
-  constructor(a: number, b: number) {
-    this.operand = a;
-    this.power = b;
-    this.value = Math.pow(a, b);
-    this.tex = `${a}^{${b}}`;
-    this.type = b < 0 ? NumberType.Rational : NumberType.Integer;
-  }
-  simplify(): Node {
-    if (this.power === 0) return new NumberNode(1);
-    if (this.power === 1) return new NumberNode(this.operand);
-    if (this.operand === 1) return new NumberNode(1);
-    if (this.operand === 0) return new NumberNode(0);
-    if (this.operand === -1) return new NumberNode(this.power % 2 === 0 ? 1 : -1);
-    return this.toTree();
-  }
-  toDecimalWriting(): Nombre {
-    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(Number(s), s);
-  }
-  toTree(): Node {
-    return new PowerNode(new NumberNode(this.operand), new NumberNode(this.power));
-  }
-}

package/src/numbers/nombre.ts

@@ -1,15 +0,0 @@
-import { Node } from "../tree/nodes/node";
-import { NumberNode } from "../tree/nodes/numbers/numberNode";
-
-export enum NumberType {
-  Integer,
-  Decimal,
-  Rational,
-  Real,
-}
-export interface Nombre {
-  value: number;
-  tex: string;
-  type: NumberType;
-  toTree: () => Node;
-}

package/src/numbers/number.js

@@ -1,8 +0,0 @@
-"use strict";
-exports.__esModule = true;
-exports.NumberType = void 0;
-var NumberType;
-(function (NumberType) {
-    NumberType[NumberType["Integer"] = 0] = "Integer";
-    NumberType[NumberType["Real"] = 1] = "Real";
-})(NumberType = exports.NumberType || (exports.NumberType = {}));

package/src/numbers/rationals/rational.js

@@ -1,128 +0,0 @@
-"use strict";
-var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
-    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
-        if (ar || !(i in from)) {
-            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
-            ar[i] = from[i];
-        }
-    }
-    return to.concat(ar || Array.prototype.slice.call(from));
-};
-exports.__esModule = true;
-exports.Rational = exports.RationalConstructor = void 0;
-var coprimesOf_1 = require("../../mathutils/arithmetic/coprimesOf");
-var gcd_1 = require("../../mathutils/arithmetic/gcd");
-var lcd_1 = require("../../mathutils/arithmetic/lcd");
-var randint_1 = require("../../mathutils/random/randint");
-var numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-var fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
-var random_1 = require("../../utils/random");
-var shuffle_1 = require("../../utils/shuffle");
-var integer_1 = require("../integer/integer");
-var nombre_1 = require("../nombre");
-var RationalConstructor = /** @class */ (function () {
-    function RationalConstructor() {
-    }
-    /**
-     * @param maxGcd max number by which the fraction is simplifiable
-     */
-    RationalConstructor.randomSimplifiable = function (maxGcd) {
-        if (maxGcd === void 0) { maxGcd = 10; }
-        var gcd = (0, randint_1.randint)(2, maxGcd);
-        var max = (0, randint_1.randint)(3, 11);
-        var min = (0, random_1.random)((0, coprimesOf_1.coprimesOf)(max));
-        var _a = (0, shuffle_1.shuffle)([gcd * min, gcd * max]), num = _a[0], denum = _a[1];
-        if (denum === gcd) {
-            //si 10/2 on transforme en 2/10
-            return new Rational(denum, num);
-        }
-        return new Rational(num, denum);
-    };
-    RationalConstructor.randomIrreductible = function (max) {
-        if (max === void 0) { max = 11; }
-        var a = (0, randint_1.randint)(2, max);
-        var b = (0, random_1.random)(__spreadArray(__spreadArray([], (0, coprimesOf_1.coprimesOf)(a), true), [1], false));
-        if (b === 1)
-            return new Rational(b, a);
-        var _a = (0, shuffle_1.shuffle)([a, b]), num = _a[0], denum = _a[1];
-        return new Rational(num, denum);
-    };
-    return RationalConstructor;
-}());
-exports.RationalConstructor = RationalConstructor;
-var Rational = /** @class */ (function () {
-    function Rational(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{".concat(this.num, "}{").concat(this.denum, "}");
-        this.type = nombre_1.NumberType.Rational;
-    }
-    Rational.prototype.toTex = function () {
-        return "\\frac{".concat(this.num, "}{").concat(this.denum, "}");
-    };
-    Rational.prototype.add = function (nb) {
-        switch (nb.type) {
-            case nombre_1.NumberType.Integer: {
-                var num = this.num + this.denum * nb.value;
-                return new Rational(num, this.denum).simplify();
-            }
-            case nombre_1.NumberType.Rational: {
-                var rational = nb;
-                var ppcm = (0, lcd_1.lcd)(rational.denum, this.denum);
-                var num = this.num * (ppcm / this.denum) + rational.num * (ppcm / rational.denum);
-                return new Rational(num, ppcm).simplify();
-            }
-        }
-        throw Error("not implemented yet");
-    };
-    Rational.prototype.multiply = function (nb) {
-        switch (nb.type) {
-            case nombre_1.NumberType.Integer: {
-                var num = this.num * nb.value;
-                var denum = this.denum;
-                return new Rational(num, denum).simplify();
-            }
-            case nombre_1.NumberType.Rational: {
-                var rational = nb;
-                var num = this.num * rational.num;
-                var denum = this.denum * rational.denum;
-                return new Rational(num, denum).simplify();
-            }
-        }
-        throw Error("not implemented yet");
-    };
-    Rational.prototype.divide = function (nb) {
-        switch (nb.type) {
-            case nombre_1.NumberType.Integer: {
-                var denum = this.denum * nb.value;
-                return new Rational(this.num, denum).simplify();
-            }
-            case nombre_1.NumberType.Rational: {
-                var rational = nb;
-                var num = this.num * rational.denum;
-                var denum = this.denum * rational.num;
-                return new Rational(num, denum).simplify();
-            }
-        }
-        throw Error("not implemented yet");
-    };
-    Rational.prototype.opposite = function () {
-        return new Rational(-this.num, this.denum);
-    };
-    Rational.prototype.toTree = function () {
-        return new fractionNode_1.FractionNode(new numberNode_1.NumberNode(this.num), new numberNode_1.NumberNode(this.denum));
-    };
-    Rational.prototype.simplify = function () {
-        var sign = (this.num > 0 && this.denum > 0) || (this.num < 0 && this.denum < 0) ? 1 : -1;
-        var 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);
-    };
-    return Rational;
-}());
-exports.Rational = Rational;

package/src/numbers/rationals/rational.ts

@@ -1,122 +0,0 @@
-import { coprimesOf } from "../../mathutils/arithmetic/coprimesOf";
-import { gcd } from "../../mathutils/arithmetic/gcd";
-import { lcd } from "../../mathutils/arithmetic/lcd";
-import { randint } from "../../mathutils/random/randint";
-import { Node } from "../../tree/nodes/node";
-import { NumberNode } from "../../tree/nodes/numbers/numberNode";
-import { DivideNode } from "../../tree/nodes/operators/divideNode";
-import { FractionNode } from "../../tree/nodes/operators/fractionNode";
-import { random } from "../../utils/random";
-import { shuffle } from "../../utils/shuffle";
-import { Integer } from "../integer/integer";
-import { Nombre, NumberType } from "../nombre";
-
-export abstract class RationalConstructor {
-  /**
-   * @param maxGcd max number by which the fraction is simplifiable
-   */
-  static randomSimplifiable(maxGcd: number = 10) {
-    const gcd = randint(2, maxGcd);
-    const max = randint(3, 11);
-    const min = random(coprimesOf(max));
-    let [num, denum]: number[] = 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: number = 11) {
-    const a = randint(2, max);
-    const b = random([...coprimesOf(a), 1]);
-    if (b === 1) return new Rational(b, a);
-    const [num, denum] = shuffle([a, b]);
-    return new Rational(num, denum);
-  }
-}
-
-export class Rational implements Nombre {
-  num: number;
-  denum: number;
-  tex: string;
-  value: number;
-  isSimplified: boolean;
-  type: NumberType;
-
-  constructor(numerator: number, denumerator: number) {
-    if (denumerator === 0) throw Error("division by zero");
-    this.num = numerator;
-    this.denum = denumerator;
-    this.value = numerator / denumerator;
-    this.isSimplified = Math.abs(gcd(numerator, denumerator)) === 1;
-    this.tex = `\\frac{${this.num}}{${this.denum}}`;
-    this.type = NumberType.Rational;
-  }
-
-  toTex() {
-    return `\\frac{${this.num}}{${this.denum}}`;
-  }
-
-  add(nb: Nombre): Nombre {
-    switch (nb.type) {
-      case NumberType.Integer: {
-        const num = this.num + this.denum * nb.value;
-        return new Rational(num, this.denum).simplify();
-      }
-      case NumberType.Rational: {
-        const rational = nb as Rational;
-        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();
-      }
-    }
-    throw Error("not implemented yet");
-  }
-
-  multiply(nb: Nombre): Nombre {
-    switch (nb.type) {
-      case NumberType.Integer: {
-        const num = this.num * nb.value;
-        const denum = this.denum;
-        return new Rational(num, denum).simplify();
-      }
-      case NumberType.Rational: {
-        const rational = nb as Rational;
-        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: Nombre): Nombre {
-    switch (nb.type) {
-      case NumberType.Integer: {
-        const denum = this.denum * nb.value;
-        return new Rational(this.num, denum).simplify();
-      }
-      case NumberType.Rational: {
-        const rational = nb as Rational;
-        const num = this.num * rational.denum;
-        const denum = this.denum * rational.num;
-        return new Rational(num, denum).simplify();
-      }
-    }
-    throw Error("not implemented yet");
-  }
-
-  opposite(): Rational {
-    return new Rational(-this.num, this.denum);
-  }
-
-  toTree(): Node {
-    return new FractionNode(new NumberNode(this.num), new NumberNode(this.denum));
-  }
-
-  simplify(): Nombre {
-    const sign = (this.num > 0 && this.denum > 0) || (this.num < 0 && this.denum < 0) ? 1 : -1;
-    const div = Math.abs(gcd(this.num, this.denum));
-    if (Math.abs(this.denum) === div) return new Integer(this.num / this.denum);
-    return new Rational((sign * Math.abs(this.num)) / div, Math.abs(this.denum) / div);
-  }
-}

package/src/numbers/reals/real.js

@@ -1,17 +0,0 @@
-"use strict";
-exports.__esModule = true;
-exports.Real = void 0;
-var numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-var nombre_1 = require("../nombre");
-var Real = /** @class */ (function () {
-    function Real(value, tex) {
-        this.value = value;
-        this.tex = tex;
-        this.type = nombre_1.NumberType.Real;
-    }
-    Real.prototype.toTree = function () {
-        return new numberNode_1.NumberNode(this.value);
-    };
-    return Real;
-}());
-exports.Real = Real;

package/src/numbers/reals/real.ts

@@ -1,17 +0,0 @@
-import { Node } from "../../tree/nodes/node";
-import { NumberNode } from "../../tree/nodes/numbers/numberNode";
-import { Nombre, NumberType } from "../nombre";
-
-export class Real implements Nombre {
-  value: number;
-  tex: string;
-  type: NumberType;
-  constructor(value: number, tex: string) {
-    this.value = value;
-    this.tex = tex;
-    this.type = NumberType.Real;
-  }
-  toTree(): Node {
-    return new NumberNode(this.value);
-  }
-}

package/src/numbers/reals/squareRoot.js

@@ -1,85 +0,0 @@
-"use strict";
-var __extends = (this && this.__extends) || (function () {
-    var extendStatics = function (d, b) {
-        extendStatics = Object.setPrototypeOf ||
-            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
-            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
-        return extendStatics(d, b);
-    };
-    return function (d, b) {
-        if (typeof b !== "function" && b !== null)
-            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
-        extendStatics(d, b);
-        function __() { this.constructor = d; }
-        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-    };
-})();
-exports.__esModule = true;
-exports.SquareRoot = exports.SquareRootConstructor = void 0;
-var isSquare_1 = require("../../mathutils/arithmetic/isSquare");
-var primeFactors_1 = require("../../mathutils/arithmetic/primeFactors");
-var randint_1 = require("../../mathutils/random/randint");
-var numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-var multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-var real_1 = require("./real");
-var sqrtNode_1 = require("../../tree/nodes/functions/sqrtNode");
-var SquareRootConstructor = /** @class */ (function () {
-    function SquareRootConstructor() {
-    }
-    /**
-     * @returns simplifiable square root type sqrt(c)=a*sqrt(b)
-     */
-    SquareRootConstructor.randomSimplifiable = function (_a) {
-        var _b = _a.allowPerfectSquare, allowPerfectSquare = _b === void 0 ? false : _b, _c = _a.maxSquare, maxSquare = _c === void 0 ? 11 : _c;
-        var a = (0, randint_1.randint)(2, maxSquare);
-        var b;
-        var 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);
-    };
-    return SquareRootConstructor;
-}());
-exports.SquareRootConstructor = SquareRootConstructor;
-var SquareRoot = /** @class */ (function (_super) {
-    __extends(SquareRoot, _super);
-    function SquareRoot(operand) {
-        var _this = _super.call(this, Math.sqrt(operand), "\\sqrt{".concat(operand, "}")) || this;
-        _this.operand = operand;
-        return _this;
-    }
-    SquareRoot.prototype.simplify = function () {
-        var factors = (0, primeFactors_1.primeFactors)(this.operand);
-        // finds primes with even exponents
-        var multiples = [1];
-        for (var i = 0; i < factors.length - 1; i++) {
-            if (factors[i] === factors[i + 1]) {
-                multiples.push(factors[i]);
-                factors.splice(i, 2);
-                i--;
-            }
-        }
-        var outsideSqrt = multiples.reduce(function (x, y) { return x * y; });
-        var insideSqrt = factors.length === 0 ? 1 : factors.reduce(function (x, y) { return x * y; });
-        var simplified = insideSqrt !== 1
-            ? new real_1.Real(outsideSqrt * Math.sqrt(insideSqrt), "".concat(outsideSqrt === 1 ? "" : "".concat(outsideSqrt), "\\sqrt{").concat(insideSqrt, "}"))
-            : new real_1.Real(outsideSqrt, outsideSqrt + "");
-        simplified.toTree = function () {
-            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;
-    };
-    SquareRoot.prototype.toTex = function () {
-        return this.tex;
-    };
-    SquareRoot.prototype.toTree = function () {
-        return new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(this.operand));
-    };
-    return SquareRoot;
-}(real_1.Real));
-exports.SquareRoot = SquareRoot;

package/src/numbers/reals/squareRoot.ts

@@ -1,70 +0,0 @@
-import { isSquare } from "../../mathutils/arithmetic/isSquare";
-import { primeFactors } from "../../mathutils/arithmetic/primeFactors";
-import { randint } from "../../mathutils/random/randint";
-import { Node } from "../../tree/nodes/node";
-import { NumberNode } from "../../tree/nodes/numbers/numberNode";
-import { MultiplyNode } from "../../tree/nodes/operators/multiplyNode";
-import { Real } from "./real";
-import { SqrtNode } from "../../tree/nodes/functions/sqrtNode";
-
-export abstract class SquareRootConstructor {
-  /**
-   * @returns simplifiable square root type sqrt(c)=a*sqrt(b)
-   */
-  static randomSimplifiable({ allowPerfectSquare = false, maxSquare = 11 }): SquareRoot {
-    const a = randint(2, maxSquare);
-    let b;
-    let bMin = allowPerfectSquare ? 1 : 2;
-    do {
-      b = randint(bMin, maxSquare);
-    } while (b % (a * a) === 0 || isSquare(b));
-    return new SquareRoot(a * a * b);
-  }
-}
-
-export class SquareRoot extends Real {
-  operand: number;
-  constructor(operand: number) {
-    super(Math.sqrt(operand), `\\sqrt{${operand}}`);
-    this.operand = operand;
-  }
-
-  simplify(): Real {
-    const factors = 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(
-            outsideSqrt * Math.sqrt(insideSqrt),
-            `${outsideSqrt === 1 ? "" : `${outsideSqrt}`}\\sqrt{${insideSqrt}}`
-          )
-        : new Real(outsideSqrt, outsideSqrt + "");
-    simplified.toTree = (): Node => {
-      return insideSqrt !== 1
-        ? outsideSqrt === 1
-          ? new SqrtNode(new NumberNode(insideSqrt))
-          : new MultiplyNode(new NumberNode(outsideSqrt), new SqrtNode(new NumberNode(insideSqrt)))
-        : new NumberNode(outsideSqrt);
-    };
-    return simplified;
-  }
-
-  toTex(): string {
-    return this.tex;
-  }
-
-  toTree(): Node {
-    return new SqrtNode(new NumberNode(this.operand));
-  }
-}

package/src/polynomials/affine.js

@@ -1,71 +0,0 @@
-"use strict";
-var __extends = (this && this.__extends) || (function () {
-    var extendStatics = function (d, b) {
-        extendStatics = Object.setPrototypeOf ||
-            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
-            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
-        return extendStatics(d, b);
-    };
-    return function (d, b) {
-        if (typeof b !== "function" && b !== null)
-            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
-        extendStatics(d, b);
-        function __() { this.constructor = d; }
-        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-    };
-})();
-exports.__esModule = true;
-exports.Affine = exports.AffineConstructor = void 0;
-var rational_1 = require("../numbers/rationals/rational");
-var intervals_1 = require("../sets/intervals/intervals");
-var polynomial_1 = require("./polynomial");
-var discreteSet_1 = require("../sets/discreteSet");
-var integer_1 = require("../numbers/integer/integer");
-var AffineConstructor = /** @class */ (function () {
-    function AffineConstructor() {
-    }
-    AffineConstructor.random = function (domainA, domainB) {
-        if (domainA === void 0) { domainA = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)])); }
-        if (domainB === void 0) { domainB = new intervals_1.Interval("[[-10; 10]]"); }
-        var a = domainA.getRandomElement();
-        var b = domainB.getRandomElement();
-        return new Affine(a.value, b.value);
-    };
-    AffineConstructor.differentRandoms = function (nb, domainA, domainB) {
-        if (domainA === void 0) { domainA = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)])); }
-        if (domainB === void 0) { domainB = new intervals_1.Interval("[[-10; 10]]"); }
-        var res = [];
-        var _loop_1 = function (i) {
-            var aff;
-            do {
-                aff = AffineConstructor.random(domainA, domainB);
-            } while (res.some(function (affine) { return affine.equals(aff); }));
-            res.push(aff);
-        };
-        for (var i = 0; i < nb; i++) {
-            _loop_1(i);
-        }
-        return res;
-    };
-    return AffineConstructor;
-}());
-exports.AffineConstructor = AffineConstructor;
-var Affine = /** @class */ (function (_super) {
-    __extends(Affine, _super);
-    function Affine(a, b, variable) {
-        if (variable === void 0) { variable = "x"; }
-        var _this = _super.call(this, [b, a], variable) || this;
-        _this.a = a;
-        _this.b = b;
-        _this.variable = variable;
-        return _this;
-    }
-    Affine.prototype.getRoot = function () {
-        return new rational_1.Rational(-this.b, this.a).simplify();
-    };
-    Affine.prototype.toString = function () {
-        return _super.prototype.toTex.call(this);
-    };
-    return Affine;
-}(polynomial_1.Polynomial));
-exports.Affine = Affine;