math-exercises 2.1.21 → 2.1.24

package/lib/exercises/sets/intervals/intervalBelonging.js

@@ -1,65 +0,0 @@
-"use strict";
-// import { MathExercise, Proposition, Question } from '../../../exercises/exercise';
-// import { getDistinctQuestions } from '../../../exercises/utils/getDistinctQuestions';
-// import { IntervalConstructor } from '../../../math/sets/intervals/intervals';
-// import { coinFlip } from '../../../utils/coinFlip';
-// import { shuffle } from '../../../utils/shuffle';
-// import { v4 } from 'uuid';
-// e getIntervalBelongingQuestion(): Question {
-//   const interval = IntervalConstructor.random();
-//   const isIn = coinFlip();
-//   let nb = '';
-//   let answer = '';
-//   if (isIn) {
-//     answer = '\\in';
-//     nb = interval.getRandomElement().toTree().toTex();
-//   } else {
-//     answer = '\\notin';
-//     nb = '2';
-//   }
-//   const getPropositions = (n: number) => {
-//     const res: Proposition[] = [];
-//     res.push({
-//       id: v4(),
-//       statement: ``,
-//       isRightAnswer: true,
-//       format: 'tex',
-//     });
-//     const missing = n - res.length;
-//     for (let i = 0; i < missing; i++) {
-//       let isDuplicate: boolean;
-//       let proposition: Proposition;
-//       do {
-//         const wrongAnswer = '';
-//         proposition = {
-//           id: v4() + ``,
-//           statement: wrongAnswer,
-//           isRightAnswer: false,
-//           format: 'tex',
-//         };
-//         isDuplicate = res.some((p) => p.statement === proposition.statement);
-//       } while (isDuplicate);
-//       res.push(proposition);
-//     }
-//     return shuffle(res);
-//   };
-//   const question: Question = {
-//     answer,
-//     instruction: `Compléter par $\\in$ ou $\\notin$ : $\\ ${nb} \\ldots ${interval.toTex()}$`,
-//     keys: ['belongs', 'notin'],
-//     getPropositions,
-//     answerFormat: 'tex',
-//   };
-//   return question;
-// }
-// export const intervalBelonging: MathExercise<QCMProps, VEAProps> = {
-//   id: 'intervalBelonging',
-//   connector: '=',
-//   label: '=',
-//   levels: ['2nde', '2ndPro', '1reESM'],
-//   isSingleStep: true,
-//   sections: ['Ensembles et intervalles'],
-//   generator: (nb: number) => getDistinctQuestions(getIntervalBelongingQuestion, nb),
-//   qcmTimer: 60,
-//   freeTimer: 60,
-// };

package/lib/exercises/sets/intervals/intervalsIntersection.d.ts

@@ -1,13 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-import { ClosureType } from "../../../tree/nodes/sets/closure";
-type Identifiers = {
-    int1Min: number;
-    int1Max: number;
-    int1Closure: ClosureType;
-    int2Min: number;
-    int2Max: number;
-    int2Closure: ClosureType;
-};
-export declare const intervalsIntersection: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=intervalsIntersection.d.ts.map

package/lib/exercises/sets/intervals/intervalsIntersection.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"intervalsIntersection.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sets/intervals/intervalsIntersection.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAMlC,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAG5D,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,WAAW,CAAC;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,WAAW,CAAC;CAC1B,CAAC;AAwDF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAa3D,CAAC"}

package/lib/exercises/sets/intervals/intervalsIntersection.js

@@ -1,63 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.intervalsIntersection = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const intervals_1 = require("../../../math/sets/intervals/intervals");
-const shuffle_1 = require("../../../utils/shuffle");
-const getIntervalsIntersectionQuestion = () => {
-    const [int1, int2] = intervals_1.IntervalConstructor.differentRandoms(2);
-    const inter = int1.intersection(int2);
-    const answer = inter.tex;
-    const question = {
-        answer,
-        instruction: `Soit $I = ${int1.toTex()}$ et $J = ${int2.toTex()}$. Déterminer $I\\cap J$.`,
-        keys: [
-            "infty",
-            "varnothing",
-            "lbracket",
-            "rbracket",
-            "semicolon",
-            "cup",
-            "cap",
-        ],
-        answerFormat: "tex",
-        identifiers: {
-            int1Closure: int1.closure,
-            int1Max: int1.max,
-            int1Min: int1.min,
-            int2Closure: int2.closure,
-            int2Max: int2.max,
-            int2Min: int2.min,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, int1Closure, int1Max, int1Min, int2Closure, int2Max, int2Min }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const int1 = new intervals_1.Interval(int1Min.toTree(), int1Max.toTree(), int1Closure);
-    const int2 = new intervals_1.Interval(int2Min.toTree(), int2Max.toTree(), int2Closure);
-    (0, exercise_1.tryToAddWrongProp)(propositions, int1.union(int2).tex);
-    while (propositions.length < n) {
-        const wrongAnswer = intervals_1.IntervalConstructor.random().tex;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { answer }) => {
-    return ans === answer;
-};
-exports.intervalsIntersection = {
-    id: "intervalsIntersection",
-    connector: "=",
-    label: "Déterminer l'intersection de deux intervalles",
-    levels: ["2nde", "1reESM"],
-    isSingleStep: true,
-    sections: ["Ensembles et intervalles"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getIntervalsIntersectionQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/sets/intervals/intervalsUnion.d.ts

@@ -1,13 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-import { ClosureType } from "../../../tree/nodes/sets/closure";
-type Identifiers = {
-    int1Min: number;
-    int1Max: number;
-    int1Closure: ClosureType;
-    int2Min: number;
-    int2Max: number;
-    int2Closure: ClosureType;
-};
-export declare const intervalsUnion: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=intervalsUnion.d.ts.map

package/lib/exercises/sets/intervals/intervalsUnion.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"intervalsUnion.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sets/intervals/intervalsUnion.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAMlC,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAG5D,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,WAAW,CAAC;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,WAAW,CAAC;CAC1B,CAAC;AA6CF,eAAO,MAAM,cAAc,EAAE,YAAY,CAAC,WAAW,CAapD,CAAC"}

package/lib/exercises/sets/intervals/intervalsUnion.js

@@ -1,55 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.intervalsUnion = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const intervals_1 = require("../../../math/sets/intervals/intervals");
-const shuffle_1 = require("../../../utils/shuffle");
-const getIntervalsUnionQuestion = () => {
-    const [int1, int2] = intervals_1.IntervalConstructor.differentRandoms(2);
-    const set = int1.union(int2);
-    const answer = set.tex;
-    const question = {
-        answer,
-        instruction: `Soit $I = ${int1.tex}$ et $J = ${int2.tex}$. Déterminer $I\\cup J$.`,
-        keys: ["infty", "lbracket", "rbracket", "semicolon", "cup", "cap"],
-        answerFormat: "tex",
-        identifiers: {
-            int1Closure: int1.closure,
-            int1Max: int1.max,
-            int1Min: int1.min,
-            int2Closure: int2.closure,
-            int2Max: int2.max,
-            int2Min: int2.min,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, int1Closure, int1Max, int1Min, int2Closure, int2Max, int2Min }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const int1 = new intervals_1.Interval(int1Min.toTree(), int1Max.toTree(), int1Closure);
-    const int2 = new intervals_1.Interval(int2Min.toTree(), int2Max.toTree(), int2Closure);
-    (0, exercise_1.tryToAddWrongProp)(propositions, int1.intersection(int2).tex);
-    while (propositions.length < n) {
-        const wrongAnswer = intervals_1.IntervalConstructor.random().tex;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { answer }) => {
-    return ans === answer;
-};
-exports.intervalsUnion = {
-    id: "intervalsUnion",
-    connector: "=",
-    label: "Déterminer l'union de deux intervalles",
-    levels: ["2nde", "2ndPro", "1reTech", "CAP"],
-    isSingleStep: true,
-    sections: ["Ensembles et intervalles"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getIntervalsUnionQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/sets/setBelonging.d.ts

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

package/lib/exercises/sets/setBelonging.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"setBelonging.d.ts","sourceRoot":"","sources":["../../../src/exercises/sets/setBelonging.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AAuEF,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,WAAW,CAYlD,CAAC"}

package/lib/exercises/sets/setBelonging.js

@@ -1,84 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.setBelonging = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const decimal_1 = require("../../math/numbers/decimals/decimal");
-const rational_1 = require("../../math/numbers/rationals/rational");
-const randint_1 = require("../../math/utils/random/randint");
-const random_1 = require("../../utils/random");
-const shuffle_1 = require("../../utils/shuffle");
-const getSetBelongingQuestion = () => {
-    //N Z D Q R (racine2, pi)
-    //fraction simplifiable en décimal/entier
-    //racine carrée simplifiable en entier / Fraction
-    //
-    const type = (0, randint_1.randint)(0, 5);
-    let answer = "";
-    let nb = "";
-    switch (type) {
-        case 0:
-            nb = (0, randint_1.randint)(0, 1000) + "";
-            answer = "\\mathbb{N}";
-            break;
-        case 1:
-            nb = -(0, randint_1.randint)(0, 1000) + "";
-            answer = "\\mathbb{Z}";
-            break;
-        case 2:
-            nb = decimal_1.DecimalConstructor.random(-50, 50, (0, randint_1.randint)(1, 4)).toTree().toTex();
-            answer = "\\mathrm{D}";
-            break;
-        case 3:
-            nb = rational_1.RationalConstructor.randomIrreductible().toTree().toTex();
-            answer = "\\mathbb{Q}";
-            break;
-        case 4:
-            nb = (0, random_1.random)(["\\sqrt 2", "\\pi"]);
-            answer = "\\mathbb{R}";
-            break;
-    }
-    const question = {
-        answer,
-        instruction: `Donner le plus petit ensemble auquel le nombre $${nb}$ appartient.`,
-        keys: [
-            "varnothing",
-            "naturals",
-            "integers",
-            "decimals",
-            "rationals",
-            "reals",
-        ],
-        answerFormat: "tex",
-        identifiers: { nb, type },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    const availableSets = ["N", "Z", "D", "Q", "R"]
-        .map((el) => `\\mathbb{${el}}`)
-        .filter((el) => el !== answer);
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const wrongAnswer = (0, random_1.random)(availableSets);
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { answer }) => {
-    return [answer, answer.replace("mathbb", "mathrm")].includes(ans);
-};
-exports.setBelonging = {
-    id: "setBelonging",
-    connector: "\\iff",
-    label: "Déterminer le plus petit ensemble auquel un nombre appartient",
-    levels: ["2nde", "1reESM"],
-    isSingleStep: true,
-    sections: ["Ensembles et intervalles"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSetBelongingQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/squareRoots/index.d.ts

@@ -1,6 +0,0 @@
-export * from "./simpifySquareRoot";
-export * from "./squareRootEquation";
-export * from "./squareRootIdentities";
-export * from "./squareRootsDistributivity";
-export * from "./squareRootsSum";
-//# sourceMappingURL=index.d.ts.map

package/lib/exercises/squareRoots/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/index.ts"],"names":[],"mappings":"AAAA,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC;AACrC,cAAc,wBAAwB,CAAC;AACvC,cAAc,6BAA6B,CAAC;AAC5C,cAAc,kBAAkB,CAAC"}

package/lib/exercises/squareRoots/index.js

@@ -1,21 +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("./simpifySquareRoot"), exports);
-__exportStar(require("./squareRootEquation"), exports);
-__exportStar(require("./squareRootIdentities"), exports);
-__exportStar(require("./squareRootsDistributivity"), exports);
-__exportStar(require("./squareRootsSum"), exports);

package/lib/exercises/squareRoots/simpifySquareRoot.d.ts

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

package/lib/exercises/squareRoots/simpifySquareRoot.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"simpifySquareRoot.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/simpifySquareRoot.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,YAAY,EAQb,MAAM,aAAa,CAAC;AAErB,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,CAAC;CACrB,CAAC;AA0CF,eAAO,MAAM,kBAAkB,EAAE,YAAY,CAAC,WAAW,CAYxD,CAAC"}

package/lib/exercises/squareRoots/simpifySquareRoot.js

@@ -1,54 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.simplifySquareRoot = void 0;
-const real_1 = require("../../math/numbers/reals/real");
-const shuffle_1 = require("../../utils/shuffle");
-const exercise_1 = require("../exercise");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const getSimplifySquareRoot = () => {
-    const squareRoot = real_1.SquareRootConstructor.randomSimplifiable({
-        allowPerfectSquare: false,
-        maxSquare: 11,
-    });
-    const sqrtTex = squareRoot.toTree().toTex();
-    const answer = squareRoot.simplify().toTree().toTex();
-    const question = {
-        instruction: `Simplifier : $${sqrtTex}$`,
-        startStatement: sqrtTex,
-        answer,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: { sqrtOperand: squareRoot.operand },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const squareRoot = real_1.SquareRootConstructor.randomSimplifiable({
-            allowPerfectSquare: false,
-            maxSquare: 11,
-        });
-        (0, exercise_1.tryToAddWrongProp)(propositions, squareRoot.simplify().toTree().toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { sqrtOperand }) => {
-    const answer = new real_1.SquareRoot(sqrtOperand).simplify().toTree();
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.simplifySquareRoot = {
-    id: "simplifySqrt",
-    connector: "=",
-    label: "Simplification de racines carrées",
-    isSingleStep: false,
-    levels: ["3ème", "2nde", "1reESM"],
-    sections: ["Racines carrées"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSimplifySquareRoot, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/squareRoots/squareRootEquation.d.ts

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

package/lib/exercises/squareRoots/squareRootEquation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"squareRootEquation.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/squareRootEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAWlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAwCF,eAAO,MAAM,kBAAkB,EAAE,YAAY,CAAC,WAAW,CAaxD,CAAC"}

package/lib/exercises/squareRoots/squareRootEquation.js

@@ -1,54 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.squareRootEquation = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../math/utils/random/randint");
-const equationSolutionNode_1 = require("../../tree/nodes/equations/equationSolutionNode");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const discreteSetNode_1 = require("../../tree/nodes/sets/discreteSetNode");
-const shuffle_1 = require("../../utils/shuffle");
-const getSquareRootEquationQuestion = () => {
-    const k = Math.random() < 0.2 ? (0, randint_1.randint)(-20, 0) : (0, randint_1.randint)(0, 11);
-    const answer = k < 0 ? "S=\\varnothing" : `S=\\left\\{${k ** 2}\\right\\}`;
-    const question = {
-        answer: answer,
-        instruction: `Résoudre l'équation suivante : $\\sqrt x = ${k}$`,
-        keys: ["S", "equal", "lbrace", "semicolon", "rbrace", "varnothing"],
-        answerFormat: "tex",
-        identifiers: { k },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, k }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    if (k >= 0)
-        (0, exercise_1.tryToAddWrongProp)(propositions, "S=\\varnothing");
-    if (Math.sqrt(k) !== k ** 2)
-        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{\\sqrt{${k}}\\right\\}`);
-    while (propositions.length < n) {
-        const wrongAnswer = `S=\\left\\{${(0, randint_1.randint)(1, 100)}\\right\\}`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { k }) => {
-    const solution = k < 0 ? discreteSetNode_1.EmptySet : new discreteSetNode_1.DiscreteSetNode([new numberNode_1.NumberNode(k ** 2)]);
-    const answerTree = new equationSolutionNode_1.EquationSolutionNode(solution);
-    const validLatexs = answerTree.toAllValidTexs();
-    return validLatexs.includes(ans);
-};
-exports.squareRootEquation = {
-    id: "squareRootEquation",
-    connector: "\\iff",
-    label: "Résoudre une équation du type $\\sqrt x = k$",
-    levels: ["2nde", "1reESM", "1reSpé"],
-    isSingleStep: true,
-    sections: ["Racines carrées", "Équations", "Fonctions de référence"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSquareRootEquationQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/squareRoots/squareRootIdentities.d.ts

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

package/lib/exercises/squareRoots/squareRootIdentities.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"squareRootIdentities.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/squareRootIdentities.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAmBlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA2KF,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,WAAW,CAa1D,CAAC"}

package/lib/exercises/squareRoots/squareRootIdentities.js

@@ -1,124 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.squareRootIdentities = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const real_1 = require("../../math/numbers/reals/real");
-const randint_1 = require("../../math/utils/random/randint");
-const sqrtNode_1 = require("../../tree/nodes/functions/sqrtNode");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const powerNode_1 = require("../../tree/nodes/operators/powerNode");
-const substractNode_1 = require("../../tree/nodes/operators/substractNode");
-const probaFlip_1 = require("../../utils/probaFlip");
-const shuffle_1 = require("../../utils/shuffle");
-const getAnswer = (type, firstTerm, secondTerm) => {
-    switch (type) {
-        case 1: //(a+b)^2
-            return new addNode_1.AddNode(new powerNode_1.SquareNode(firstTerm), new addNode_1.AddNode(new powerNode_1.SquareNode(secondTerm), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(2), new multiplyNode_1.MultiplyNode(firstTerm, secondTerm)))).simplify();
-        case 2:
-            return new addNode_1.AddNode(new powerNode_1.SquareNode(firstTerm), new substractNode_1.SubstractNode(new powerNode_1.SquareNode(secondTerm), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(2), new multiplyNode_1.MultiplyNode(firstTerm, secondTerm)))).simplify();
-        case 3:
-        default:
-            return new substractNode_1.SubstractNode(new powerNode_1.SquareNode(firstTerm), new powerNode_1.SquareNode(secondTerm)).simplify();
-    }
-};
-//(x sqrt(a) +- [y || y*sqrt(b)])^2
-//ou (x sqrt(a) + [y || y*sqrt(b)])(x sqrt(a) - [y || y*sqrt(b)])
-const getSquareRootIdentitiesQuestion = () => {
-    const type = (0, randint_1.randint)(1, 4);
-    const a = real_1.SquareRootConstructor.randomIrreductible(10);
-    const x = (0, randint_1.randint)(1, 7);
-    let b;
-    let y = (0, randint_1.randint)(1, 7);
-    const otherTermIsSqrt = (0, probaFlip_1.probaFlip)(0.3);
-    if (otherTermIsSqrt) {
-        do {
-            b = real_1.SquareRootConstructor.randomIrreductible(10);
-        } while (b.operand === a.operand);
-    }
-    const firstTerm = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(x), a.toTree());
-    const secondTerm = otherTermIsSqrt
-        ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(y), b.toTree())
-        : new numberNode_1.NumberNode(y);
-    let statement;
-    switch (type) {
-        case 1: //(a+b)^2
-            statement = new powerNode_1.SquareNode(new addNode_1.AddNode(firstTerm, secondTerm));
-            break;
-        case 2:
-            statement = new powerNode_1.SquareNode(new substractNode_1.SubstractNode(firstTerm, secondTerm));
-            break;
-        case 3:
-        default:
-            statement = new multiplyNode_1.MultiplyNode(new addNode_1.AddNode(firstTerm, secondTerm), new substractNode_1.SubstractNode(firstTerm, secondTerm));
-    }
-    const answer = getAnswer(type, firstTerm, secondTerm).toTex();
-    const question = {
-        answer,
-        instruction: `Développer et simplifier : $${statement.toTex()}$`,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: { type, a: a.operand, b: b?.operand, x, y },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, a, b, type, x, y }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const firstTerm = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(x), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(a)));
-    const secondTerm = b
-        ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(y), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b)))
-        : new numberNode_1.NumberNode(y);
-    switch (type) {
-        case 1:
-            (0, exercise_1.tryToAddWrongProp)(propositions, new addNode_1.AddNode(new powerNode_1.SquareNode(firstTerm), new powerNode_1.SquareNode(secondTerm))
-                .simplify({ forbidFactorize: true })
-                .toTex());
-            while (propositions.length < n) {
-                (0, exercise_1.tryToAddWrongProp)(propositions, new addNode_1.AddNode(new numberNode_1.NumberNode((0, randint_1.randint)(1, 100)), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(1, 100)), real_1.SquareRootConstructor.randomIrreductible().toTree())).toTex());
-            }
-            break;
-        case 2:
-            (0, exercise_1.tryToAddWrongProp)(propositions, new substractNode_1.SubstractNode(new powerNode_1.SquareNode(firstTerm), new powerNode_1.SquareNode(secondTerm))
-                .simplify({ forbidFactorize: true })
-                .toTex());
-            while (propositions.length < n) {
-                (0, exercise_1.tryToAddWrongProp)(propositions, new substractNode_1.SubstractNode(new numberNode_1.NumberNode((0, randint_1.randint)(1, 100)), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(1, 100)), real_1.SquareRootConstructor.randomIrreductible().toTree())).toTex());
-            }
-            break;
-        case 3:
-        default:
-            (0, exercise_1.tryToAddWrongProp)(propositions, new substractNode_1.SubstractNode(new powerNode_1.SquareNode(secondTerm), new powerNode_1.SquareNode(firstTerm))
-                .simplify({ forbidFactorize: true })
-                .toTex());
-            while (propositions.length < n) {
-                (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-100, 100) + "");
-            }
-            break;
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { a, b, type, x, y }) => {
-    const firstTerm = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(x), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(a)));
-    const secondTerm = b
-        ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(y), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b)))
-        : new numberNode_1.NumberNode(y);
-    const answer = getAnswer(type, firstTerm, secondTerm);
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.squareRootIdentities = {
-    id: "squareRootIdentities",
-    connector: "=",
-    label: "Identités remarquables avec des racines carrées",
-    levels: ["2nde", "1reSpé"],
-    isSingleStep: true,
-    sections: ["Racines carrées", "Calcul littéral"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSquareRootIdentitiesQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/squareRoots/squareRootsDistributivity.d.ts

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

package/lib/exercises/squareRoots/squareRootsDistributivity.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"squareRootsDistributivity.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/squareRootsDistributivity.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAiEF,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,WAAW,CAa/D,CAAC"}