math-exercises 1.3.42 → 1.3.43

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

@@ -1,118 +1,121 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getReduceExpression = exports.reduceExpression = 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 addNode_1 = require("../../../tree/nodes/operators/addNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.reduceExpression = {
-    id: 'reduceExpression',
-    connector: '=',
-    instruction: "Réduire l'expression suivante :",
-    isSingleStep: false,
-    label: 'Réduire une expression',
-    levels: ['4', '3', '2'],
-    section: 'Calcul littéral',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getReduceExpression, nb),
-    keys: ['x'],
-};
-function getReduceExpression() {
-    const rand = (0, randint_1.randint)(0, 7);
-    let statement;
-    let polynome1;
-    let polynome2;
-    let answer;
-    switch (rand) {
-        case 0: // ax + b + cx + d
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 1:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 2:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 3:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 4:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([0, 0, (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 5:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 6:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        default:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(new polynomial_1.Polynomial([1, 2]).toTree(), new polynomial_1.Polynomial([3, 4]).toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-    }
-    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 {
-                polynome2 = new polynomial_1.Polynomial(rand < 3
-                    ? [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]
-                    : [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]);
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: polynome1.add(polynome2).toTree().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: statement.toTex(),
-        answer,
-        keys: ['x'],
-        getPropositions,
-    };
-    return question;
-}
-exports.getReduceExpression = getReduceExpression;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getReduceExpression = exports.reduceExpression = 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 addNode_1 = require("../../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.reduceExpression = {
+    id: 'reduceExpression',
+    connector: '=',
+    instruction: "Réduire l'expression suivante :",
+    isSingleStep: false,
+    label: 'Réduire une expression',
+    levels: ['4', '3', '2'],
+    section: 'Calcul littéral',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getReduceExpression, nb),
+    keys: ['x'],
+};
+function getReduceExpression() {
+    const rand = (0, randint_1.randint)(0, 7);
+    let statement;
+    let polynome1;
+    let polynome2;
+    let answer;
+    switch (rand) {
+        case 0: // ax + b + cx + d
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 1:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 2:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 3:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 4:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([0, 0, (0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 5:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 6:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        default:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(new polynomial_1.Polynomial([1, 2]).toTree(), new polynomial_1.Polynomial([3, 4]).toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+    }
+    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 {
+                polynome2 = new polynomial_1.Polynomial(rand < 3
+                    ? [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]
+                    : [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]);
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: polynome1.add(polynome2).toTree().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: statement.toTex(),
+        answer,
+        keys: ['x'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getReduceExpression = getReduceExpression;

package/lib/exercises/conversion/aeraConversion.d.ts

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

package/lib/exercises/conversion/aeraConversion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"aeraConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/aeraConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,iBAAiB,IAAI,QAAQ,CAoD5C"}
+{"version":3,"file":"aeraConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/aeraConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,iBAAiB,IAAI,QAAQ,CAuD5C"}

package/lib/exercises/conversion/aeraConversion.js

@@ -1,59 +1,62 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getAeraConversion = exports.aeraConversion = void 0;
-const decimal_1 = require("../../math/numbers/decimals/decimal");
-const randint_1 = require("../../math/utils/random/randint");
-const shuffle_1 = require("../../utils/shuffle");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const uuid_1 = require("uuid");
-exports.aeraConversion = {
-    id: 'aeraConversion',
-    connector: '=',
-    instruction: '',
-    label: 'Conversion des aires',
-    levels: ['6', '5'],
-    section: 'Conversions',
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAeraConversion, nb),
-    keys: [],
-};
-function getAeraConversion() {
-    const units = ['mm^2', 'cm^2', 'dm^2', 'm^2', 'dam^2', 'hm^2', 'km^2'];
-    const randomUnitIndex = (0, randint_1.randint)(0, 7);
-    const randomUnitInstructionIndex = (0, randint_1.randint)(
-    // cette manip a pour but d'éviter des conversion de type km² --> cm² ou le contraire (chiffre trop grand/petit)
-    randomUnitIndex - 2 < 0 ? 0 : randomUnitIndex - 2, randomUnitIndex + 2 > 7 ? 7 : randomUnitIndex + 3, [randomUnitIndex]);
-    const randomAera = decimal_1.DecimalConstructor.random(0, 1000, (0, randint_1.randint)(0, 4));
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: randomAera.multiplyByPowerOfTen(2 * (randomUnitIndex - randomUnitInstructionIndex)).value + '',
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = randomAera.multiplyByPowerOfTen(2 * (0, randint_1.randint)(-2, 4, [randomUnitIndex - randomUnitInstructionIndex])).value +
-                    '';
-                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 = {
-        instruction: `$${randomAera.value}$ $${units[randomUnitIndex]}$ = ... $${units[randomUnitInstructionIndex]}$`,
-        answer: randomAera.multiplyByPowerOfTen(2 * (randomUnitIndex - randomUnitInstructionIndex)).value + '',
-        keys: [],
-        getPropositions,
-    };
-    return question;
-}
-exports.getAeraConversion = getAeraConversion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getAeraConversion = exports.aeraConversion = void 0;
+const decimal_1 = require("../../math/numbers/decimals/decimal");
+const randint_1 = require("../../math/utils/random/randint");
+const shuffle_1 = require("../../utils/shuffle");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
+exports.aeraConversion = {
+    id: 'aeraConversion',
+    connector: '=',
+    instruction: '',
+    label: 'Conversion des aires',
+    levels: ['6', '5'],
+    section: 'Conversions',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAeraConversion, nb),
+    keys: [],
+};
+function getAeraConversion() {
+    const units = ['mm^2', 'cm^2', 'dm^2', 'm^2', 'dam^2', 'hm^2', 'km^2'];
+    const randomUnitIndex = (0, randint_1.randint)(0, 7);
+    const randomUnitInstructionIndex = (0, randint_1.randint)(
+    // cette manip a pour but d'éviter des conversion de type km² --> cm² ou le contraire (chiffre trop grand/petit)
+    randomUnitIndex - 2 < 0 ? 0 : randomUnitIndex - 2, randomUnitIndex + 2 > 7 ? 7 : randomUnitIndex + 3, [randomUnitIndex]);
+    const randomAera = decimal_1.DecimalConstructor.random(0, 1000, (0, randint_1.randint)(0, 4));
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: randomAera.multiplyByPowerOfTen(2 * (randomUnitIndex - randomUnitInstructionIndex)).value + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = randomAera.multiplyByPowerOfTen(2 * (0, randint_1.randint)(-2, 4, [randomUnitIndex - randomUnitInstructionIndex])).value +
+                    '';
+                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: `$${randomAera.value}$ $${units[randomUnitIndex]}$ = ... $${units[randomUnitInstructionIndex]}$`,
+        answer: randomAera.multiplyByPowerOfTen(2 * (randomUnitIndex - randomUnitInstructionIndex)).value + '',
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getAeraConversion = getAeraConversion;

package/lib/exercises/conversion/capacityConversion.d.ts

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

package/lib/exercises/conversion/capacityConversion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"capacityConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/capacityConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA+ChD"}
+{"version":3,"file":"capacityConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/capacityConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAkDhD"}

package/lib/exercises/conversion/capacityConversion.js

@@ -1,57 +1,60 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getCapacityConversion = exports.capacityConversion = void 0;
-const decimal_1 = require("../../math/numbers/decimals/decimal");
-const randint_1 = require("../../math/utils/random/randint");
-const shuffle_1 = require("../../utils/shuffle");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const uuid_1 = require("uuid");
-exports.capacityConversion = {
-    id: 'capacityConversion',
-    connector: '=',
-    instruction: '',
-    label: 'Conversion de capacités',
-    levels: ['6', '5'],
-    section: 'Conversions',
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getCapacityConversion, nb),
-    keys: [],
-};
-function getCapacityConversion() {
-    const units = ['mL', 'cL', 'dL', 'L', 'daL', 'hL', 'kL'];
-    const randomUnitIndex = (0, randint_1.randint)(0, 7);
-    const randomUnitInstructionIndex = (0, randint_1.randint)(0, 7, [randomUnitIndex]);
-    const randomCapacity = decimal_1.DecimalConstructor.random(0, 1000, (0, randint_1.randint)(0, 4));
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: randomCapacity.multiplyByPowerOfTen(randomUnitIndex - randomUnitInstructionIndex).value + '',
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = randomCapacity.multiplyByPowerOfTen((0, randint_1.randint)(-3, 4, [randomUnitIndex - randomUnitInstructionIndex])).value +
-                    '';
-                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 = {
-        instruction: `$${randomCapacity.value}$ $${units[randomUnitIndex]}$ = ... $${units[randomUnitInstructionIndex]}$`,
-        answer: randomCapacity.multiplyByPowerOfTen(randomUnitIndex - randomUnitInstructionIndex).value + '',
-        keys: [],
-        getPropositions,
-    };
-    return question;
-}
-exports.getCapacityConversion = getCapacityConversion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getCapacityConversion = exports.capacityConversion = void 0;
+const decimal_1 = require("../../math/numbers/decimals/decimal");
+const randint_1 = require("../../math/utils/random/randint");
+const shuffle_1 = require("../../utils/shuffle");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
+exports.capacityConversion = {
+    id: 'capacityConversion',
+    connector: '=',
+    instruction: '',
+    label: 'Conversion de capacités',
+    levels: ['6', '5'],
+    section: 'Conversions',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getCapacityConversion, nb),
+    keys: [],
+};
+function getCapacityConversion() {
+    const units = ['mL', 'cL', 'dL', 'L', 'daL', 'hL', 'kL'];
+    const randomUnitIndex = (0, randint_1.randint)(0, 7);
+    const randomUnitInstructionIndex = (0, randint_1.randint)(0, 7, [randomUnitIndex]);
+    const randomCapacity = decimal_1.DecimalConstructor.random(0, 1000, (0, randint_1.randint)(0, 4));
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: randomCapacity.multiplyByPowerOfTen(randomUnitIndex - randomUnitInstructionIndex).value + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = randomCapacity.multiplyByPowerOfTen((0, randint_1.randint)(-3, 4, [randomUnitIndex - randomUnitInstructionIndex])).value +
+                    '';
+                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: `$${randomCapacity.value}$ $${units[randomUnitIndex]}$ = ... $${units[randomUnitInstructionIndex]}$`,
+        answer: randomCapacity.multiplyByPowerOfTen(randomUnitIndex - randomUnitInstructionIndex).value + '',
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getCapacityConversion = getCapacityConversion;

package/lib/exercises/conversion/lengthConversion.d.ts

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

package/lib/exercises/conversion/lengthConversion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"lengthConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/lengthConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CA8C9C"}
+{"version":3,"file":"lengthConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/lengthConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAiD9C"}