math-exercises 2.0.2 → 2.0.3

package/lib/exercises/calculLitteral/simplifying/reduceExpression.js

@@ -1,114 +1,114 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.reduceExpression = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const polynomial_1 = require("../../../math/polynomials/polynomial");
-const randint_1 = require("../../../math/utils/random/randint");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const getReduceExpression = () => {
-    const rand = (0, randint_1.randint)(0, 7);
-    let polynome1;
-    let polynome2;
-    switch (rand) {
-        case 0: // ax + b + cx + d
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
-            break;
-        case 1:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
-            break;
-        case 2:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            break;
-        case 3:
-            polynome1 = new polynomial_1.Polynomial([
-                (0, randint_1.randint)(-9, 10),
-                (0, randint_1.randint)(-9, 10),
-                (0, randint_1.randint)(-9, 10, [0]),
-            ]);
-            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
-            break;
-        case 4:
-            polynome1 = new polynomial_1.Polynomial([
-                (0, randint_1.randint)(-9, 10),
-                (0, randint_1.randint)(-9, 10),
-                (0, randint_1.randint)(-9, 10, [0]),
-            ]);
-            polynome2 = new polynomial_1.Polynomial([0, 0, (0, randint_1.randint)(-5, 6, [0])]);
-            break;
-        case 5:
-            polynome1 = new polynomial_1.Polynomial([
-                (0, randint_1.randint)(-9, 10),
-                (0, randint_1.randint)(-9, 10),
-                (0, randint_1.randint)(-9, 10, [0]),
-            ]);
-            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
-            break;
-        case 6:
-            polynome1 = new polynomial_1.Polynomial([
-                (0, randint_1.randint)(-9, 10),
-                (0, randint_1.randint)(-9, 10),
-                (0, randint_1.randint)(-9, 10, [0]),
-            ]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            break;
-        default:
-            throw Error("something went wrong");
-    }
-    const statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-    statement.shuffle();
-    const statementTex = statement.toTex();
-    const answer = polynome1.add(polynome2).toTree().toTex();
-    const question = {
-        instruction: `Réduire l'expression suivante : $${statementTex}$`,
-        startStatement: statementTex,
-        answer,
-        keys: ["x"],
-        answerFormat: "tex",
-        identifiers: {
-            rand,
-            polynome1Coeffs: polynome1.coefficients,
-            polynome2Coeffs: polynome2.coefficients,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, rand, polynome1Coeffs }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const polynome1 = new polynomial_1.Polynomial(polynome1Coeffs);
-    while (propositions.length < n) {
-        const polynome2 = new polynomial_1.Polynomial(rand < 3
-            ? [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]
-            : [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]);
-        (0, exercise_1.tryToAddWrongProp)(propositions, polynome1.add(polynome2).toTree().toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { polynome1Coeffs, polynome2Coeffs, rand }) => {
-    const polynome1 = new polynomial_1.Polynomial(polynome1Coeffs);
-    const polynome2 = new polynomial_1.Polynomial(polynome2Coeffs);
-    const answer = polynome1
-        .add(polynome2)
-        .toTree({ forbidPowerToProduct: true });
-    const texs = answer.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.reduceExpression = {
-    id: "reduceExpression",
-    connector: "=",
-    isSingleStep: false,
-    label: "Réduire une expression",
-    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro"],
-    sections: ["Calcul littéral"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getReduceExpression, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reduceExpression = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../../math/polynomials/polynomial");
+const randint_1 = require("../../../math/utils/random/randint");
+const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getReduceExpression = () => {
+    const rand = (0, randint_1.randint)(0, 7);
+    let polynome1;
+    let polynome2;
+    switch (rand) {
+        case 0: // ax + b + cx + d
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 1:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 2:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 3:
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 4:
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
+            polynome2 = new polynomial_1.Polynomial([0, 0, (0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 5:
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 6:
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        default:
+            throw Error("something went wrong");
+    }
+    const statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+    statement.shuffle();
+    const statementTex = statement.toTex();
+    const answer = polynome1.add(polynome2).toTree().toTex();
+    const question = {
+        instruction: `Réduire l'expression suivante : $${statementTex}$`,
+        startStatement: statementTex,
+        answer,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: {
+            rand,
+            polynome1Coeffs: polynome1.coefficients,
+            polynome2Coeffs: polynome2.coefficients,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, rand, polynome1Coeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const polynome1 = new polynomial_1.Polynomial(polynome1Coeffs);
+    while (propositions.length < n) {
+        const polynome2 = new polynomial_1.Polynomial(rand < 3
+            ? [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]
+            : [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]);
+        (0, exercise_1.tryToAddWrongProp)(propositions, polynome1.add(polynome2).toTree().toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { polynome1Coeffs, polynome2Coeffs, rand }) => {
+    const polynome1 = new polynomial_1.Polynomial(polynome1Coeffs);
+    const polynome2 = new polynomial_1.Polynomial(polynome2Coeffs);
+    const answer = polynome1
+        .add(polynome2)
+        .toTree({ forbidPowerToProduct: true });
+    const texs = answer.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.reduceExpression = {
+    id: "reduceExpression",
+    connector: "=",
+    isSingleStep: false,
+    label: "Réduire une expression",
+    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro"],
+    sections: ["Calcul littéral"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getReduceExpression, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/combinatory/anagrams.d.ts

@@ -1,7 +1,7 @@
-import { MathExercise } from "../../exercises/exercise";
-type Identifiers = {
-    word: string;
-};
-export declare const anagrams: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    word: string;
+};
+export declare const anagrams: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=anagrams.d.ts.map

package/lib/exercises/combinatory/anagrams.js

@@ -1,161 +1,161 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.anagrams = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../math/utils/random/randint");
-const random_1 = require("../../utils/random");
-const words = [
-    "angle",
-    "armoire",
-    "banc",
-    "bureau",
-    "cabinet",
-    "carreau",
-    "chaise",
-    "classe",
-    "clé",
-    "coin",
-    "couloir",
-    "dossier",
-    "eau",
-    "école",
-    "écriture",
-    "entrée",
-    "escalier",
-    "étagère",
-    "étude",
-    "extérieur",
-    "fenêtre",
-    "intérieur",
-    "lavabo",
-    "lecture",
-    "lit",
-    "marche",
-    "matelas",
-    "maternelle",
-    "meuble",
-    "mousse",
-    "mur",
-    "peluche",
-    "placard",
-    "plafond",
-    "porte",
-    "portemanteau",
-    "poubelle",
-    "radiateur",
-    "rampe",
-    "récréation",
-    "rentrée",
-    "rideau",
-    "robinet",
-    "salle",
-    "savon",
-    "serrure",
-    "serviette",
-    "siège",
-    "sieste",
-    "silence",
-    "sol",
-    "sommeil",
-    "sonnette",
-    "sortie",
-    "table",
-    "tableau",
-    "tabouret",
-    "tapis",
-    "tiroir",
-    "toilette",
-    "vitre",
-];
-const letters = [
-    "a",
-    "b",
-    "c",
-    "d",
-    "e",
-    "f",
-    "g",
-    "h",
-    "i",
-    "j",
-    "k",
-    "l",
-    "m",
-    "n",
-    "o",
-    "p",
-    "q",
-    "r",
-    "s",
-    "t",
-    "u",
-    "v",
-    "w",
-    "x",
-    "y",
-    "z",
-    "é",
-    "è",
-    "à",
-    "ç",
-];
-const getAnagramsQuestion = () => {
-    const word = (0, random_1.random)(words);
-    const repeats = [];
-    const wordLetters = word.split("");
-    letters.forEach((letter) => {
-        const nbOfRepeats = wordLetters.filter((l) => l === letter).length;
-        if (nbOfRepeats > 1)
-            repeats.push(nbOfRepeats);
-    });
-    const getFacto = (n) => {
-        if (n === 1)
-            return 1;
-        return n * getFacto(n - 1);
-    };
-    const facto = word
-        .split("")
-        .map((el, index) => index + 1)
-        .reduce((acc, curr) => acc * curr, 1);
-    let arrangements = 1;
-    repeats.forEach((nbOfRepeats) => {
-        arrangements *= getFacto(nbOfRepeats);
-    });
-    const answer = facto / arrangements + "";
-    const question = {
-        answer,
-        instruction: `Combien d'anagrammes mathématiques du mot ${word} sont possibles ? `,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: { word },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, word }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, Math.pow(word.length, word.length) + "");
-    (0, exercise_1.tryToAddWrongProp)(propositions, (word.length * (word.length + 1)) / 2 + "");
-    (0, exercise_1.tryToAddWrongProp)(propositions, word.length * word.length + "");
-    while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(1000, 10000) + "");
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { answer }) => {
-    return ans === answer;
-};
-exports.anagrams = {
-    id: "anagrams",
-    connector: "=",
-    label: "Compter le nombre d'anagrammes d'un mot",
-    levels: ["TermSpé"],
-    isSingleStep: true,
-    sections: ["Combinatoire et dénombrement"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAnagramsQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.anagrams = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../math/utils/random/randint");
+const random_1 = require("../../utils/random");
+const words = [
+    "angle",
+    "armoire",
+    "banc",
+    "bureau",
+    "cabinet",
+    "carreau",
+    "chaise",
+    "classe",
+    "clé",
+    "coin",
+    "couloir",
+    "dossier",
+    "eau",
+    "école",
+    "écriture",
+    "entrée",
+    "escalier",
+    "étagère",
+    "étude",
+    "extérieur",
+    "fenêtre",
+    "intérieur",
+    "lavabo",
+    "lecture",
+    "lit",
+    "marche",
+    "matelas",
+    "maternelle",
+    "meuble",
+    "mousse",
+    "mur",
+    "peluche",
+    "placard",
+    "plafond",
+    "porte",
+    "portemanteau",
+    "poubelle",
+    "radiateur",
+    "rampe",
+    "récréation",
+    "rentrée",
+    "rideau",
+    "robinet",
+    "salle",
+    "savon",
+    "serrure",
+    "serviette",
+    "siège",
+    "sieste",
+    "silence",
+    "sol",
+    "sommeil",
+    "sonnette",
+    "sortie",
+    "table",
+    "tableau",
+    "tabouret",
+    "tapis",
+    "tiroir",
+    "toilette",
+    "vitre",
+];
+const letters = [
+    "a",
+    "b",
+    "c",
+    "d",
+    "e",
+    "f",
+    "g",
+    "h",
+    "i",
+    "j",
+    "k",
+    "l",
+    "m",
+    "n",
+    "o",
+    "p",
+    "q",
+    "r",
+    "s",
+    "t",
+    "u",
+    "v",
+    "w",
+    "x",
+    "y",
+    "z",
+    "é",
+    "è",
+    "à",
+    "ç",
+];
+const getAnagramsQuestion = () => {
+    const word = (0, random_1.random)(words);
+    const repeats = [];
+    const wordLetters = word.split("");
+    letters.forEach((letter) => {
+        const nbOfRepeats = wordLetters.filter((l) => l === letter).length;
+        if (nbOfRepeats > 1)
+            repeats.push(nbOfRepeats);
+    });
+    const getFacto = (n) => {
+        if (n === 1)
+            return 1;
+        return n * getFacto(n - 1);
+    };
+    const facto = word
+        .split("")
+        .map((el, index) => index + 1)
+        .reduce((acc, curr) => acc * curr, 1);
+    let arrangements = 1;
+    repeats.forEach((nbOfRepeats) => {
+        arrangements *= getFacto(nbOfRepeats);
+    });
+    const answer = facto / arrangements + "";
+    const question = {
+        answer,
+        instruction: `Combien d'anagrammes mathématiques du mot ${word} sont possibles ? `,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { word },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, word }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, Math.pow(word.length, word.length) + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, (word.length * (word.length + 1)) / 2 + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, word.length * word.length + "");
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(1000, 10000) + "");
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+exports.anagrams = {
+    id: "anagrams",
+    connector: "=",
+    label: "Compter le nombre d'anagrammes d'un mot",
+    levels: ["TermSpé"],
+    isSingleStep: true,
+    sections: ["Combinatoire et dénombrement"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAnagramsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/combinatory/ballsCounting.d.ts

@@ -1,10 +1,10 @@
-import { MathExercise } from "../../exercises/exercise";
-type Identifiers = {
-    type: number;
-    reds: number;
-    greens: number;
-    blacks: number;
-};
-export declare const ballsCounting: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    type: number;
+    reds: number;
+    greens: number;
+    blacks: number;
+};
+export declare const ballsCounting: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=ballsCounting.d.ts.map