math-exercises 1.3.40 → 1.3.42

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

@@ -1,77 +1,77 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getDoubleDistributivityQuestion = exports.doubleDistributivity = 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.doubleDistributivity = {
-    id: 'doubleDistri',
-    connector: '=',
-    instruction: 'Développer et réduire :',
-    label: 'Distributivité double',
-    levels: ['3', '2'],
-    isSingleStep: false,
-    section: 'Calcul littéral',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDoubleDistributivityQuestion, nb),
-    keys: ['x'],
-};
-function getDoubleDistributivityQuestion() {
-    const interval = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
-    const affines = affine_1.AffineConstructor.differentRandoms(2, interval, interval);
-    const statementTree = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].toTree());
-    const answerTree = affines[0].multiply(affines[1]).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: affines[0]
-                .multiply(new affine_1.Affine(-affines[1].a, (0, randint_1.randint)(-9, 10, [affines[1].b])))
-                .toTree()
-                .toTex(),
-            isRightAnswer: false,
-        });
-        if (n > 2)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: affines[1]
-                    .multiply(new affine_1.Affine((0, randint_1.randint)(-9, 10, [affines[0].a]), affines[0].b))
-                    .toTree()
-                    .toTex(),
-                isRightAnswer: false,
-            });
-        for (let i = 0; i < n - 3; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const affinesTemps = affine_1.AffineConstructor.differentRandoms(2, interval, interval);
-                const wrongAnswer = affinesTemps[0].multiply(affinesTemps[1]).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.getDoubleDistributivityQuestion = getDoubleDistributivityQuestion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getDoubleDistributivityQuestion = exports.doubleDistributivity = 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.doubleDistributivity = {
+    id: 'doubleDistri',
+    connector: '=',
+    instruction: 'Développer et réduire :',
+    label: 'Distributivité double',
+    levels: ['3', '2'],
+    isSingleStep: false,
+    section: 'Calcul littéral',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDoubleDistributivityQuestion, nb),
+    keys: ['x'],
+};
+function getDoubleDistributivityQuestion() {
+    const interval = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
+    const affines = affine_1.AffineConstructor.differentRandoms(2, interval, interval);
+    const statementTree = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].toTree());
+    const answerTree = affines[0].multiply(affines[1]).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: affines[0]
+                .multiply(new affine_1.Affine(-affines[1].a, (0, randint_1.randint)(-9, 10, [affines[1].b])))
+                .toTree()
+                .toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: affines[1]
+                    .multiply(new affine_1.Affine((0, randint_1.randint)(-9, 10, [affines[0].a]), affines[0].b))
+                    .toTree()
+                    .toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 3; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const affinesTemps = affine_1.AffineConstructor.differentRandoms(2, interval, interval);
+                const wrongAnswer = affinesTemps[0].multiply(affinesTemps[1]).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.getDoubleDistributivityQuestion = getDoubleDistributivityQuestion;

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

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

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

@@ -1,78 +1,78 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getFirstIdentityQuestion = exports.firstIdentity = 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 polynomial_1 = require("../../../math/polynomials/polynomial");
-const discreteSet_1 = require("../../../math/sets/discreteSet");
-const intervals_1 = require("../../../math/sets/intervals/intervals");
-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.firstIdentity = {
-    id: 'idRmq1',
-    connector: '=',
-    instruction: 'Développer et réduire :',
-    label: 'Identité remarquable $(a+b)^2$',
-    levels: ['3', '2'],
-    isSingleStep: false,
-    section: 'Calcul littéral',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstIdentityQuestion, nb),
-    keys: ['x'],
-};
-function getFirstIdentityQuestion() {
-    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 = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
-    const answerTree = affine.multiply(affine).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 polynomial_1.Polynomial([affine.b ** 2, 0, affine.a ** 2]).toTree().toTex(),
-            isRightAnswer: false,
-        });
-        if (n > 2)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new polynomial_1.Polynomial([affine.b ** 2, affine.a * affine.b, affine.a ** 2]).toTree().toTex(),
-                isRightAnswer: false,
-            });
-        if (n > 3)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new polynomial_1.Polynomial([affine.b ** 2, affine.a ** 2 + affine.b ** 2, affine.a ** 2]).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 wrongAnswer = affine.multiply(affineTemp).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.getFirstIdentityQuestion = getFirstIdentityQuestion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getFirstIdentityQuestion = exports.firstIdentity = 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 polynomial_1 = require("../../../math/polynomials/polynomial");
+const discreteSet_1 = require("../../../math/sets/discreteSet");
+const intervals_1 = require("../../../math/sets/intervals/intervals");
+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.firstIdentity = {
+    id: 'idRmq1',
+    connector: '=',
+    instruction: 'Développer et réduire :',
+    label: 'Identité remarquable $(a+b)^2$',
+    levels: ['3', '2'],
+    isSingleStep: false,
+    section: 'Calcul littéral',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstIdentityQuestion, nb),
+    keys: ['x'],
+};
+function getFirstIdentityQuestion() {
+    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 = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
+    const answerTree = affine.multiply(affine).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 polynomial_1.Polynomial([affine.b ** 2, 0, affine.a ** 2]).toTree().toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new polynomial_1.Polynomial([affine.b ** 2, affine.a * affine.b, affine.a ** 2]).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new polynomial_1.Polynomial([affine.b ** 2, affine.a ** 2 + affine.b ** 2, affine.a ** 2]).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 wrongAnswer = affine.multiply(affineTemp).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.getFirstIdentityQuestion = getFirstIdentityQuestion;

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

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

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

@@ -1,79 +1,79 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getSecondIdentityQuestion = exports.secondIdentity = 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 polynomial_1 = require("../../../math/polynomials/polynomial");
-const discreteSet_1 = require("../../../math/sets/discreteSet");
-const intervals_1 = require("../../../math/sets/intervals/intervals");
-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.secondIdentity = {
-    id: 'idRmq2',
-    connector: '=',
-    instruction: 'Développer et réduire :',
-    label: 'Identité remarquable $(a-b)^2$',
-    levels: ['3', '2'],
-    isSingleStep: false,
-    section: 'Calcul littéral',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSecondIdentityQuestion, nb),
-    keys: ['x'],
-};
-function getSecondIdentityQuestion() {
-    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 = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
-    const answerTree = affine.multiply(affine).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 polynomial_1.Polynomial([-(affine.b ** 2), 0, affine.a ** 2]).toTree().toTex(),
-            isRightAnswer: false,
-        });
-        if (n > 2)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new polynomial_1.Polynomial([affine.b ** 2, affine.a * affine.b, affine.a ** 2]).toTree().toTex(),
-                isRightAnswer: false,
-            });
-        if (n > 3)
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: new polynomial_1.Polynomial([-(affine.b ** 2), -(affine.a ** 2 + affine.b ** 2), affine.a ** 2]).toTree().toTex(),
-                isRightAnswer: false,
-            });
-        for (let i = 0; i < n - 4; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const affineTemp = affine_1.AffineConstructor.random(intervalA, intervalB);
-                const wrongAnswer = affine.multiply(affineTemp).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.getSecondIdentityQuestion = getSecondIdentityQuestion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSecondIdentityQuestion = exports.secondIdentity = 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 polynomial_1 = require("../../../math/polynomials/polynomial");
+const discreteSet_1 = require("../../../math/sets/discreteSet");
+const intervals_1 = require("../../../math/sets/intervals/intervals");
+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.secondIdentity = {
+    id: 'idRmq2',
+    connector: '=',
+    instruction: 'Développer et réduire :',
+    label: 'Identité remarquable $(a-b)^2$',
+    levels: ['3', '2'],
+    isSingleStep: false,
+    section: 'Calcul littéral',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSecondIdentityQuestion, nb),
+    keys: ['x'],
+};
+function getSecondIdentityQuestion() {
+    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 = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
+    const answerTree = affine.multiply(affine).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 polynomial_1.Polynomial([-(affine.b ** 2), 0, affine.a ** 2]).toTree().toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new polynomial_1.Polynomial([affine.b ** 2, affine.a * affine.b, affine.a ** 2]).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new polynomial_1.Polynomial([-(affine.b ** 2), -(affine.a ** 2 + affine.b ** 2), affine.a ** 2]).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 4; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const affineTemp = affine_1.AffineConstructor.random(intervalA, intervalB);
+                const wrongAnswer = affine.multiply(affineTemp).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.getSecondIdentityQuestion = getSecondIdentityQuestion;

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

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