math-exercises 2.1.25 → 2.1.26

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"distributeAndSimplify.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/distributeAndSimplify.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,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,YAAY,CAAC,WAAW,CAa3D,CAAC"}

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

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

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"evaluateExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/evaluateExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,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,YAAY,CAAC,WAAW,CAYxD,CAAC"}

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

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

package/lib/exercises/calculLitteral/simplifying/expSimplifiying.d.ts

@@ -0,0 +1,10 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    random: number;
+    a?: number;
+    uCoeffs: number[];
+    vCoeffs: number[];
+};
+export declare const expSimplifiying: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=expSimplifiying.d.ts.map

package/lib/exercises/calculLitteral/simplifying/expSimplifiying.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expSimplifiying.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/expSimplifiying.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAclC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB,CAAC;AAmIF,eAAO,MAAM,eAAe,EAAE,YAAY,CAAC,WAAW,CAYrD,CAAC"}

package/lib/exercises/calculLitteral/simplifying/expSimplifiying.js

@@ -0,0 +1,116 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.expSimplifiying = 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 expNode_1 = require("../../../tree/nodes/functions/expNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getExpSimplifiying = () => {
+    const random = (0, randint_1.randint)(1, 4);
+    let a;
+    let u, v;
+    let expression;
+    let answer;
+    switch (random) {
+        case 1:
+            //e^u*e^a / e^v
+            a = (0, randint_1.randint)(-9, 10, [0]);
+            u = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-9, 10, [0])]);
+            v = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            expression = new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new expNode_1.ExpNode(u.toTree()), new expNode_1.ExpNode(new numberNode_1.NumberNode(a))), new expNode_1.ExpNode(v.toTree()));
+            answer = new expNode_1.ExpNode(u.add(a).add(v.opposite()).toTree()).toTex();
+            break;
+        case 2:
+            //e^u * e^v
+            u = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            v = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            expression = new multiplyNode_1.MultiplyNode(new expNode_1.ExpNode(u.toTree()), new expNode_1.ExpNode(v.toTree()));
+            expression.shuffle();
+            answer = new expNode_1.ExpNode(u.add(v).toTree()).toTex();
+            break;
+        case 3:
+            //e^u / e^v
+            u = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            v = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            expression = new fractionNode_1.FractionNode(new expNode_1.ExpNode(u.toTree()), new expNode_1.ExpNode(v.toTree()));
+            answer = new expNode_1.ExpNode(u.add(v.opposite()).toTree()).toTex();
+            break;
+        default:
+            throw Error("something wrong happened");
+    }
+    const question = {
+        instruction: `Simplifier l'expression $${expression.toTex()}$.`,
+        answer,
+        keys: ["x", "epower", "exp"],
+        answerFormat: "tex",
+        identifiers: {
+            random,
+            a,
+            uCoeffs: u.coefficients,
+            vCoeffs: v.coefficients,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, random, a, uCoeffs, vCoeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const u = new polynomial_1.Polynomial(uCoeffs);
+    const v = new polynomial_1.Polynomial(vCoeffs);
+    switch (random) {
+        case 1:
+            (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(u.times(a).add(v.opposite()).toTree()).toTex());
+            break;
+        case 2:
+            (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(u.multiply(v).toTree()).toTex());
+            break;
+        case 3:
+            (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(new fractionNode_1.FractionNode(u.toTree(), v.toTree())).toTex());
+            (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(u.add(v).toTree()).toTex());
+            break;
+        default:
+            throw Error("received wrong quesiton type");
+    }
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(polynomial_1.PolynomialConstructor.randomWithOrder(1).toTree()).toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, random, uCoeffs, vCoeffs }) => {
+    const u = new polynomial_1.Polynomial(uCoeffs);
+    const v = new polynomial_1.Polynomial(vCoeffs);
+    let answer;
+    switch (random) {
+        case 1:
+            answer = new expNode_1.ExpNode(u.add(a).add(v.opposite()).toTree());
+            break;
+        case 2:
+            answer = new expNode_1.ExpNode(u.add(v).toTree());
+            break;
+        case 3:
+            answer = new expNode_1.ExpNode(u.add(v.opposite()).toTree());
+            break;
+        default:
+            throw Error("wrong random in exp simplifying");
+    }
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.expSimplifiying = {
+    id: "expSimplifiying",
+    connector: "\\iff",
+    label: "Simplifier des expressions avec l'exponentielle",
+    levels: ["1reSpé", "TermSpé", "MathComp"],
+    sections: ["Exponentielle"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpSimplifiying, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/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/calculLitteral/simplifying/index.d.ts.map

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

package/lib/exercises/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/calculLitteral/simplifying/logSimplifiying.d.ts

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

package/lib/exercises/calculLitteral/simplifying/logSimplifiying.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logSimplifiying.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/logSimplifiying.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAqEF,eAAO,MAAM,eAAe,EAAE,YAAY,CAAC,WAAW,CAYrD,CAAC"}

package/lib/exercises/calculLitteral/simplifying/logSimplifiying.js

@@ -0,0 +1,77 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.logSimplifiying = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const randint_1 = require("../../../math/utils/random/randint");
+const logNode_1 = require("../../../tree/nodes/functions/logNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const substractNode_1 = require("../../../tree/nodes/operators/substractNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const getExpSimplifiying = () => {
+    let expression;
+    let simplifiedExpression;
+    let pm = (0, coinFlip_1.coinFlip)() ? 1 : -1;
+    const a = (0, randint_1.randint)(1, 10);
+    let b;
+    do {
+        b = (0, randint_1.randint)(1, 10);
+    } while (pm === -1 && a === b);
+    const opts = { allowLnOfOne: true };
+    if (pm === 1) {
+        expression = new addNode_1.AddNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a), opts), new logNode_1.LogNode(new numberNode_1.NumberNode(b), opts));
+        simplifiedExpression = new logNode_1.LogNode(new numberNode_1.NumberNode(a * b));
+    }
+    else {
+        expression = new substractNode_1.SubstractNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a), opts), new logNode_1.LogNode(new numberNode_1.NumberNode(b), opts));
+        simplifiedExpression = new logNode_1.LogNode(new rational_1.Rational(a, b).simplify().toTree());
+    }
+    const answer = simplifiedExpression.toTex();
+    const question = {
+        instruction: `Simplifier l'expression $${expression.toTex()}$.`,
+        answer,
+        keys: ["ln"],
+        answerFormat: "tex",
+        identifiers: { pm, a, b },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, pm }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const a = (0, randint_1.randint)(1, 10);
+        const b = (0, randint_1.randint)(1, 10);
+        (0, exercise_1.tryToAddWrongProp)(propositions, pm > 0
+            ? new logNode_1.LogNode(new numberNode_1.NumberNode(a * b)).toTex()
+            : new logNode_1.LogNode(new rational_1.Rational(a, b).simplify().toTree()).toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, pm }) => {
+    let answer;
+    if (pm === 1) {
+        answer = new logNode_1.LogNode(new numberNode_1.NumberNode(a * b));
+    }
+    else {
+        answer = new logNode_1.LogNode(new rational_1.Rational(a, b).simplify().toTree({ allowFractionToDecimal: true }));
+    }
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.logSimplifiying = {
+    id: "logSimplifiying",
+    connector: "\\iff",
+    label: "Simplifier des expressions avec $\\ln$",
+    levels: ["1reSpé", "TermSpé", "MathComp"],
+    sections: ["Logarithme népérien"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpSimplifiying, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"reduceExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/reduceExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,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,YAAY,CAAC,WAAW,CAYtD,CAAC"}

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

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

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"basicNiceValuesSystemResolution.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/systems/basicNiceValuesSystemResolution.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,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,YAAY,CAAC,WAAW,CAarE,CAAC"}

package/lib/exercises/calculLitteral/systems/basicNiceValuesSystemResolution.js

@@ -0,0 +1,56 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.basicNiceValuesSystemResolution = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const system_1 = require("../../../math/systems/system");
+const randint_1 = require("../../../math/utils/random/randint");
+const coinFlip_1 = require("../../../utils/coinFlip");
+//{ a1x + b1y = c1 , a2x + b2y = c2}
+const getBasicNiceValuesSystemResolutionQuestion = () => {
+    //need a1/b1 != a2/b2
+    const sys = system_1.SystemConstructor.niceValues();
+    const { x, y } = sys.solve();
+    const isXAsked = (0, coinFlip_1.coinFlip)();
+    const variable = isXAsked ? "x" : "y";
+    const answer = isXAsked ? x.toTex() : y.toTex();
+    const question = {
+        answer,
+        instruction: `Soit le système d'équations suivant :
+  
+  $${sys.toTex()}$
+  
+  Que vaut $${variable}$ ?`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { coeffs: sys.coeffs, isXAsked },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, coeffs, isXAsked }) => {
+    const propositions = [];
+    const sys = new system_1.System(coeffs);
+    const { x, y } = sys.solve();
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, isXAsked ? y.toTex() : x.toTex());
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 11) + "");
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, coeffs, isXAsked }) => {
+    return ans === answer;
+};
+exports.basicNiceValuesSystemResolution = {
+    id: "basicNiceValuesSystemResolution",
+    connector: "=",
+    label: "Résoudre un système d'équations (solutions entières)",
+    levels: ["2nde", "1reSpé"],
+    isSingleStep: true,
+    sections: ["Systèmes"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getBasicNiceValuesSystemResolutionQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/systems/basicSystemResolution.d.ts

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

package/lib/exercises/calculLitteral/systems/basicSystemResolution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"basicSystemResolution.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/systems/basicSystemResolution.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,QAAQ,EAAE,OAAO,CAAC;CACnB,CAAC;AA0DF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAa3D,CAAC"}