math-exercises 1.3.41 → 1.3.43

package/lib/exercises/probaStat/median.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"median.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/median.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,MAAM,EAAE,QAUpB,CAAC;AAEF,wBAAgB,SAAS,IAAI,QAAQ,CA8EpC"}

package/lib/exercises/probaStat/median.js

@@ -0,0 +1,82 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getMedian = exports.median = void 0;
+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.median = {
+    id: 'median',
+    connector: '=',
+    instruction: '',
+    label: "Calcul de la moyenne d'une série de valeurs",
+    levels: ['1', '0'],
+    isSingleStep: false,
+    section: 'Probabilités',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMedian, nb),
+    keys: [],
+};
+function getMedian() {
+    const getRandomUniqueValues = (count, min, max) => {
+        const uniqueValues = new Set();
+        while (uniqueValues.size < count) {
+            uniqueValues.add((0, randint_1.randint)(min, max));
+        }
+        return Array.from(uniqueValues).sort((a, b) => a - b);
+    };
+    const randomValeurs = getRandomUniqueValues(5, 1, 20);
+    const randomEffectives = [1, 2, 3, 4, 5].map((el) => (0, randint_1.randint)(1, 6));
+    let sortedValues = [];
+    for (let i = 0; i < randomEffectives.length; i++)
+        for (let j = 0; j < randomEffectives[i]; j++)
+            sortedValues.push(randomValeurs[i]);
+    const n = randomEffectives.reduce((sum, value) => sum + value, 0);
+    const middleIndex = Math.floor(n / 2);
+    let median;
+    if (n % 2 === 0) {
+        median = (sortedValues[middleIndex - 1] + sortedValues[middleIndex]) / 2;
+    }
+    else {
+        median = sortedValues[middleIndex];
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: median + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: randomValeurs[(0, randint_1.randint)(0, randomValeurs.length)] + '',
+                    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: `On considère le tableau d'effectifs suivant : 
+
+| | | | | | |
+|-|-|-|-|-|-|
+|Valeur|${randomValeurs[0]}|${randomValeurs[1]}|${randomValeurs[2]}|${randomValeurs[3]}|${randomValeurs[4]}|
+|Effectif|${randomEffectives[0]}|${randomEffectives[1]}|${randomEffectives[2]}|${randomEffectives[3]}|${randomEffectives[4]}|
+
+Calculer la médiane de cette série de valeurs.`,
+        answer: median + '',
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getMedian = getMedian;

package/lib/exercises/probaStat/medianList.d.ts

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

package/lib/exercises/probaStat/medianList.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"medianList.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/medianList.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,UAAU,EAAE,QAUxB,CAAC;AAEF,wBAAgB,SAAS,IAAI,QAAQ,CA4DpC"}

package/lib/exercises/probaStat/medianList.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getMedian = exports.medianList = void 0;
+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.medianList = {
+    id: 'medianList',
+    connector: '=',
+    instruction: '',
+    label: "Calcul de la médiane d'une liste de valeurs",
+    levels: ['1', '0'],
+    isSingleStep: false,
+    section: 'Probabilités',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMedian, nb),
+    keys: ['f', 'cap', 'underscore'],
+};
+function getMedian() {
+    let randomValeurs = [];
+    const length = (0, randint_1.randint)(6, 10);
+    for (let i = 0; i < length; i++)
+        randomValeurs.push((0, randint_1.randint)(1, 20));
+    const sortedValues = randomValeurs.sort((a, b) => a - b);
+    const middleIndex = Math.floor(randomValeurs.length / 2);
+    let median;
+    if (randomValeurs.length % 2 === 0) {
+        median = (sortedValues[middleIndex - 1] + sortedValues[middleIndex]) / 2;
+    }
+    else {
+        median = sortedValues[middleIndex];
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: median + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: randomValeurs[(0, randint_1.randint)(0, randomValeurs.length)] + '',
+                    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: `On considère la liste suivante : $${randomValeurs.join(';\\ ')}.$
+    $\\\\$Calculer la médiane de cette liste de valeurs.`,
+        answer: median + '',
+        keys: ['f', 'cap', 'underscore'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getMedian = getMedian;

package/lib/exercises/probaStat/probabilityTree.d.ts

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

package/lib/exercises/probaStat/probabilityTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"probabilityTree.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/probabilityTree.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,eAAe,EAAE,QAS7B,CAAC;AAOF,wBAAgB,kBAAkB,IAAI,QAAQ,CA2H7C"}

package/lib/exercises/probaStat/probabilityTree.js

@@ -0,0 +1,135 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getProbabilityTree = exports.probabilityTree = void 0;
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+const simplify_1 = require("../../tree/parsers/simplify");
+const shuffle_1 = require("../../utils/shuffle");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
+exports.probabilityTree = {
+    id: 'probabilityTree',
+    connector: '=',
+    instruction: '',
+    label: "Calculs de probabilités à l'aide d'un arbre pondéré",
+    levels: ['1', '0'],
+    isSingleStep: false,
+    section: 'Probabilités',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getProbabilityTree, nb),
+};
+function pgcd(a, b) {
+    while (b)
+        [a, b] = [b, a % b];
+    return a;
+}
+function getProbabilityTree() {
+    const A = (0, randint_1.randint)(2, 9);
+    const B = (0, randint_1.randint)(2, 10 - A);
+    const AC = (0, randint_1.randint)(2, 9);
+    const AD = (0, randint_1.randint)(2, 10 - AC);
+    const BC = (0, randint_1.randint)(2, 9);
+    const BD = (0, randint_1.randint)(2, 10 - BC);
+    const pA = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(A / (A + B)));
+    const pB = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(B / (A + B)));
+    const pA_C = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(AC / (AC + AD)));
+    const pA_D = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(AD / (AC + AD)));
+    const pB_C = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(BC / (BC + BD)));
+    const pB_D = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(BD / (BC + BD)));
+    let instruction = `En utilisant l'arbre de probabilité suivant, `;
+    let startStatement = '';
+    let answer;
+    const rand = (0, randint_1.randint)(1, 5);
+    switch (rand) {
+        case 1: {
+            instruction += `$\\\\$ Calculer $P(A \\cap C)$`;
+            startStatement = `P(A \\cap C)`;
+            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pA, pA_C));
+            break;
+        }
+        case 2: {
+            instruction += `$\\\\$ Calculer $P(A \\cap D)$`;
+            startStatement = `P(A \\cap D)`;
+            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pA, pA_D));
+            break;
+        }
+        case 3: {
+            instruction += `$\\\\$ Calculer $P(B \\cap C)$`;
+            startStatement = `P(B \\cap C)`;
+            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_C));
+            break;
+        }
+        case 4: {
+            instruction += `$\\\\$ Calculer $P(B \\cap D)$`;
+            startStatement = `P(B \\cap D)`;
+            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_D));
+            break;
+        }
+        default:
+            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_D)); // juste pour éviter l'erreur
+    }
+    let commands = [
+        'A = Point({2,2})',
+        'B = Point({2,-2})',
+        'AC = Point({5,3})',
+        'AD = Point({5,1})',
+        'BC = Point({5,-1})',
+        'BD = Point({5,-3})',
+        'Segment(Point({0,0}),A)',
+        'Segment(A,AC)',
+        'Segment(A,AD)',
+        'Segment(Point({0,0}),B)',
+        'Segment(B,BC)',
+        'Segment(B,BD)',
+        'ShowAxes(false)',
+        'ShowGrid(false)',
+        `Text("\\scriptsize${A / pgcd(A, A + B)}/${(A + B) / pgcd(A, A + B)}", (0.3, 2.1), true, true)`,
+        `Text("\\scriptsize${AC / pgcd(AC, AC + AD)}/${(AC + AD) / pgcd(AC, AC + AD)}", (2.8, 3.5), true, true)`,
+        `Text("\\scriptsize${AD / pgcd(AD, AC + AD)}/${(AC + AD) / pgcd(AD, AC + AD)}", (2.8, 1.4), true, true)`,
+        `Text("\\scriptsize${B / pgcd(B, A + B)}/${(A + B) / pgcd(B, A + B)}", (0.3, -1.2), true, true)`,
+        `Text("\\scriptsize${BC / pgcd(BC, BC + BD)}/${(BC + BD) / pgcd(BC, BC + BD)}", (2.8, -0.6), true, true)`,
+        `Text("\\scriptsize${BD / pgcd(BD, BC + BD)}/${(BC + BD) / pgcd(BD, BC + BD)}", (2.8, -2.5), true, true)`,
+        'Text("A", (1.85 , 2.5))',
+        'Text("B", (1.85 , -2.8))',
+        'Text("C", (5.5 , 2.85))',
+        'Text("D", (5.5 , 0.85))',
+        'Text("C", (5.5 , -1.1))',
+        'Text("D", (5.5 , -3.1))',
+    ];
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(answer, new numberNode_1.NumberNode((0, randint_1.randint)(2, 11)))).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 = {
+        instruction,
+        startStatement,
+        answer: answer.toTex(),
+        keys: [],
+        commands,
+        coords: [-2, 8, -5, 5],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getProbabilityTree = getProbabilityTree;

package/lib/exercises/probaStat/quartiles.d.ts

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

package/lib/exercises/probaStat/quartiles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quartiles.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/quartiles.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,SAAS,EAAE,QAUvB,CAAC;AAEF,wBAAgB,YAAY,IAAI,QAAQ,CAkGvC"}

package/lib/exercises/probaStat/quartiles.js

@@ -0,0 +1,96 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getQuartiles = exports.quartiles = void 0;
+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.quartiles = {
+    id: 'quartiles',
+    connector: '=',
+    instruction: '',
+    label: "Calcul des quartiles d'une série de valeurs",
+    levels: ['1', '0'],
+    isSingleStep: false,
+    section: 'Probabilités',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getQuartiles, nb),
+    keys: ['cap', 'underscore'],
+};
+function getQuartiles() {
+    const getRandomUniqueValues = (count, min, max) => {
+        const uniqueValues = new Set();
+        while (uniqueValues.size < count) {
+            uniqueValues.add((0, randint_1.randint)(min, max));
+        }
+        return Array.from(uniqueValues).sort((a, b) => a - b);
+    };
+    const randomValeurs = getRandomUniqueValues(5, 1, 20);
+    const randomEffectives = [1, 2, 3, 4, 5].map((el) => (0, randint_1.randint)(1, 6));
+    let sortedValues = [];
+    for (let i = 0; i < randomEffectives.length; i++)
+        for (let j = 0; j < randomEffectives[i]; j++)
+            sortedValues.push(randomValeurs[i]);
+    const n = randomEffectives.reduce((sum, value) => sum + value, 0);
+    const firstQuartileIndex = Math.round(n / 4 + 0.49);
+    const thirdQuartileIndex = Math.round((3 * n) / 4 + 0.49);
+    console.log(thirdQuartileIndex + '///' + (3 * n) / 4);
+    const firstQuartile = sortedValues[firstQuartileIndex - 1];
+    const thirdQuartile = sortedValues[thirdQuartileIndex - 1];
+    const randomQuartile = (0, randint_1.randint)(0, 2);
+    let quartileToString;
+    let choosenQuartile;
+    switch (randomQuartile) {
+        case 0:
+            quartileToString = 'premier quartile';
+            choosenQuartile = firstQuartile;
+            break;
+        case 1:
+            quartileToString = 'troisième quartile';
+            choosenQuartile = thirdQuartile;
+            break;
+        default:
+            quartileToString = 'troisième quartile';
+            choosenQuartile = thirdQuartile;
+            break;
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: choosenQuartile + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: randomValeurs[(0, randint_1.randint)(0, randomValeurs.length)] + '',
+                    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: `On considère le tableau d'effectifs suivant : 
+
+| | | | | | |
+|-|-|-|-|-|-|
+|Valeur|${randomValeurs[0]}|${randomValeurs[1]}|${randomValeurs[2]}|${randomValeurs[3]}|${randomValeurs[4]}|
+|Effectif|${randomEffectives[0]}|${randomEffectives[1]}|${randomEffectives[2]}|${randomEffectives[3]}|${randomEffectives[4]}|
+
+Calculer le ${quartileToString} de cette série de valeurs.`,
+        answer: choosenQuartile + '',
+        keys: ['f', 'cap', 'underscore'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getQuartiles = getQuartiles;

package/lib/exercises/probaStat/quartilesList.d.ts

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

package/lib/exercises/probaStat/quartilesList.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quartilesList.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/quartilesList.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,YAAY,IAAI,QAAQ,CAgFvC"}

package/lib/exercises/probaStat/quartilesList.js

@@ -0,0 +1,81 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getQuartiles = exports.quartilesList = void 0;
+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.quartilesList = {
+    id: 'quartilesList',
+    connector: '=',
+    instruction: '',
+    label: "Calcul des quartiles d'une liste",
+    levels: ['1', '0'],
+    isSingleStep: false,
+    section: 'Statistiques',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getQuartiles, nb),
+    keys: [],
+};
+function getQuartiles() {
+    let randomValeurs = [];
+    const length = (0, randint_1.randint)(5, 9);
+    for (let i = 0; i < length; i++)
+        randomValeurs.push((0, randint_1.randint)(1, 20));
+    const sortedValues = randomValeurs.sort((a, b) => a - b);
+    const firstQuartileIndex = Math.round(randomValeurs.length / 4 + 0.49);
+    const thirdQuartileIndex = Math.round((3 * randomValeurs.length) / 4 + 0.49);
+    const firstQuartile = sortedValues[firstQuartileIndex - 1];
+    const thirdQuartile = sortedValues[thirdQuartileIndex - 1];
+    const randomQuartile = (0, randint_1.randint)(0, 2);
+    let quartileToString;
+    let choosenQuartile;
+    switch (randomQuartile) {
+        case 0:
+            quartileToString = 'premier quartile';
+            choosenQuartile = firstQuartile;
+            break;
+        case 1:
+            quartileToString = 'troisième quartile';
+            choosenQuartile = thirdQuartile;
+            break;
+        default:
+            quartileToString = 'troisième quartile';
+            choosenQuartile = thirdQuartile;
+            break;
+    }
+    let stringList = '';
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: choosenQuartile + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: randomValeurs[(0, randint_1.randint)(0, randomValeurs.length)] + '',
+                    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: `On considère la liste suivante : $${randomValeurs.join(';\\ ')}.$
+    $\\\\$Calculer le ${quartileToString} de cette série de valeurs.`,
+        answer: choosenQuartile + '',
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getQuartiles = getQuartiles;

package/lib/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticExplicitFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,8BAA8B,EAAE,QAU5C,CAAC;AAEF,wBAAgB,iCAAiC,IAAI,QAAQ,CA6C5D"}
+{"version":3,"file":"arithmeticExplicitFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,8BAA8B,EAAE,QAU5C,CAAC;AAEF,wBAAgB,iCAAiC,IAAI,QAAQ,CAgD5D"}

package/lib/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.js

@@ -28,6 +28,7 @@ function getArithmeticExplicitFormulaUsage() {
             id: (0, uuid_1.v4)() + '',
             statement: (firstValue + askedRank * reason).toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -37,6 +38,7 @@ function getArithmeticExplicitFormulaUsage() {
                     id: (0, uuid_1.v4)() + '',
                     statement: ((0, randint_1.randint)(-5, 6, [firstValue]) + askedRank * reason).toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -50,6 +52,7 @@ function getArithmeticExplicitFormulaUsage() {
         answer: (firstValue + askedRank * reason).toString(),
         keys: ['r', 'n', 'u', 'underscore'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticFindExplicitFormula.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,6BAA6B,EAAE,QAU3C,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CA6C3D"}
+{"version":3,"file":"arithmeticFindExplicitFormula.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,6BAA6B,EAAE,QAU3C,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAgD3D"}

package/lib/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.js

@@ -28,6 +28,7 @@ function getArithmeticFindExplicitFormula() {
             id: (0, uuid_1.v4)() + '',
             statement: formula.toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -37,6 +38,7 @@ function getArithmeticFindExplicitFormula() {
                     id: (0, uuid_1.v4)() + '',
                     statement: new polynomial_1.Polynomial([firstValue + (0, randint_1.randint)(-3, 4), reason + (0, randint_1.randint)(-3, 4)], 'n').toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -50,6 +52,7 @@ function getArithmeticFindExplicitFormula() {
         answer: formula.toString(),
         keys: ['r', 'n', 'u', 'underscore'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticFindReason.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticFindReason.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticFindReason.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,oBAAoB,EAAE,QAWlC,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CA4ClD"}
+{"version":3,"file":"arithmeticFindReason.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticFindReason.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,oBAAoB,EAAE,QAWlC,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CA+ClD"}

package/lib/exercises/sequences/arithmetic/arithmeticFindReason.js

@@ -28,6 +28,7 @@ function getArithmeticFindReason() {
             id: (0, uuid_1.v4)() + '',
             statement: reason + '',
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -37,6 +38,7 @@ function getArithmeticFindReason() {
                     id: (0, uuid_1.v4)() + '',
                     statement: reason + (0, randint_1.randint)(-5, 6, [0]) + '',
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -50,6 +52,7 @@ function getArithmeticFindReason() {
         answer: reason.toString(),
         keys: ['r', 'n', 'u', 'underscore'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticReasonUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticReasonUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticReasonUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CA2CnD"}
+{"version":3,"file":"arithmeticReasonUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticReasonUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CA8CnD"}

package/lib/exercises/sequences/arithmetic/arithmeticReasonUsage.js

@@ -27,6 +27,7 @@ function getArithmeticReasonUsage() {
             id: (0, uuid_1.v4)() + '',
             statement: (startValue + reason).toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -36,6 +37,7 @@ function getArithmeticReasonUsage() {
                     id: (0, uuid_1.v4)() + '',
                     statement: startValue + reason + (0, randint_1.randint)(-5, 6, [0]) + '',
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -49,6 +51,7 @@ function getArithmeticReasonUsage() {
         answer: (startValue + reason).toString(),
         keys: ['r', 'n', 'u', 'underscore'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticRecurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAiC,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM7F,eAAO,MAAM,gCAAgC,EAAE,QAU9C,CAAC;AAEF,wBAAgB,mCAAmC,IAAI,QAAQ,CA2C9D"}
+{"version":3,"file":"arithmeticRecurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAiC,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM7F,eAAO,MAAM,gCAAgC,EAAE,QAU9C,CAAC;AAEF,wBAAgB,mCAAmC,IAAI,QAAQ,CA8C9D"}

package/lib/exercises/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.js

@@ -27,6 +27,7 @@ function getArithmeticRecurrenceFormulaUsage() {
             id: (0, uuid_1.v4)() + '',
             statement: (firstValue + reason).toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -36,6 +37,7 @@ function getArithmeticRecurrenceFormulaUsage() {
                     id: (0, uuid_1.v4)() + '',
                     statement: firstValue + reason + (0, randint_1.randint)(-5, 6, [0]) + '',
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -49,6 +51,7 @@ function getArithmeticRecurrenceFormulaUsage() {
         answer: (firstValue + reason).toString(),
         keys: ['r', 'n', 'u', 'underscore'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticThresholdFind.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticThresholdFind.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticThresholdFind.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAIjE,eAAO,MAAM,uBAAuB,EAAE,QAUrC,CAAC;AAEF,wBAAgB,0BAA0B,IAAI,QAAQ,CAuDrD"}
+{"version":3,"file":"arithmeticThresholdFind.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticThresholdFind.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAIjE,eAAO,MAAM,uBAAuB,EAAE,QAUrC,CAAC;AAEF,wBAAgB,0BAA0B,IAAI,QAAQ,CA0DrD"}