math-exercises 2.2.98 → 3.0.2

package/lib/exercises/math/limits/sequenceRationalFracLimit.js

@@ -1,22 +1,19 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.sequenceRationalFracLimit = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const monom_1 = require("../../../math/polynomials/monom");
-const polynomial_1 = require("../../../math/polynomials/polynomial");
-const randint_1 = require("../../../math/utils/random/randint");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const shuffle_1 = require("../../../utils/alea/shuffle");
+import { addValidProp, tryToAddWrongProp, } from "../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
+import { Rational } from "../../../math/numbers/rationals/rational.js";
+import { Monom } from "../../../math/polynomials/monom.js";
+import { PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
+import { randint } from "../../../math/utils/random/randint.js";
+import { NumberNode } from "../../../tree/nodes/numbers/numberNode.js";
+import { shuffle } from "../../../utils/alea/shuffle.js";
 const getSequenceRationalFracLimitQuestion = () => {
-    const polyNum = polynomial_1.PolynomialConstructor.random(4, "n");
-    const polyDenum = polynomial_1.PolynomialConstructor.random(4, "n");
+    const polyNum = PolynomialConstructor.random(4, "n");
+    const polyDenum = PolynomialConstructor.random(4, "n");
     const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
     const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
     const to = "+\\infty";
     let answer;
-    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+    let leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
         .simplify()
         .toTree()
         .toTex();
@@ -27,7 +24,7 @@ const getSequenceRationalFracLimitQuestion = () => {
         answer = "0";
     }
     else {
-        const tempPoly = new monom_1.Monom(polyNum.degree - polyDenum.degree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1, "n");
+        const tempPoly = new Monom(polyNum.degree - polyDenum.degree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1, "n");
         answer = tempPoly.getLimit(to);
     }
     const question = {
@@ -46,29 +43,29 @@ const getSequenceRationalFracLimitQuestion = () => {
 };
 const getPropositions = (n, { answer, numCoeffs, denumCoeffs }) => {
     const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
+    addValidProp(propositions, answer);
     const numLeadingCoeff = numCoeffs[numCoeffs.length - 1];
     const denumLeadingCoeff = denumCoeffs[denumCoeffs.length - 1];
     const to = "+\\infty";
-    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+    let leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
         .simplify()
         .toTree()
         .toTex();
-    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "0");
-    (0, exercise_1.tryToAddWrongProp)(propositions, leadingCoeffsRational);
+    tryToAddWrongProp(propositions, "+\\infty");
+    tryToAddWrongProp(propositions, "-\\infty");
+    tryToAddWrongProp(propositions, "0");
+    tryToAddWrongProp(propositions, leadingCoeffsRational);
     while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + "");
+        tryToAddWrongProp(propositions, randint(-10, 10) + "");
     }
-    return (0, shuffle_1.shuffle)(propositions);
+    return shuffle(propositions);
 };
 const isAnswerValid = (ans, { denumCoeffs, numCoeffs }) => {
     const numDegree = numCoeffs.length - 1;
     const denumDegree = denumCoeffs.length - 1;
     const numLeadingCoeff = numCoeffs[numDegree];
     const denumLeadingCoeff = denumCoeffs[denumDegree];
-    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+    let leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
         .simplify()
         .toTree({ allowFractionToDecimal: true });
     let answer;
@@ -76,23 +73,23 @@ const isAnswerValid = (ans, { denumCoeffs, numCoeffs }) => {
         answer = leadingCoeffsRational;
     }
     else if (denumDegree > numDegree) {
-        answer = new numberNode_1.NumberNode(0);
+        answer = new NumberNode(0);
     }
     else {
-        const tempPoly = new monom_1.Monom(numDegree - denumDegree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1);
+        const tempPoly = new Monom(numDegree - denumDegree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1);
         answer = tempPoly.getLimitNode("+\\infty");
     }
     const texs = answer.toAllValidTexs();
     return texs.includes(ans);
 };
-exports.sequenceRationalFracLimit = {
+export const sequenceRationalFracLimit = {
     id: "sequenceRationalFracLimit",
     connector: "=",
     label: "Limite d'une suite rationnelle",
     levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
     sections: ["Limites", "Suites"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceRationalFracLimitQuestion, nb),
+    generator: (nb) => getDistinctQuestions(getSequenceRationalFracLimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,

package/lib/exercises/math/matrices/index.d.ts

@@ -1,3 +1,3 @@
-export * from "./matrixInversibilityDomain";
-export * from "./productCell";
+export * from "./matrixInversibilityDomain.js";
+export * from "./productCell.js";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/matrices/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,eAAe,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/index.ts"],"names":[],"mappings":"AAAA,cAAc,gCAAgC,CAAC;AAC/C,cAAc,kBAAkB,CAAC"}

package/lib/exercises/math/matrices/index.js

@@ -1,19 +1,3 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./matrixInversibilityDomain"), exports);
-__exportStar(require("./productCell"), exports);
-// export * from "./matrixGeneralTerm";
+export * from "./matrixInversibilityDomain.js";
+export * from "./productCell.js";
+// export * from "./matrixGeneralTerm.js";

package/lib/exercises/math/matrices/matrixGeneralTerm.d.ts

@@ -1,4 +1,4 @@
-import { Exercise } from "../../../exercises/exercise";
+import { Exercise } from "../../../exercises/exercise.js";
 type Identifiers = {
     n: number;
     p: number;

package/lib/exercises/math/matrices/matrixGeneralTerm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"matrixGeneralTerm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/matrixGeneralTerm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AASlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAsDF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAcnD,CAAC"}
+{"version":3,"file":"matrixGeneralTerm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/matrixGeneralTerm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAsDF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAcnD,CAAC"}

package/lib/exercises/math/matrices/matrixGeneralTerm.js

@@ -1,23 +1,20 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.matrixGeneralTerm = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const matrix_1 = require("../../../math/matrices/matrix");
-const randint_1 = require("../../../math/utils/random/randint");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const doWhile_1 = require("../../../utils/doWhile");
+import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
+import { Matrix, MatrixConstructor } from "../../../math/matrices/matrix.js";
+import { randint } from "../../../math/utils/random/randint.js";
+import { AddNode } from "../../../tree/nodes/operators/addNode.js";
+import { MultiplyNode } from "../../../tree/nodes/operators/multiplyNode.js";
+import { VariableNode } from "../../../tree/nodes/variables/variableNode.js";
+import { doWhile } from "../../../utils/doWhile.js";
 //A d'ordre nxp avec a_(i,j) = alpha*i + beta*j
 const getMatrixGeneralTermQuestion = () => {
-    const n = (0, randint_1.randint)(1, 5);
-    const p = (0, doWhile_1.doWhile)(() => (0, randint_1.randint)(1, 5), (res) => n === 1 && res === 1);
-    const alpha = (0, randint_1.randint)(-5, 6, [0]);
-    const beta = (0, randint_1.randint)(-5, 6, [0]);
-    const aij = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(alpha.toTree(), new variableNode_1.VariableNode("i")), new multiplyNode_1.MultiplyNode(beta.toTree(), new variableNode_1.VariableNode("j"))).simplify();
+    const n = randint(1, 5);
+    const p = doWhile(() => randint(1, 5), (res) => n === 1 && res === 1);
+    const alpha = randint(-5, 6, [0]);
+    const beta = randint(-5, 6, [0]);
+    const aij = new AddNode(new MultiplyNode(alpha.toTree(), new VariableNode("i")), new MultiplyNode(beta.toTree(), new VariableNode("j"))).simplify();
     const elements = Array.from(Array(n), (_, rowIndex) => Array.from(Array(p), (__, colIndex) => (alpha * (rowIndex + 1) + beta * (colIndex + 1)).toTree()));
-    const matrix = new matrix_1.Matrix(elements);
+    const matrix = new Matrix(elements);
     const answer = matrix.toTex();
     const question = {
         answer,
@@ -30,25 +27,25 @@ const getMatrixGeneralTermQuestion = () => {
 };
 const getPropositions = (nb, { answer, n, p, alpha, beta }) => {
     const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
+    addValidProp(propositions, answer);
     const transposedElements = Array.from(Array(p), (_, rowIndex) => Array.from(Array(n), (__, colIndex) => (alpha * (rowIndex + 1) + beta * (colIndex + 1)).toTree()));
-    const matrix = new matrix_1.Matrix(transposedElements);
-    (0, exercise_1.tryToAddWrongProp)(propositions, matrix.toTex());
+    const matrix = new Matrix(transposedElements);
+    tryToAddWrongProp(propositions, matrix.toTex());
     while (propositions.length < nb) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, matrix_1.MatrixConstructor.random(n, p).toTex());
+        tryToAddWrongProp(propositions, MatrixConstructor.random(n, p).toTex());
     }
-    return (0, exercise_1.shuffleProps)(propositions, nb);
+    return shuffleProps(propositions, nb);
 };
 const isAnswerValid = (ans, { answer }) => {
     return ans === answer;
 };
-exports.matrixGeneralTerm = {
+export const matrixGeneralTerm = {
     id: "matrixGeneralTerm",
     label: "Déterminer l'expression d'une matrice",
     levels: ["MathExp"],
     isSingleStep: true,
     sections: ["Matrices"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMatrixGeneralTermQuestion, nb),
+    generator: (nb) => getDistinctQuestions(getMatrixGeneralTermQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,

package/lib/exercises/math/matrices/matrixInversibilityDomain.d.ts

@@ -1,4 +1,4 @@
-import { Exercise } from "../../../exercises/exercise";
+import { Exercise } from "../../../exercises/exercise.js";
 type Identifiers = {
     a: string;
     b: string;

package/lib/exercises/math/matrices/matrixInversibilityDomain.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"matrixInversibilityDomain.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/matrixInversibilityDomain.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AA2BlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAoGF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAc3D,CAAC"}
+{"version":3,"file":"matrixInversibilityDomain.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/matrixInversibilityDomain.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AA2BrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAoGF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAc3D,CAAC"}

package/lib/exercises/math/matrices/matrixInversibilityDomain.js

@@ -1,37 +1,34 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.matrixInversibilityDomain = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const matrix_1 = require("../../../math/matrices/matrix");
-const integer_1 = require("../../../math/numbers/integer/integer");
-const nombre_1 = require("../../../math/numbers/nombre");
-const randint_1 = require("../../../math/utils/random/randint");
-const infiniteNode_1 = require("../../../tree/nodes/numbers/infiniteNode");
-const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const substractNode_1 = require("../../../tree/nodes/operators/substractNode");
-const closure_1 = require("../../../tree/nodes/sets/closure");
-const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
-const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
-const unionIntervalNode_1 = require("../../../tree/nodes/sets/unionIntervalNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const latexParser_1 = require("../../../tree/parsers/latexParser");
-const unionIntervalParser_1 = require("../../../tree/parsers/unionIntervalParser");
-const handleVEAError_1 = require("../../../utils/errors/handleVEAError");
-const intervalKeys_1 = require("../../utils/keys/intervalKeys");
+import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
+import { Matrix } from "../../../math/matrices/matrix.js";
+import { Integer } from "../../../math/numbers/integer/integer.js";
+import { NombreConstructor, NumberType } from "../../../math/numbers/nombre.js";
+import { randint } from "../../../math/utils/random/randint.js";
+import { MinusInfinityNode, PlusInfinityNode, } from "../../../tree/nodes/numbers/infiniteNode.js";
+import { FractionNode } from "../../../tree/nodes/operators/fractionNode.js";
+import { MultiplyNode } from "../../../tree/nodes/operators/multiplyNode.js";
+import { SubstractNode } from "../../../tree/nodes/operators/substractNode.js";
+import { ClosureType } from "../../../tree/nodes/sets/closure.js";
+import { EmptySet } from "../../../tree/nodes/sets/discreteSetNode.js";
+import { IntervalNode } from "../../../tree/nodes/sets/intervalNode.js";
+import { UnionIntervalNode, UnionIntervalNodeBuilder, } from "../../../tree/nodes/sets/unionIntervalNode.js";
+import { VariableNode } from "../../../tree/nodes/variables/variableNode.js";
+import { parseAlgebraic } from "../../../tree/parsers/latexParser.js";
+import { unionIntervalParser } from "../../../tree/parsers/unionIntervalParser.js";
+import { handleVEAError } from "../../../utils/errors/handleVEAError.js";
+import { intervalKeys } from "../../utils/keys/intervalKeys.js";
 const getMatrixInversibilityDomainQuestion = () => {
     const elements = [[], []];
     for (let i = 0; i < 2; i++) {
         for (let j = 0; j < 2; j++) {
-            elements[i][j] = nombre_1.NombreConstructor.random({
-                types: [nombre_1.NumberType.Integer, nombre_1.NumberType.Rational],
-                excludes: i === 0 && j === 0 ? [new integer_1.Integer(0)] : undefined,
+            elements[i][j] = NombreConstructor.random({
+                types: [NumberType.Integer, NumberType.Rational],
+                excludes: i === 0 && j === 0 ? [new Integer(0)] : undefined,
             }).toTree();
         }
     }
-    const matrix = new matrix_1.Matrix([
-        [new multiplyNode_1.MultiplyNode(elements[0][0], new variableNode_1.VariableNode("x")), elements[0][1]],
+    const matrix = new Matrix([
+        [new MultiplyNode(elements[0][0], new VariableNode("x")), elements[0][1]],
         elements[1],
     ]);
     // si d=0 & (b|c)=0 alors det = 0 sur R donc non inversible sur R
@@ -41,14 +38,14 @@ const getMatrixInversibilityDomainQuestion = () => {
     const isBorCZero = elements[0][1].evaluate({}) === 0 || elements[1][0].evaluate({}) === 0;
     const x = isDZero
         ? undefined
-        : new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(elements[0][1], elements[1][0]), new multiplyNode_1.MultiplyNode(elements[0][0], elements[1][1])).simplify();
+        : new FractionNode(new MultiplyNode(elements[0][1], elements[1][0]), new MultiplyNode(elements[0][0], elements[1][1])).simplify();
     const answer = isDZero && isBorCZero
-        ? discreteSetNode_1.EmptySet.toTex()
+        ? EmptySet.toTex()
         : isDZero
             ? "\\mathbb{R}"
-            : new unionIntervalNode_1.UnionIntervalNode([
-                new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, x, closure_1.ClosureType.OO),
-                new intervalNode_1.IntervalNode(x, infiniteNode_1.PlusInfinityNode, closure_1.ClosureType.OO),
+            : new UnionIntervalNode([
+                new IntervalNode(MinusInfinityNode, x, ClosureType.OO),
+                new IntervalNode(x, PlusInfinityNode, ClosureType.OO),
             ]).toTex();
     const question = {
         answer,
@@ -56,7 +53,7 @@ const getMatrixInversibilityDomainQuestion = () => {
 
 Sur quel ensemble la matrice $M$ est-elle inversible ?
     `,
-        keys: [...intervalKeys_1.intervalKeys, "reals", "varnothing"],
+        keys: [...intervalKeys, "reals", "varnothing"],
         answerFormat: "tex",
         identifiers: {
             a: elements[0][0].toTex(),
@@ -69,38 +66,38 @@ Sur quel ensemble la matrice $M$ est-elle inversible ?
 };
 const getPropositions = (n, { answer, a, b, c, d }) => {
     const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const aTree = (0, latexParser_1.parseAlgebraic)(a);
-    const bTree = (0, latexParser_1.parseAlgebraic)(b);
-    const cTree = (0, latexParser_1.parseAlgebraic)(c);
-    const dTree = (0, latexParser_1.parseAlgebraic)(d);
-    const det = new substractNode_1.SubstractNode(new multiplyNode_1.MultiplyNode(aTree, dTree), new multiplyNode_1.MultiplyNode(bTree, cTree)).simplify();
-    (0, exercise_1.tryToAddWrongProp)(propositions, unionIntervalNode_1.UnionIntervalNodeBuilder.realMinus(det).toTex());
+    addValidProp(propositions, answer);
+    const aTree = parseAlgebraic(a);
+    const bTree = parseAlgebraic(b);
+    const cTree = parseAlgebraic(c);
+    const dTree = parseAlgebraic(d);
+    const det = new SubstractNode(new MultiplyNode(aTree, dTree), new MultiplyNode(bTree, cTree)).simplify();
+    tryToAddWrongProp(propositions, UnionIntervalNodeBuilder.realMinus(det).toTex());
     while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, unionIntervalNode_1.UnionIntervalNodeBuilder.realMinus((0, randint_1.randint)(-10, 10).toTree()).toTex());
+        tryToAddWrongProp(propositions, UnionIntervalNodeBuilder.realMinus(randint(-10, 10).toTree()).toTex());
     }
-    return (0, exercise_1.shuffleProps)(propositions, n);
+    return shuffleProps(propositions, n);
 };
 const isAnswerValid = (ans, { answer }) => {
     try {
         if (answer === "\\mathbb{R}" || answer === "\\varnothing")
             return ans === answer;
-        const parsed = (0, unionIntervalParser_1.unionIntervalParser)(ans);
+        const parsed = unionIntervalParser(ans);
         if (!parsed)
             return false;
         return parsed.simplify().toTex() === answer;
     }
     catch (err) {
-        return (0, handleVEAError_1.handleVEAError)(err);
+        return handleVEAError(err);
     }
 };
-exports.matrixInversibilityDomain = {
+export const matrixInversibilityDomain = {
     id: "matrixInversibilityDomain",
     label: "Déterminer le domaine d'inversibilité d'une matrice",
     levels: ["MathExp"],
     isSingleStep: true,
     sections: ["Matrices"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMatrixInversibilityDomainQuestion, nb),
+    generator: (nb) => getDistinctQuestions(getMatrixInversibilityDomainQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,

package/lib/exercises/math/matrices/productCell.d.ts

@@ -1,4 +1,4 @@
-import { Exercise } from "../../../exercises/exercise";
+import { Exercise } from "../../../exercises/exercise.js";
 type Identifiers = {
     AiCoeff: number;
     AjCoeff: number;

package/lib/exercises/math/matrices/productCell.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"productCell.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/productCell.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AASlC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAqDF,eAAO,MAAM,WAAW,EAAE,QAAQ,CAAC,WAAW,CAa7C,CAAC"}
+{"version":3,"file":"productCell.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/productCell.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAqDF,eAAO,MAAM,WAAW,EAAE,QAAQ,CAAC,WAAW,CAa7C,CAAC"}

package/lib/exercises/math/matrices/productCell.js

@@ -1,27 +1,24 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.productCell = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../../math/utils/random/randint");
-const sum_1 = require("../../../math/utils/stats/sum");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const doWhile_1 = require("../../../utils/doWhile");
+import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
+import { randint } from "../../../math/utils/random/randint.js";
+import { sum } from "../../../math/utils/stats/sum.js";
+import { AddNode } from "../../../tree/nodes/operators/addNode.js";
+import { MultiplyNode } from "../../../tree/nodes/operators/multiplyNode.js";
+import { VariableNode } from "../../../tree/nodes/variables/variableNode.js";
+import { doWhile } from "../../../utils/doWhile.js";
 //$A=(a_{i,j})$ avec $a_{i,j}=2i-j$ et $B=(b_{i,j})$ avec $b_{i,j}=i+j$ calculer $c_{2,3}$ Réponse: $c_{2,3} = \sum_{k=1}^{3} (2 \cdot 2 - k) \cdot (k + 3)$ $ c_{2,3} = (2 \cdot 2 - 1) \cdot (1 + 3) + (2 \cdot 2 - 2) \cdot (2 + 3) + (2 \cdot 2 - 3) \cdot (3 + 3)$ $c_{2,3}=3\times 4+2\times 5+1\times 6 =28$. Si l'élève détermine l'expression des matrices A et B puis effectue le calcul des bons blocs pour obtenir le coefficient cela est intéressant aussi ! Bonne journée merci
 // Les matrices A et B sont définies par combinaisons linéaires de leurs lignes/colonnes
 // exp a_(i,j) = 2i+j
 const getProductCellQuestion = () => {
-    const i = (0, randint_1.randint)(1, 4);
-    const j = (0, randint_1.randint)(1, 4);
-    const AiCoeff = (0, randint_1.randint)(-3, 4, [0]);
-    const AjCoeff = (0, randint_1.randint)(-3, 4, [0]);
-    const BiCoeff = (0, randint_1.randint)(-3, 4, [0]);
-    const BjCoeff = (0, doWhile_1.doWhile)(() => (0, randint_1.randint)(-3, 4, [0]), (x) => BiCoeff === AiCoeff && x === AjCoeff);
-    const aij = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(AiCoeff.toTree(), new variableNode_1.VariableNode("i")), new multiplyNode_1.MultiplyNode(AjCoeff.toTree(), new variableNode_1.VariableNode("j"))).simplify();
-    const bij = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(BiCoeff.toTree(), new variableNode_1.VariableNode("i")), new multiplyNode_1.MultiplyNode(BjCoeff.toTree(), new variableNode_1.VariableNode("j"))).simplify();
-    const answer = (0, sum_1.sum)(1, 3, (k) => (AiCoeff * i + AjCoeff * k) * (BiCoeff * k + BjCoeff * j)) + "";
+    const i = randint(1, 4);
+    const j = randint(1, 4);
+    const AiCoeff = randint(-3, 4, [0]);
+    const AjCoeff = randint(-3, 4, [0]);
+    const BiCoeff = randint(-3, 4, [0]);
+    const BjCoeff = doWhile(() => randint(-3, 4, [0]), (x) => BiCoeff === AiCoeff && x === AjCoeff);
+    const aij = new AddNode(new MultiplyNode(AiCoeff.toTree(), new VariableNode("i")), new MultiplyNode(AjCoeff.toTree(), new VariableNode("j"))).simplify();
+    const bij = new AddNode(new MultiplyNode(BiCoeff.toTree(), new VariableNode("i")), new MultiplyNode(BjCoeff.toTree(), new VariableNode("j"))).simplify();
+    const answer = sum(1, 3, (k) => (AiCoeff * i + AjCoeff * k) * (BiCoeff * k + BjCoeff * j)) + "";
     const question = {
         answer,
         instruction: `Soient  $A = \\left(a_{i,j}\\right)$ et $B = \\left(b_{i,j}\\right)$ deux matrices carrées d'ordre $3$, avec $a_{i,j} = ${aij.toTex()}$ et $b_{i,j} = ${bij.toTex()}$. Soit $C = AB$. Calculer $c_{${i},${j}}$.`,
@@ -33,23 +30,23 @@ const getProductCellQuestion = () => {
 };
 const getPropositions = (n, { answer }) => {
     const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
+    addValidProp(propositions, answer);
     while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-100, 100) + "");
+        tryToAddWrongProp(propositions, randint(-100, 100) + "");
     }
-    return (0, exercise_1.shuffleProps)(propositions, n);
+    return shuffleProps(propositions, n);
 };
 const isAnswerValid = (ans, { answer }) => {
     return ans === answer;
 };
-exports.productCell = {
+export const productCell = {
     id: "productCell",
     connector: "=",
     label: "Calculer un coefficient du produit de deux matrices",
     levels: ["MathExp"],
     isSingleStep: true,
     sections: ["Matrices"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getProductCellQuestion, nb),
+    generator: (nb) => getDistinctQuestions(getProductCellQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,

package/lib/exercises/math/percent/applyPercent.d.ts

@@ -1,4 +1,4 @@
-import { Exercise } from "../../exercise";
+import { Exercise } from "../../exercise.js";
 type Identifiers = {
     randNbr: number;
     randPercent: number;

package/lib/exercises/math/percent/applyPercent.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"applyPercent.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/percent/applyPercent.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,QAAQ,EAQT,MAAM,gBAAgB,CAAC;AAGxB,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,OAAO,CAAC;CACf,CAAC;AAoFF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAwB9C,CAAC"}
+{"version":3,"file":"applyPercent.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/percent/applyPercent.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,QAAQ,EAQT,MAAM,mBAAmB,CAAC;AAG3B,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,OAAO,CAAC;CACf,CAAC;AAoFF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAwB9C,CAAC"}

package/lib/exercises/math/percent/applyPercent.js

@@ -1,30 +1,27 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.applyPercent = void 0;
-const numberVEA_1 = require("../../../exercises/vea/numberVEA");
-const randint_1 = require("../../../math/utils/random/randint");
-const round_1 = require("../../../math/utils/round");
-const coinFlip_1 = require("../../../utils/alea/coinFlip");
-const shuffle_1 = require("../../../utils/alea/shuffle");
-const exercise_1 = require("../../exercise");
-const getDistinctQuestions_1 = require("../../utils/getDistinctQuestions");
+import { numberVEA } from "../../../exercises/vea/numberVEA.js";
+import { randint } from "../../../math/utils/random/randint.js";
+import { round } from "../../../math/utils/round.js";
+import { coinFlip } from "../../../utils/alea/coinFlip.js";
+import { shuffle } from "../../../utils/alea/shuffle.js";
+import { addValidProp, tryToAddWrongProp, } from "../../exercise.js";
+import { getDistinctQuestions } from "../../utils/getDistinctQuestions.js";
 const getApplyPercentQuestion = () => {
-    const randNbr = (0, randint_1.randint)(1, 500);
-    const randPercent = (0, randint_1.randint)(1, 100);
+    const randNbr = randint(1, 500);
+    const randPercent = randint(1, 100);
     let instruction = "";
     let ans = "";
     let ansNb = 0;
     let cm = 0;
-    const isUp = (0, coinFlip_1.coinFlip)();
+    const isUp = coinFlip();
     if (isUp) {
         cm = 1 + randPercent / 100;
-        ansNb = (0, round_1.round)(randNbr * cm, 2);
+        ansNb = round(randNbr * cm, 2);
         ans = (ansNb + "").replace(".", ",");
         instruction = `Appliquer une hausse de $${randPercent}\\%$ à $${randNbr}$.`;
     }
     else {
         cm = 1 - randPercent / 100;
-        ansNb = (0, round_1.round)(randNbr * cm, 2);
+        ansNb = round(randNbr * cm, 2);
         ans = (ansNb + "").replace(".", ",");
         instruction = `Appliquer une baisse de $${randPercent}\\%$ à $${randNbr}$.`;
     }
@@ -38,21 +35,21 @@ const getApplyPercentQuestion = () => {
             ? `Augmenter un nombre de $x\\%$ revient à le multiplier par $1 + \\frac{x}{100}$.`
             : `Baisser un nombre de $x\\%$ revient à le multiplier par $1 - \\frac{x}{100}$.`,
         correction: isUp
-            ? `Augmenter un nombre de $${randPercent}\\%$ revient à le multiplier par $1 + \\frac{${randPercent}}{100}$, c'est à dire par $${(0, round_1.round)(cm, 2).frenchify()}$.
+            ? `Augmenter un nombre de $${randPercent}\\%$ revient à le multiplier par $1 + \\frac{${randPercent}}{100}$, c'est à dire par $${round(cm, 2).frenchify()}$.
     
 On a donc 
 
 $$
-${randNbr}\\times ${(0, round_1.round)(cm, 2).frenchify()} = ${answer}
+${randNbr}\\times ${round(cm, 2).frenchify()} = ${answer}
 $$
 
     `
-            : `Baisser un nombre de $${randPercent}\\%$ revient à le multiplier par $1 - \\frac{${randPercent}}{100}$, c'est à dire par $${(0, round_1.round)(cm, 2).frenchify()}$.
+            : `Baisser un nombre de $${randPercent}\\%$ revient à le multiplier par $1 - \\frac{${randPercent}}{100}$, c'est à dire par $${round(cm, 2).frenchify()}$.
     
 On a donc 
 
 $$
-${randNbr}\\times ${(0, round_1.round)(cm, 2).frenchify()} = ${answer}
+${randNbr}\\times ${round(cm, 2).frenchify()} = ${answer}
 $$
 
     `,
@@ -62,23 +59,23 @@ $$
 };
 const getPropositions = (n, { answer }) => {
     const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
+    addValidProp(propositions, answer);
     while (propositions.length < n) {
         const ansNb = Number(answer.replace(",", "."));
         if (ansNb === 0)
-            (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + "");
+            tryToAddWrongProp(propositions, randint(-10, 10) + "");
         const deviation = Math.random() < 0.5 ? -1 : 1;
         const percentDeviation = Math.random() * 20 + 1;
         let wrongAnswer = ansNb + deviation * (percentDeviation / 100) * ansNb;
-        wrongAnswer = (0, round_1.round)(wrongAnswer, 2);
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toString().replace(".", ","));
+        wrongAnswer = round(wrongAnswer, 2);
+        tryToAddWrongProp(propositions, wrongAnswer.toString().replace(".", ","));
     }
-    return (0, shuffle_1.shuffle)(propositions);
+    return shuffle(propositions);
 };
 const isAnswerValid = (ans, { answer }) => {
-    return (0, numberVEA_1.numberVEA)(ans, answer);
+    return numberVEA(ans, answer);
 };
-exports.applyPercent = {
+export const applyPercent = {
     id: "applyPercent",
     connector: "=",
     label: "Appliquer un pourcentage d'augmentation ou de diminution",
@@ -95,7 +92,7 @@ exports.applyPercent = {
     ],
     sections: ["Pourcentages"],
     isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getApplyPercentQuestion, nb),
+    generator: (nb) => getDistinctQuestions(getApplyPercentQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,

package/lib/exercises/math/percent/averageEvolutionRate.d.ts

@@ -1,4 +1,4 @@
-import { Exercise } from "../../exercise";
+import { Exercise } from "../../exercise.js";
 type Identifiers = {
     rate: number;
     nbMois: number;