math-exercises 2.0.1 → 2.0.3

package/lib/exercises/calcul/addAndSub.d.ts

@@ -1,8 +1,7 @@
-import { MathExercise } from '../exercise';
-type QCMProps = {
-    answer: string;
-};
-type VEAProps = {};
-export declare const addAndSubExercise: MathExercise<QCMProps, VEAProps>;
-export {};
+import { MathExercise } from "../exercise";
+type Identifiers = {
+    numbers: number[];
+};
+export declare const addAndSubExercise: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=addAndSub.d.ts.map

package/lib/exercises/calcul/addAndSub.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"addAndSub.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSub.ts"],"names":[],"mappings":"AAIA,OAAO,EACL,YAAY,EAOb,MAAM,aAAa,CAAC;AA8BrB,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAenB,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW9D,CAAC"}
+{"version":3,"file":"addAndSub.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSub.ts"],"names":[],"mappings":"AAIA,OAAO,EACL,YAAY,EAQb,MAAM,aAAa,CAAC;AA8BrB,KAAK,WAAW,GAAG;IAAE,OAAO,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC;AAoBzC,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,WAAW,CAYvD,CAAC"}

package/lib/exercises/calcul/addAndSub.js

@@ -1,57 +1,63 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.addAndSubExercise = void 0;
-const randint_1 = require("../../math/utils/random/randint");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const shuffle_1 = require("../../utils/shuffle");
-const exercise_1 = require("../exercise");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-/**
- * a±b±c±d
- */
-const getAddAndSubQuestions = () => {
-    const nbOperations = (0, randint_1.randint)(2, 4);
-    const numbers = [];
-    for (let i = 0; i < nbOperations + 1; i++) {
-        numbers.push((0, randint_1.randint)(-15, 15, [0]));
-    }
-    const allNumbersNodes = numbers.map((nb) => new numberNode_1.NumberNode(nb));
-    let statementTree = new addNode_1.AddNode(allNumbersNodes[0], allNumbersNodes[1]);
-    for (let i = 2; i < allNumbersNodes.length; i++) {
-        statementTree = new addNode_1.AddNode(statementTree, allNumbersNodes[i]);
-    }
-    const answer = numbers.reduce((a, b) => a + b) + '';
-    const statement = statementTree.toTex();
-    const question = {
-        instruction: `Calculer : $${statement}$`,
-        startStatement: statement,
-        answer,
-        keys: [],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const randomOffset = (0, randint_1.randint)(-9, 10, [0]);
-        const wrongAnswer = Number(answer) + randomOffset;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toString());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-exports.addAndSubExercise = {
-    id: 'addAndSub',
-    connector: '=',
-    label: 'Additions et soustractions',
-    levels: ['6ème', '5ème'],
-    sections: ['Calculs'],
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAddAndSubQuestions, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addAndSubExercise = void 0;
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../utils/shuffle");
+const exercise_1 = require("../exercise");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+/**
+ * a±b±c±d
+ */
+const getAddAndSubQuestions = () => {
+    const nbOperations = (0, randint_1.randint)(2, 4);
+    const numbers = [];
+    for (let i = 0; i < nbOperations + 1; i++) {
+        numbers.push((0, randint_1.randint)(-15, 15, [0]));
+    }
+    const allNumbersNodes = numbers.map((nb) => new numberNode_1.NumberNode(nb));
+    let statementTree = new addNode_1.AddNode(allNumbersNodes[0], allNumbersNodes[1]);
+    for (let i = 2; i < allNumbersNodes.length; i++) {
+        statementTree = new addNode_1.AddNode(statementTree, allNumbersNodes[i]);
+    }
+    const answer = numbers.reduce((a, b) => a + b) + "";
+    const statement = statementTree.toTex();
+    const question = {
+        instruction: `Calculer : $${statement}$`,
+        startStatement: statement,
+        answer,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { numbers },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const randomOffset = (0, randint_1.randint)(-9, 10, [0]);
+        const wrongAnswer = Number(answer) + randomOffset;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toString());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (studentAns, { answer }) => {
+    const answerTree = new numberNode_1.NumberNode(Number(answer));
+    const texs = answerTree.toAllValidTexs();
+    return texs.includes(studentAns);
+};
+exports.addAndSubExercise = {
+    id: "addAndSub",
+    connector: "=",
+    label: "Additions et soustractions",
+    levels: ["6ème", "5ème"],
+    sections: ["Calculs"],
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAddAndSubQuestions, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calcul/addAndSubWithoutRelatives.d.ts

@@ -1,8 +1,7 @@
-import { MathExercise } from '../exercise';
-type QCMProps = {
-    answer: string;
-};
-type VEAProps = {};
-export declare const addAndSubWithoutRelatives: MathExercise<QCMProps, VEAProps>;
-export {};
+import { MathExercise } from "../exercise";
+type Identifiers = {
+    numbers: number[];
+};
+export declare const addAndSubWithoutRelatives: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=addAndSubWithoutRelatives.d.ts.map

package/lib/exercises/calcul/addAndSubWithoutRelatives.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"addAndSubWithoutRelatives.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSubWithoutRelatives.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,YAAY,EAOb,MAAM,aAAa,CAAC;AA8CrB,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAcnB,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWtE,CAAC"}
+{"version":3,"file":"addAndSubWithoutRelatives.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSubWithoutRelatives.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,YAAY,EAQb,MAAM,aAAa,CAAC;AA4CrB,KAAK,WAAW,GAAG;IAAE,OAAO,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC;AAoBzC,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,WAAW,CAa/D,CAAC"}

package/lib/exercises/calcul/addAndSubWithoutRelatives.js

@@ -1,66 +1,73 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.addAndSubWithoutRelatives = void 0;
-const randint_1 = require("../../math/utils/random/randint");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const shuffle_1 = require("../../utils/shuffle");
-const exercise_1 = require("../exercise");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-/**
- * a±b±c±d
- */
-const getAddAndSubWithoutRelatives = () => {
-    let answer = -1;
-    let statementTree;
-    while (answer < 0) {
-        const nbOperations = (0, randint_1.randint)(2, 4);
-        let numbers = [];
-        do {
-            numbers = [];
-            numbers.push((0, randint_1.randint)(1, 15));
-            let sum = numbers[0];
-            for (let i = 1; i < nbOperations + 1; i++) {
-                numbers.push((0, randint_1.randint)(-sum, 15, [0]));
-                sum += numbers[i];
-            }
-        } while (numbers.every((a) => a > 0));
-        const allNumbersNodes = numbers.map((nb) => new numberNode_1.NumberNode(nb));
-        statementTree = new addNode_1.AddNode(allNumbersNodes[0], allNumbersNodes[1]);
-        for (let i = 2; i < allNumbersNodes.length; i++) {
-            statementTree = new addNode_1.AddNode(statementTree, allNumbersNodes[i]);
-        }
-        answer = numbers.reduce((a, b) => a + b);
-    }
-    const answerTex = answer.toString();
-    const question = {
-        instruction: `Calculer : $${statementTree.toTex()}$`,
-        startStatement: statementTree.toTex(),
-        answer: answerTex,
-        keys: [],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer: answerTex },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const incorrectAnswer = Number(answer) + (0, randint_1.randint)(-5, 6, [0]);
-        (0, exercise_1.tryToAddWrongProp)(propositions, incorrectAnswer.toString());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-exports.addAndSubWithoutRelatives = {
-    id: 'addAndSubWithoutRelatives',
-    connector: '=',
-    label: 'Additions et soustractions sans les nombres relatifs',
-    levels: ['6ème', '5ème'],
-    sections: ['Calculs'],
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAddAndSubWithoutRelatives, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addAndSubWithoutRelatives = void 0;
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../utils/shuffle");
+const exercise_1 = require("../exercise");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+/**
+ * a±b±c±d
+ */
+const getAddAndSubWithoutRelatives = () => {
+    let answer = -1;
+    let statementTree;
+    let numbers = [];
+    while (answer < 0) {
+        const nbOperations = (0, randint_1.randint)(2, 4);
+        numbers = [];
+        do {
+            numbers = [];
+            numbers.push((0, randint_1.randint)(1, 15));
+            let sum = numbers[0];
+            for (let i = 1; i < nbOperations + 1; i++) {
+                numbers.push((0, randint_1.randint)(-sum, 15, [0]));
+                sum += numbers[i];
+            }
+        } while (numbers.every((a) => a > 0));
+        const allNumbersNodes = numbers.map((nb) => new numberNode_1.NumberNode(nb));
+        statementTree = new addNode_1.AddNode(allNumbersNodes[0], allNumbersNodes[1]);
+        for (let i = 2; i < allNumbersNodes.length; i++) {
+            statementTree = new addNode_1.AddNode(statementTree, allNumbersNodes[i]);
+        }
+        answer = numbers.reduce((a, b) => a + b);
+    }
+    const answerTex = answer.toString();
+    const question = {
+        instruction: `Calculer : $${statementTree.toTex()}$`,
+        startStatement: statementTree.toTex(),
+        answer: answerTex,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { numbers },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const incorrectAnswer = Number(answer) + (0, randint_1.randint)(-5, 6, [0]);
+        (0, exercise_1.tryToAddWrongProp)(propositions, incorrectAnswer.toString());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (studentAns, { answer }) => {
+    const answerTree = new numberNode_1.NumberNode(Number(answer));
+    const texs = answerTree.toAllValidTexs();
+    return texs.includes(studentAns);
+};
+exports.addAndSubWithoutRelatives = {
+    id: "addAndSubWithoutRelatives",
+    connector: "=",
+    label: "Additions et soustractions sans les nombres relatifs",
+    levels: ["6ème", "5ème"],
+    sections: ["Calculs"],
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAddAndSubWithoutRelatives, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calcul/arithmetics/euclideanDivision.d.ts

@@ -1,14 +1,10 @@
-import { MathExercise } from '../../../exercises/exercise';
-type VEAProps = {
-    dividend: number;
-    divisor: number;
-    quotient: number;
-    remainder: number;
-};
-type QCMProps = {
-    answer: string;
-    dividend: number;
-};
-export declare const euclideanDivision: MathExercise<QCMProps, VEAProps>;
-export {};
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    dividend: number;
+    divisor: number;
+    quotient: number;
+    remainder: number;
+};
+export declare const euclideanDivision: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=euclideanDivision.d.ts.map

package/lib/exercises/calcul/arithmetics/euclideanDivision.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"euclideanDivision.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/euclideanDivision.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAoClC,KAAK,QAAQ,GAAG;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAWF,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;CAClB,CAAC;AAiBF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAY9D,CAAC"}
+{"version":3,"file":"euclideanDivision.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/euclideanDivision.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAsClC,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAwCF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,WAAW,CAYvD,CAAC"}

package/lib/exercises/calcul/arithmetics/euclideanDivision.js

@@ -1,61 +1,60 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.euclideanDivision = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../../math/utils/random/randint");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const equalNode_1 = require("../../../tree/nodes/operators/equalNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const getEuclideanDivisionQuestions = () => {
-    let dividend = (0, randint_1.randint)(5, 100);
-    let divisor = (0, randint_1.randint)(2, 11);
-    while (dividend % divisor === 0) {
-        dividend = (0, randint_1.randint)(5, 100);
-        divisor = (0, randint_1.randint)(2, 11);
-    }
-    const quotient = Math.floor(dividend / divisor);
-    const remainder = dividend % divisor;
-    const answer = new equalNode_1.EqualNode(new numberNode_1.NumberNode(dividend), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(divisor), new numberNode_1.NumberNode(quotient)), new numberNode_1.NumberNode(remainder)));
-    const answerTex = answer.toTex();
-    const question = {
-        instruction: `Ecrire la division euclidienne de ${dividend} par ${divisor}.`,
-        answer: answerTex,
-        keys: ['equal'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer: answerTex, dividend },
-        veaProps: { dividend, divisor, quotient, remainder },
-    };
-    return question;
-};
-const isAnswerValid = (ans, { dividend, divisor, quotient, remainder }) => {
-    const tree = new equalNode_1.EqualNode(new numberNode_1.NumberNode(dividend), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(divisor), new numberNode_1.NumberNode(quotient)), new numberNode_1.NumberNode(remainder)), { isRightChildOnlyValid: true });
-    const validLatexs = tree.toAllValidTexs();
-    return validLatexs.includes(ans);
-};
-const getPropositions = (n, { answer, dividend }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const divisor = (0, randint_1.randint)(2, 11);
-        const quotient = Math.floor((0, randint_1.randint)(5, 100) / divisor);
-        const remainder = (0, randint_1.randint)(5, 100) % divisor;
-        const wrongAnswer = new equalNode_1.EqualNode(new numberNode_1.NumberNode(dividend), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(divisor), new numberNode_1.NumberNode(quotient)), new numberNode_1.NumberNode(remainder)));
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-exports.euclideanDivision = {
-    id: 'euclideanDivision',
-    connector: '=',
-    label: 'Ecrire une division euclidienne',
-    levels: ['6ème', '5ème', '4ème'],
-    sections: ['Arithmétique'],
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEuclideanDivisionQuestions, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.euclideanDivision = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const getEuclideanDivisionQuestions = () => {
+    let dividend = (0, randint_1.randint)(5, 100);
+    let divisor = (0, randint_1.randint)(2, 11);
+    while (dividend % divisor === 0) {
+        dividend = (0, randint_1.randint)(5, 100);
+        divisor = (0, randint_1.randint)(2, 11);
+    }
+    const quotient = Math.floor(dividend / divisor);
+    const remainder = dividend % divisor;
+    const answer = new equalNode_1.EqualNode(new numberNode_1.NumberNode(dividend), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(divisor), new numberNode_1.NumberNode(quotient)), new numberNode_1.NumberNode(remainder)));
+    const answerTex = answer.toTex();
+    const question = {
+        instruction: `Ecrire la division euclidienne de ${dividend} par ${divisor}.`,
+        answer: answerTex,
+        keys: ["equal"],
+        answerFormat: "tex",
+        identifiers: { dividend, divisor, quotient, remainder },
+    };
+    return question;
+};
+const isAnswerValid = (ans, { dividend, divisor, quotient, remainder }) => {
+    const tree = new equalNode_1.EqualNode(new numberNode_1.NumberNode(dividend), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(divisor), new numberNode_1.NumberNode(quotient)), new numberNode_1.NumberNode(remainder)), { allowRawRightChildAsSolution: true });
+    const validLatexs = tree.toAllValidTexs();
+    return validLatexs.includes(ans);
+};
+const getPropositions = (n, { answer, dividend }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const divisor = (0, randint_1.randint)(2, 11);
+        const quotient = Math.floor((0, randint_1.randint)(5, 100) / divisor);
+        const remainder = (0, randint_1.randint)(5, 100) % divisor;
+        const wrongAnswer = new equalNode_1.EqualNode(new numberNode_1.NumberNode(dividend), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(divisor), new numberNode_1.NumberNode(quotient)), new numberNode_1.NumberNode(remainder)));
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+exports.euclideanDivision = {
+    id: "euclideanDivision",
+    connector: "=",
+    label: "Ecrire une division euclidienne",
+    levels: ["6ème", "5ème", "4ème"],
+    sections: ["Arithmétique"],
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEuclideanDivisionQuestions, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calcul/arithmetics/index.d.ts

@@ -0,0 +1,4 @@
+export * from "./euclideanDivision";
+export * from "./paritySumsAndProducts";
+export * from "./primeNumbers";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/calcul/arithmetics/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/index.ts"],"names":[],"mappings":"AAAA,cAAc,qBAAqB,CAAC;AACpC,cAAc,yBAAyB,CAAC;AACxC,cAAc,gBAAgB,CAAC"}

package/lib/exercises/calcul/arithmetics/index.js

@@ -0,0 +1,19 @@
+"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("./euclideanDivision"), exports);
+__exportStar(require("./paritySumsAndProducts"), exports);
+__exportStar(require("./primeNumbers"), exports);

package/lib/exercises/calcul/arithmetics/paritySumsAndProducts.d.ts

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

package/lib/exercises/calcul/arithmetics/paritySumsAndProducts.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"paritySumsAndProducts.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/paritySumsAndProducts.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,YAAY,EAKb,MAAM,0BAA0B,CAAC;AAsElC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAgCF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,QAAQ,CAaxD,CAAC"}
+{"version":3,"file":"paritySumsAndProducts.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/paritySumsAndProducts.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAKb,MAAM,0BAA0B,CAAC;AAyElC,KAAK,WAAW,GAAG,EAAE,CAAC;AAgCtB,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAc3D,CAAC"}