math-exercises 2.0.44 → 2.1.1

package/lib/exercises/math/calculLitteral/factorisation/factoIdRmq1.js

@@ -0,0 +1,57 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.factoIdRmq1 = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const affine_1 = require("../../../../math/polynomials/affine");
+const randint_1 = require("../../../../math/utils/random/randint");
+const numberNode_1 = require("../../../../tree/nodes/numbers/numberNode");
+const powerNode_1 = require("../../../../tree/nodes/operators/powerNode");
+const shuffle_1 = require("../../../../utils/shuffle");
+const getFactoType1Question = () => {
+    const affine = affine_1.AffineConstructor.random(undefined, {
+        excludes: [0],
+    });
+    const statementTree = affine.multiply(affine).toTree();
+    const answerTree = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
+    const answer = answerTree.toTex();
+    const question = {
+        instruction: `Factoriser : $${statementTree.toTex()}$`,
+        startStatement: statementTree.toTex(),
+        answer,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: { a: affine.a, b: affine.b },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, new powerNode_1.PowerNode(new affine_1.Affine(b, a).toTree(), new numberNode_1.NumberNode(2)).toTex());
+    while (propositions.length < n) {
+        const wrongAnswer = new powerNode_1.PowerNode(new affine_1.Affine(a + (0, randint_1.randint)(-a + 1, 10 - a), b + (0, randint_1.randint)(-b + 1, 10 - b)).toTree(), new numberNode_1.NumberNode(2));
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b }) => {
+    const affine = new affine_1.Affine(a, b);
+    const answerTree = new powerNode_1.SquareNode(affine.toTree());
+    const validLatexs = answerTree.toAllValidTexs();
+    return validLatexs.includes(ans);
+};
+exports.factoIdRmq1 = {
+    id: "factoIdRmq1",
+    connector: "=",
+    isSingleStep: false,
+    label: "Factorisation du type $a^2 + 2ab + b^2$",
+    levels: ["3ème", "2nde"],
+    sections: ["Calcul littéral"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFactoType1Question, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/calculLitteral/factorisation/factoIdRmq2.d.ts

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

package/lib/exercises/math/calculLitteral/factorisation/factoIdRmq2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"factoIdRmq2.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/factorisation/factoIdRmq2.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAWlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAuDF,eAAO,MAAM,WAAW,EAAE,QAAQ,CAAC,WAAW,CAa7C,CAAC"}

package/lib/exercises/math/calculLitteral/factorisation/factoIdRmq2.js

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.factoIdRmq2 = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const affine_1 = require("../../../../math/polynomials/affine");
+const randint_1 = require("../../../../math/utils/random/randint");
+const numberNode_1 = require("../../../../tree/nodes/numbers/numberNode");
+const powerNode_1 = require("../../../../tree/nodes/operators/powerNode");
+const shuffle_1 = require("../../../../utils/shuffle");
+const getFactoType1Question = () => {
+    const affine = affine_1.AffineConstructor.random({
+        min: 0,
+        max: 11,
+    }, { min: -10, max: 0 });
+    const statementTree = affine.multiply(affine).toTree();
+    const answerTree = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
+    const answer = answerTree.toTex();
+    const question = {
+        instruction: `Factoriser : $${statementTree.toTex()}$`,
+        startStatement: statementTree.toTex(),
+        answer,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: { a: affine.a, b: affine.b },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, new powerNode_1.PowerNode(new affine_1.Affine(-b, -a).toTree(), new numberNode_1.NumberNode(2)).toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, new powerNode_1.PowerNode(new affine_1.Affine(-a, b).toTree(), new numberNode_1.NumberNode(2)).toTex());
+    while (propositions.length < n) {
+        const wrongAnswer = new powerNode_1.PowerNode(new affine_1.Affine(a + (0, randint_1.randint)(-a + 1, 10 - a), b + (0, randint_1.randint)(-9 - b, -b)).toTree(), new numberNode_1.NumberNode(2));
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b }) => {
+    const affine = new affine_1.Affine(a, b);
+    const answerTree = new powerNode_1.SquareNode(affine.toTree());
+    const validLatexs = answerTree.toAllValidTexs();
+    return validLatexs.includes(ans);
+};
+exports.factoIdRmq2 = {
+    id: "factoIdRmq2",
+    connector: "=",
+    isSingleStep: false,
+    label: "Factorisation du type $a^2 - 2ab + b^2$",
+    levels: ["3ème", "2nde"],
+    sections: ["Calcul littéral"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFactoType1Question, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/calculLitteral/factorisation/factoIdRmq3.d.ts

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

package/lib/exercises/math/calculLitteral/factorisation/factoIdRmq3.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"factoIdRmq3.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/factorisation/factoIdRmq3.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB,CAAC;AAgFF,eAAO,MAAM,WAAW,EAAE,QAAQ,CAAC,WAAW,CAa7C,CAAC"}

package/lib/exercises/math/calculLitteral/factorisation/factoIdRmq3.js

@@ -0,0 +1,66 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.factoIdRmq3 = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const affine_1 = require("../../../../math/polynomials/affine");
+const randint_1 = require("../../../../math/utils/random/randint");
+const multiplyNode_1 = require("../../../../tree/nodes/operators/multiplyNode");
+const getFactoType1Question = () => {
+    const affine = affine_1.AffineConstructor.random({
+        min: 1,
+        max: 11,
+    }, { excludes: [0] });
+    const affine2 = new affine_1.Affine(affine.a, -affine.b);
+    const statementTree = affine.multiply(affine2).toTree();
+    const answerTree = new multiplyNode_1.MultiplyNode(affine.toTree(), affine2.toTree());
+    const answer = answerTree.toTex();
+    const question = {
+        instruction: `Factoriser : $${statementTree.toTex()}$`,
+        startStatement: statementTree.toTex(),
+        answer,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: {
+            affine1Coeffs: affine.coefficients,
+            affine2Coeffs: affine2.coefficients,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, affine1Coeffs, affine2Coeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const affine = new affine_1.Affine(affine1Coeffs[1], affine1Coeffs[0]);
+    const affine2 = new affine_1.Affine(affine2Coeffs[1], affine2Coeffs[0]);
+    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(affine.toTree(), affine.toTree()).toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(affine.toTree(), affine.toTree()).toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(affine2.toTree(), affine2.toTree()).toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(affine2.toTree(), new affine_1.Affine(-affine.b, affine.a).toTree()).toTex());
+    while (propositions.length < n) {
+        const wrongAnswer = new multiplyNode_1.MultiplyNode(new affine_1.Affine((0, randint_1.randint)(-9, 10, [0]), (0, randint_1.randint)(-9, 10, [0])).toTree(), new affine_1.Affine((0, randint_1.randint)(-9, 10, [0]), (0, randint_1.randint)(-9, 10, [0])).toTree());
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { affine1Coeffs, affine2Coeffs }) => {
+    const affine = new affine_1.Affine(affine1Coeffs[1], affine1Coeffs[0]);
+    const affine2 = new affine_1.Affine(affine2Coeffs[1], affine2Coeffs[0]);
+    const answerTree = new multiplyNode_1.MultiplyNode(affine.toTree(), affine2.toTree());
+    const validLatexs = answerTree.toAllValidTexs();
+    return validLatexs.includes(ans);
+};
+exports.factoIdRmq3 = {
+    id: "factoIdRmq3",
+    connector: "=",
+    isSingleStep: false,
+    label: "Factorisation du type $a^2 - b^2$",
+    levels: ["3ème", "2nde"],
+    sections: ["Calcul littéral"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFactoType1Question, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/calculLitteral/factorisation/factoType1Exercise.d.ts

@@ -0,0 +1,11 @@
+/**
+ *  type (ax+b)(cx+d) ± (ax+b)(ex+f)
+ */
+import { Exercise } from "../../../../exercises/exercise";
+type Identifiers = {
+    affinesCoeffs: number[][];
+    operation: string;
+};
+export declare const factoType1Exercise: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=factoType1Exercise.d.ts.map

package/lib/exercises/math/calculLitteral/factorisation/factoType1Exercise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"factoType1Exercise.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/factorisation/factoType1Exercise.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AASlC,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,MAAM,EAAE,EAAE,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAyHF,eAAO,MAAM,kBAAkB,EAAE,QAAQ,CAAC,WAAW,CAapD,CAAC"}

package/lib/exercises/math/calculLitteral/factorisation/factoType1Exercise.js

@@ -0,0 +1,92 @@
+"use strict";
+/**
+ *  type (ax+b)(cx+d) ± (ax+b)(ex+f)
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.factoType1Exercise = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const affine_1 = require("../../../../math/polynomials/affine");
+const addNode_1 = require("../../../../tree/nodes/operators/addNode");
+const multiplyNode_1 = require("../../../../tree/nodes/operators/multiplyNode");
+const substractNode_1 = require("../../../../tree/nodes/operators/substractNode");
+const random_1 = require("../../../../utils/random");
+const shuffle_1 = require("../../../../utils/shuffle");
+const getFactoType1Question = () => {
+    const affines = affine_1.AffineConstructor.differentRandoms(3);
+    const permut = [
+        (0, shuffle_1.shuffle)([affines[0], affines[1]]),
+        (0, shuffle_1.shuffle)([affines[0], affines[2]]),
+    ];
+    const operation = (0, random_1.random)(["add", "substract"]);
+    const statementTree = operation === "add"
+        ? new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(permut[0][0].toTree(), permut[0][1].toTree()), new multiplyNode_1.MultiplyNode(permut[1][0].toTree(), permut[1][1].toTree()))
+        : new substractNode_1.SubstractNode(new multiplyNode_1.MultiplyNode(permut[0][0].toTree(), permut[0][1].toTree()), new multiplyNode_1.MultiplyNode(permut[1][0].toTree(), permut[1][1].toTree()));
+    const affine1 = affines[0];
+    const affine2 = affines[1].add(operation === "add" ? affines[2] : affines[2].opposite());
+    const answerTree = affine2.coefficients[0] === 0
+        ? affine1.coefficients[0] === 0
+            ? affine1.multiply(affine2).toTree()
+            : new multiplyNode_1.MultiplyNode(affine2.toTree(), affine1.toTree())
+        : new multiplyNode_1.MultiplyNode(affine1.toTree(), affine2.toTree());
+    const answer = answerTree.toTex();
+    const question = {
+        instruction: `Factoriser : $${statementTree.toTex()}$`,
+        startStatement: statementTree.toTex(),
+        answer,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: {
+            affinesCoeffs: affines.map((affine) => affine.coefficients),
+            operation,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, affinesCoeffs, operation }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const affines = affinesCoeffs.map((coeffs) => new affine_1.Affine(coeffs[1], coeffs[0]));
+    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1]
+        .add(operation !== "add" ? affines[2] : affines[2].opposite())
+        .toTree()).toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(affines[1].toTree(), affines[0]
+        .add(operation === "add" ? affines[2] : affines[2].opposite())
+        .toTree()).toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(affines[2].toTree(), affines[0]
+        .add(operation === "add" ? affines[2] : affines[2].opposite())
+        .toTree()).toTex());
+    while (propositions.length < n) {
+        const wrongAnswer = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(affine_1.AffineConstructor.differentRandoms(1)[0]).toTree());
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { affinesCoeffs, operation }) => {
+    const affines = affinesCoeffs.map((coeffs) => new affine_1.Affine(coeffs[1], coeffs[0]));
+    const affine1 = affines[0];
+    const affine2 = affines[1].add(operation === "add" ? affines[2] : affines[2].opposite());
+    const answerTree = affine2.coefficients[0] === 0
+        ? affine1.coefficients[0] === 0
+            ? affine1.multiply(affine2).toTree()
+            : new multiplyNode_1.MultiplyNode(affine2.toTree(), affine1.toTree())
+        : new multiplyNode_1.MultiplyNode(affine1.toTree(), affine2.toTree());
+    const answer = answerTree.toTex();
+    const validLatexs = answerTree.toAllValidTexs();
+    console.log(ans, validLatexs);
+    return validLatexs.includes(ans);
+};
+exports.factoType1Exercise = {
+    id: "facto1",
+    connector: "=",
+    isSingleStep: false,
+    label: "Factorisation du type $(ax+b)(cx+d) \\pm (ax+b)(ex+f)$",
+    levels: ["3ème", "2nde"],
+    sections: ["Calcul littéral"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFactoType1Question, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/calculLitteral/factorisation/index.d.ts

@@ -0,0 +1,5 @@
+export * from "./factoIdRmq1";
+export * from "./factoIdRmq2";
+export * from "./factoIdRmq3";
+export * from "./factoType1Exercise";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/calculLitteral/factorisation/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/factorisation/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,sBAAsB,CAAC"}

package/lib/exercises/math/calculLitteral/factorisation/index.js

@@ -0,0 +1,20 @@
+"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("./factoIdRmq1"), exports);
+__exportStar(require("./factoIdRmq2"), exports);
+__exportStar(require("./factoIdRmq3"), exports);
+__exportStar(require("./factoType1Exercise"), exports);

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

@@ -0,0 +1,7 @@
+export * from "./distributivity";
+export * from "./equation";
+export * from "./factorisation";
+export * from "./inequations";
+export * from "./simplifying";
+export * from "./systems";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/calculLitteral/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC;AACjC,cAAc,YAAY,CAAC;AAC3B,cAAc,iBAAiB,CAAC;AAChC,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,WAAW,CAAC"}

package/lib/exercises/math/calculLitteral/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("./distributivity"), exports);
+__exportStar(require("./equation"), exports);
+__exportStar(require("./factorisation"), exports);
+__exportStar(require("./inequations"), exports);
+__exportStar(require("./simplifying"), exports);
+__exportStar(require("./systems"), exports);

package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType0.d.ts

@@ -0,0 +1,10 @@
+import { Exercise } from "../../../../exercises/exercise";
+import { InegalitySymbols } from "../../../../math/inequations/inequation";
+type Identifiers = {
+    b: number;
+    c: number;
+    ineqType: InegalitySymbols;
+};
+export declare const firstDegreeInequationsType0: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=firstDegreeInequationsType0.d.ts.map

package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType0.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"firstDegreeInequationsType0.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/inequations/firstDegreeInequationsType0.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AA4DF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAc7D,CAAC"}

package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType0.js

@@ -0,0 +1,65 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.firstDegreeInequationsType0 = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const inequationKeys_1 = require("../../../../exercises/utils/keys/inequationKeys");
+const inequation_1 = require("../../../../math/inequations/inequation");
+const affine_1 = require("../../../../math/polynomials/affine");
+const randint_1 = require("../../../../math/utils/random/randint");
+const inequationNode_1 = require("../../../../tree/nodes/inequations/inequationNode");
+const inequationSolutionNode_1 = require("../../../../tree/nodes/inequations/inequationSolutionNode");
+const numberNode_1 = require("../../../../tree/nodes/numbers/numberNode");
+const variableNode_1 = require("../../../../tree/nodes/variables/variableNode");
+const coinFlip_1 = require("../../../../utils/coinFlip");
+const shuffle_1 = require("../../../../utils/shuffle");
+/**x +b < c */
+const getFirstDegreeInequationsQuestion = () => {
+    const affine = new affine_1.Affine(1, (0, randint_1.randint)(-10, 11, [0]));
+    const c = (0, randint_1.randint)(-10, 11);
+    const result = c - affine.b;
+    const ineqType = inequation_1.InequationSymbolConstructor.random();
+    const answer = `x${ineqType.symbol}${result}`;
+    const question = {
+        answer: answer,
+        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType.symbol} ${c}$ `,
+        keys: inequationKeys_1.inequationKeys,
+        answerFormat: "tex",
+        identifiers: { ineqType: ineqType.symbol, b: affine.b, c },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, ineqType, b, c }) => {
+    const result = c - b;
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const ineqSymbol = new inequation_1.InequationSymbol(ineqType);
+    const invIneqType = ineqSymbol.reversed();
+    (0, exercise_1.tryToAddWrongProp)(propositions, `x${invIneqType}${result}`);
+    while (propositions.length < n) {
+        const wrongAnswer = `x${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType}${(0, randint_1.randint)(-10, 11)}`;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { answer, ineqType, b, c }) => {
+    const result = c - b;
+    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), new numberNode_1.NumberNode(result)], ineqType);
+    const tree = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval());
+    const texs = tree.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.firstDegreeInequationsType0 = {
+    id: "firstDegreeInequationsType0",
+    connector: "\\iff",
+    label: "Résoudre une inéquation du type $x+b<c$",
+    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
+    isSingleStep: true,
+    sections: ["Inéquations"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType1.d.ts

@@ -0,0 +1,10 @@
+import { Exercise } from "../../../../exercises/exercise";
+import { InegalitySymbols } from "../../../../math/inequations/inequation";
+type Identifiers = {
+    a: number;
+    b: number;
+    ineqType: InegalitySymbols;
+};
+export declare const firstDegreeInequationsType1: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=firstDegreeInequationsType1.d.ts.map

package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType1.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"firstDegreeInequationsType1.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/inequations/firstDegreeInequationsType1.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAS3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AAqEF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAe7D,CAAC"}

package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType1.js

@@ -0,0 +1,71 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.firstDegreeInequationsType1 = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const inequationKeys_1 = require("../../../../exercises/utils/keys/inequationKeys");
+const inequation_1 = require("../../../../math/inequations/inequation");
+const rational_1 = require("../../../../math/numbers/rationals/rational");
+const affine_1 = require("../../../../math/polynomials/affine");
+const randint_1 = require("../../../../math/utils/random/randint");
+const inequationNode_1 = require("../../../../tree/nodes/inequations/inequationNode");
+const inequationSolutionNode_1 = require("../../../../tree/nodes/inequations/inequationSolutionNode");
+const variableNode_1 = require("../../../../tree/nodes/variables/variableNode");
+const coinFlip_1 = require("../../../../utils/coinFlip");
+const shuffle_1 = require("../../../../utils/shuffle");
+/**ax<b */
+const getFirstDegreeInequationsQuestion = () => {
+    const affine = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, 1]), 0);
+    const b = (0, randint_1.randint)(-10, 11);
+    const result = new rational_1.Rational(b, affine.a).simplify().toTree().toTex();
+    const ineqType = inequation_1.InequationSymbolConstructor.random();
+    const invIneqType = ineqType.reversed();
+    const answer = `x${affine.a > 0 ? ineqType.symbol : invIneqType}${result}`;
+    const question = {
+        answer: answer,
+        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType.symbol} ${b}$ `,
+        keys: inequationKeys_1.inequationKeys,
+        answerFormat: "tex",
+        identifiers: { a: affine.a, b, ineqType: ineqType.symbol },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, ineqType, b }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const ineq = new inequation_1.InequationSymbol(ineqType);
+    const invIneqType = ineq.reversed();
+    const result = new rational_1.Rational(b, a).simplify().toTree().toTex();
+    (0, exercise_1.tryToAddWrongProp)(propositions, `x${a < 0 ? ineqType : invIneqType}${result}`);
+    while (propositions.length < n) {
+        const wrongAnswer = `x${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType}${(0, randint_1.randint)(-10, 11)}`;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, ineqType }) => {
+    const ineqSymbol = new inequation_1.InequationSymbol(ineqType);
+    const invIneqType = ineqSymbol.reversed();
+    const trueIneqType = a < 0 ? invIneqType : ineqType;
+    const result = new rational_1.Rational(b, a).simplify().toTree();
+    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), result], trueIneqType);
+    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval(), {
+        opts: { allowFractionToDecimal: true },
+    });
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.firstDegreeInequationsType1 = {
+    id: "firstDegreeInequationsType1",
+    connector: "\\iff",
+    getPropositions,
+    label: "Résoudre une inéquation du type $ax<b$",
+    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
+    isSingleStep: true,
+    sections: ["Inéquations"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType2.d.ts

@@ -0,0 +1,11 @@
+import { Exercise } from "../../../../exercises/exercise";
+import { InegalitySymbols } from "../../../../math/inequations/inequation";
+type Identifiers = {
+    ineqType: InegalitySymbols;
+    a: number;
+    b: number;
+    c: number;
+};
+export declare const firstDegreeInequationsType2: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=firstDegreeInequationsType2.d.ts.map

package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"firstDegreeInequationsType2.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/inequations/firstDegreeInequationsType2.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAc3C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAyEF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAc7D,CAAC"}