math-exercises 1.3.40 → 1.3.42

package/lib/exercises/calculLitteral/distributivity/simpleDistributivity.js

@@ -1,78 +1,78 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getSimpleDistributivityQuestion = exports.simpleDistributivity = 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 numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.simpleDistributivity = {
-    id: 'simpleDistri',
-    connector: '=',
-    instruction: 'Développer et réduire :',
-    label: 'Distributivité simple',
-    levels: ['3', '2'],
-    isSingleStep: false,
-    section: 'Calcul littéral',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSimpleDistributivityQuestion, nb),
-    keys: ['x'],
-};
-function getSimpleDistributivityQuestion() {
-    const excludeNbrs = [new integer_1.Integer(-1), new integer_1.Integer(0), new integer_1.Integer(1)];
-    const interval = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet(excludeNbrs));
-    const affine = affine_1.AffineConstructor.random(interval, interval);
-    const coeff = interval.getRandomElement();
-    const statementTree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff.value), affine.toTree());
-    const answerTree = affine.times(coeff.value).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 affine_1.Affine(coeff.value * affine.a, affine.b).toTree().toTex(),
-            isRightAnswer: false,
-        });
-        if (n > 2)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new affine_1.Affine(affine.a, coeff.value * affine.b).toTree().toTex(),
-                isRightAnswer: false,
-            });
-        if (n > 3)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: affine.times(-coeff.value).toTree().toTex(),
-                isRightAnswer: false,
-            });
-        for (let i = 0; i < n - 4; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = affine_1.AffineConstructor.random(interval, interval).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);
-    };
-    return {
-        startStatement: statementTree.toTex(),
-        answer: answerTree.toTex(),
-        keys: ['x'],
-        getPropositions,
-    };
-}
-exports.getSimpleDistributivityQuestion = getSimpleDistributivityQuestion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSimpleDistributivityQuestion = exports.simpleDistributivity = 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 numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.simpleDistributivity = {
+    id: 'simpleDistri',
+    connector: '=',
+    instruction: 'Développer et réduire :',
+    label: 'Distributivité simple',
+    levels: ['3', '2'],
+    isSingleStep: false,
+    section: 'Calcul littéral',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSimpleDistributivityQuestion, nb),
+    keys: ['x'],
+};
+function getSimpleDistributivityQuestion() {
+    const excludeNbrs = [new integer_1.Integer(-1), new integer_1.Integer(0), new integer_1.Integer(1)];
+    const interval = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet(excludeNbrs));
+    const affine = affine_1.AffineConstructor.random(interval, interval);
+    const coeff = interval.getRandomElement();
+    const statementTree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff.value), affine.toTree());
+    const answerTree = affine.times(coeff.value).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 affine_1.Affine(coeff.value * affine.a, affine.b).toTree().toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new affine_1.Affine(affine.a, coeff.value * affine.b).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: affine.times(-coeff.value).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 4; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = affine_1.AffineConstructor.random(interval, interval).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);
+    };
+    return {
+        startStatement: statementTree.toTex(),
+        answer: answerTree.toTex(),
+        keys: ['x'],
+        getPropositions,
+    };
+}
+exports.getSimpleDistributivityQuestion = getSimpleDistributivityQuestion;

package/lib/exercises/calculLitteral/distributivity/thirdIdentity.d.ts

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

package/lib/exercises/calculLitteral/distributivity/thirdIdentity.js

@@ -1,78 +1,78 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getThirdIdentityQuestion = exports.thirdIdentity = 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 multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.thirdIdentity = {
-    id: 'idRmq3',
-    connector: '=',
-    instruction: 'Développer et réduire :',
-    label: 'Identité remarquable $(a+b)(a-b)$',
-    levels: ['3', '2'],
-    isSingleStep: false,
-    section: 'Calcul littéral',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getThirdIdentityQuestion, nb),
-    keys: ['x'],
-};
-function getThirdIdentityQuestion() {
-    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 = new multiplyNode_1.MultiplyNode(affine.toTree(), affine2.toTree());
-    const answerTree = affine.multiply(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: affine.multiply(affine2.opposite()).toTree().toTex(),
-            isRightAnswer: false,
-        });
-        if (n > 2)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: affine.multiply(affine).toTree().toTex(),
-                isRightAnswer: false,
-            });
-        if (n > 3)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: affine2.multiply(affine2.opposite()).toTree().toTex(),
-                isRightAnswer: false,
-            });
-        for (let i = 0; i < n - 4; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const affineTemp = affine_1.AffineConstructor.random(interval, interval);
-                const affineTemp2 = new affine_1.Affine(affineTemp.a, -affineTemp.b);
-                const wrongAnswer = affineTemp.multiply(affineTemp2).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);
-    };
-    return {
-        startStatement: statementTree.toTex(),
-        answer: answerTree.toTex(),
-        keys: ['x'],
-        getPropositions,
-    };
-}
-exports.getThirdIdentityQuestion = getThirdIdentityQuestion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getThirdIdentityQuestion = exports.thirdIdentity = 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 multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.thirdIdentity = {
+    id: 'idRmq3',
+    connector: '=',
+    instruction: 'Développer et réduire :',
+    label: 'Identité remarquable $(a+b)(a-b)$',
+    levels: ['3', '2'],
+    isSingleStep: false,
+    section: 'Calcul littéral',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getThirdIdentityQuestion, nb),
+    keys: ['x'],
+};
+function getThirdIdentityQuestion() {
+    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 = new multiplyNode_1.MultiplyNode(affine.toTree(), affine2.toTree());
+    const answerTree = affine.multiply(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: affine.multiply(affine2.opposite()).toTree().toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: affine.multiply(affine).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: affine2.multiply(affine2.opposite()).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 4; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const affineTemp = affine_1.AffineConstructor.random(interval, interval);
+                const affineTemp2 = new affine_1.Affine(affineTemp.a, -affineTemp.b);
+                const wrongAnswer = affineTemp.multiply(affineTemp2).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);
+    };
+    return {
+        startStatement: statementTree.toTex(),
+        answer: answerTree.toTex(),
+        keys: ['x'],
+        getPropositions,
+    };
+}
+exports.getThirdIdentityQuestion = getThirdIdentityQuestion;

package/lib/exercises/calculLitteral/equation/equationSimpleSquare.d.ts

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

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

@@ -1,153 +1,153 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getEquationSimpleSquare = exports.equationSimpleSquare = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-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.equationSimpleSquare = {
-    id: 'equationSimpleSquare',
-    connector: '=',
-    instruction: '',
-    label: 'Résoudre une équation du second degré du type x² = a',
-    levels: ['2', '1'],
-    section: 'Équations',
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEquationSimpleSquare, nb),
-    keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
-};
-const higherFactor = (n) => {
-    for (let i = Math.floor(Math.sqrt(n)); i > 0; i--)
-        if (n % i ** 2 === 0)
-            return i;
-    return 1;
-};
-function getEquationSimpleSquare() {
-    let randNbr = (0, randint_1.randint)(-20, 100);
-    let answer;
-    if (randNbr >= 0)
-        while (higherFactor(randNbr) === 1)
-            randNbr = (0, randint_1.randint)(1, 100);
-    const instruction = `Résoudre l'équation suivante : $x^2 = ${randNbr}$`;
-    const ans = Math.sqrt(randNbr);
-    if (ans === Math.floor(ans))
-        answer = `\\{${ans}\\ ; -${ans}\\}`;
-    else {
-        const factor = higherFactor(randNbr);
-        const radicand = randNbr / factor ** 2;
-        answer = `\\{${factor}\\sqrt{${radicand}}\\ ; -${factor}\\sqrt{${radicand}} \\}`;
-    }
-    if (randNbr < 0)
-        answer = `\\emptyset`;
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer,
-            isRightAnswer: true,
-        });
-        if (ans === Math.floor(ans)) {
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: `${ans}`,
-                isRightAnswer: false,
-            });
-            if (n > 2)
-                res.push({
-                    id: (0, uuid_1.v4)() + '',
-                    statement: `${ans + (0, randint_1.randint)(-ans + 1, 7, [0])}`,
-                    isRightAnswer: false,
-                });
-            for (let i = 0; i < n - 3; i++) {
-                let isDuplicate;
-                let proposition;
-                do {
-                    const tempAns = ans + (0, randint_1.randint)(-ans + 1, 7, [0]);
-                    proposition = {
-                        id: (0, uuid_1.v4)() + '',
-                        statement: (0, coinFlip_1.coinFlip)() ? `\\{${tempAns}\\ ; -${tempAns}\\}` : `\\emptyset`,
-                        isRightAnswer: false,
-                    };
-                    isDuplicate = res.some((p) => p.statement === proposition.statement);
-                } while (isDuplicate);
-                res.push(proposition);
-            }
-        }
-        else if (randNbr >= 0 && ans !== Math.floor(ans)) {
-            const factor = higherFactor(randNbr);
-            const radicand = randNbr / factor ** 2;
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: `${factor}\\sqrt{${radicand}}`,
-                isRightAnswer: false,
-            });
-            if (n > 2)
-                res.push({
-                    id: (0, uuid_1.v4)() + '',
-                    statement: `${radicand}\\sqrt{${factor}}`,
-                    isRightAnswer: false,
-                });
-            if (n > 3)
-                res.push({
-                    id: (0, uuid_1.v4)() + '',
-                    statement: `${Math.floor(ans)}`,
-                    isRightAnswer: false,
-                });
-            for (let i = 0; i < n - 4; i++) {
-                let isDuplicate;
-                let proposition;
-                do {
-                    const tempFactor = factor + (0, randint_1.randint)(-factor + 1, 7, [0]);
-                    const tempRadicand = radicand + (0, randint_1.randint)(-radicand + 1, 7, [0]);
-                    proposition = {
-                        id: (0, uuid_1.v4)() + '',
-                        statement: (0, coinFlip_1.coinFlip)()
-                            ? `\\{${tempFactor}\\sqrt{${tempRadicand}}\\ ; -${tempFactor}\\sqrt{${tempRadicand}} \\}`
-                            : `\\emptyset`,
-                        isRightAnswer: false,
-                    };
-                    isDuplicate = res.some((p) => p.statement === proposition.statement);
-                } while (isDuplicate);
-                res.push(proposition);
-            }
-        }
-        else {
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: `-\\sqrt${-randNbr}`,
-                isRightAnswer: false,
-            });
-            if (n > 2)
-                res.push({
-                    id: (0, uuid_1.v4)() + '',
-                    statement: `${Math.floor(Math.sqrt(-randNbr))}`,
-                    isRightAnswer: false,
-                });
-            for (let i = 0; i < n - 3; i++) {
-                let isDuplicate;
-                let proposition;
-                do {
-                    const factor = (0, randint_1.randint)(2, 5);
-                    const radicand = (0, randint_1.randint)(2, -randNbr);
-                    proposition = {
-                        id: (0, uuid_1.v4)() + '',
-                        statement: `\\{${factor}\\sqrt{${radicand}}\\ ; -${factor}\\sqrt{${radicand}} \\}`,
-                        isRightAnswer: false,
-                    };
-                    isDuplicate = res.some((p) => p.statement === proposition.statement);
-                } while (isDuplicate);
-                res.push(proposition);
-            }
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        instruction,
-        answer,
-        keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
-        getPropositions,
-    };
-    return question;
-}
-exports.getEquationSimpleSquare = getEquationSimpleSquare;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getEquationSimpleSquare = exports.equationSimpleSquare = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+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.equationSimpleSquare = {
+    id: 'equationSimpleSquare',
+    connector: '=',
+    instruction: '',
+    label: 'Résoudre une équation du second degré du type $x^2 = a$',
+    levels: ['2', '1'],
+    section: 'Équations',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEquationSimpleSquare, nb),
+    keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+};
+const higherFactor = (n) => {
+    for (let i = Math.floor(Math.sqrt(n)); i > 0; i--)
+        if (n % i ** 2 === 0)
+            return i;
+    return 1;
+};
+function getEquationSimpleSquare() {
+    let randNbr = (0, randint_1.randint)(-20, 100);
+    let answer;
+    if (randNbr >= 0)
+        while (higherFactor(randNbr) === 1)
+            randNbr = (0, randint_1.randint)(1, 100);
+    const instruction = `Résoudre l'équation suivante : $x^2 = ${randNbr}$`;
+    const ans = Math.sqrt(randNbr);
+    if (ans === Math.floor(ans))
+        answer = `\\{${ans}\\ ; -${ans}\\}`;
+    else {
+        const factor = higherFactor(randNbr);
+        const radicand = randNbr / factor ** 2;
+        answer = `\\{${factor}\\sqrt{${radicand}}\\ ; -${factor}\\sqrt{${radicand}} \\}`;
+    }
+    if (randNbr < 0)
+        answer = `\\emptyset`;
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer,
+            isRightAnswer: true,
+        });
+        if (ans === Math.floor(ans)) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: `${ans}`,
+                isRightAnswer: false,
+            });
+            if (n > 2)
+                res.push({
+                    id: (0, uuid_1.v4)() + '',
+                    statement: `${ans + (0, randint_1.randint)(-ans + 1, 7, [0])}`,
+                    isRightAnswer: false,
+                });
+            for (let i = 0; i < n - 3; i++) {
+                let isDuplicate;
+                let proposition;
+                do {
+                    const tempAns = ans + (0, randint_1.randint)(-ans + 1, 7, [0]);
+                    proposition = {
+                        id: (0, uuid_1.v4)() + '',
+                        statement: (0, coinFlip_1.coinFlip)() ? `\\{${tempAns}\\ ; -${tempAns}\\}` : `\\emptyset`,
+                        isRightAnswer: false,
+                    };
+                    isDuplicate = res.some((p) => p.statement === proposition.statement);
+                } while (isDuplicate);
+                res.push(proposition);
+            }
+        }
+        else if (randNbr >= 0 && ans !== Math.floor(ans)) {
+            const factor = higherFactor(randNbr);
+            const radicand = randNbr / factor ** 2;
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: `${factor}\\sqrt{${radicand}}`,
+                isRightAnswer: false,
+            });
+            if (n > 2)
+                res.push({
+                    id: (0, uuid_1.v4)() + '',
+                    statement: `${radicand}\\sqrt{${factor}}`,
+                    isRightAnswer: false,
+                });
+            if (n > 3)
+                res.push({
+                    id: (0, uuid_1.v4)() + '',
+                    statement: `${Math.floor(ans)}`,
+                    isRightAnswer: false,
+                });
+            for (let i = 0; i < n - 4; i++) {
+                let isDuplicate;
+                let proposition;
+                do {
+                    const tempFactor = factor + (0, randint_1.randint)(-factor + 1, 7, [0]);
+                    const tempRadicand = radicand + (0, randint_1.randint)(-radicand + 1, 7, [0]);
+                    proposition = {
+                        id: (0, uuid_1.v4)() + '',
+                        statement: (0, coinFlip_1.coinFlip)()
+                            ? `\\{${tempFactor}\\sqrt{${tempRadicand}}\\ ; -${tempFactor}\\sqrt{${tempRadicand}} \\}`
+                            : `\\emptyset`,
+                        isRightAnswer: false,
+                    };
+                    isDuplicate = res.some((p) => p.statement === proposition.statement);
+                } while (isDuplicate);
+                res.push(proposition);
+            }
+        }
+        else {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: `-\\sqrt${-randNbr}`,
+                isRightAnswer: false,
+            });
+            if (n > 2)
+                res.push({
+                    id: (0, uuid_1.v4)() + '',
+                    statement: `${Math.floor(Math.sqrt(-randNbr))}`,
+                    isRightAnswer: false,
+                });
+            for (let i = 0; i < n - 3; i++) {
+                let isDuplicate;
+                let proposition;
+                do {
+                    const factor = (0, randint_1.randint)(2, 5);
+                    const radicand = (0, randint_1.randint)(2, -randNbr);
+                    proposition = {
+                        id: (0, uuid_1.v4)() + '',
+                        statement: `\\{${factor}\\sqrt{${radicand}}\\ ; -${factor}\\sqrt{${radicand}} \\}`,
+                        isRightAnswer: false,
+                    };
+                    isDuplicate = res.some((p) => p.statement === proposition.statement);
+                } while (isDuplicate);
+                res.push(proposition);
+            }
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction,
+        answer,
+        keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+        getPropositions,
+    };
+    return question;
+}
+exports.getEquationSimpleSquare = getEquationSimpleSquare;

package/lib/exercises/calculLitteral/equation/equationType1Exercise.d.ts

@@ -1,7 +1,7 @@
-import { Exercise, Question } from '../../../exercises/exercise';
-/**
- *  type x+a=b
- */
-export declare const equationType1Exercise: Exercise;
-export declare function getEquationType1ExerciseQuestion(): Question;
+import { Exercise, Question } from '../../../exercises/exercise';
+/**
+ *  type x+a=b
+ */
+export declare const equationType1Exercise: Exercise;
+export declare function getEquationType1ExerciseQuestion(): Question;
 //# sourceMappingURL=equationType1Exercise.d.ts.map