math-exercises 1.3.58 → 1.3.59

package/lib/exercises/exercise.d.ts

@@ -28,6 +28,7 @@ export interface Exercise {
     connector?: '=' | '\\iff' | '\\approx';
     keys?: string[];
     generator(nb: number, options?: GeneratorOptions): Question[];
+    answerType?: 'QCM' | 'free';
 }
 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';

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,YAAY,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC9B,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;CAC/D;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,YAAY,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC9B,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;CAC7B;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"}

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

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

package/lib/exercises/exercises.js

@@ -159,6 +159,8 @@ const firstDegreeInequationsType2_1 = require("./calculLitteral/inequations/firs
 const firstDegreeInequationsType3_1 = require("./calculLitteral/inequations/firstDegreeInequationsType3");
 const firstDegreeInequationsType0_1 = require("./calculLitteral/inequations/firstDegreeInequationsType0");
 const chasles_1 = require("./geometry/vectors/chasles");
+const rootsFromFactorizedForm_1 = require("./functions/trinoms/rootsFromFactorizedForm");
+const rootsFromDevForm_1 = require("./functions/trinoms/rootsFromDevForm");
 exports.exercises = [
     /**
      * calcul litteral
@@ -373,6 +375,9 @@ exports.exercises = [
     extremumFromCanonicalForm_1.extremumFromCanonicalForm,
     extremumTypeFromAlgebricForm_1.extremumTypeFromAlgebricForm,
     variationsFromAlgebricForm_1.variationsFromAlgebricForm,
+    // deltaTrinom,
+    rootsFromFactorizedForm_1.rootsFromFactorizedForm,
+    rootsFromDevForm_1.rootsFromDevForm,
     /**Complexes */
     mutiplyComplex_1.mutiplyComplex,
     reAndIm_1.reAndIm,

package/lib/exercises/functions/trinoms/deltaTrinom.d.ts

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

package/lib/exercises/functions/trinoms/deltaTrinom.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"deltaTrinom.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/deltaTrinom.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,WAAW,EAAE,QASzB,CAAC;AAEF,wBAAgB,sBAAsB,IAAI,QAAQ,CA4DjD"}

package/lib/exercises/functions/trinoms/deltaTrinom.js

@@ -0,0 +1,73 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getDeltaTrinomQuestion = exports.deltaTrinom = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const trinom_1 = require("../../../math/polynomials/trinom");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.deltaTrinom = {
+    id: 'deltaTrinom',
+    connector: '=',
+    instruction: '',
+    label: "Calculer le discriminant d'un trinôme",
+    levels: ['1reSpé', 'TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Second degré'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDeltaTrinomQuestion, nb),
+};
+function getDeltaTrinomQuestion() {
+    const trinom = trinom_1.TrinomConstructor.random();
+    const answer = trinom.getDelta();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        const bMinus4ac = trinom.b - 4 * trinom.a * trinom.c;
+        if (bMinus4ac !== answer)
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: bMinus4ac + '',
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        const bSquarePlus4ac = trinom.b ** 2 + trinom.a * trinom.c;
+        if (bSquarePlus4ac !== answer && bSquarePlus4ac !== bMinus4ac)
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: bSquarePlus4ac + '',
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, randint_1.randint)(-100, 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, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: answer + '',
+        instruction: `Soit $f(x) = ${trinom.toTree().toTex()}$. Calculer le discriminant $\\Delta$.`,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getDeltaTrinomQuestion = getDeltaTrinomQuestion;

package/lib/exercises/functions/trinoms/extremumTypeFromAlgebricForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"extremumTypeFromAlgebricForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/extremumTypeFromAlgebricForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,4BAA4B,EAAE,QAQ1C,CAAC;AAEF,wBAAgB,uCAAuC,IAAI,QAAQ,CA6ClE"}
+{"version":3,"file":"extremumTypeFromAlgebricForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/extremumTypeFromAlgebricForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,4BAA4B,EAAE,QAS1C,CAAC;AAEF,wBAAgB,uCAAuC,IAAI,QAAQ,CA6ClE"}

package/lib/exercises/functions/trinoms/extremumTypeFromAlgebricForm.js

@@ -14,6 +14,7 @@ exports.extremumTypeFromAlgebricForm = {
     isSingleStep: true,
     sections: ['Second degré'],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExtremumTypeFromAlgebricFormQuestion, nb),
+    answerType: 'QCM',
 };
 function getExtremumTypeFromAlgebricFormQuestion() {
     const isDevForm = (0, coinFlip_1.coinFlip)();

package/lib/exercises/functions/trinoms/rootsFromDevForm.d.ts

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

package/lib/exercises/functions/trinoms/rootsFromDevForm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rootsFromDevForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/rootsFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,gBAAgB,EAAE,QAS9B,CAAC;AAEF,wBAAgB,2BAA2B,IAAI,QAAQ,CA6CtD"}

package/lib/exercises/functions/trinoms/rootsFromDevForm.js

@@ -0,0 +1,56 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getRootsFromDevFormQuestion = exports.rootsFromDevForm = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const trinom_1 = require("../../../math/polynomials/trinom");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.rootsFromDevForm = {
+    id: 'rootsFromDevForm',
+    connector: '\\iff',
+    instruction: '',
+    label: 'Résoudre une équation du second degré',
+    levels: ['1reSpé', 'TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: [],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getRootsFromDevFormQuestion, nb),
+};
+function getRootsFromDevFormQuestion() {
+    const trinom = trinom_1.TrinomConstructor.random();
+    const answer = trinom.getRootsEquationSolutionTex();
+    const getPropositions = (n) => {
+        const res = [];
+        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 = '';
+                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: answer,
+        instruction: `Soit $f(x) = ${trinom.toTree().toTex()}$. Résoudre l'équation $f(x) = 0$.`,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getRootsFromDevFormQuestion = getRootsFromDevFormQuestion;

package/lib/exercises/functions/trinoms/rootsFromFactorizedForm.d.ts

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

package/lib/exercises/functions/trinoms/rootsFromFactorizedForm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rootsFromFactorizedForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/rootsFromFactorizedForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,uBAAuB,EAAE,QASrC,CAAC;AAEF,wBAAgB,kCAAkC,IAAI,QAAQ,CAiF7D"}

package/lib/exercises/functions/trinoms/rootsFromFactorizedForm.js

@@ -0,0 +1,92 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getRootsFromFactorizedFormQuestion = exports.rootsFromFactorizedForm = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const trinom_1 = require("../../../math/polynomials/trinom");
+const randint_1 = require("../../../math/utils/random/randint");
+const oppositeNode_1 = require("../../../tree/nodes/functions/oppositeNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.rootsFromFactorizedForm = {
+    id: 'rootsFromFactorizedForm',
+    connector: '=',
+    instruction: '',
+    label: "Déterminer les racines d'un trinôme à partir de sa forme factorisée",
+    levels: ['1reSpé', 'TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Second degré'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getRootsFromFactorizedFormQuestion, nb),
+};
+function getRootsFromFactorizedFormQuestion() {
+    const trinom = trinom_1.TrinomConstructor.randomFactorized();
+    const answer = trinom.getRootsEquationSolutionTex();
+    const roots = trinom.getRoots();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        if (roots.length === 1 && roots[0] !== 0) {
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: `S = \\lbrace ${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[0]))} \\rbrace`,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        }
+        if (roots.length === 2 && roots[0] !== 0) {
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: `S = \\lbrace ${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[0])).toTex()} ; ${roots[1]} \\rbrace`,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        }
+        if (roots.length === 2 && roots[1] !== 0) {
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: `S = \\lbrace ${roots[0]} ; ${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[1])).toTex()} \\rbrace`,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        }
+        if (roots.length === 2 && roots[0] !== 0 && roots[1] !== 0) {
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: `S = \\lbrace ${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[0])).toTex()} ; ${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[1])).toTex()} \\rbrace`,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        }
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = `S = \\lbrace ${(0, randint_1.randint)(-10, 11)}; ${(0, randint_1.randint)(-10, 11)} \\rbrace`;
+                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: answer,
+        instruction: `Soit $f(x) = ${trinom.getFactorizedForm().toTex()}$. Résoudre l'équation $f(x) = 0$.`,
+        keys: ['S', 'equal', 'lbrace', 'semicolon', 'rbrace', 'emptyset'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getRootsFromFactorizedFormQuestion = getRootsFromFactorizedFormQuestion;

package/lib/math/polynomials/trinom.d.ts

@@ -5,6 +5,7 @@ import { Polynomial } from './polynomial';
 export declare abstract class TrinomConstructor {
     static random(domainA?: MathSet, domainB?: MathSet, domainC?: MathSet): Trinom;
     static randomCanonical(domainA?: MathSet, domainAlpha?: MathSet, domainBeta?: MathSet): Trinom;
+    static randomFactorized(domainA?: MathSet, domainX1?: MathSet, domainX2?: MathSet): Trinom;
 }
 export declare class Trinom extends Polynomial {
     a: number;
@@ -14,10 +15,14 @@ export declare class Trinom extends Polynomial {
     constructor(a: number, b: number, c: number, variable?: string);
     getDelta(): number;
     getDeltaNode(): NumberNode;
+    getRoots(): number[];
+    getRootsNode(): Node[];
+    getRootsEquationSolutionTex(): string;
     getAlpha(): number;
     getAlphaNode(): Node;
     getBeta(): number;
     getBetaNode(): Node;
+    getFactorizedForm(): Node;
     getCanonicalForm(): Node;
     getSommet(): string;
 }

package/lib/math/polynomials/trinom.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"trinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/trinom.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AAajE,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C,8BAAsB,iBAAiB;IACrC,MAAM,CAAC,MAAM,CACX,OAAO,GAAE,OAAmF,EAC5F,OAAO,GAAE,OAAqC,EAC9C,OAAO,GAAE,OAAqC,GAC7C,MAAM;IAOT,MAAM,CAAC,eAAe,CACpB,OAAO,GAAE,OAAmF,EAC5F,WAAW,GAAE,OAAqC,EAClD,UAAU,GAAE,OAAqC,GAChD,MAAM;CAQV;AAED,qBAAa,MAAO,SAAQ,UAAU;IACpC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;gBACL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAQnE,QAAQ;IAGR,YAAY,IAAI,UAAU;IAI1B,QAAQ;IAGR,YAAY,IAAI,IAAI;IAIpB,OAAO;IAIP,WAAW,IAAI,IAAI;IAInB,gBAAgB,IAAI,IAAI;IAYxB,SAAS;CAGV"}
+{"version":3,"file":"trinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/trinom.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AAejE,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C,8BAAsB,iBAAiB;IACrC,MAAM,CAAC,MAAM,CACX,OAAO,GAAE,OAAmF,EAC5F,OAAO,GAAE,OAAqC,EAC9C,OAAO,GAAE,OAAqC,GAC7C,MAAM;IAOT,MAAM,CAAC,eAAe,CACpB,OAAO,GAAE,OAAmF,EAC5F,WAAW,GAAE,OAAqC,EAClD,UAAU,GAAE,OAAqC,GAChD,MAAM;IAQT,MAAM,CAAC,gBAAgB,CACrB,OAAO,GAAE,OAAmF,EAC5F,QAAQ,GAAE,OAAqC,EAC/C,QAAQ,GAAE,OAAqC,GAC9C,MAAM;CAOV;AAED,qBAAa,MAAO,SAAQ,UAAU;IACpC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;gBACL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAQnE,QAAQ;IAGR,YAAY,IAAI,UAAU;IAI1B,QAAQ;IAQR,YAAY,IAAI,IAAI,EAAE;IAoBtB,2BAA2B;IAO3B,QAAQ;IAGR,YAAY,IAAI,IAAI;IAIpB,OAAO;IAIP,WAAW,IAAI,IAAI;IAInB,iBAAiB,IAAI,IAAI;IAqBzB,gBAAgB,IAAI,IAAI;IAYxB,SAAS;CAGV"}

package/lib/math/polynomials/trinom.js

@@ -11,6 +11,8 @@ const variableNode_1 = require("../../tree/nodes/variables/variableNode");
 const simplify_1 = require("../../tree/parsers/simplify");
 const point_1 = require("../geometry/point");
 const integer_1 = require("../numbers/integer/integer");
+const rational_1 = require("../numbers/rationals/rational");
+const squareRoot_1 = require("../numbers/reals/squareRoot");
 const discreteSet_1 = require("../sets/discreteSet");
 const intervals_1 = require("../sets/intervals/intervals");
 const polynomial_1 = require("./polynomial");
@@ -29,6 +31,13 @@ class TrinomConstructor {
         const c = a.value * alpha.value ** 2 + beta.value;
         return new Trinom(a.value, b, c);
     }
+    static randomFactorized(domainA = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)])), domainX1 = new intervals_1.Interval('[[-10; 10]]'), domainX2 = new intervals_1.Interval('[[-10; 10]]')) {
+        const a = domainA.getRandomElement();
+        const x1 = domainX1.getRandomElement();
+        const x2 = domainX2.getRandomElement();
+        //a*x^2 + ax*-x2 + a*-x1*x + a*-x1*-x2
+        return new Trinom(a.value, -a.value * (x1.value + x2.value), a.value * x1.value * x2.value);
+    }
 }
 exports.TrinomConstructor = TrinomConstructor;
 class Trinom extends polynomial_1.Polynomial {
@@ -45,6 +54,34 @@ class Trinom extends polynomial_1.Polynomial {
     getDeltaNode() {
         return new numberNode_1.NumberNode(this.getDelta());
     }
+    getRoots() {
+        const delta = this.getDelta();
+        if (delta < 0)
+            return [];
+        if (delta === 0)
+            return [-this.b / (2 * this.a)];
+        return [(-this.b - Math.sqrt(delta)) / (2 * this.a), (-this.b + Math.sqrt(delta)) / (2 * this.a)];
+    }
+    //! la simplification de mathjs est foireuse, exemple (4+4sqrt(3))/16 est simplifiée mais pas (4-4sqrt(3))/16 ??
+    getRootsNode() {
+        const delta = this.getDelta();
+        if (delta < 0)
+            return [];
+        if (delta === 0)
+            return [new rational_1.Rational(-this.b, 2 * this.a).simplify().toTree()];
+        return [
+            (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new substractNode_1.SubstractNode(new numberNode_1.NumberNode(-this.b), new squareRoot_1.SquareRoot(delta).simplify().toTree()), new numberNode_1.NumberNode(2 * this.a))),
+            (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new addNode_1.AddNode(new numberNode_1.NumberNode(-this.b), new squareRoot_1.SquareRoot(delta).simplify().toTree()), new numberNode_1.NumberNode(2 * this.a))),
+        ];
+    }
+    getRootsEquationSolutionTex() {
+        const roots = this.getRootsNode();
+        if (!roots.length)
+            return `S = \\emptyset`;
+        if (roots.length === 1)
+            return `S = \\left\\lbrace ${roots[0].toTex()} \\right\\rbrace`;
+        return `S = \\left\\lbrace ${roots[0].toTex()} ; ${roots[1].toTex()} \\right\\rbrace`;
+    }
     getAlpha() {
         return -this.b / (2 * this.a);
     }
@@ -57,6 +94,14 @@ class Trinom extends polynomial_1.Polynomial {
     getBetaNode() {
         return (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-this.getDelta()), new numberNode_1.NumberNode(4 * this.a)));
     }
+    getFactorizedForm() {
+        const roots = this.getRootsNode();
+        if (!roots.length)
+            return this.toTree();
+        if (roots.length === 1)
+            return (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), new powerNode_1.PowerNode(new substractNode_1.SubstractNode(new variableNode_1.VariableNode('x'), roots[0]), new numberNode_1.NumberNode(2))));
+        return (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), new multiplyNode_1.MultiplyNode(new substractNode_1.SubstractNode(new variableNode_1.VariableNode('x'), roots[0]), new substractNode_1.SubstractNode(new variableNode_1.VariableNode('x'), roots[1]))));
+    }
     getCanonicalForm() {
         return (0, simplify_1.simplifyNode)(new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.a), new powerNode_1.PowerNode(new substractNode_1.SubstractNode(new variableNode_1.VariableNode(this.variable), this.getAlphaNode()), new numberNode_1.NumberNode(2))), new numberNode_1.NumberNode(this.getBeta())));
     }

package/lib/tree/nodes/functions/oppositeNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"oppositeNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/oppositeNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAY,MAAM,SAAS,CAAC;AAEzC,OAAO,EAAE,YAAY,EAAgB,MAAM,gBAAgB,CAAC;AAE5D,qBAAa,YAAa,SAAQ,YAAa,YAAW,IAAI;gBAChD,KAAK,EAAE,IAAI;IAGvB,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAWf,QAAQ;CAGT"}
+{"version":3,"file":"oppositeNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/oppositeNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAY,MAAM,SAAS,CAAC;AAEzC,OAAO,EAAE,YAAY,EAAgB,MAAM,gBAAgB,CAAC;AAG5D,qBAAa,YAAa,SAAQ,YAAa,YAAW,IAAI;gBAChD,KAAK,EAAE,IAAI;IAGvB,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAcf,QAAQ;CAGT"}

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

@@ -19,6 +19,9 @@ class OppositeNode extends functionNode_1.FunctionNode {
             const operatorChild = this.child;
             needBrackets || (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);
+        }
         if (needBrackets)
             childTex = `(${childTex})`;
         return `-${childTex}`;

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

@@ -10,7 +10,7 @@ class SqrtNode extends functionNode_1.FunctionNode {
         this.type = node_1.NodeType.function;
     }
     toMathString() {
-        return `sqrt(${this.child.toMathString()})`;
+        return `sqr(${this.child.toMathString()})`;
     }
     toMathjs() {
         return (0, mathjs_1.sqrt)(this.child.toMathjs());

package/lib/tree/parsers/simplify.js

@@ -56,6 +56,9 @@ const mathjsNodeToNode = (mathjsNode) => {
     else if (mathjsNode.isFunctionNode) {
         const fn = mathjsNode.fn;
         switch (fn.name) {
+            //mathjs arrondit les racines carrées, on truc avec sqr pour bypass
+            case 'sqr':
+                return new sqrtNode_1.SqrtNode(mathjsNodeToNode(mathjsNode.args[0]));
             case 'sqrt':
                 return new sqrtNode_1.SqrtNode(mathjsNodeToNode(mathjsNode.args[0]));
             case 'log':

package/package.json

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