math-exercises 1.3.61 → 1.3.63

package/lib/exercises/exercise.d.ts

@@ -32,5 +32,5 @@ export interface Exercise {
     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' | 'É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' | 'Intervalles' | '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' | '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,qBAAqB,CAAC;AAE5C,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,CAAC,EAAE,MAAM,CAAC;IACrB,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,eAAe,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,WAAW,EAAE,CAAC;CAC/C;AAED,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,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,MAAM,EAAE,CAAC;IAChB,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,gBAAgB,GAAG,QAAQ,EAAE,CAAC;IAC9D,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,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,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,qBAAqB,CAAC;AAE5C,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,CAAC,EAAE,MAAM,CAAC;IACrB,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,eAAe,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,WAAW,EAAE,CAAC;CAC/C;AAED,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,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,MAAM,EAAE,CAAC;IAChB,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,gBAAgB,GAAG,QAAQ,EAAE,CAAC;IAC9D,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"}

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

@@ -1 +1 @@
-{"version":3,"file":"exercises.d.ts","sourceRoot":"","sources":["../../src/exercises/exercises.ts"],"names":[],"mappings":"AA2KA,eAAO,MAAM,SAAS,iCAwPrB,CAAC"}
+{"version":3,"file":"exercises.d.ts","sourceRoot":"","sources":["../../src/exercises/exercises.ts"],"names":[],"mappings":"AA6KA,eAAO,MAAM,SAAS,iCA4PrB,CAAC"}

package/lib/exercises/exercises.js

@@ -161,6 +161,8 @@ const firstDegreeInequationsType0_1 = require("./calculLitteral/inequations/firs
 const chasles_1 = require("./geometry/vectors/chasles");
 const rootsFromFactorizedForm_1 = require("./functions/trinoms/rootsFromFactorizedForm");
 const rootsFromDevForm_1 = require("./functions/trinoms/rootsFromDevForm");
+const inequalityToInterval_1 = require("./sets/intervals/inequalityToInterval");
+const setBelonging_1 = require("./sets/setBelonging");
 exports.exercises = [
     /**
      * calcul litteral
@@ -387,4 +389,7 @@ exports.exercises = [
     inverseComplex_1.inverseComplex,
     divideComplex_1.divideComplex,
     conjugateDivideComplex_1.conjugateDivideComplex,
+    /**sets */
+    inequalityToInterval_1.inequalityToInterval,
+    setBelonging_1.setBelonging,
 ];

package/lib/exercises/sets/intervals/inequalityToInterval.d.ts

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

package/lib/exercises/sets/intervals/inequalityToInterval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inequalityToInterval.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sets/intervals/inequalityToInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,oBAAoB,EAAE,QAWlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAyH1D"}

package/lib/exercises/sets/intervals/inequalityToInterval.js

@@ -0,0 +1,136 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getInequalityToIntervalQuestion = exports.inequalityToInterval = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const intervals_1 = require("../../../math/sets/intervals/intervals");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.inequalityToInterval = {
+    id: 'inequalityToInterval',
+    connector: '=',
+    instruction: '',
+    label: 'Traduire une inégalité en intervalle',
+    levels: ['2ndPro', '2nde', 'CAP', '1reESM'],
+    isSingleStep: true,
+    sections: ['Ensembles et intervalles'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInequalityToIntervalQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getInequalityToIntervalQuestion() {
+    const reverseBracket = (bracket) => {
+        return bracket === '[' ? ']' : '[';
+    };
+    const switchInequality = (symbol) => {
+        if (symbol === '\\leq')
+            return '<';
+        if (symbol === '<')
+            return '\\leq';
+        if (symbol === '>')
+            return '\\geq';
+        return '>';
+    };
+    const reverseInequality = (symbol) => {
+        if (symbol === '\\leq')
+            return '\\geq';
+        if (symbol === '<')
+            return '>';
+        if (symbol === '>')
+            return '<';
+        return '\\leq';
+    };
+    const isIntervalToInequality = (0, coinFlip_1.coinFlip)();
+    const interval = intervals_1.IntervalConstructor.random();
+    const inequalityString = interval.toInequality();
+    const answer = isIntervalToInequality ? inequalityString : `x \\in ${interval.toTex()}`;
+    const instruction = isIntervalToInequality
+        ? `Soit $x \\in ${interval.toTex()}$. Traduire cette appartenance en une inégalité.`
+        : `Soit $${inequalityString}$. Traduire cette inégalité en appartenance à un intervalle.`;
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        if (isIntervalToInequality) {
+            if (interval.min === -Infinity) {
+                const wrongStatements = [
+                    `x ${switchInequality(interval.rightInequalitySymbol)} ${interval.maxTex}`,
+                    `-\\infty \\leq x ${switchInequality(interval.rightInequalitySymbol)} ${interval.maxTex}`,
+                    `-\\infty < x ${switchInequality(interval.rightInequalitySymbol)} ${interval.maxTex}`,
+                ];
+                wrongStatements.forEach((statement) => {
+                    res.push({
+                        id: (0, uuid_1.v4)(),
+                        statement,
+                        isRightAnswer: false,
+                        format: 'tex',
+                    });
+                });
+            }
+            else if (interval.max === Infinity) {
+                const wrongStatements = [
+                    `x ${switchInequality(reverseInequality(interval.leftInequalitySymbol))} ${interval.minTex}`,
+                    `${interval.minTex} ${switchInequality(interval.leftInequalitySymbol)} x \\leq +\\infty`,
+                    `${interval.minTex} ${switchInequality(interval.leftInequalitySymbol)} x \\leq +\\infty`,
+                ];
+                wrongStatements.forEach((statement) => {
+                    res.push({
+                        id: (0, uuid_1.v4)(),
+                        statement,
+                        isRightAnswer: false,
+                        format: 'tex',
+                    });
+                });
+            }
+            else {
+                const wrongStatements = [
+                    `${interval.minTex} ${switchInequality(interval.leftInequalitySymbol)} x ${interval.rightInequalitySymbol} ${interval.maxTex}`,
+                    `${interval.minTex} ${interval.leftInequalitySymbol} x ${switchInequality(interval.rightInequalitySymbol)} ${interval.maxTex}`,
+                    `${interval.minTex} ${switchInequality(interval.leftInequalitySymbol)} x ${switchInequality(interval.rightInequalitySymbol)} ${interval.maxTex}`,
+                ];
+                wrongStatements.forEach((statement) => {
+                    res.push({
+                        id: (0, uuid_1.v4)(),
+                        statement,
+                        isRightAnswer: false,
+                        format: 'tex',
+                    });
+                });
+            }
+        }
+        else {
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: `x \\in \\left${reverseBracket(interval.leftBracket)}${interval.insideToTex()}\\right${interval.rightBracket}`,
+                isRightAnswer: true,
+                format: 'tex',
+            });
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: `x \\in \\left${interval.leftBracket}${interval.insideToTex()}\\right${reverseBracket(interval.rightBracket)}`,
+                isRightAnswer: true,
+                format: 'tex',
+            });
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: `x \\in \\left${reverseBracket(interval.leftBracket)}${interval.insideToTex()}\\right${reverseBracket(interval.rightBracket)}`,
+                isRightAnswer: true,
+                format: 'tex',
+            });
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer,
+        instruction: instruction,
+        keys: ['x', 'belongs', 'inf', 'sup', 'geq', 'leq', 'lbracket', 'rbracket', 'semicolon'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getInequalityToIntervalQuestion = getInequalityToIntervalQuestion;

package/lib/exercises/sets/intervals/intervalBelonging.d.ts

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

package/lib/exercises/sets/intervals/intervalBelonging.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intervalBelonging.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sets/intervals/intervalBelonging.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAK3E,eAAO,MAAM,iBAAiB,EAAE,QAW/B,CAAC;AAEF,wBAAgB,4BAA4B,IAAI,QAAQ,CA2CvD"}

package/lib/exercises/sets/intervals/intervalBelonging.js

@@ -0,0 +1,55 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getIntervalBelongingQuestion = exports.intervalBelonging = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.intervalBelonging = {
+    id: 'intervalBelonging',
+    connector: '=',
+    instruction: '',
+    label: '=',
+    levels: ['2nde', '2ndPro', '1reESM'],
+    isSingleStep: true,
+    sections: ['Ensembles et intervalles'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getIntervalBelongingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getIntervalBelongingQuestion() {
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: ``,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        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, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: ``,
+        instruction: ``,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getIntervalBelongingQuestion = getIntervalBelongingQuestion;

package/lib/exercises/sets/intervals/intervalsUnion.d.ts

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

package/lib/exercises/sets/intervals/intervalsUnion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intervalsUnion.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sets/intervals/intervalsUnion.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAK3E,eAAO,MAAM,cAAc,EAAE,QAW5B,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CA2CpD"}

package/lib/exercises/sets/intervals/intervalsUnion.js

@@ -0,0 +1,55 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getIntervalsUnionQuestion = exports.intervalsUnion = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.intervalsUnion = {
+    id: 'intervalsUnion',
+    connector: '=',
+    instruction: '',
+    label: "Déterminer l'union de deux intervalles",
+    levels: ['2nde', '2ndPro', '1reTech', 'CAP'],
+    isSingleStep: true,
+    sections: ['Ensembles et intervalles'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getIntervalsUnionQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getIntervalsUnionQuestion() {
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: ``,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        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, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: ``,
+        instruction: ``,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getIntervalsUnionQuestion = getIntervalsUnionQuestion;

package/lib/exercises/sets/setBelonging.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"setBelonging.d.ts","sourceRoot":"","sources":["../../../src/exercises/sets/setBelonging.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,YAAY,EAAE,QAW1B,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAwElD"}

package/lib/exercises/sets/setBelonging.js

@@ -0,0 +1,89 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSetBelongingQuestion = exports.setBelonging = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const decimal_1 = require("../../math/numbers/decimals/decimal");
+const rational_1 = require("../../math/numbers/rationals/rational");
+const randint_1 = require("../../math/utils/random/randint");
+const random_1 = require("../../utils/random");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.setBelonging = {
+    id: 'setBelonging',
+    connector: '\\iff',
+    instruction: '',
+    label: 'Déterminer le plus petit ensemble auquel un nombre appartient',
+    levels: ['2nde', '1reESM'],
+    isSingleStep: true,
+    sections: ['Ensembles et intervalles'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSetBelongingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getSetBelongingQuestion() {
+    //N Z D Q R (racine2, pi)
+    //fraction simplifiable en décimal/entier
+    //racine carrée simplifiable en entier / Fraction
+    //
+    const type = (0, randint_1.randint)(0, 5);
+    let answer = '';
+    let nb = '';
+    switch (type) {
+        case 0:
+            nb = (0, randint_1.randint)(0, 1000) + '';
+            answer = '\\mathbb{N}';
+            break;
+        case 1:
+            nb = -(0, randint_1.randint)(0, 1000) + '';
+            answer = '\\mathbb{Z}';
+            break;
+        case 2:
+            nb = decimal_1.DecimalConstructor.random(-50, 50, (0, randint_1.randint)(1, 4)).toTree().toTex();
+            answer = '\\mathbb{D}';
+            break;
+        case 3:
+            nb = rational_1.RationalConstructor.randomIrreductible().toTree().toTex();
+            answer = '\\mathbb{Q}';
+            break;
+        case 4:
+            nb = (0, random_1.random)(['\\sqrt 2', '\\pi']);
+            answer = '\\mathbb{R}';
+            break;
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        const availableSets = ['N', 'Z', 'D', 'Q', 'R'].map((el) => `\\mathbb{${el}}`).filter((el) => el !== answer);
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, random_1.random)(availableSets);
+                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 = {
+        answer,
+        instruction: `Donner le plus petit ensemble auquel le nombre $${nb}$ appartient.`,
+        keys: ['emptyset', 'naturals', 'integers', 'decimals', 'rationals', 'reals'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSetBelongingQuestion = getSetBelongingQuestion;

package/lib/index.js

@@ -16,8 +16,7 @@ const getAllMathExercisesBySection = () => {
         }
         else {
             sectionsData.forEach((sectionData) => {
-                var _a;
-                (_a = data.find((d) => d.section === sectionData.section)) === null || _a === void 0 ? void 0 : _a.exos.push(exo);
+                data.find((d) => d.section === sectionData.section)?.exos.push(exo);
             });
         }
     });

package/lib/math/geometry/triangles.js

@@ -136,8 +136,8 @@ class Triangle {
             `ShowLabel(${this.getSideCName()}, false)`,
             `ShowLabel(${this.getSideBName()}, false)`,
             `ShowLabel(${this.getSideBName()}, false)`,
-            `ShowAxes(${showAxes !== null && showAxes !== void 0 ? showAxes : false})`,
-            `ShowGrid(${showGrid !== null && showGrid !== void 0 ? showGrid : false})`,
+            `ShowAxes(${showAxes ?? false})`,
+            `ShowGrid(${showGrid ?? false})`,
         ];
         if (this.isRight())
             commands.push(`alpha = Angle(${this.vertexB.name},${this.vertexA.name},${this.vertexC.name}, Line(${this.vertexB.name},${this.vertexA.name}))`, `ShowLabel(alpha, false)`);
@@ -150,7 +150,7 @@ class Triangle {
                 temp = [this.vertexB.name, this.vertexC.name, this.vertexA.name];
             if (highlightedAngle === this.vertexA.name)
                 temp = [this.vertexC.name, this.vertexA.name, this.vertexB.name];
-            commands.push(`be = Angle(${temp[0]}, ${temp[1]}, ${temp[2]}, Line(${temp[0]}, ${temp[1]}))`, `ShowLabel(be, false)`, `SetColor(be, "${colorHighlightedAngle !== null && colorHighlightedAngle !== void 0 ? colorHighlightedAngle : defautColor}")`);
+            commands.push(`be = Angle(${temp[0]}, ${temp[1]}, ${temp[2]}, Line(${temp[0]}, ${temp[1]}))`, `ShowLabel(be, false)`, `SetColor(be, "${colorHighlightedAngle ?? defautColor}")`);
         }
         if (showLabels)
             for (let i = 0; i < showLabels.length; i++) {
@@ -159,7 +159,7 @@ class Triangle {
                     commands.push(`SetCaption(${showLabels[i]}, "${setCaptions[i]}")`);
             }
         if (highlightedSide)
-            commands.push(`SetColor(${highlightedSide}, "${colorHighlightedSide !== null && colorHighlightedSide !== void 0 ? colorHighlightedSide : defautColor}")`);
+            commands.push(`SetColor(${highlightedSide}, "${colorHighlightedSide ?? defautColor}")`);
         return commands;
     }
     generateCoords() {

package/lib/math/polynomials/polynomial.js

@@ -69,7 +69,6 @@ class Polynomial {
         return roots.sort((a, b) => a - b);
     }
     add(P) {
-        var _a, _b;
         if (P.variable !== this.variable)
             throw Error("Can't add two polynomials with different variables");
         const newDegree = P.degree === this.degree && P.coefficients[P.degree] === -this.coefficients[this.degree]
@@ -77,7 +76,7 @@ class Polynomial {
             : Math.max(P.degree, this.degree);
         const res = [];
         for (let i = 0; i < newDegree + 1; i++) {
-            res[i] = ((_a = P.coefficients[i]) !== null && _a !== void 0 ? _a : 0) + ((_b = this.coefficients[i]) !== null && _b !== void 0 ? _b : 0);
+            res[i] = (P.coefficients[i] ?? 0) + (this.coefficients[i] ?? 0);
         }
         return new Polynomial(res, this.variable);
     }

package/lib/math/sets/intervals/intervals.d.ts

@@ -2,6 +2,9 @@ import { Nombre, NumberType } from '../../../math/numbers/nombre';
 import { DiscreteSet } from '../discreteSet';
 import { MathSet } from '../mathSet';
 import { MathSetInterface } from '../mathSetInterface';
+export declare abstract class IntervalConstructor {
+    static random(): Interval;
+}
 declare enum BoundType {
     OO = "]a;b[",
     OF = "]a;b]",
@@ -10,8 +13,14 @@ declare enum BoundType {
 }
 export declare class Interval implements MathSetInterface {
     min: number;
+    minTex: string;
     max: number;
+    maxTex: string;
     boundType: BoundType;
+    leftBracket: '[' | ']';
+    rightBracket: '[' | ']';
+    leftInequalitySymbol: '\\leq' | '<' | '\\geq' | '>';
+    rightInequalitySymbol: '\\leq' | '<' | '\\geq' | '>';
     type: NumberType;
     tex: string;
     /**
@@ -21,6 +30,8 @@ export declare class Interval implements MathSetInterface {
     exclude(nb: number): MathSet;
     difference(set: DiscreteSet): MathSet;
     toTex(): string;
+    insideToTex(): string;
+    toInequality(): string;
     getRandomElement(precision?: number): Nombre;
 }
 export {};

package/lib/math/sets/intervals/intervals.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"intervals.d.ts","sourceRoot":"","sources":["../../../../src/math/sets/intervals/intervals.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAI/D,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACrC,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAEvD,aAAK,SAAS;IACZ,EAAE,UAAU;IACZ,EAAE,UAAU;IACZ,EAAE,UAAU;IACZ,EAAE,UAAU;CACb;AAED,qBAAa,QAAS,YAAW,gBAAgB;IAC/C,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,SAAS,CAAC;IACrB,IAAI,EAAE,UAAU,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ;;OAEG;gBACS,GAAG,SAAc;IA+C7B,OAAO,CAAC,EAAE,EAAE,MAAM;IAWlB,UAAU,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO;IAYrC,KAAK,IAAI,MAAM;IAIf,gBAAgB,CAAC,SAAS,GAAE,MAAiD,GAAG,MAAM;CAYvF"}
+{"version":3,"file":"intervals.d.ts","sourceRoot":"","sources":["../../../../src/math/sets/intervals/intervals.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAM/D,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACrC,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAEvD,8BAAsB,mBAAmB;IACvC,MAAM,CAAC,MAAM;CA2Cd;AACD,aAAK,SAAS;IACZ,EAAE,UAAU;IACZ,EAAE,UAAU;IACZ,EAAE,UAAU;IACZ,EAAE,UAAU;CACb;AAED,qBAAa,QAAS,YAAW,gBAAgB;IAC/C,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,SAAS,CAAC;IACrB,WAAW,EAAE,GAAG,GAAG,GAAG,CAAC;IACvB,YAAY,EAAE,GAAG,GAAG,GAAG,CAAC;IACxB,oBAAoB,EAAE,OAAO,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,CAAC;IACpD,qBAAqB,EAAE,OAAO,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,CAAC;IAErD,IAAI,EAAE,UAAU,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ;;OAEG;gBACS,GAAG,SAAc;IAgE7B,OAAO,CAAC,EAAE,EAAE,MAAM;IAWlB,UAAU,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO;IAYrC,KAAK,IAAI,MAAM;IAGf,WAAW,IAAI,MAAM;IAIrB,YAAY,IAAI,MAAM;IAetB,gBAAgB,CAAC,SAAS,GAAE,MAAiD,GAAG,MAAM;CAYvF"}

package/lib/math/sets/intervals/intervals.js

@@ -1,12 +1,59 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.Interval = void 0;
+exports.Interval = exports.IntervalConstructor = void 0;
 const epsilon_1 = require("../../../math/numbers/epsilon");
 const integer_1 = require("../../../math/numbers/integer/integer");
 const nombre_1 = require("../../../math/numbers/nombre");
 const real_1 = require("../../../math/numbers/reals/real");
+const randint_1 = require("../../../math/utils/random/randint");
 const round_1 = require("../../../math/utils/round");
+const coinFlip_1 = require("../../../utils/coinFlip");
 const mathSet_1 = require("../mathSet");
+class IntervalConstructor {
+    static random() {
+        let tex = '';
+        const randType = (0, randint_1.randint)(0, 6);
+        let a, b;
+        switch (randType) {
+            case 0:
+                b = (0, randint_1.randint)(-10, 10);
+                tex = `]-\\infty;${b}${(0, coinFlip_1.coinFlip)() ? ']' : '['}`;
+                break;
+            case 1:
+                a = (0, randint_1.randint)(-10, 10);
+                tex = `${(0, coinFlip_1.coinFlip)() ? ']' : '['}${a};+\\infty[`;
+                break;
+            case 2:
+                a = (0, randint_1.randint)(-10, 10);
+                b = (0, randint_1.randint)(a + 1, a + 10);
+                tex = `[${a};${b}]`;
+                break;
+            case 3:
+                a = (0, randint_1.randint)(-10, 10);
+                b = (0, randint_1.randint)(a + 1, a + 10);
+                tex = `]${a};${b}]`;
+                break;
+            case 4:
+                a = (0, randint_1.randint)(-10, 10);
+                b = (0, randint_1.randint)(a + 1, a + 10);
+                tex = `[${a};${b}[`;
+                break;
+            case 5:
+                a = (0, randint_1.randint)(-10, 10);
+                b = (0, randint_1.randint)(a + 1, a + 10);
+                tex = `]${a};${b}[`;
+                break;
+        }
+        //-inf; x[
+        //[x; inf
+        //[a,b]
+        //[ [
+        //] ]
+        //] [
+        return new Interval(tex);
+    }
+}
+exports.IntervalConstructor = IntervalConstructor;
 var BoundType;
 (function (BoundType) {
     BoundType["OO"] = "]a;b[";
@@ -27,17 +74,35 @@ class Interval {
         const left = tex[0];
         const right = tex[tex.length - 1];
         const [a, b] = tex.slice(isInt ? 2 : 1, isInt ? tex.length - 2 : tex.length - 1).split(';');
+        this.minTex = a;
+        this.maxTex = b;
         switch (`${left}a;b${right}`) {
             case '[a;b]':
+                this.leftBracket = '[';
+                this.leftInequalitySymbol = '\\leq';
+                this.rightInequalitySymbol = '\\leq';
+                this.rightBracket = ']';
                 this.boundType = BoundType.FF;
                 break;
             case ']a;b[':
+                this.leftBracket = ']';
+                this.rightBracket = '[';
+                this.leftInequalitySymbol = '<';
+                this.rightInequalitySymbol = '<';
                 this.boundType = BoundType.OO;
                 break;
             case '[a;b[':
+                this.leftBracket = '[';
+                this.rightBracket = '[';
+                this.leftInequalitySymbol = '\\leq';
+                this.rightInequalitySymbol = '<';
                 this.boundType = BoundType.FO;
                 break;
             case ']a;b]':
+                this.leftBracket = ']';
+                this.rightBracket = ']';
+                this.leftInequalitySymbol = '<';
+                this.rightInequalitySymbol = '\\leq';
                 this.boundType = BoundType.OF;
                 break;
             default:
@@ -87,6 +152,28 @@ class Interval {
     toTex() {
         return this.tex;
     }
+    insideToTex() {
+        return this.tex.replaceAll('[', '').replaceAll(']', '');
+    }
+    toInequality() {
+        const isLeftClosed = this.boundType === BoundType.FO || this.boundType === BoundType.FF;
+        const isRightClosed = this.boundType === BoundType.FF || this.boundType === BoundType.OF;
+        if (this.max === Infinity) {
+            if (isLeftClosed) {
+                return `x \\geq ${this.min}`;
+            }
+            else
+                return `x > ${this.min}`;
+        }
+        else if (this.min === -Infinity) {
+            if (this.boundType === BoundType.OF) {
+                return `x \\leq ${this.max}`;
+            }
+            else
+                return `x < ${this.max}`;
+        }
+        return `${this.min} ${isLeftClosed ? '\\leq' : '<'} x ${isRightClosed ? '\\leq' : '<'} ${this.max}`;
+    }
     getRandomElement(precision = this.type === nombre_1.NumberType.Integer ? 0 : 2) {
         if (this.min === -Infinity || this.max === Infinity)
             throw Error("Can't chose amongst infinity");

package/lib/server.js

@@ -21,7 +21,7 @@ const runServer = () => {
         const exo = allExercises[exoIndex];
         if (!exo)
             res.send('Exo not found');
-        const questions = exo === null || exo === void 0 ? void 0 : exo.generator(10);
+        const questions = exo?.generator(10);
         res.json({
             exercise: exo,
             questions,
@@ -35,10 +35,9 @@ const runServer = () => {
         const exo = allExercises[exoIndex];
         if (!exo)
             res.send('Exo not found');
-        const questions = exo === null || exo === void 0 ? void 0 : exo.generator(10);
-        const populatedQuestions = questions === null || questions === void 0 ? void 0 : questions.map((q) => {
-            var _a;
-            return Object.assign(Object.assign({}, q), { propositions: (_a = q.getPropositions) === null || _a === void 0 ? void 0 : _a.call(q, 4) });
+        const questions = exo?.generator(10);
+        const populatedQuestions = questions?.map((q) => {
+            return { ...q, propositions: q.getPropositions?.(4) };
         });
         res.json({
             exercise: exo,

package/lib/tree/nodes/functions/oppositeNode.js

@@ -17,7 +17,7 @@ class OppositeNode extends functionNode_1.FunctionNode {
         let needBrackets = childTex[0] === '-';
         if (this.child.type === node_1.NodeType.operator) {
             const operatorChild = this.child;
-            needBrackets || (needBrackets = [operatorNode_1.OperatorIds.add, operatorNode_1.OperatorIds.substract].includes(operatorChild.id));
+            needBrackets ||= [operatorNode_1.OperatorIds.add, operatorNode_1.OperatorIds.substract].includes(operatorChild.id);
         }
         if (this.child.type === node_1.NodeType.number && childTex[0] === '-') {
             return childTex.substring(1);

package/lib/tree/nodes/operators/divideNode.js

@@ -25,7 +25,7 @@ class DivideNode extends operatorNode_1.OperatorNode {
         let needBrackets = rightTex[0] === '-';
         if (this.rightChild.type === node_1.NodeType.operator) {
             const operatorRightChild = this.rightChild;
-            needBrackets || (needBrackets = [operatorNode_1.OperatorIds.add, operatorNode_1.OperatorIds.substract, operatorNode_1.OperatorIds.divide].includes(operatorRightChild.id));
+            needBrackets ||= [operatorNode_1.OperatorIds.add, operatorNode_1.OperatorIds.substract, operatorNode_1.OperatorIds.divide].includes(operatorRightChild.id);
         }
         if (needBrackets)
             rightTex = `(${rightTex})`;

package/lib/tree/nodes/operators/multiplyNode.js

@@ -33,7 +33,7 @@ class MultiplyNode extends operatorNode_1.OperatorNode {
         let needBrackets = rightTex[0] === '-';
         if (this.rightChild.type === node_1.NodeType.operator) {
             const operatorRightChild = this.rightChild;
-            needBrackets || (needBrackets = [operatorNode_1.OperatorIds.add, operatorNode_1.OperatorIds.substract].includes(operatorRightChild.id));
+            needBrackets ||= [operatorNode_1.OperatorIds.add, operatorNode_1.OperatorIds.substract].includes(operatorRightChild.id);
         }
         if (needBrackets)
             rightTex = `(${rightTex})`;
@@ -41,7 +41,7 @@ class MultiplyNode extends operatorNode_1.OperatorNode {
         let showTimesSign = !isNaN(+rightTex[0]) || this.rightChild.type === node_1.NodeType.number;
         if (this.rightChild.type === node_1.NodeType.operator) {
             const operatorRightChild = this.rightChild;
-            showTimesSign || (showTimesSign = [operatorNode_1.OperatorIds.fraction].includes(operatorRightChild.id));
+            showTimesSign ||= [operatorNode_1.OperatorIds.fraction].includes(operatorRightChild.id);
         }
         return `${leftTex}${showTimesSign ? '\\times ' : ''}${rightTex}`;
     }

package/lib/tree/nodes/operators/powerNode.js

@@ -17,14 +17,14 @@ class PowerNode extends operatorNode_1.OperatorNode {
         let needBrackets = leftTex[0] === '-';
         if (this.leftChild.type === node_1.NodeType.operator) {
             const childOperator = this.leftChild;
-            needBrackets || (needBrackets = [
+            needBrackets ||= [
                 operatorNode_1.OperatorIds.add,
                 operatorNode_1.OperatorIds.substract,
                 operatorNode_1.OperatorIds.multiply,
                 operatorNode_1.OperatorIds.divide,
                 operatorNode_1.OperatorIds.fraction,
                 operatorNode_1.OperatorIds.power,
-            ].includes(childOperator.id));
+            ].includes(childOperator.id);
         }
         if (needBrackets)
             leftTex = `(${leftTex})`;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "math-exercises",
-  "version": "1.3.61",
+  "version": "1.3.63",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [
@@ -29,7 +29,7 @@
     "express": "^4.18.2",
     "nodemon": "^2.0.20",
     "prettier": "^2.8.4",
-    "react-math-keyboard": "^1.2.39",
+    "react-math-keyboard": "^1.3.1",
     "ts-node": "^10.9.1",
     "ts-node-dev": "^2.0.0",
     "tsc-alias": "^1.8.2",