math-exercises 1.3.41 → 1.3.42

package/lib/exercises/calculLitteral/equation/multiplicationEquation.js

@@ -1,74 +1,74 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getMultiplicationEquation = exports.multiplicationEquation = 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 numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
-const simplify_1 = require("../../../tree/parsers/simplify");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.multiplicationEquation = {
-    id: 'multiplicationEquation',
-    connector: '\\iff',
-    instruction: 'Résoudre :',
-    label: 'Résoudre une équation produit nul',
-    levels: ['2', '1'],
-    section: 'Équations',
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMultiplicationEquation, nb),
-    keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'ou'],
-};
-function getMultiplicationEquation() {
-    // (ax + b)(cx + d) = 0
-    let a, b, c, d;
-    do {
-        a = (0, randint_1.randint)(-9, 10, [0]);
-        b = (0, randint_1.randint)(-9, 10, [0]);
-        c = (0, randint_1.randint)(-9, 10, [0]);
-        d = (0, randint_1.randint)(-9, 10, [0]);
-    } while (a / c === b / d);
-    const polynome1 = new polynomial_1.Polynomial([b, a]);
-    const polynome2 = new polynomial_1.Polynomial([d, c]);
-    const answer = `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`;
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer,
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                do {
-                    a = (0, randint_1.randint)(-9, 10, [0]);
-                    b = (0, randint_1.randint)(-9, 10, [0]);
-                    c = (0, randint_1.randint)(-9, 10, [0]);
-                    d = (0, randint_1.randint)(-9, 10, [0]);
-                } while (a / c === b / d);
-                const polynome1 = new polynomial_1.Polynomial([b, a]);
-                const polynome2 = new polynomial_1.Polynomial([d, c]);
-                const wrongAnswer = `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`;
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer,
-                    isRightAnswer: false,
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        startStatement: `(${polynome1.toTex()})(${polynome2.toTex()}) = 0`,
-        answer: `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`,
-        keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'ou'],
-        getPropositions,
-    };
-    return question;
-}
-exports.getMultiplicationEquation = getMultiplicationEquation;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getMultiplicationEquation = exports.multiplicationEquation = 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 numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.multiplicationEquation = {
+    id: 'multiplicationEquation',
+    connector: '\\iff',
+    instruction: 'Résoudre :',
+    label: 'Résoudre une équation produit nul',
+    levels: ['2', '1'],
+    section: 'Équations',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMultiplicationEquation, nb),
+    keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'ou'],
+};
+function getMultiplicationEquation() {
+    // (ax + b)(cx + d) = 0
+    let a, b, c, d;
+    do {
+        a = (0, randint_1.randint)(-9, 10, [0]);
+        b = (0, randint_1.randint)(-9, 10, [0]);
+        c = (0, randint_1.randint)(-9, 10, [0]);
+        d = (0, randint_1.randint)(-9, 10, [0]);
+    } while (a / c === b / d);
+    const polynome1 = new polynomial_1.Polynomial([b, a]);
+    const polynome2 = new polynomial_1.Polynomial([d, c]);
+    const answer = `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`;
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer,
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                do {
+                    a = (0, randint_1.randint)(-9, 10, [0]);
+                    b = (0, randint_1.randint)(-9, 10, [0]);
+                    c = (0, randint_1.randint)(-9, 10, [0]);
+                    d = (0, randint_1.randint)(-9, 10, [0]);
+                } while (a / c === b / d);
+                const polynome1 = new polynomial_1.Polynomial([b, a]);
+                const polynome2 = new polynomial_1.Polynomial([d, c]);
+                const wrongAnswer = `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`;
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        startStatement: `(${polynome1.toTex()})(${polynome2.toTex()}) = 0`,
+        answer: `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`,
+        keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'ou'],
+        getPropositions,
+    };
+    return question;
+}
+exports.getMultiplicationEquation = getMultiplicationEquation;

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

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

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

@@ -1,66 +1,66 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getFactoType1Question = exports.factoIdRmq1 = 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 numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.factoIdRmq1 = {
-    id: 'factoIdRmq1',
-    connector: '=',
-    instruction: 'Factoriser :',
-    isSingleStep: false,
-    label: 'Factorisation du type $a^2 + 2ab + b^2$',
-    levels: ['3', '2'],
-    section: 'Calcul littéral',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFactoType1Question, nb),
-    keys: ['x'],
-};
-function getFactoType1Question() {
-    const interval = new intervals_1.Interval('[[1; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
-    const affine = affine_1.AffineConstructor.random(interval, interval);
-    const statementTree = affine.multiply(affine).toTree();
-    const answerTree = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answerTree.toTex(),
-            isRightAnswer: true,
-        });
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: new powerNode_1.PowerNode(new affine_1.Affine(affine.b, affine.a).toTree(), new numberNode_1.NumberNode(2)).toTex(),
-            isRightAnswer: false,
-        });
-        for (let i = 0; i < n - 2; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = new powerNode_1.PowerNode(new affine_1.Affine(affine.a + (0, randint_1.randint)(-affine.a + 1, 10 - affine.a), affine.b + (0, randint_1.randint)(-affine.b + 1, 10 - affine.b)).toTree(), new numberNode_1.NumberNode(2));
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer.toTex(),
-                    isRightAnswer: false,
-                };
-                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,
-    };
-    return question;
-}
-exports.getFactoType1Question = getFactoType1Question;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getFactoType1Question = exports.factoIdRmq1 = 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 numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.factoIdRmq1 = {
+    id: 'factoIdRmq1',
+    connector: '=',
+    instruction: 'Factoriser :',
+    isSingleStep: false,
+    label: 'Factorisation du type $a^2 + 2ab + b^2$',
+    levels: ['3', '2'],
+    section: 'Calcul littéral',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFactoType1Question, nb),
+    keys: ['x'],
+};
+function getFactoType1Question() {
+    const interval = new intervals_1.Interval('[[1; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
+    const affine = affine_1.AffineConstructor.random(interval, interval);
+    const statementTree = affine.multiply(affine).toTree();
+    const answerTree = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answerTree.toTex(),
+            isRightAnswer: true,
+        });
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: new powerNode_1.PowerNode(new affine_1.Affine(affine.b, affine.a).toTree(), new numberNode_1.NumberNode(2)).toTex(),
+            isRightAnswer: false,
+        });
+        for (let i = 0; i < n - 2; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new powerNode_1.PowerNode(new affine_1.Affine(affine.a + (0, randint_1.randint)(-affine.a + 1, 10 - affine.a), affine.b + (0, randint_1.randint)(-affine.b + 1, 10 - affine.b)).toTree(), new numberNode_1.NumberNode(2));
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                };
+                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,
+    };
+    return question;
+}
+exports.getFactoType1Question = getFactoType1Question;

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

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

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

@@ -1,73 +1,73 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getFactoType1Question = exports.factoIdRmq2 = 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 numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.factoIdRmq2 = {
-    id: 'factoIdRmq2',
-    connector: '=',
-    instruction: 'Factoriser :',
-    isSingleStep: false,
-    label: 'Factorisation du type $a^2 - 2ab + b^2$',
-    levels: ['3', '2'],
-    section: 'Calcul littéral',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFactoType1Question, nb),
-    keys: ['x'],
-};
-function getFactoType1Question() {
-    const intervalA = new intervals_1.Interval('[[0; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
-    const intervalB = new intervals_1.Interval('[[-10; 0]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
-    const affine = affine_1.AffineConstructor.random(intervalA, intervalB);
-    const statementTree = affine.multiply(affine).toTree();
-    const answerTree = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answerTree.toTex(),
-            isRightAnswer: true,
-        });
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: new powerNode_1.PowerNode(new affine_1.Affine(-affine.b, -affine.a).toTree(), new numberNode_1.NumberNode(2)).toTex(),
-            isRightAnswer: false,
-        });
-        if (n > 2)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new powerNode_1.PowerNode(new affine_1.Affine(-affine.a, affine.b).toTree(), new numberNode_1.NumberNode(2)).toTex(),
-                isRightAnswer: false,
-            });
-        for (let i = 0; i < n - 3; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = new powerNode_1.PowerNode(new affine_1.Affine(affine.a + (0, randint_1.randint)(-affine.a + 1, 10 - affine.a), affine.b + (0, randint_1.randint)(-9 - affine.b, -affine.b)).toTree(), new numberNode_1.NumberNode(2));
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer.toTex(),
-                    isRightAnswer: false,
-                };
-                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,
-    };
-    return question;
-}
-exports.getFactoType1Question = getFactoType1Question;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getFactoType1Question = exports.factoIdRmq2 = 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 numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.factoIdRmq2 = {
+    id: 'factoIdRmq2',
+    connector: '=',
+    instruction: 'Factoriser :',
+    isSingleStep: false,
+    label: 'Factorisation du type $a^2 - 2ab + b^2$',
+    levels: ['3', '2'],
+    section: 'Calcul littéral',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFactoType1Question, nb),
+    keys: ['x'],
+};
+function getFactoType1Question() {
+    const intervalA = new intervals_1.Interval('[[0; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
+    const intervalB = new intervals_1.Interval('[[-10; 0]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
+    const affine = affine_1.AffineConstructor.random(intervalA, intervalB);
+    const statementTree = affine.multiply(affine).toTree();
+    const answerTree = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answerTree.toTex(),
+            isRightAnswer: true,
+        });
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: new powerNode_1.PowerNode(new affine_1.Affine(-affine.b, -affine.a).toTree(), new numberNode_1.NumberNode(2)).toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new powerNode_1.PowerNode(new affine_1.Affine(-affine.a, affine.b).toTree(), new numberNode_1.NumberNode(2)).toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 3; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new powerNode_1.PowerNode(new affine_1.Affine(affine.a + (0, randint_1.randint)(-affine.a + 1, 10 - affine.a), affine.b + (0, randint_1.randint)(-9 - affine.b, -affine.b)).toTree(), new numberNode_1.NumberNode(2));
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                };
+                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,
+    };
+    return question;
+}
+exports.getFactoType1Question = getFactoType1Question;

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

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

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

@@ -1,78 +1,78 @@
-"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', '2'],
-    section: '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,
-        });
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: new multiplyNode_1.MultiplyNode(affine.toTree(), affine.toTree()).toTex(),
-            isRightAnswer: false,
-        });
-        if (n > 2)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new multiplyNode_1.MultiplyNode(affine2.toTree(), affine2.toTree()).toTex(),
-                isRightAnswer: false,
-            });
-        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,
-            });
-        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,
-                };
-                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,
-    };
-    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', '2'],
+    section: '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,
+        });
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: new multiplyNode_1.MultiplyNode(affine.toTree(), affine.toTree()).toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new multiplyNode_1.MultiplyNode(affine2.toTree(), affine2.toTree()).toTex(),
+                isRightAnswer: false,
+            });
+        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,
+            });
+        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,
+                };
+                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,
+    };
+    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