math-exercises 1.4.15 → 1.4.16

package/lib/exercises/calcul/arithmetics/paritySumsAndProducts.d.ts

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

package/lib/exercises/calcul/arithmetics/paritySumsAndProducts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"paritySumsAndProducts.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/paritySumsAndProducts.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM7F,eAAO,MAAM,qBAAqB,EAAE,YAanC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CA8F3D"}

package/lib/exercises/calcul/arithmetics/paritySumsAndProducts.js

@@ -0,0 +1,113 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getParitySumsAndProductsQuestion = exports.paritySumsAndProducts = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.paritySumsAndProducts = {
+    id: 'paritySumsAndProducts',
+    connector: '=',
+    instruction: '',
+    label: 'Parité de sommes et de produits',
+    levels: ['2nde'],
+    isSingleStep: true,
+    sections: ['Arithmétique'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getParitySumsAndProductsQuestion, nb, 12),
+    qcmTimer: 60,
+    freeTimer: 60,
+    answerType: 'QCM',
+    maxAllowedQuestions: 12,
+};
+function getParitySumsAndProductsQuestion() {
+    const type = (0, randint_1.randint)(0, 12);
+    let instruction = '';
+    let answer;
+    switch (type) {
+        case 0:
+            instruction = 'La somme de deux nombres pairs est un nombre...';
+            answer = 'Pair';
+            break;
+        case 1:
+            instruction = 'La somme de deux nombres impairs est un nombre...';
+            answer = 'Pair';
+            break;
+        case 2:
+            instruction = "La somme d'un nombre pair et d'un nombre impair un nombre...";
+            answer = 'Impair';
+            break;
+        case 3:
+            instruction = 'La somme de trois nombres impairs est un nombre...';
+            answer = 'Impair';
+            break;
+        case 4:
+            instruction = 'La somme de trois nombres consécutifs est un nombre...';
+            answer = 'Parfois pair, parfois impair';
+            break;
+        case 5:
+            instruction = 'La somme de quatre nombres consécutifs est un nombre...';
+            answer = 'Pair';
+            break;
+        case 6:
+            instruction = 'Le produit de deux nombres pairs est un nombre...';
+            answer = 'Pair';
+            break;
+        case 7:
+            instruction = 'Le produit de deux nombres impairs est un nombre...';
+            answer = 'Impair';
+            break;
+        case 8:
+            instruction = "Le produit d'un nombre pair et d'un nombre impair est un nombre...";
+            answer = 'Pair';
+            break;
+        case 9:
+            instruction = 'Le produit de trois nombres consécutifs est un nombre...';
+            answer = 'Pair';
+            break;
+        case 10:
+            instruction = 'Le produit de trois nombres impairs est un nombre...';
+            answer = 'Impair';
+            break;
+        case 11:
+            instruction = 'Le produit de trois nombres pairs est un nombre...';
+            answer = 'Pair';
+            break;
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: `Pair`,
+            isRightAnswer: answer === 'Pair',
+            format: 'raw',
+        });
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: `Impair`,
+            isRightAnswer: answer === 'Impair',
+            format: 'raw',
+        });
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: `Parfois pair, parfois impair`,
+            isRightAnswer: answer === 'Parfois pair, parfois impair',
+            format: 'raw',
+        });
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: `Premier`,
+            isRightAnswer: answer === 'Premier',
+            format: 'raw',
+        });
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: answer,
+        instruction,
+        keys: [],
+        getPropositions,
+        answerFormat: 'raw',
+    };
+    return question;
+}
+exports.getParitySumsAndProductsQuestion = getParitySumsAndProductsQuestion;

package/lib/exercises/combinatory/anagrams.d.ts

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

package/lib/exercises/combinatory/anagrams.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"anagrams.d.ts","sourceRoot":"","sources":["../../../src/exercises/combinatory/anagrams.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAqEhH,eAAO,MAAM,QAAQ,EAAE,YAWtB,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAoD9C"}

package/lib/exercises/combinatory/anagrams.js

@@ -0,0 +1,128 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getAnagramsQuestion = exports.anagrams = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../math/utils/random/randint");
+const random_1 = require("../../utils/random");
+const uuid_1 = require("uuid");
+const words = [
+    'angle',
+    'armoire',
+    'banc',
+    'bureau',
+    'cabinet',
+    'carreau',
+    'chaise',
+    'classe',
+    'clé',
+    'coin',
+    'couloir',
+    'dossier',
+    'eau',
+    'école',
+    'écriture',
+    'entrée',
+    'escalier',
+    'étagère',
+    'étude',
+    'extérieur',
+    'fenêtre',
+    'intérieur',
+    'lavabo',
+    'lecture',
+    'lit',
+    'marche',
+    'matelas',
+    'maternelle',
+    'meuble',
+    'mousse',
+    'mur',
+    'peluche',
+    'placard',
+    'plafond',
+    'porte',
+    'portemanteau',
+    'poubelle',
+    'radiateur',
+    'rampe',
+    'récréation',
+    'rentrée',
+    'rideau',
+    'robinet',
+    'salle',
+    'savon',
+    'serrure',
+    'serviette',
+    'siège',
+    'sieste',
+    'silence',
+    'sol',
+    'sommeil',
+    'sonnette',
+    'sortie',
+    'table',
+    'tableau',
+    'tabouret',
+    'tapis',
+    'tiroir',
+    'toilette',
+    'vitre',
+];
+exports.anagrams = {
+    id: 'anagrams',
+    connector: '=',
+    instruction: '',
+    label: "Compter le nombre d'anagrammes d'un mot",
+    levels: ['TermSpé'],
+    isSingleStep: true,
+    sections: ['Combinatoire et dénombrement'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAnagramsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getAnagramsQuestion() {
+    const word = (0, random_1.random)(words);
+    const answer = word
+        .split('')
+        .map((el, index) => index + 1)
+        .reduce((acc, curr) => acc * curr, 1);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer + ``,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        (0, exercise_1.tryToAddWrongProp)(res, Math.pow(word.length, word.length) + '');
+        (0, exercise_1.tryToAddWrongProp)(res, (word.length * (word.length + 1)) / 2 + '');
+        (0, exercise_1.tryToAddWrongProp)(res, word.length * word.length + '');
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, randint_1.randint)(1000, 10000);
+                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, exercise_1.shuffleProps)(res, n);
+    };
+    const question = {
+        answer: answer + '',
+        instruction: `Combien d'anagrammes mathématiques du mot ${word} sont possibles ? `,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getAnagramsQuestion = getAnagramsQuestion;

package/lib/exercises/combinatory/ballsCounting.d.ts

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

package/lib/exercises/combinatory/ballsCounting.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ballsCounting.d.ts","sourceRoot":"","sources":["../../../src/exercises/combinatory/ballsCounting.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAKhH,eAAO,MAAM,aAAa,EAAE,YAW3B,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CA8GnD"}

package/lib/exercises/combinatory/ballsCounting.js

@@ -0,0 +1,124 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getBallsCountingQuestion = exports.ballsCounting = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../math/utils/random/randint");
+const uuid_1 = require("uuid");
+exports.ballsCounting = {
+    id: 'ballsCounting',
+    connector: '=',
+    instruction: '',
+    label: 'Dénombrement avec des boules',
+    levels: ['TermSpé'],
+    isSingleStep: true,
+    sections: ['Combinatoire et dénombrement'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getBallsCountingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getBallsCountingQuestion() {
+    const type = (0, randint_1.randint)(0, 6);
+    let instruction = '';
+    let answer = '';
+    const blacks = (0, randint_1.randint)(2, 6);
+    const greens = (0, randint_1.randint)(2, 6);
+    const reds = (0, randint_1.randint)(3, 6);
+    const total = blacks + greens + reds;
+    switch (type) {
+        case 0:
+            instruction = ``;
+            answer = total * (total - 1) * (total - 2) + '';
+            break;
+        case 1:
+            instruction = `comportant trois boules rouges`;
+            answer = reds * (reds - 1) * (reds - 2) + '';
+            break;
+        case 2:
+            instruction = `ne comportant pas de boule noire`;
+            answer = (reds + greens) * (reds + greens - 1) * (reds + greens - 2) + '';
+            break;
+        case 3:
+            instruction = `comportant au moins une boule noire`;
+            answer = total * (total - 1) * (total - 2) - (reds + greens) * (reds + greens - 1) * (reds + greens - 2) + '';
+            break;
+        case 4:
+            instruction = `comportant trois boules de trois couleurs différentes`;
+            answer = 6 * (blacks * greens * reds) + '';
+            break;
+        case 5:
+            instruction = `comportant exactement une boule verte et deux boules noires`;
+            answer = 6 * (greens * blacks * (blacks - 1)) + '';
+            break;
+        case 6:
+            instruction = `comportant exactement une boule verte`;
+            answer = 6 * greens * (reds + blacks) * (reds + blacks - 1) + '';
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        switch (type) {
+            case 0:
+                (0, exercise_1.tryToAddWrongProp)(res, total * total * total + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 + '');
+                break;
+            case 1:
+                (0, exercise_1.tryToAddWrongProp)(res, reds * reds * reds + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 1 + '');
+                break;
+            case 2:
+                (0, exercise_1.tryToAddWrongProp)(res, (reds + greens) * (reds + greens) * (reds + greens) + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * blacks * (reds + greens) * (reds + greens - 1) + '');
+                break;
+            case 3:
+                (0, exercise_1.tryToAddWrongProp)(res, (reds + greens) * (reds + greens) * (reds + greens) + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 3 * (reds + greens) * (reds + greens - 1) + '');
+                break;
+            case 4:
+                (0, exercise_1.tryToAddWrongProp)(res, blacks * greens * reds + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 + '');
+                break;
+            case 5:
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * greens * blacks * blacks + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 + '');
+                break;
+            case 6:
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * (blacks * greens * reds) + '');
+                (0, exercise_1.tryToAddWrongProp)(res, greens * (reds + blacks) * (reds + blacks - 1) + '');
+                break;
+        }
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, randint_1.randint)(1, 100) + '';
+                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, exercise_1.shuffleProps)(res, n);
+    };
+    const question = {
+        answer: answer,
+        instruction: `Une urne contient ${blacks} boules noires numérotées de 1 à ${blacks}, ${reds} boules rouges numérotées de 1 à ${reds} et ${greens} boules vertes numérotées de 1 à ${greens}.
+    On tire successivement et sans remise 3 boules dans l'urne. 
+    Combien de tirages ${instruction} sont possibles ?`,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getBallsCountingQuestion = getBallsCountingQuestion;

package/lib/exercises/combinatory/diceCounting.d.ts

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

package/lib/exercises/combinatory/diceCounting.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"diceCounting.d.ts","sourceRoot":"","sources":["../../../src/exercises/combinatory/diceCounting.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAKhH,eAAO,MAAM,YAAY,EAAE,YAW1B,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAwHlD"}

package/lib/exercises/combinatory/diceCounting.js

@@ -0,0 +1,134 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getDiceCountingQuestion = exports.diceCounting = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../math/utils/random/randint");
+const uuid_1 = require("uuid");
+exports.diceCounting = {
+    id: 'diceCounting',
+    connector: '=',
+    instruction: '',
+    label: 'Dénombrement avec des dés',
+    levels: ['TermSpé'],
+    isSingleStep: true,
+    sections: ['Combinatoire et dénombrement'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDiceCountingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getDiceCountingQuestion() {
+    const type = (0, randint_1.randint)(0, 8);
+    let instruction = '';
+    let answer = '';
+    let face1, face2, face3;
+    switch (type) {
+        case 0:
+            instruction = `avec exactement deux chiffres identiques`;
+            answer = 6 * 3 * 5 + '';
+            break;
+        case 1:
+            instruction = `avec trois chiffres identiques`;
+            answer = 6 + '';
+            break;
+        case 2:
+            face1 = (0, randint_1.randint)(1, 7);
+            instruction = `avec exactement une fois la face ${face1}`;
+            answer = 3 * 5 * 5 + '';
+            break;
+        case 3:
+            face1 = (0, randint_1.randint)(1, 7);
+            instruction = `avec exactement deux fois la face ${face1}`;
+            answer = 3 * 5 + '';
+            break;
+        case 4:
+            face1 = (0, randint_1.randint)(1, 7);
+            face2 = (0, randint_1.randint)(1, 7, [face1]);
+            face3 = (0, randint_1.randint)(1, 7, [face1, face2]);
+            instruction = `avec exactement les faces ${face1}, ${face2} et ${face3}`;
+            answer = 6 + '';
+            break;
+        case 5:
+            face1 = (0, randint_1.randint)(1, 7);
+            face2 = (0, randint_1.randint)(1, 7, [face1]);
+            face3 = (0, randint_1.randint)(1, 7, [face1, face2]);
+            instruction = `avec exactement une fois la face ${face1} et une fois la face ${face2}`;
+            answer = 3 * 5 + '';
+            break;
+        case 6:
+            instruction = `dans lesquels toutes les faces sont différentes`;
+            answer = 6 * 5 * 4 + '';
+            break;
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        switch (type) {
+            case 0:
+                (0, exercise_1.tryToAddWrongProp)(res, 3 * 5 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * 6 * 3 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * 3 + '');
+                break;
+            case 1:
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * 3 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 1 + '');
+                break;
+            case 2:
+                (0, exercise_1.tryToAddWrongProp)(res, 3 * 6 * 6 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 5 * 5 + '');
+                break;
+            case 3:
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * 3 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * 5 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 5 + '');
+                break;
+            case 4:
+                (0, exercise_1.tryToAddWrongProp)(res, 3 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 1 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * 6 * 6 + '');
+                break;
+            case 5:
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * 3 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * 5 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 5 + '');
+                break;
+            case 6:
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * 6 * 6 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 * 5 + '');
+                (0, exercise_1.tryToAddWrongProp)(res, 6 + '');
+                break;
+        }
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, randint_1.randint)(1, 100) + '';
+                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, exercise_1.shuffleProps)(res, n);
+    };
+    const question = {
+        answer: answer,
+        instruction: `On tire 3 fois consécutivement un dé à six faces numérotées de 1 à 6. Combien de tirages ${instruction} sont possibles ?`,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getDiceCountingQuestion = getDiceCountingQuestion;

package/lib/exercises/exercise.d.ts

@@ -36,5 +36,5 @@ export interface MathExercise {
     freeTimer: number;
 }
 export type MathLevel = '6ème' | '5ème' | '4ème' | '3ème' | '2nde' | '1reTech' | '1reESM' | '1reSpé' | 'TermSpé' | 'TermTech' | 'MathExp' | 'MathComp' | 'CAP' | '2ndPro' | '1rePro' | 'TermPro';
-export type MathSection = 'Arithmétique' | 'Calcul littéral' | 'Calculs' | 'Conversions' | 'Dérivation' | 'Droites' | 'Ensembles et intervalles' | 'Équations' | 'Équations différentielles' | 'Exponentielle' | 'Fonction cube' | 'Fonction inverse' | 'Fonctions' | 'Fonctions affines' | 'Fonctions de référence' | 'Fractions' | 'Géométrie cartésienne' | 'Géométrie euclidienne' | 'Inéquations' | 'Intégration' | 'Limites' | 'Logarithme népérien' | 'Nombres complexes' | 'Pourcentages' | 'Primitives' | 'Probabilités' | 'Proportionnalité' | 'Puissances' | 'Racines carrées' | 'Second degré' | 'Statistiques' | 'Suites' | 'Trigonométrie' | 'Vecteurs';
+export type MathSection = 'Arithmétique' | 'Calcul littéral' | 'Calculs' | 'Combinatoire et dénombrement' | 'Conversions' | 'Dérivation' | 'Droites' | 'Ensembles et intervalles' | 'Équations' | 'Équations différentielles' | 'Exponentielle' | 'Fonction cube' | 'Fonction inverse' | 'Fonctions' | 'Fonctions affines' | 'Fonctions de référence' | 'Fractions' | 'Géométrie cartésienne' | 'Géométrie euclidienne' | 'Inéquations' | 'Intégration' | 'Limites' | 'Logarithme népérien' | 'Nombres complexes' | 'Pourcentages' | 'Primitives' | 'Probabilités' | 'Proportionnalité' | 'Puissances' | 'Racines carrées' | 'Second degré' | 'Statistiques' | 'Suites' | 'Trigonométrie' | 'Vecteurs';
 //# sourceMappingURL=exercise.d.ts.map

package/lib/exercises/exercise.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"exercise.d.ts","sourceRoot":"","sources":["../../src/exercises/exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAI3C,eAAO,MAAM,iBAAiB,UAAW,WAAW,EAAE,aAAa,MAAM,WAAU,KAAK,GAAG,KAAK,SAS/F,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,WAAW,EAAE,KAAK,MAAM,kBAE3D,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAElC,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC;CACvB,CAAC;AACF,MAAM,WAAW,QAAQ;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,CAAC,EAAE,GAAG,CAAC;IACd,cAAc,CAAC,EAAE,UAAU,GAAG,QAAQ,CAAC;IACvC,eAAe,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,WAAW,EAAE,CAAC;CAC/C;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,OAAO,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,SAAS,CAAC,EAAE,GAAG,GAAG,OAAO,GAAG,UAAU,CAAC;IACvC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,gBAAgB,GAAG,QAAQ,EAAE,CAAC;IAC9D,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,UAAU,GACV,SAAS,GACT,UAAU,GACV,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,MAAM,WAAW,GACnB,cAAc,GACd,iBAAiB,GACjB,SAAS,GACT,aAAa,GACb,YAAY,GACZ,SAAS,GACT,0BAA0B,GAC1B,WAAW,GACX,2BAA2B,GAC3B,eAAe,GACf,eAAe,GACf,kBAAkB,GAClB,WAAW,GACX,mBAAmB,GACnB,wBAAwB,GACxB,WAAW,GACX,uBAAuB,GACvB,uBAAuB,GACvB,aAAa,GACb,aAAa,GACb,SAAS,GACT,qBAAqB,GACrB,mBAAmB,GACnB,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,YAAY,GACZ,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,eAAe,GACf,UAAU,CAAC"}
+{"version":3,"file":"exercise.d.ts","sourceRoot":"","sources":["../../src/exercises/exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAI3C,eAAO,MAAM,iBAAiB,UAAW,WAAW,EAAE,aAAa,MAAM,WAAU,KAAK,GAAG,KAAK,SAS/F,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,WAAW,EAAE,KAAK,MAAM,kBAE3D,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAElC,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC;CACvB,CAAC;AACF,MAAM,WAAW,QAAQ;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,CAAC,EAAE,GAAG,CAAC;IACd,cAAc,CAAC,EAAE,UAAU,GAAG,QAAQ,CAAC;IACvC,eAAe,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,WAAW,EAAE,CAAC;CAC/C;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,OAAO,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,SAAS,CAAC,EAAE,GAAG,GAAG,OAAO,GAAG,UAAU,CAAC;IACvC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,gBAAgB,GAAG,QAAQ,EAAE,CAAC;IAC9D,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,UAAU,GACV,SAAS,GACT,UAAU,GACV,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,MAAM,WAAW,GACnB,cAAc,GACd,iBAAiB,GACjB,SAAS,GACT,8BAA8B,GAC9B,aAAa,GACb,YAAY,GACZ,SAAS,GACT,0BAA0B,GAC1B,WAAW,GACX,2BAA2B,GAC3B,eAAe,GACf,eAAe,GACf,kBAAkB,GAClB,WAAW,GACX,mBAAmB,GACnB,wBAAwB,GACxB,WAAW,GACX,uBAAuB,GACvB,uBAAuB,GACvB,aAAa,GACb,aAAa,GACb,SAAS,GACT,qBAAqB,GACrB,mBAAmB,GACnB,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,YAAY,GACZ,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,eAAe,GACf,UAAU,CAAC"}

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

@@ -1 +1 @@
-{"version":3,"file":"exercises.d.ts","sourceRoot":"","sources":["../../src/exercises/exercises.ts"],"names":[],"mappings":"AAkLA,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAc1C,eAAO,MAAM,SAAS,EAAE,YAAY,EA+QnC,CAAC"}
+{"version":3,"file":"exercises.d.ts","sourceRoot":"","sources":["../../src/exercises/exercises.ts"],"names":[],"mappings":"AAkLA,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAmB1C,eAAO,MAAM,SAAS,EAAE,YAAY,EAwRnC,CAAC"}

package/lib/exercises/exercises.js

@@ -182,6 +182,11 @@ const niceRootsFromDevForm_1 = require("./functions/trinoms/niceRootsFromDevForm
 const diceBasicProbas_1 = require("./probaStat/diceBasicProbas");
 const cardBasicProbas_1 = require("./probaStat/cardBasicProbas");
 const ballsBasicProbas_1 = require("./probaStat/ballsBasicProbas");
+const coordinatesReading_1 = require("./geometry/vectors/coordinatesReading");
+const anagrams_1 = require("./combinatory/anagrams");
+const ballsCounting_1 = require("./combinatory/ballsCounting");
+const diceCounting_1 = require("./combinatory/diceCounting");
+const paritySumsAndProducts_1 = require("./calcul/arithmetics/paritySumsAndProducts");
 exports.exercises = [
     /**
      * calcul litteral
@@ -205,6 +210,8 @@ exports.exercises = [
     equationType4Exercise_1.equationType4Exercise,
     firstDegreeEquation_1.firstDegreeEquation,
     equationSimpleSquare_1.equationSimpleSquare,
+    multiplicationEquation_1.multiplicationEquation,
+    fractionEquation_1.fractionEquation,
     /**
      * inequations
      */
@@ -234,6 +241,10 @@ exports.exercises = [
     addAndSubWithoutRelatives_1.addAndSubWithoutRelatives,
     operationsPriorities_1.operationsPriorities,
     operationsPrioritiesWithoutRelative_1.operationsPrioritiesWithoutRelative,
+    mentalAddAndSub_1.mentalAddAndSub,
+    mentalMultiplications_1.mentalMultiplications,
+    mentalDivisions_1.mentalDivisions,
+    mentalPercentage_1.mentalPercentage,
     /**
      * rounding
      */
@@ -264,12 +275,22 @@ exports.exercises = [
     trigonometrySideCalcul_1.trigonometrySideCalcul,
     rightTriangleArea_1.rightTriangleArea,
     triangleArea_1.triangleArea,
+    rectangleArea_1.rectangleArea,
+    rectanglePerimeter_1.rectanglePerimeter,
+    squareArea_1.squareArea,
+    squarePerimeter_1.squarePerimeter,
+    triangleAreaV2_1.triangleAreaV2,
+    trianglePerimeter_1.trianglePerimeter,
+    circleArea_1.circleArea,
+    circleCircumference_1.circleCircumference,
+    distanceBetweenTwoPoints_1.distanceBetweenTwoPoints,
     /**
      * vectors
      */
     scalarProductViaCoords_1.scalarProductViaCoords,
     determinant_1.determinant,
     chasles_1.chasles,
+    coordinatesReading_1.coordinatesReading,
     /**
      * puissances
      */
@@ -328,7 +349,7 @@ exports.exercises = [
     expDerivativeTwo_1.expDerivativeTwo,
     expDerivativeThree_1.expDerivativeThree,
     /**
-     * primitive
+     * primitive and equa diff
      */
     constantPrimitive_1.constantPrimitive,
     polynomialPrimitive_1.polynomialPrimitive,
@@ -336,6 +357,8 @@ exports.exercises = [
     exponentialPrimitive_1.exponentialPrimitive,
     logarithmePrimitive_1.logarithmePrimitive,
     usualPrimitives_1.usualPrimitives,
+    equaDiffGeneralForme_1.exponentialDifferentialEquation,
+    equaDiffGeneralFormeWithIC_1.exponentialDifferentialEquationWithIC,
     /**
      * probabilités
      */
@@ -344,39 +367,21 @@ exports.exercises = [
     diceBasicProbas_1.diceBasicProbas,
     cardBasicProbas_1.cardBasicProbas,
     ballsBasicProbas_1.ballsBasicProbas,
+    /**arithmetic */
+    primeNumbers_1.primeNumbers,
+    paritySumsAndProducts_1.paritySumsAndProducts,
+    euclideanDivision_1.euclideanDivision,
     /**
      * islam
      */
     leadingCoefficient_1.leadingCoefficient,
     fractionToPercentToDecimal_1.fractionToPercentToDecimal,
     marginalAndConditionalFrequency_1.marginalAndConditionalFrequency,
-    mentalAddAndSub_1.mentalAddAndSub,
-    mentalMultiplications_1.mentalMultiplications,
-    mentalDivisions_1.mentalDivisions,
-    mentalPercentage_1.mentalPercentage,
     /**
      * nv generateurs
      */
-    capacityConversion_1.capacityConversion,
-    lengthConversion_1.lengthConversion,
-    massConversion_1.massConversion,
-    aeraConversion_1.aeraConversion,
-    volumeConversion_1.volumeConversion,
-    volumeCapacityConversion_1.volumeCapacityConversion,
-    primeNumbers_1.primeNumbers,
-    multiplicationEquation_1.multiplicationEquation,
-    fractionEquation_1.fractionEquation,
     leadingCoefficientCalculV1_1.leadingCoefficientCalculV1,
     leadingCoefficientCalculV2_1.leadingCoefficientCalculV2,
-    rectangleArea_1.rectangleArea,
-    rectanglePerimeter_1.rectanglePerimeter,
-    squareArea_1.squareArea,
-    squarePerimeter_1.squarePerimeter,
-    triangleAreaV2_1.triangleAreaV2,
-    trianglePerimeter_1.trianglePerimeter,
-    circleArea_1.circleArea,
-    circleCircumference_1.circleCircumference,
-    distanceBetweenTwoPoints_1.distanceBetweenTwoPoints,
     reduceExpression_1.reduceExpression,
     evaluateExpression_1.evaluateExpression,
     proportionalityTable_1.proportionalityTable,
@@ -384,11 +389,15 @@ exports.exercises = [
     expEquation_1.expEquation,
     expSimplifiying_1.expSimplifiying,
     logSimplifiying_1.logSimplifiying,
-    euclideanDivision_1.euclideanDivision,
     signFunction_1.signFunction,
     thirdDegreeFunctionVariation_1.thirdDegreeFunctionVariation,
-    equaDiffGeneralForme_1.exponentialDifferentialEquation,
-    equaDiffGeneralFormeWithIC_1.exponentialDifferentialEquationWithIC,
+    /**conversions */
+    capacityConversion_1.capacityConversion,
+    lengthConversion_1.lengthConversion,
+    massConversion_1.massConversion,
+    aeraConversion_1.aeraConversion,
+    volumeConversion_1.volumeConversion,
+    volumeCapacityConversion_1.volumeCapacityConversion,
     /**Stats */
     averageWithTable_1.averageWithTable,
     medianList_1.medianWithList,
@@ -430,4 +439,8 @@ exports.exercises = [
     sequenceRationalFracLimit_1.sequenceRationalFracLimit,
     sequencePolynomProductLimit_1.sequencePolynomProductLimit,
     sequenceGeometricLimit_1.sequenceGeometricLimit,
+    /**combinatory */
+    anagrams_1.anagrams,
+    ballsCounting_1.ballsCounting,
+    diceCounting_1.diceCounting,
 ];

package/lib/exercises/geometry/vectors/coordinatesReading.d.ts

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

package/lib/exercises/geometry/vectors/coordinatesReading.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coordinatesReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/coordinatesReading.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAMhH,eAAO,MAAM,kBAAkB,EAAE,YAWhC,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAsExD"}

package/lib/exercises/geometry/vectors/coordinatesReading.js

@@ -0,0 +1,81 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getCoordinatesReadingQuestion = exports.coordinatesReading = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const integer_1 = require("../../../math/numbers/integer/integer");
+const uuid_1 = require("uuid");
+exports.coordinatesReading = {
+    id: 'coordinatesReading',
+    connector: '=',
+    instruction: '',
+    label: "Lire les coordonnées d'un vecteur",
+    levels: ['2nde', '1reESM'],
+    isSingleStep: true,
+    sections: ['Vecteurs'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getCoordinatesReadingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getCoordinatesReadingQuestion() {
+    const [xA, yA] = integer_1.IntegerConstructor.randomDifferents(-5, 6, 2);
+    let xB, yB;
+    do {
+        [xB, yB] = integer_1.IntegerConstructor.randomDifferents(-5, 6, 2);
+    } while (xA === xB && yA === yB);
+    const xDelta = xB - xA;
+    const yDelta = yB - yA;
+    const answer = `\\left(${xDelta};${yDelta}\\right)`;
+    const commands = [`Vector((${xA},${yA}), (${xB}, ${yB}))`];
+    const xMin = Math.min(xA, xB);
+    const yMin = Math.min(yA, yB);
+    const xMax = Math.max(xA, xB);
+    const yMax = Math.max(yA, yB);
+    const coords = [
+        xMin === xMax ? xMin - 1 : xMin - 0.2 * Math.abs(xDelta),
+        xMin === xMax ? xMax + 1 : xMax + 0.2 * Math.abs(xDelta),
+        yMin === yMax ? yMin - 1 : yMin - 0.2 * Math.abs(yDelta),
+        yMin === yMax ? yMax + 1 : yMax + 0.2 * Math.abs(yDelta),
+    ];
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        (0, exercise_1.tryToAddWrongProp)(res, `\\left(${xA - xB};${yA - yB}\\right)`);
+        (0, exercise_1.tryToAddWrongProp)(res, `\\left(${xA + xB};${yA + yB}\\right)`);
+        (0, exercise_1.tryToAddWrongProp)(res, `\\left(${xA - yA};${xB - yB}\\right)`);
+        (0, exercise_1.tryToAddWrongProp)(res, `\\left(${yA - xA};${yB - xB}\\right)`);
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = '';
+                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, exercise_1.shuffleProps)(res, n);
+    };
+    const question = {
+        answer: answer,
+        instruction: `Lire les coordonnées du vecteur $\\overrightarrow u$ représentée ci-dessous :`,
+        keys: ['semicolon', 'u', 'overrightarrow', 'equal'],
+        getPropositions,
+        answerFormat: 'tex',
+        commands,
+        coords,
+    };
+    return question;
+}
+exports.getCoordinatesReadingQuestion = getCoordinatesReadingQuestion;

package/lib/exercises/utils/geogebra/getAdaptedCoords.d.ts

@@ -0,0 +1 @@
+//# sourceMappingURL=getAdaptedCoords.d.ts.map

package/lib/exercises/utils/geogebra/getAdaptedCoords.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"getAdaptedCoords.d.ts","sourceRoot":"","sources":["../../../../src/exercises/utils/geogebra/getAdaptedCoords.ts"],"names":[],"mappings":""}

package/lib/exercises/utils/geogebra/getAdaptedCoords.js

@@ -0,0 +1 @@
+"use strict";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "math-exercises",
-  "version": "1.4.15",
+  "version": "1.4.16",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [