math-exercises 2.0.44 → 2.1.0

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

@@ -0,0 +1,74 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.firstDegreeInequationsType2 = 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<c */
+const getFirstDegreeInequationsQuestion = () => {
+    const affine = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, 1]), (0, randint_1.randint)(-10, 10, [0]));
+    const c = (0, randint_1.randint)(-10, 11);
+    const result = new rational_1.Rational(c - affine.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} ${c}$ `,
+        keys: inequationKeys_1.inequationKeys,
+        answerFormat: "tex",
+        identifiers: { a: affine.a, b: affine.b, c, ineqType: ineqType.symbol },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, ineqType, b, c }) => {
+    const result = new rational_1.Rational(c - b, a).simplify().toTree().toTex();
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const ineq = new inequation_1.InequationSymbol(ineqType);
+    const invIneqType = ineq.reversed();
+    (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, c, ineqType }) => {
+    const ineqSymbol = new inequation_1.InequationSymbol(ineqType);
+    const invIneqType = ineqSymbol.reversed();
+    const trueIneqType = a < 0 ? invIneqType : ineqType;
+    const result = new rational_1.Rational(c - 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.firstDegreeInequationsType2 = {
+    id: "firstDegreeInequationsType2",
+    connector: "\\iff",
+    getPropositions,
+    isAnswerValid,
+    label: "Résoudre une inéquation du type $ax+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,
+    subject: "Mathématiques",
+};

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

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

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

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

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

@@ -0,0 +1,83 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.firstDegreeInequationsType3 = 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<cx+d */
+const getFirstDegreeInequationsQuestion = () => {
+    const affine1 = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0]), (0, randint_1.randint)(-10, 10));
+    const affine2 = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, affine1.a]), (0, randint_1.randint)(-10, 10));
+    const result = new rational_1.Rational(affine2.b - affine1.b, affine1.a - affine2.a)
+        .simplify()
+        .toTree()
+        .toTex();
+    const coeff = affine1.a - affine2.a;
+    const ineqType = inequation_1.InequationSymbolConstructor.random();
+    const invIneqType = ineqType.reversed();
+    const answer = `x${coeff > 0 ? ineqType.symbol : invIneqType}${result}`;
+    const question = {
+        answer: answer,
+        instruction: `Résoudre l'inéquation : $${affine1.toTex()} ${ineqType.symbol} ${affine2.toTex()}$ `,
+        keys: inequationKeys_1.inequationKeys,
+        answerFormat: "tex",
+        identifiers: {
+            coeff,
+            ineqType: ineqType.symbol,
+            a: affine1.a,
+            b: affine1.b,
+            c: affine2.a,
+            d: affine2.b,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, coeff, ineqType, a, b, c, d }) => {
+    const result = new rational_1.Rational(d - b, a - c).simplify().toTree().toTex();
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const ineq = new inequation_1.InequationSymbol(ineqType);
+    const invIneqType = ineq.reversed();
+    (0, exercise_1.tryToAddWrongProp)(propositions, `x${coeff < 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, c, d, ineqType }) => {
+    const ineqSymbol = new inequation_1.InequationSymbol(ineqType);
+    const invIneqType = ineqSymbol.reversed();
+    const trueIneqType = a - c < 0 ? invIneqType : ineqType;
+    const result = new rational_1.Rational(d - b, a - c).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();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.firstDegreeInequationsType3 = {
+    id: "firstDegreeInequationsType3",
+    connector: "\\iff",
+    label: "Résoudre une inéquation du type $ax+b<cx+d$",
+    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/index.d.ts

@@ -0,0 +1,6 @@
+export * from "./firstDegreeInequationsType0";
+export * from "./firstDegreeInequationsType1";
+export * from "./firstDegreeInequationsType2";
+export * from "./firstDegreeInequationsType3";
+export * from "./squareFunctionInequation";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/inequations/index.ts"],"names":[],"mappings":"AAAA,cAAc,+BAA+B,CAAC;AAC9C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,+BAA+B,CAAC;AAE9C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,4BAA4B,CAAC"}

package/lib/exercises/math/calculLitteral/inequations/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("./firstDegreeInequationsType0"), exports);
+__exportStar(require("./firstDegreeInequationsType1"), exports);
+__exportStar(require("./firstDegreeInequationsType2"), exports);
+__exportStar(require("./firstDegreeInequationsType3"), exports);
+__exportStar(require("./squareFunctionInequation"), exports);

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"squareFunctionInequation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/inequations/squareFunctionInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAc3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,gBAAgB,EAAE,gBAAgB,CAAC;CACpC,CAAC;AAoEF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAa1D,CAAC"}

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

@@ -0,0 +1,66 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.squareFunctionInequation = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const inequation_1 = require("../../../../math/inequations/inequation");
+const randint_1 = require("../../../../math/utils/random/randint");
+const oppositeNode_1 = require("../../../../tree/nodes/functions/oppositeNode");
+const sqrtNode_1 = require("../../../../tree/nodes/functions/sqrtNode");
+const inequationSolutionNode_1 = require("../../../../tree/nodes/inequations/inequationSolutionNode");
+const closure_1 = require("../../../../tree/nodes/sets/closure");
+const intervalNode_1 = require("../../../../tree/nodes/sets/intervalNode");
+const coinFlip_1 = require("../../../../utils/coinFlip");
+const getAnswer = (k, ineqSymbol) => {
+    const sqrt = Math.sqrt(k);
+    const sqrtTree = Math.floor(sqrt) === sqrt ? sqrt.toTree() : new sqrtNode_1.SqrtNode(k.toTree());
+    const inequationSymbol = new inequation_1.InequationSymbol(ineqSymbol);
+    const isStrict = inequationSymbol.isStrict;
+    const insideInterval = new intervalNode_1.IntervalNode(new oppositeNode_1.OppositeNode(sqrtTree), sqrtTree, isStrict ? closure_1.ClosureType.OO : closure_1.ClosureType.FF);
+    const set = inequationSymbol.isSup
+        ? insideInterval.toReversedClosure().toComplement()
+        : insideInterval;
+    const solution = new inequationSolutionNode_1.InequationSolutionNode(set);
+    return solution;
+};
+const getSquareFunctionInequationQuestion = () => {
+    const k = (0, coinFlip_1.coinFlip)() ? (0, randint_1.randint)(1, 11) ** 2 : (0, randint_1.randint)(1, 100);
+    const inequationSymbol = inequation_1.InequationSymbolConstructor.random();
+    const solution = getAnswer(k, inequationSymbol.symbol);
+    const question = {
+        answer: solution.toTex(),
+        instruction: `Résoudre l'inéquation suivante : $x^2 ${inequationSymbol.symbol} ${k}$`,
+        keys: ["S", "equal", "lbracket", "rbracket", "semicolon", "infty", "cup"],
+        answerFormat: "tex",
+        identifiers: { k, inequationSymbol: inequationSymbol.symbol },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, k, inequationSymbol }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer(k ** 2, inequationSymbol).toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer(k, new inequation_1.InequationSymbol(inequationSymbol).reversed()).toTex());
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer((0, randint_1.randint)(1, 100), inequationSymbol).toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, k, inequationSymbol }) => {
+    const solution = getAnswer(k, inequationSymbol);
+    const texs = solution.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.squareFunctionInequation = {
+    id: "squareFunctionInequation",
+    label: "Résoudre une inéquation du type $x^2 < k$",
+    levels: ["2nde"],
+    isSingleStep: true,
+    sections: ["Fonctions de référence", "Inéquations"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSquareFunctionInequationQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/calculLitteral/simplifying/distributeAndSimplify.d.ts

@@ -0,0 +1,14 @@
+import { Exercise } from "../../../../exercises/exercise";
+type Identifiers = {
+    firstTermIsAffine: boolean;
+    a: number;
+    b: number;
+    c: number;
+    d: number;
+    e: number;
+    f: number;
+    g: number;
+};
+export declare const distributeAndSimplify: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=distributeAndSimplify.d.ts.map

package/lib/exercises/math/calculLitteral/simplifying/distributeAndSimplify.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"distributeAndSimplify.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/simplifying/distributeAndSimplify.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,iBAAiB,EAAE,OAAO,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA2DF,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAAC,WAAW,CAcvD,CAAC"}

package/lib/exercises/math/calculLitteral/simplifying/distributeAndSimplify.js

@@ -0,0 +1,68 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.distributeAndSimplify = 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 addNode_1 = require("../../../../tree/nodes/operators/addNode");
+const multiplyNode_1 = require("../../../../tree/nodes/operators/multiplyNode");
+const coinFlip_1 = require("../../../../utils/coinFlip");
+//[a]|[b*(cx+d)] +- e*(fx+g)]
+// c & f > 0
+const getDistributeAndSimplifyQuestion = () => {
+    const firstTermIsAffine = (0, coinFlip_1.coinFlip)();
+    const a = (0, randint_1.randint)(-5, 6, [0]);
+    const b = (0, randint_1.randint)(-5, 6, [0]);
+    const c = (0, randint_1.randint)(1, 6);
+    const d = (0, randint_1.randint)(-5, 6, [0]);
+    const e = (0, randint_1.randint)(-5, 6, [0, 1]);
+    let f = 0;
+    do {
+        f = (0, randint_1.randint)(1, 6);
+    } while (b * c + e * f === 0);
+    const g = (0, randint_1.randint)(-5, 6, [0]);
+    const statement = new addNode_1.AddNode(firstTermIsAffine
+        ? new multiplyNode_1.MultiplyNode(b.toTree(), new affine_1.Affine(c, d).toTree())
+        : a.toTree(), new multiplyNode_1.MultiplyNode(e.toTree(), new affine_1.Affine(f, g).toTree())).simplify();
+    const answer = firstTermIsAffine
+        ? new affine_1.Affine(b * c + e * f, b * d + e * g).toTree().toTex()
+        : new affine_1.Affine(e * f, a + e * g).toTree().toTex();
+    const question = {
+        answer,
+        instruction: `Développer et réduire : $${statement.toTex()}$`,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: { firstTermIsAffine, a, b, c, d, e, f, g },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, affine_1.AffineConstructor.random().toTree().toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, firstTermIsAffine, a, b, c, d, e, f, g }) => {
+    const answerNode = firstTermIsAffine
+        ? new affine_1.Affine(b * c + e * f, b * d + e * g).toTree()
+        : new affine_1.Affine(e * f, a + e * g).toTree();
+    const texs = answerNode.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.distributeAndSimplify = {
+    id: "distributeAndSimplify",
+    connector: "=",
+    label: "Développer et réduire une expression",
+    levels: ["4ème", "3ème", "2nde"],
+    isSingleStep: true,
+    sections: ["Calcul littéral"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDistributeAndSimplifyQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/calculLitteral/simplifying/evaluateExpression.d.ts

@@ -0,0 +1,10 @@
+import { Exercise } from "../../../../exercises/exercise";
+type Identifiers = {
+    rand: boolean;
+    poly1: number[];
+    poly2: number[];
+    xValue: number;
+};
+export declare const evaluateExpression: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=evaluateExpression.d.ts.map

package/lib/exercises/math/calculLitteral/simplifying/evaluateExpression.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluateExpression.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/simplifying/evaluateExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAOlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,OAAO,CAAC;IACd,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAmDF,eAAO,MAAM,kBAAkB,EAAE,QAAQ,CAAC,WAAW,CAapD,CAAC"}

package/lib/exercises/math/calculLitteral/simplifying/evaluateExpression.js

@@ -0,0 +1,64 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.evaluateExpression = 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 coinFlip_1 = require("../../../../utils/coinFlip");
+const shuffle_1 = require("../../../../utils/shuffle");
+const getEvaluateExpression = () => {
+    const rand = (0, coinFlip_1.coinFlip)();
+    const polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-5, 6, [0])]);
+    const polynome2 = new polynomial_1.Polynomial([
+        (0, randint_1.randint)(-9, 10),
+        (0, randint_1.randint)(-9, 10),
+        (0, randint_1.randint)(-4, 5, [0]),
+    ]);
+    const xValue = (0, randint_1.randint)(-9, 10);
+    const statement = rand
+        ? `Calculer $${polynome1.toTree().toTex()}$ pour $x = ${xValue}$.`
+        : `Calculer $${polynome2.toTree().toTex()}$ pour $x = ${xValue}$.`;
+    const answer = rand
+        ? polynome1.calculate(xValue) + ""
+        : polynome2.calculate(xValue) + "";
+    const question = {
+        instruction: statement,
+        answer,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: {
+            rand,
+            poly1: polynome1.coefficients,
+            poly2: polynome2.coefficients,
+            xValue,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const wrongAnswer = Number(answer) + (0, randint_1.randint)(-10, 11, [0]);
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer + "");
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+exports.evaluateExpression = {
+    id: "evaluateExpression",
+    connector: "=",
+    label: "Evaluer une expression",
+    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro"],
+    sections: ["Calcul littéral"],
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEvaluateExpression, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

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

@@ -0,0 +1,4 @@
+export * from "./evaluateExpression";
+export * from "./reduceExpression";
+export * from "./distributeAndSimplify";
+//# sourceMappingURL=index.d.ts.map

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

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

package/lib/exercises/math/calculLitteral/simplifying/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("./evaluateExpression"), exports);
+__exportStar(require("./reduceExpression"), exports);
+__exportStar(require("./distributeAndSimplify"), exports);

package/lib/exercises/math/calculLitteral/simplifying/reduceExpression.d.ts

@@ -0,0 +1,9 @@
+import { Exercise } from "../../../../exercises/exercise";
+type Identifiers = {
+    rand: number;
+    polynome1Coeffs: number[];
+    polynome2Coeffs: number[];
+};
+export declare const reduceExpression: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=reduceExpression.d.ts.map

package/lib/exercises/math/calculLitteral/simplifying/reduceExpression.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduceExpression.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/simplifying/reduceExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC;AAkHF,eAAO,MAAM,gBAAgB,EAAE,QAAQ,CAAC,WAAW,CAalD,CAAC"}

package/lib/exercises/math/calculLitteral/simplifying/reduceExpression.js

@@ -0,0 +1,115 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reduceExpression = 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 addNode_1 = require("../../../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../../../utils/shuffle");
+const getReduceExpression = () => {
+    const rand = (0, randint_1.randint)(0, 7);
+    let polynome1;
+    let polynome2;
+    switch (rand) {
+        case 0: // ax + b + cx + d
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 1:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 2:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 3:
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 4:
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
+            polynome2 = new polynomial_1.Polynomial([0, 0, (0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 5:
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        case 6:
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
+            break;
+        default:
+            throw Error("something went wrong");
+    }
+    const statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+    statement.shuffle();
+    const statementTex = statement.toTex();
+    const answer = polynome1.add(polynome2).toTree().toTex();
+    const question = {
+        instruction: `Réduire l'expression suivante : $${statementTex}$`,
+        startStatement: statementTex,
+        answer,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: {
+            rand,
+            polynome1Coeffs: polynome1.coefficients,
+            polynome2Coeffs: polynome2.coefficients,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, rand, polynome1Coeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const polynome1 = new polynomial_1.Polynomial(polynome1Coeffs);
+    while (propositions.length < n) {
+        const polynome2 = new polynomial_1.Polynomial(rand < 3
+            ? [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]
+            : [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]);
+        (0, exercise_1.tryToAddWrongProp)(propositions, polynome1.add(polynome2).toTree().toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { polynome1Coeffs, polynome2Coeffs, rand }) => {
+    const polynome1 = new polynomial_1.Polynomial(polynome1Coeffs);
+    const polynome2 = new polynomial_1.Polynomial(polynome2Coeffs);
+    const answer = polynome1
+        .add(polynome2)
+        .toTree({ forbidPowerToProduct: true });
+    const texs = answer.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.reduceExpression = {
+    id: "reduceExpression",
+    connector: "=",
+    isSingleStep: false,
+    label: "Réduire une expression",
+    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro"],
+    sections: ["Calcul littéral"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getReduceExpression, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/calculLitteral/systems/basicNiceValuesSystemResolution.d.ts

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

package/lib/exercises/math/calculLitteral/systems/basicNiceValuesSystemResolution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"basicNiceValuesSystemResolution.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/systems/basicNiceValuesSystemResolution.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAOlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,QAAQ,EAAE,OAAO,CAAC;CACnB,CAAC;AA8CF,eAAO,MAAM,+BAA+B,EAAE,QAAQ,CAAC,WAAW,CAcjE,CAAC"}