math-exercises 1.3.54 → 1.3.56

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

@@ -1,84 +1,84 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getFactoType1Question = exports.factoIdRmq3 = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const integer_1 = require("../../../math/numbers/integer/integer");
-const affine_1 = require("../../../math/polynomials/affine");
-const discreteSet_1 = require("../../../math/sets/discreteSet");
-const intervals_1 = require("../../../math/sets/intervals/intervals");
-const randint_1 = require("../../../math/utils/random/randint");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.factoIdRmq3 = {
-    id: 'factoIdRmq3',
-    connector: '=',
-    instruction: 'Factoriser :',
-    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),
-    keys: ['x'],
-};
-function getFactoType1Question() {
-    const interval = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
-    const affine = affine_1.AffineConstructor.random(interval, interval);
-    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 getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answerTree.toTex(),
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: new multiplyNode_1.MultiplyNode(affine.toTree(), affine.toTree()).toTex(),
-            isRightAnswer: false,
-            format: 'tex',
-        });
-        if (n > 2)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new multiplyNode_1.MultiplyNode(affine2.toTree(), affine2.toTree()).toTex(),
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        if (n > 3)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new multiplyNode_1.MultiplyNode(affine2.toTree(), new affine_1.Affine(-affine.b, affine.a).toTree()).toTex(),
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        for (let i = 0; i < n - 4; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                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());
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer.toTex(),
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        startStatement: statementTree.toTex(),
-        answer: answerTree.toTex(),
-        keys: ['x'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getFactoType1Question = getFactoType1Question;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getFactoType1Question = exports.factoIdRmq3 = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const integer_1 = require("../../../math/numbers/integer/integer");
+const affine_1 = require("../../../math/polynomials/affine");
+const discreteSet_1 = require("../../../math/sets/discreteSet");
+const intervals_1 = require("../../../math/sets/intervals/intervals");
+const randint_1 = require("../../../math/utils/random/randint");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.factoIdRmq3 = {
+    id: 'factoIdRmq3',
+    connector: '=',
+    instruction: 'Factoriser :',
+    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),
+    keys: ['x'],
+};
+function getFactoType1Question() {
+    const interval = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
+    const affine = affine_1.AffineConstructor.random(interval, interval);
+    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 getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answerTree.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: new multiplyNode_1.MultiplyNode(affine.toTree(), affine.toTree()).toTex(),
+            isRightAnswer: false,
+            format: 'tex',
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new multiplyNode_1.MultiplyNode(affine2.toTree(), affine2.toTree()).toTex(),
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new multiplyNode_1.MultiplyNode(affine2.toTree(), new affine_1.Affine(-affine.b, affine.a).toTree()).toTex(),
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        for (let i = 0; i < n - 4; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                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());
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        startStatement: statementTree.toTex(),
+        answer: answerTree.toTex(),
+        keys: ['x'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getFactoType1Question = getFactoType1Question;

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

@@ -1,7 +1,7 @@
-/**
- *  type (ax+b)(cx+d) ± (ax+b)(ex+f)
- */
-import { Exercise, Question } from '../../../exercises/exercise';
-export declare const factoType1Exercise: Exercise;
-export declare function getFactoType1Question(): Question;
+/**
+ *  type (ax+b)(cx+d) ± (ax+b)(ex+f)
+ */
+import { Exercise, Question } from '../../../exercises/exercise';
+export declare const factoType1Exercise: Exercise;
+export declare function getFactoType1Question(): Question;
 //# sourceMappingURL=factoType1Exercise.d.ts.map

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

@@ -1,88 +1,88 @@
-"use strict";
-/**
- *  type (ax+b)(cx+d) ± (ax+b)(ex+f)
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getFactoType1Question = exports.factoType1Exercise = void 0;
-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 uuid_1 = require("uuid");
-exports.factoType1Exercise = {
-    id: 'facto1',
-    connector: '=',
-    instruction: 'Factoriser :',
-    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),
-    keys: ['x'],
-};
-function 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 answerTree = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree());
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answerTree.toTex(),
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(operation !== 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
-            isRightAnswer: false,
-            format: 'tex',
-        });
-        if (n > 2)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new multiplyNode_1.MultiplyNode(affines[1].toTree(), affines[0].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        if (n > 3)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new multiplyNode_1.MultiplyNode(affines[2].toTree(), affines[0].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        for (let i = 0; i < n - 4; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(affine_1.AffineConstructor.differentRandoms(1)[0]).toTree());
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer.toTex(),
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        startStatement: statementTree.toTex(),
-        answer: answerTree.toTex(),
-        keys: ['x'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getFactoType1Question = getFactoType1Question;
+"use strict";
+/**
+ *  type (ax+b)(cx+d) ± (ax+b)(ex+f)
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getFactoType1Question = exports.factoType1Exercise = void 0;
+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 uuid_1 = require("uuid");
+exports.factoType1Exercise = {
+    id: 'facto1',
+    connector: '=',
+    instruction: 'Factoriser :',
+    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),
+    keys: ['x'],
+};
+function 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 answerTree = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree());
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answerTree.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(operation !== 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
+            isRightAnswer: false,
+            format: 'tex',
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new multiplyNode_1.MultiplyNode(affines[1].toTree(), affines[0].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new multiplyNode_1.MultiplyNode(affines[2].toTree(), affines[0].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        for (let i = 0; i < n - 4; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(affine_1.AffineConstructor.differentRandoms(1)[0]).toTree());
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        startStatement: statementTree.toTex(),
+        answer: answerTree.toTex(),
+        keys: ['x'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getFactoType1Question = getFactoType1Question;

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

@@ -1,4 +1,4 @@
-import { Exercise, Question } from '../../../exercises/exercise';
-export declare const evaluateExpression: Exercise;
-export declare function getEvaluateExpression(): Question;
+import { Exercise, Question } from '../../../exercises/exercise';
+export declare const evaluateExpression: Exercise;
+export declare function getEvaluateExpression(): Question;
 //# sourceMappingURL=evaluateExpression.d.ts.map

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

@@ -1,64 +1,64 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getEvaluateExpression = exports.evaluateExpression = void 0;
-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 uuid_1 = require("uuid");
-exports.evaluateExpression = {
-    id: 'evaluateExpression',
-    connector: '=',
-    instruction: '',
-    label: 'Evaluer une expression',
-    levels: ['4ème', '3ème', '2nde'],
-    sections: ['Calcul littéral'],
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEvaluateExpression, nb),
-    keys: ['x'],
-};
-function 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 getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer + '',
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = answer + (0, randint_1.randint)(-10, 11, [0]);
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer + '',
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        instruction: statement,
-        answer: answer + '',
-        keys: ['x'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getEvaluateExpression = getEvaluateExpression;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getEvaluateExpression = exports.evaluateExpression = void 0;
+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 uuid_1 = require("uuid");
+exports.evaluateExpression = {
+    id: 'evaluateExpression',
+    connector: '=',
+    instruction: '',
+    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),
+    keys: ['x'],
+};
+function 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 getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = answer + (0, randint_1.randint)(-10, 11, [0]);
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer + '',
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction: statement,
+        answer: answer + '',
+        keys: ['x'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getEvaluateExpression = getEvaluateExpression;

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

@@ -1,4 +1,4 @@
-import { Exercise, Question } from '../../../exercises/exercise';
-export declare const expSimplifiying: Exercise;
-export declare function getExpSimplifiying(): Question;
+import { Exercise, Question } from '../../../exercises/exercise';
+export declare const expSimplifiying: Exercise;
+export declare function getExpSimplifiying(): Question;
 //# sourceMappingURL=expSimplifiying.d.ts.map