math-exercises 2.0.44 → 2.1.0

package/lib/exercises/math/sequences/recurrenceFormulaUsage.js

@@ -0,0 +1,56 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.recurrenceFormulaUsage = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../../math/polynomials/polynomial");
+const randint_1 = require("../../../math/utils/random/randint");
+const getRecurrenceFormulaUsageQuestion = () => {
+    const coeffs = [(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-3, 4, [0])];
+    const u = new polynomial_1.Polynomial(coeffs, "u_n");
+    const u0 = (0, randint_1.randint)(-2, 3, [0]);
+    const rank = (0, randint_1.randint)(1, 4);
+    let currentValue = u0;
+    for (let i = 0; i < rank; i++) {
+        currentValue = u.calculate(currentValue);
+    }
+    const answer = currentValue + "";
+    const question = {
+        answer,
+        instruction: `Soit $u$ la suite définie par $u_0 = ${u0}$ et pour tout $n\\geq 1$, $u_{n+1} = ${u
+            .toTree()
+            .toTex()}$. Calculer $u_${rank}$.`,
+        keys: ["u", "underscore", "equal"],
+        answerFormat: "tex",
+        identifiers: { rank, u0, coeffs },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, rank, u0, coeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const u = new polynomial_1.Polynomial(coeffs, "u_n");
+    (0, exercise_1.tryToAddWrongProp)(propositions, u.calculate(rank) + "");
+    while (propositions.length < n) {
+        const wrongAnswer = (0, randint_1.randint)(-100, 100) + "";
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, rank }) => {
+    return [answer, `u_{${rank}}=${answer}`, `u_${rank}=${answer}`].includes(ans);
+};
+exports.recurrenceFormulaUsage = {
+    id: "recurrenceFormulaUsage",
+    connector: "=",
+    label: "Utiliser la formule de récurrence d'une suite",
+    levels: ["1reESM", "1reSpé", "1reTech"],
+    isSingleStep: true,
+    sections: ["Suites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getRecurrenceFormulaUsageQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/sets/index.d.ts

@@ -0,0 +1,3 @@
+export * from "./intervals";
+export * from "./setBelonging";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/sets/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/sets/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC"}

package/lib/exercises/math/sets/index.js

@@ -0,0 +1,18 @@
+"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("./intervals"), exports);
+__exportStar(require("./setBelonging"), exports);

package/lib/exercises/math/sets/intervals/index.d.ts

@@ -0,0 +1,4 @@
+export * from "./inequalityToInterval";
+export * from "./intervalsIntersection";
+export * from "./intervalsUnion";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/sets/intervals/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,yBAAyB,CAAC;AACxC,cAAc,kBAAkB,CAAC"}

package/lib/exercises/math/sets/intervals/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("./inequalityToInterval"), exports);
+__exportStar(require("./intervalsIntersection"), exports);
+__exportStar(require("./intervalsUnion"), exports);

package/lib/exercises/math/sets/intervals/inequalityToInterval.d.ts

@@ -0,0 +1,11 @@
+import { Exercise } from "../../../../exercises/exercise";
+import { ClosureType } from "../../../../tree/nodes/sets/closure";
+type Identifiers = {
+    isIntervalToInequality: boolean;
+    intervalMin: number;
+    intervalMax: number;
+    intervalClosure: ClosureType;
+};
+export declare const inequalityToInterval: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=inequalityToInterval.d.ts.map

package/lib/exercises/math/sets/intervals/inequalityToInterval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inequalityToInterval.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/inequalityToInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AASlC,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAK5D,KAAK,WAAW,GAAG;IACjB,sBAAsB,EAAE,OAAO,CAAC;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,WAAW,CAAC;CAC9B,CAAC;AA8KF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CActD,CAAC"}

package/lib/exercises/math/sets/intervals/inequalityToInterval.js

@@ -0,0 +1,149 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.inequalityToInterval = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const intervals_1 = require("../../../../math/sets/intervals/intervals");
+const inequationNode_1 = require("../../../../tree/nodes/inequations/inequationNode");
+const numberNode_1 = require("../../../../tree/nodes/numbers/numberNode");
+const belongsNode_1 = require("../../../../tree/nodes/sets/belongsNode");
+const variableNode_1 = require("../../../../tree/nodes/variables/variableNode");
+const coinFlip_1 = require("../../../../utils/coinFlip");
+const shuffle_1 = require("../../../../utils/shuffle");
+const getInequalityToIntervalQuestion = () => {
+    const isIntervalToInequality = (0, coinFlip_1.coinFlip)();
+    const interval = intervals_1.IntervalConstructor.random();
+    const inequalityString = interval.toInequality();
+    const answer = isIntervalToInequality
+        ? inequalityString
+        : `x\\in${interval.toTex()}`;
+    const instruction = isIntervalToInequality
+        ? `Soit $x \\in ${interval.toTex()}$. Traduire cette appartenance en une inégalité.`
+        : `Soit $${inequalityString}$. Traduire cette inégalité en appartenance à un intervalle.`;
+    const question = {
+        answer,
+        instruction: instruction,
+        keys: [
+            "x",
+            "belongs",
+            "inf",
+            "sup",
+            "geq",
+            "leq",
+            "lbracket",
+            "rbracket",
+            "semicolon",
+            "infty",
+        ],
+        answerFormat: "tex",
+        identifiers: {
+            isIntervalToInequality: isIntervalToInequality,
+            intervalMin: interval.min,
+            intervalMax: interval.max,
+            intervalClosure: interval.closure,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, isIntervalToInequality, intervalClosure, intervalMax, intervalMin }) => {
+    const reverseBracket = (bracket) => {
+        return bracket === "[" ? "]" : "[";
+    };
+    const switchInclusion = (symbol) => {
+        if (symbol === "\\le")
+            return "<";
+        if (symbol === "<")
+            return "\\le";
+        if (symbol === ">")
+            return "\\ge";
+        return ">";
+    };
+    const reverseInequality = (symbol) => {
+        if (symbol === "\\le")
+            return "\\ge";
+        if (symbol === "<")
+            return ">";
+        if (symbol === ">")
+            return "<";
+        return "\\le";
+    };
+    const interval = new intervals_1.Interval(intervalMin.toTree(), intervalMax.toTree(), intervalClosure);
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const xNode = new variableNode_1.VariableNode("x");
+    if (isIntervalToInequality) {
+        let wrongIneqs = [];
+        if (interval.min === -Infinity) {
+            wrongIneqs = [
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], switchInclusion(interval.rightInequalitySymbol)),
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], reverseInequality(switchInclusion(interval.rightInequalitySymbol))),
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], reverseInequality(interval.rightInequalitySymbol)),
+            ];
+        }
+        else if (interval.max === Infinity) {
+            wrongIneqs = [
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], switchInclusion(interval.leftInequalitySymbol)),
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], reverseInequality(switchInclusion(interval.leftInequalitySymbol))),
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], reverseInequality(interval.leftInequalitySymbol)),
+            ];
+        }
+        else {
+            wrongIneqs = [
+                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
+                    switchInclusion(interval.leftInequalitySymbol),
+                    interval.rightInequalitySymbol,
+                ]),
+                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
+                    interval.leftInequalitySymbol,
+                    switchInclusion(interval.rightInequalitySymbol),
+                ]),
+                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
+                    switchInclusion(interval.leftInequalitySymbol),
+                    switchInclusion(interval.rightInequalitySymbol),
+                ]),
+            ];
+        }
+        wrongIneqs.forEach((ineq) => {
+            (0, exercise_1.addWrongProp)(propositions, ineq.toTex());
+        });
+    }
+    else {
+        const wrongStatements = [
+            `x\\in${reverseBracket(interval.leftBracket)}${interval.insideToTex()}${interval.rightBracket}`,
+            `x\\in${interval.leftBracket}${interval.insideToTex()}${reverseBracket(interval.rightBracket)}`,
+            `x\\in${reverseBracket(interval.leftBracket)}${interval.insideToTex()}${reverseBracket(interval.rightBracket)}`,
+        ];
+        wrongStatements.forEach((ineq) => {
+            (0, exercise_1.addWrongProp)(propositions, ineq);
+        });
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { intervalClosure, intervalMax, intervalMin, isIntervalToInequality }) => {
+    const interval = new intervals_1.Interval(intervalMin.toTree(), intervalMax.toTree(), intervalClosure).toTree();
+    console.log("int", interval.toTex());
+    const inequality = interval.toInequality();
+    const answer = isIntervalToInequality
+        ? inequality
+        : new belongsNode_1.BelongsNode(new variableNode_1.VariableNode("x"), interval, {
+            allowRawRightChildAsSolution: true,
+        });
+    console.log("ans", answer);
+    const texs = answer.toAllValidTexs();
+    console.log("texs", texs);
+    return texs.includes(ans);
+};
+exports.inequalityToInterval = {
+    id: "inequalityToInterval",
+    connector: "=",
+    label: "Traduire une inégalité en intervalle",
+    levels: ["2ndPro", "2nde", "CAP", "1reESM"],
+    isSingleStep: true,
+    sections: ["Ensembles et intervalles"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInequalityToIntervalQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

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

@@ -0,0 +1,13 @@
+import { Exercise } 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: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=intervalsIntersection.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"intervalsIntersection.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/intervalsIntersection.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,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,QAAQ,CAAC,WAAW,CAcvD,CAAC"}

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

@@ -0,0 +1,64 @@
+"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,
+    subject: "Mathématiques",
+};

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

@@ -0,0 +1,13 @@
+import { Exercise } 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: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=intervalsUnion.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"intervalsUnion.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/intervalsUnion.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,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,QAAQ,CAAC,WAAW,CAchD,CAAC"}

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

@@ -0,0 +1,56 @@
+"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,
+    subject: "Mathématiques",
+};

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

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

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

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

package/lib/exercises/math/sets/setBelonging.js

@@ -0,0 +1,85 @@
+"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,
+    subject: "Mathématiques",
+};

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/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/math/squareRoots/index.js

@@ -0,0 +1,21 @@
+"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/math/squareRoots/simpifySquareRoot.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"simpifySquareRoot.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/squareRoots/simpifySquareRoot.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,QAAQ,EAQT,MAAM,gBAAgB,CAAC;AAExB,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,CAAC;CACrB,CAAC;AA0CF,eAAO,MAAM,kBAAkB,EAAE,QAAQ,CAAC,WAAW,CAapD,CAAC"}

package/lib/exercises/math/squareRoots/simpifySquareRoot.js

@@ -0,0 +1,55 @@
+"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,
+    subject: "Mathématiques",
+};

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

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

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

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