math-exercises 2.1.25 → 2.1.26

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

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

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

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

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

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

@@ -0,0 +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;
+    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/commonDivisorsList.d.ts

@@ -0,0 +1,8 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    a: number;
+    b: number;
+};
+export declare const commonDivisorsList: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=commonDivisorsList.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"commonDivisorsList.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/commonDivisorsList.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AASlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA2DF,eAAO,MAAM,kBAAkB,EAAE,YAAY,CAAC,WAAW,CAYxD,CAAC"}

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

@@ -0,0 +1,64 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.commonDivisorsList = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const dividersOf_1 = require("../../../math/utils/arithmetic/dividersOf");
+const gcd_1 = require("../../../math/utils/arithmetic/gcd");
+const isPrime_1 = require("../../../math/utils/arithmetic/isPrime");
+const randint_1 = require("../../../math/utils/random/randint");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const doWhile_1 = require("../../../utils/doWhile");
+const getCommonDivisorsListQuestion = () => {
+    const a = (0, doWhile_1.doWhile)(() => (0, randint_1.randint)(30, 150), (x) => (0, isPrime_1.isPrime)(x));
+    const b = (0, doWhile_1.doWhile)(() => (0, randint_1.randint)(30, 150), (x) => x === a || (0, gcd_1.gcd)(a, x) === 1);
+    const divisorsA = (0, dividersOf_1.dividersOf)(a);
+    const divisorsB = (0, dividersOf_1.dividersOf)(b);
+    const res = [];
+    divisorsA.forEach((n) => divisorsB.includes(n) && res.push(n));
+    res.sort((a, b) => a - b);
+    const answer = res.join(",");
+    const question = {
+        answer,
+        instruction: `Donner la liste des diviseurs communs à ${a} et ${b} (séparer les valeurs par des virgules).`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { a, b },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const values = answer.split(",").map((v) => Number(v));
+    const max = Math.max(a, b);
+    while (propositions.length < n) {
+        const newValue = (0, doWhile_1.doWhile)(() => (0, randint_1.randint)(2, max), (x) => values.includes(max));
+        const copy = values.slice();
+        const willRemove = (0, coinFlip_1.coinFlip)();
+        willRemove
+            ? copy.splice((0, randint_1.randint)(0, values.length), 1)
+            : copy.splice(0, 0, newValue);
+        (0, exercise_1.tryToAddWrongProp)(propositions, willRemove ? copy.join(",") : copy.sort((a, b) => a - b).join(","));
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer }) => {
+    let values = ans.split(",").map((v) => Number(v));
+    if (values.some((v) => isNaN(v)))
+        return false;
+    values.sort((a, b) => a - b);
+    return values.join(",") === answer;
+};
+exports.commonDivisorsList = {
+    id: "commonDivisorsList",
+    label: "Déterminer les diviseurs communs de deux nombres",
+    levels: ["2nde"],
+    isSingleStep: true,
+    sections: ["Arithmétique"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getCommonDivisorsListQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"divisorsList.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/divisorsList.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAOlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA6CF,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,WAAW,CAWlD,CAAC"}

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

@@ -0,0 +1,56 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.divisorsList = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const dividersOf_1 = require("../../../math/utils/arithmetic/dividersOf");
+const randint_1 = require("../../../math/utils/random/randint");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const doWhile_1 = require("../../../utils/doWhile");
+const getDivisorsListQuestion = () => {
+    const a = (0, randint_1.randint)(30, 90);
+    const divisors = (0, dividersOf_1.dividersOf)(a);
+    const answer = divisors.join(",");
+    const question = {
+        answer,
+        instruction: `Donner la liste des diviseurs de ${a} (séparer les valeurs par des virgules).`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { a },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const values = answer.split(",").map((v) => Number(v));
+    while (propositions.length < n) {
+        const newValue = (0, doWhile_1.doWhile)(() => (0, randint_1.randint)(2, values[values.length - 1]), (x) => values.includes(x));
+        const copy = values.slice();
+        const willRemove = (0, coinFlip_1.coinFlip)();
+        willRemove
+            ? copy.splice((0, randint_1.randint)(0, values.length), 1)
+            : copy.splice(0, 0, newValue);
+        (0, exercise_1.tryToAddWrongProp)(propositions, willRemove ? copy.join(",") : copy.sort((a, b) => a - b).join(","));
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer }) => {
+    let values = ans.split(",").map((v) => Number(v));
+    if (values.some((v) => isNaN(v)))
+        return false;
+    values.sort((a, b) => a - b);
+    return values.join(",") === answer;
+};
+exports.divisorsList = {
+    id: "divisorsList",
+    label: "Déterminer les diviseurs d'un nombre",
+    levels: ["2nde"],
+    isSingleStep: true,
+    sections: ["Arithmétique"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDivisorsListQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

@@ -0,0 +1,10 @@
+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

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

@@ -0,0 +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/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,7 @@
+export * from "./euclideanDivision";
+export * from "./paritySumsAndProducts";
+export * from "./primeNumbers";
+export * from "./pgcdCalcul";
+export * from "./divisorsList";
+export * from "./commonDivisorsList";
+//# 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;AAC/B,cAAc,cAAc,CAAC;AAC7B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,sBAAsB,CAAC"}

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

@@ -0,0 +1,22 @@
+"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);
+__exportStar(require("./pgcdCalcul"), exports);
+__exportStar(require("./divisorsList"), exports);
+__exportStar(require("./commonDivisorsList"), exports);

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

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

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

@@ -0,0 +1 @@
+{"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;IACjB,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAgCF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAc3D,CAAC"}

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

@@ -0,0 +1,115 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.paritySumsAndProducts = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+const getParitySumsAndProductsQuestion = () => {
+    const type = (0, randint_1.randint)(0, 12);
+    let instruction = "";
+    let answer = "Pair";
+    switch (type) {
+        case 0:
+            instruction = "La somme de deux nombres pairs est un nombre...";
+            answer = "Pair";
+            break;
+        case 1:
+            instruction = "La somme de deux nombres impairs est un nombre...";
+            answer = "Pair";
+            break;
+        case 2:
+            instruction =
+                "La somme d'un nombre pair et d'un nombre impair un nombre...";
+            answer = "Impair";
+            break;
+        case 3:
+            instruction = "La somme de trois nombres impairs est un nombre...";
+            answer = "Impair";
+            break;
+        case 4:
+            instruction = "La somme de trois nombres consécutifs est un nombre...";
+            answer = "Parfois pair, parfois impair";
+            break;
+        case 5:
+            instruction = "La somme de quatre nombres consécutifs est un nombre...";
+            answer = "Pair";
+            break;
+        case 6:
+            instruction = "Le produit de deux nombres pairs est un nombre...";
+            answer = "Pair";
+            break;
+        case 7:
+            instruction = "Le produit de deux nombres impairs est un nombre...";
+            answer = "Impair";
+            break;
+        case 8:
+            instruction =
+                "Le produit d'un nombre pair et d'un nombre impair est un nombre...";
+            answer = "Pair";
+            break;
+        case 9:
+            instruction = "Le produit de trois nombres consécutifs est un nombre...";
+            answer = "Pair";
+            break;
+        case 10:
+            instruction = "Le produit de trois nombres impairs est un nombre...";
+            answer = "Impair";
+            break;
+        case 11:
+            instruction = "Le produit de trois nombres pairs est un nombre...";
+            answer = "Pair";
+            break;
+    }
+    const question = {
+        answer: answer,
+        instruction,
+        keys: [],
+        answerFormat: "raw",
+        identifiers: { type },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [
+        {
+            id: (0, uuid_1.v4)(),
+            statement: `Pair`,
+            isRightAnswer: answer === "Pair",
+            format: "raw",
+        },
+        {
+            id: (0, uuid_1.v4)(),
+            statement: `Impair`,
+            isRightAnswer: answer === "Impair",
+            format: "raw",
+        },
+        {
+            id: (0, uuid_1.v4)(),
+            statement: `Parfois pair, parfois impair`,
+            isRightAnswer: answer === "Parfois pair, parfois impair",
+            format: "raw",
+        },
+        {
+            id: (0, uuid_1.v4)(),
+            statement: `Premier`,
+            isRightAnswer: answer === "Premier",
+            format: "raw",
+        },
+    ];
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.paritySumsAndProducts = {
+    id: "paritySumsAndProducts",
+    connector: "=",
+    label: "Parité de sommes et de produits",
+    levels: ["2nde"],
+    isSingleStep: true,
+    sections: ["Arithmétique"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getParitySumsAndProductsQuestion, nb, 12),
+    qcmTimer: 60,
+    freeTimer: 60,
+    answerType: "QCM",
+    maxAllowedQuestions: 12,
+    getPropositions,
+};

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

@@ -0,0 +1,8 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    a: number;
+    b: number;
+};
+export declare const pgcdCalcul: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=pgcdCalcul.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pgcdCalcul.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/pgcdCalcul.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAOlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAqCF,eAAO,MAAM,UAAU,EAAE,YAAY,CAAC,WAAW,CAYhD,CAAC"}

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

@@ -0,0 +1,47 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.pgcdCalcul = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const gcd_1 = require("../../../math/utils/arithmetic/gcd");
+const isPrime_1 = require("../../../math/utils/arithmetic/isPrime");
+const randint_1 = require("../../../math/utils/random/randint");
+const doWhile_1 = require("../../../utils/doWhile");
+const getPgcdCalculQuestion = () => {
+    const a = (0, doWhile_1.doWhile)(() => (0, randint_1.randint)(30, 150), (x) => (0, isPrime_1.isPrime)(x));
+    const b = (0, doWhile_1.doWhile)(() => (0, randint_1.randint)(30, 150), (x) => x === a || (0, gcd_1.gcd)(a, x) === 1);
+    const pgcd = (0, gcd_1.gcd)(a, b);
+    const question = {
+        answer: pgcd + "",
+        instruction: `Donner le PGCD de ${a} et ${b}`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { a, b },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, "1");
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(2, 11) + "");
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+exports.pgcdCalcul = {
+    id: "pgcdCalcul",
+    connector: "=",
+    label: "Calculer un PGCD",
+    levels: ["2nde", "1reSpé", "MathExp"],
+    isSingleStep: true,
+    sections: ["Arithmétique"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPgcdCalculQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

@@ -0,0 +1,7 @@
+import { MathExercise } from "../../exercise";
+type Identifiers = {
+    chosenNumbers: number[];
+};
+export declare const primeNumbers: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=primeNumbers.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"primeNumbers.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/primeNumbers.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,YAAY,EASb,MAAM,gBAAgB,CAAC;AAsDxB,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB,CAAC;AAuDF,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,WAAW,CAYlD,CAAC"}