math-exercises 2.1.20 → 2.1.23

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@@ -1,105 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.primeNumbers = void 0;
-const randint_1 = require("../../../math/utils/random/randint");
-const exercise_1 = require("../../exercise");
-const getDistinctQuestions_1 = require("../../utils/getDistinctQuestions");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
-const operatorComposition_1 = require("../../../tree/utilities/operatorComposition");
-function prodNumbers(tab) {
-    let temp = 1;
-    for (let i = 0; i < tab.length; i++)
-        temp *= tab[i];
-    return temp;
-}
-const primes = [2, 3, 5, 7, 11];
-const getPrimeNumbers = () => {
-    const rand = (0, randint_1.randint)(3, 5);
-    let chosenNumbers = [];
-    let elevenCount = 0;
-    for (let i = 0; i < rand; i++) {
-        let temp = (0, randint_1.randint)(0, 5);
-        if (temp === 4)
-            elevenCount++;
-        while (elevenCount >= 2 && temp === 4)
-            temp = (0, randint_1.randint)(0, 5);
-        chosenNumbers.push(primes[temp]);
-    }
-    const prod = prodNumbers(chosenNumbers);
-    chosenNumbers = chosenNumbers.sort((a, b) => a - b);
-    const numberNodes = chosenNumbers.map((nb) => new numberNode_1.NumberNode(nb));
-    let tree = new multiplyNode_1.MultiplyNode(numberNodes[numberNodes.length - 2], numberNodes[numberNodes.length - 1]);
-    for (let i = numberNodes.length - 3; i > -1; i--) {
-        tree = new multiplyNode_1.MultiplyNode(numberNodes[i], tree);
-    }
-    let answer = tree.toTex();
-    const question = {
-        instruction: `Donner la décomposition en nombres premiers de : $${prod}$`,
-        startStatement: `${prod}`,
-        answer,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: { chosenNumbers },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, chosenNumbers }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const wrongFactors = [...chosenNumbers];
-    while (propositions.length < n) {
-        let wrongFactor, newFactor, randomIndex, wrongAnswer;
-        randomIndex = (0, randint_1.randint)(0, wrongFactors.length);
-        wrongFactor = wrongFactors[randomIndex];
-        newFactor = wrongFactor;
-        while (newFactor === wrongFactor) {
-            const temp = (0, randint_1.randint)(0, primes.length);
-            newFactor = primes[temp];
-        }
-        wrongFactors[randomIndex] = newFactor;
-        wrongAnswer = `${wrongFactors[0]}`;
-        for (let j = 1; j < wrongFactors.length; j++) {
-            wrongAnswer += `\\times` + wrongFactors[j];
-        }
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { chosenNumbers }) => {
-    //array of [nombre, power]
-    const nbsToPower = [];
-    chosenNumbers.forEach((nb) => {
-        if (nbsToPower.some((el) => el[0] === nb))
-            return;
-        const count = chosenNumbers.filter((el) => el === nb).length;
-        nbsToPower.push([nb, count]);
-    });
-    const nodes = nbsToPower.map((el) => {
-        const nbNode = new numberNode_1.NumberNode(el[0]);
-        if (el[1] === 1) {
-            return nbNode;
-        }
-        else {
-            return new powerNode_1.PowerNode(nbNode, new numberNode_1.NumberNode(el[1]));
-        }
-    });
-    const answer = nodes.length === 1 ? nodes[0] : (0, operatorComposition_1.operatorComposition)(multiplyNode_1.MultiplyNode, nodes);
-    const texs = answer.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.primeNumbers = {
-    id: "primeNumbers",
-    connector: "=",
-    label: "Décomposition en nombres premiers",
-    levels: ["5ème", "4ème", "3ème", "2nde"],
-    sections: ["Arithmétique"],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPrimeNumbers, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/calcul/fractions/fractionAndIntegerDivision.d.ts

@@ -1,9 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    integerFirst: boolean;
-    integer: number;
-    rational: [number, number];
-};
-export declare const fractionAndIntegerDivision: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=fractionAndIntegerDivision.d.ts.map

package/lib/exercises/calcul/fractions/fractionAndIntegerDivision.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"fractionAndIntegerDivision.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionAndIntegerDivision.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAwClC,KAAK,WAAW,GAAG;IACjB,YAAY,EAAE,OAAO,CAAC;IACtB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC5B,CAAC;AAyCF,eAAO,MAAM,0BAA0B,EAAE,YAAY,CAAC,WAAW,CAahE,CAAC"}

package/lib/exercises/calcul/fractions/fractionAndIntegerDivision.js

@@ -1,77 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.fractionAndIntegerDivision = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const integer_1 = require("../../../math/numbers/integer/integer");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const randint_1 = require("../../../math/utils/random/randint");
-const divideNode_1 = require("../../../tree/nodes/operators/divideNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const getFractionAndIntegerDivision = () => {
-    const rational = rational_1.RationalConstructor.randomIrreductible();
-    const integerFirst = (0, coinFlip_1.coinFlip)();
-    const integer = integerFirst
-        ? new integer_1.Integer((0, randint_1.randint)(-10, 11, [0]))
-        : new integer_1.Integer((0, randint_1.randint)(-10, 11, [0, 1]));
-    const statementTree = integerFirst
-        ? new divideNode_1.DivideNode(integer.toTree(), rational.toTree())
-        : new divideNode_1.DivideNode(rational.toTree(), integer.toTree());
-    const answerTree = integerFirst
-        ? integer.divide(rational).toTree()
-        : rational.divide(integer).toTree();
-    const answerTex = answerTree.toTex();
-    const question = {
-        instruction: `Calculer et donner le résultat sous la forme d'une fraction irréductible : $${statementTree.toTex()}$`,
-        startStatement: statementTree.toTex(),
-        answer: answerTex,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: {
-            integerFirst,
-            integer: integer.value,
-            rational: [rational.num, rational.denum],
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, integerFirst, integer, rational }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const integerObj = new integer_1.Integer(integer);
-    const rationalObj = new rational_1.Rational(rational[0], rational[1]);
-    (0, exercise_1.tryToAddWrongProp)(propositions, !integerFirst
-        ? integerObj.divide(rationalObj).toTree().toTex()
-        : rationalObj.divide(integerObj).toTree().toTex());
-    while (propositions.length < n) {
-        const wrongRational = rational_1.RationalConstructor.randomIrreductible();
-        const wrongAnswerTree = integerFirst
-            ? integerObj.divide(wrongRational).toTree()
-            : wrongRational.divide(integerObj).toTree();
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswerTree.toTex());
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { integer, integerFirst, rational }) => {
-    const integerObj = new integer_1.Integer(integer);
-    const rationalObj = new rational_1.Rational(rational[0], rational[1]);
-    const answerTree = integerFirst
-        ? integerObj.divide(rationalObj).toTree({ allowFractionToDecimal: true })
-        : rationalObj.divide(integerObj).toTree({ allowFractionToDecimal: true });
-    const texs = answerTree.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.fractionAndIntegerDivision = {
-    id: "fractionAndIntegerDivision",
-    connector: "=",
-    label: "Division d'un entier et d'une fraction",
-    levels: ["4ème", "3ème", "2nde", "2ndPro", "1rePro", "CAP"],
-    isSingleStep: false,
-    sections: ["Fractions"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFractionAndIntegerDivision, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/calcul/fractions/fractionAndIntegerProduct.d.ts

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

package/lib/exercises/calcul/fractions/fractionAndIntegerProduct.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"fractionAndIntegerProduct.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionAndIntegerProduct.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAiClC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC5B,CAAC;AAsCF,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,WAAW,CAa/D,CAAC"}

package/lib/exercises/calcul/fractions/fractionAndIntegerProduct.js

@@ -1,68 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.fractionAndIntegerProduct = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const integer_1 = require("../../../math/numbers/integer/integer");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const randint_1 = require("../../../math/utils/random/randint");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const getFractionAndIntegerProduct = () => {
-    const rational = rational_1.RationalConstructor.randomIrreductible();
-    const integer = new integer_1.Integer((0, randint_1.randint)(-10, 11, [0, 1]));
-    const statementTree = new multiplyNode_1.MultiplyNode(rational.toTree(), integer.toTree());
-    statementTree.shuffle();
-    const answerTree = rational.multiply(integer).toTree();
-    const answer = answerTree.toTex();
-    const question = {
-        instruction: `Calculer et donner le résultat sous la forme d'une fraction irréductible : $${statementTree.toTex()}$`,
-        startStatement: statementTree.toTex(),
-        answer,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: {
-            integer: integer.value,
-            rational: [rational.num, rational.denum],
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, integer, rational }) => {
-    const propositions = [];
-    const integerObj = new integer_1.Integer(integer);
-    const rationalObj = new rational_1.Rational(rational[0], rational[1]);
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, new rational_1.Rational(integerObj.value * rationalObj.num, integerObj.value * rationalObj.denum).toTex());
-    while (propositions.length < n) {
-        const randomMultiplier = (0, randint_1.randint)(-10, 10);
-        const wrongAnswerTree = rationalObj
-            .multiply(new integer_1.Integer(randomMultiplier))
-            .toTree();
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswerTree.toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { integer, rational }) => {
-    const integerObj = new integer_1.Integer(integer);
-    const rationalObj = new rational_1.Rational(rational[0], rational[1]);
-    const answerTree = rationalObj
-        .multiply(integerObj)
-        .toTree({ allowFractionToDecimal: true });
-    const texs = answerTree.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.fractionAndIntegerProduct = {
-    id: "fractionAndIntegerProduct",
-    connector: "=",
-    label: "Produit d'un entier et d'une fraction",
-    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro", "1rePro"],
-    isSingleStep: false,
-    sections: ["Fractions"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFractionAndIntegerProduct, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/calcul/fractions/fractionAndIntegerSum.d.ts

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

package/lib/exercises/calcul/fractions/fractionAndIntegerSum.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"fractionAndIntegerSum.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionAndIntegerSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAgClC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC5B,CAAC;AA0CF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAY3D,CAAC"}

package/lib/exercises/calcul/fractions/fractionAndIntegerSum.js

@@ -1,67 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.fractionAndIntegerSum = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const integer_1 = require("../../../math/numbers/integer/integer");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const randint_1 = require("../../../math/utils/random/randint");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const getFractionAndIntegerSum = () => {
-    const rational = rational_1.RationalConstructor.randomIrreductible();
-    const integer = new integer_1.Integer((0, randint_1.randint)(-10, 11, [0]));
-    const statementTree = new addNode_1.AddNode(rational.toTree(), integer.toTree());
-    statementTree.shuffle();
-    const answerTree = rational.add(integer).toTree();
-    const answer = answerTree.toTex();
-    const question = {
-        instruction: `Calculer et donner le résultat sous la forme d'une fraction irréductible : $${statementTree.toTex()}$`,
-        startStatement: statementTree.toTex(),
-        answer,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: {
-            integer: integer.value,
-            rational: [rational.num, rational.denum],
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, integer, rational }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const integerObj = new integer_1.Integer(integer);
-    const rationalObj = new rational_1.Rational(rational[0], rational[1]);
-    (0, exercise_1.tryToAddWrongProp)(propositions, new rational_1.Rational(integerObj.value + rationalObj.num, rationalObj.denum).toTex());
-    if (integerObj.value + rationalObj.denum !== 0)
-        (0, exercise_1.tryToAddWrongProp)(propositions, new rational_1.Rational(integerObj.value + rationalObj.num, integerObj.value + rationalObj.denum).toTex());
-    while (propositions.length < n) {
-        const rational = rational_1.RationalConstructor.randomIrreductible();
-        const wrongAnswerTree = rational.add(integerObj).toTree();
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswerTree.toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { integer, rational }) => {
-    const integerObj = new integer_1.Integer(integer);
-    const rationalObj = new rational_1.Rational(rational[0], rational[1]);
-    const answerTree = rationalObj
-        .add(integerObj)
-        .toTree({ allowFractionToDecimal: true });
-    const texs = answerTree.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.fractionAndIntegerSum = {
-    id: "fractionAndIntegerSum",
-    connector: "=",
-    label: "Somme d'un entier et d'une fraction",
-    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro", "1rePro"],
-    isSingleStep: false,
-    sections: ["Fractions"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFractionAndIntegerSum, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};