math-exercises 2.0.10 → 2.0.12

package/lib/exercises/exercise.d.ts

@@ -47,5 +47,5 @@ export interface MathExercise<TIdentifiers = {}> {
     isAnswerValid?: VEA<TIdentifiers>;
 }
 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 = "Aires" | "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" | "Logarithme décimal" | "Nombres complexes" | "Périmètres" | "Pourcentages" | "Primitives" | "Probabilités" | "Proportionnalité" | "Puissances" | "Racines carrées" | "Second degré" | "Statistiques" | "Suites" | "Théorème de Pythagore" | "Théorème de Thalès" | "Trigonométrie" | "Valeur absolue" | "Vecteurs";
+export type MathSection = "Aires" | "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" | "Logarithme décimal" | "Nombres complexes" | "Périmètres" | "Pourcentages" | "Primitives" | "Probabilités" | "Produit scalaire" | "Proportionnalité" | "Puissances" | "Racines carrées" | "Second degré" | "Statistiques" | "Suites" | "Théorème de Pythagore" | "Théorème de Thalès" | "Trigonométrie" | "Valeur absolue" | "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,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,iBAAiB,UACrB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAUtB,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,CAAC,YAAY,GAAG,EAAE;IACzC,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,WAAW,EAAE,YAAY,CAAC;CAC3B;AAED,MAAM,MAAM,YAAY,CAAC,YAAY,IAAI,CACvC,CAAC,EAAE,MAAM,EACT,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,WAAW,EAAE,CAAC;AACnB,MAAM,MAAM,GAAG,CAAC,YAAY,IAAI,CAC9B,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,OAAO,CAAC;AACb,MAAM,MAAM,iBAAiB,CAAC,YAAY,GAAG,EAAE,EAAE,QAAQ,GAAG,EAAE,IAAI,CAChE,IAAI,CAAC,EAAE,QAAQ,KACZ,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC5B,MAAM,WAAW,YAAY,CAAC,YAAY,GAAG,EAAE;IAC7C,EAAE,EAAE,MAAM,CAAC;IACX,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,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;IACnD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,YAAY,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,YAAY,CAAC,CAAC;IAClE,aAAa,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;CACnC;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,OAAO,GACP,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,oBAAoB,GACpB,mBAAmB,GACnB,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,YAAY,GACZ,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,uBAAuB,GACvB,oBAAoB,GACpB,eAAe,GACf,gBAAgB,GAChB,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,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,iBAAiB,UACrB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAUtB,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,CAAC,YAAY,GAAG,EAAE;IACzC,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,WAAW,EAAE,YAAY,CAAC;CAC3B;AAED,MAAM,MAAM,YAAY,CAAC,YAAY,IAAI,CACvC,CAAC,EAAE,MAAM,EACT,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,WAAW,EAAE,CAAC;AACnB,MAAM,MAAM,GAAG,CAAC,YAAY,IAAI,CAC9B,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,OAAO,CAAC;AACb,MAAM,MAAM,iBAAiB,CAAC,YAAY,GAAG,EAAE,EAAE,QAAQ,GAAG,EAAE,IAAI,CAChE,IAAI,CAAC,EAAE,QAAQ,KACZ,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC5B,MAAM,WAAW,YAAY,CAAC,YAAY,GAAG,EAAE;IAC7C,EAAE,EAAE,MAAM,CAAC;IACX,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,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;IACnD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,YAAY,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,YAAY,CAAC,CAAC;IAClE,aAAa,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;CACnC;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,OAAO,GACP,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,oBAAoB,GACpB,mBAAmB,GACnB,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,kBAAkB,GAClB,YAAY,GACZ,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,uBAAuB,GACvB,oBAAoB,GACpB,eAAe,GACf,gBAAgB,GAChB,UAAU,CAAC"}

package/lib/exercises/functions/affines/leadingCoefficient.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"leadingCoefficient.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/leadingCoefficient.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AA8EF,eAAO,MAAM,kBAAkB,EAAE,YAAY,CAAC,WAAW,CAaxD,CAAC"}
+{"version":3,"file":"leadingCoefficient.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/leadingCoefficient.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AAgFF,eAAO,MAAM,kBAAkB,EAAE,YAAY,CAAC,WAAW,CAaxD,CAAC"}

package/lib/exercises/functions/affines/leadingCoefficient.js

@@ -30,7 +30,11 @@ const getLeadingCoefficientQuestion = () => {
         ymin = bValue - 1;
         ymax = 1;
     }
-    if (-bValue / aValue > 0) {
+    if (aValue === 0) {
+        xmax = 5;
+        xmin = -5;
+    }
+    else if (-bValue / aValue > 0) {
         xmax = -bValue / aValue + 1;
         xmin = -1;
     }

package/lib/exercises/functions/logarithm/logPowerEquation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"logPowerEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/logarithm/logPowerEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAgBlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,OAAO,EAAE,MAAM,CAAC;IAChB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC;AAwGF,eAAO,MAAM,gBAAgB,EAAE,YAAY,CAAC,WAAW,CAatD,CAAC;AACF,eAAO,MAAM,kBAAkB,EAAE,YAAY,CAAC,WAAW,CAgBxD,CAAC"}
+{"version":3,"file":"logPowerEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/logarithm/logPowerEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAgBlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,OAAO,EAAE,MAAM,CAAC;IAChB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC;AAwGF,eAAO,MAAM,gBAAgB,EAAE,YAAY,CAAC,WAAW,CActD,CAAC;AACF,eAAO,MAAM,kBAAkB,EAAE,YAAY,CAAC,WAAW,CAiBxD,CAAC"}

package/lib/exercises/functions/logarithm/logPowerEquation.js

@@ -78,7 +78,7 @@ const isAnswerValid = (ans, { a, c, k, powered, isLog10 }) => {
 exports.logPowerEquation = {
     id: "logPowerEquation",
     connector: "\\iff",
-    label: "Résoudre une équation du type $a\\times b^x + c = d$",
+    label: "Résoudre une équation du type $a\\times b^x + c = d$ grâce au logarithme décimal",
     levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
     sections: ["Logarithme népérien", "Puissances"],
@@ -91,7 +91,7 @@ exports.logPowerEquation = {
 exports.log10PowerEquation = {
     id: "log10PowerEquation",
     connector: "\\iff",
-    label: "Résoudre une équation du type $a\\times b^x + c = d$",
+    label: "Résoudre une équation du type $a\\times b^x + c = d$ grâce au logarithme népérien",
     levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
     sections: ["Logarithme décimal", "Puissances"],

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

@@ -3,4 +3,5 @@ export * from "./coordinatesReading";
 export * from "./determinant";
 export * from "./scalarProductViaCoords";
 export * from "./vectorCoordinatesFromTwoPoints";
+export * from "./scalarProductViaCos";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC;AAC1B,cAAc,sBAAsB,CAAC;AACrC,cAAc,eAAe,CAAC;AAC9B,cAAc,0BAA0B,CAAC;AACzC,cAAc,kCAAkC,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC;AAC1B,cAAc,sBAAsB,CAAC;AACrC,cAAc,eAAe,CAAC;AAC9B,cAAc,0BAA0B,CAAC;AACzC,cAAc,kCAAkC,CAAC;AACjD,cAAc,uBAAuB,CAAC"}

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

@@ -19,3 +19,4 @@ __exportStar(require("./coordinatesReading"), exports);
 __exportStar(require("./determinant"), exports);
 __exportStar(require("./scalarProductViaCoords"), exports);
 __exportStar(require("./vectorCoordinatesFromTwoPoints"), exports);
+__exportStar(require("./scalarProductViaCos"), exports);

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

@@ -43,7 +43,7 @@ exports.scalarProductViaCoords = {
     isSingleStep: false,
     label: "Calculer un produit scalaire à l'aide des coordonnées",
     levels: ["1reSpé", "TermSpé"],
-    sections: ["Vecteurs"],
+    sections: ["Vecteurs", "Produit scalaire"],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getScalarProductViaCoordsQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,

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

@@ -0,0 +1,9 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    AB: number;
+    AC: number;
+    trigoPoint: string;
+};
+export declare const scalarProductViaCos: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=scalarProductViaCos.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scalarProductViaCos.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/scalarProductViaCos.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAyDF,eAAO,MAAM,mBAAmB,EAAE,YAAY,CAAC,WAAW,CAazD,CAAC"}

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

@@ -0,0 +1,66 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.scalarProductViaCos = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const remarkableValue_1 = require("../../../math/trigonometry/remarkableValue");
+const remarkableValues_1 = require("../../../math/trigonometry/remarkableValues");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const randomLetter_1 = require("../../../utils/randomLetter");
+const shuffle_1 = require("../../../utils/shuffle");
+//|u| |v| cos(u,v)
+const getScalarProductViaCosQuestion = () => {
+    const AB = (0, randint_1.randint)(1, 10);
+    const AC = (0, randint_1.randint)(1, 10);
+    const trigo = remarkableValue_1.RemarkableValueConstructor.mainInterval();
+    const answer = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(AB * AC), trigo.cos)
+        .simplify()
+        .toTex();
+    const letters = [];
+    for (let i = 0; i < 3; i++) {
+        letters.push((0, randomLetter_1.randomLetter)(true, letters));
+    }
+    letters.sort((a, b) => a.localeCompare(b));
+    const [letterA, letterB, letterC] = letters;
+    const question = {
+        answer,
+        instruction: `Soient trois points $${letterA}$, $${letterB}$ et $${letterC}$ tels que $${letterA}${letterB} = ${AB}$, $${letterA}${letterC}= ${AC}$, et $\\widehat{${letterB}${letterA}${letterC}} = ${trigo.angle.toTex()}$. Calculer $\\overrightarrow{${letterA}${letterB}}\\cdot \\overrightarrow{${letterA}${letterC}}$.`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { AB, AC, trigoPoint: trigo.point },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, AB, AC, trigoPoint }) => {
+    const propositions = [];
+    const trigo = remarkableValues_1.remarkableTrigoValues.find((v) => v.point === trigoPoint);
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(AB * AC), trigo.sin).simplify().toTex());
+    const coeff = new numberNode_1.NumberNode(AB * AC);
+    while (propositions.length < n) {
+        const trigoValue = remarkableValue_1.RemarkableValueConstructor.mainInterval();
+        (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(coeff, trigoValue.sin).simplify().toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { AB, AC, trigoPoint }) => {
+    const trigo = remarkableValues_1.remarkableTrigoValues.find((v) => v.point === trigoPoint);
+    const tree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(AB * AC), trigo.cos).simplify();
+    const texs = tree.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.scalarProductViaCos = {
+    id: "scalarProductViaCos",
+    connector: "=",
+    label: "Calculer un produit scalaire (formule avec $cos$)",
+    levels: ["1reSpé"],
+    isSingleStep: true,
+    sections: ["Vecteurs", "Produit scalaire"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getScalarProductViaCosQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/limits/index.d.ts

@@ -7,4 +7,5 @@ export * from "./sequencePolynomLimit";
 export * from "./sequencePolynomNoFILimit";
 export * from "./sequencePolynomProductLimit";
 export * from "./sequenceRationalFracLimit";
+export * from "./limitReading";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC;AAC/B,cAAc,oBAAoB,CAAC;AACnC,cAAc,mCAAmC,CAAC;AAClD,cAAc,qBAAqB,CAAC;AACpC,cAAc,0BAA0B,CAAC;AACzC,cAAc,wBAAwB,CAAC;AACvC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,6BAA6B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC;AAC/B,cAAc,oBAAoB,CAAC;AACnC,cAAc,mCAAmC,CAAC;AAClD,cAAc,qBAAqB,CAAC;AACpC,cAAc,0BAA0B,CAAC;AACzC,cAAc,wBAAwB,CAAC;AACvC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,gBAAgB,CAAC"}

package/lib/exercises/limits/index.js

@@ -23,3 +23,4 @@ __exportStar(require("./sequencePolynomLimit"), exports);
 __exportStar(require("./sequencePolynomNoFILimit"), exports);
 __exportStar(require("./sequencePolynomProductLimit"), exports);
 __exportStar(require("./sequenceRationalFracLimit"), exports);
+__exportStar(require("./limitReading"), exports);

package/lib/exercises/limits/limitReading.d.ts

@@ -0,0 +1,10 @@
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    type: number;
+    to: string;
+    from: string | undefined;
+    a: number | undefined;
+};
+export declare const limitReading: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=limitReading.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"limitReading.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/limitReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAuBlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;IACzB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvB,CAAC;AAmGF,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,WAAW,CAYlD,CAAC"}

package/lib/exercises/limits/limitReading.js

@@ -0,0 +1,111 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.limitReading = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../math/utils/random/randint");
+const infiniteNode_1 = require("../../tree/nodes/numbers/infiniteNode");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
+const limitNode_1 = require("../../tree/nodes/operators/limitNode");
+const substractNode_1 = require("../../tree/nodes/operators/substractNode");
+const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+const coinFlip_1 = require("../../utils/coinFlip");
+const getLimitReadingQuestion = () => {
+    let to;
+    let from = undefined;
+    const type = (0, randint_1.randint)(1, 3);
+    let fct;
+    let answer = "";
+    let a;
+    switch (type) {
+        case 1: //a + b/(x-c)
+            a = (0, randint_1.randint)(-3, 4);
+            const b = (0, randint_1.randint)(-1, 2, [0]);
+            const c = (0, randint_1.randint)(-5, 6);
+            fct = new addNode_1.AddNode(new numberNode_1.NumberNode(a), new fractionNode_1.FractionNode(new numberNode_1.NumberNode(b), new substractNode_1.SubstractNode(new variableNode_1.VariableNode("x"), new numberNode_1.NumberNode(c)))).toMathString();
+            if ((0, coinFlip_1.coinFlip)()) {
+                // limites en +-inf
+                answer = a + "";
+                to = (0, coinFlip_1.coinFlip)() ? infiniteNode_1.PlusInfinityNode : infiniteNode_1.MinusInfinityNode;
+            }
+            else {
+                // limite en VI
+                to = new numberNode_1.NumberNode(c);
+                if ((0, coinFlip_1.coinFlip)()) {
+                    from = "+";
+                    answer = b > 0 ? infiniteNode_1.PlusInfinityNode.toTex() : infiniteNode_1.MinusInfinityNode.toTex();
+                }
+                else {
+                    from = "-";
+                    answer = b < 0 ? infiniteNode_1.PlusInfinityNode.toTex() : infiniteNode_1.MinusInfinityNode.toTex();
+                }
+            }
+            break;
+        case 2:
+        default:
+            const aPositive = (0, coinFlip_1.coinFlip)();
+            const polyPoints = [];
+            polyPoints.push([-8, (0, randint_1.randint)(-4, 5)]);
+            polyPoints.push([
+                -4,
+                aPositive ? polyPoints[0][1] + 2 : polyPoints[0][1] - 2,
+            ]);
+            polyPoints.push([2, polyPoints[0][1]]);
+            polyPoints.push([6, polyPoints[1][1]]);
+            const pointsString = polyPoints
+                .map((point) => `(${point[0]},${point[1]})`)
+                .join(",");
+            fct = `Polynomial({${pointsString}})`;
+            const isPlusInf = (0, coinFlip_1.coinFlip)();
+            to = isPlusInf ? infiniteNode_1.PlusInfinityNode : infiniteNode_1.MinusInfinityNode;
+            answer = aPositive
+                ? isPlusInf
+                    ? infiniteNode_1.PlusInfinityNode.toTex()
+                    : infiniteNode_1.MinusInfinityNode.toTex()
+                : isPlusInf
+                    ? infiniteNode_1.MinusInfinityNode.toTex()
+                    : infiniteNode_1.PlusInfinityNode.toTex();
+            break;
+    }
+    const question = {
+        answer,
+        instruction: `Ci-dessous est tracé la courbe représentative d'une fonction $f$. Déterminer la limite: $\\displaystyle ${new limitNode_1.LimitNode(to, new variableNode_1.VariableNode("f(x)"), from).toTex()}$`,
+        keys: [],
+        commands: [fct],
+        coords: [-10, 10, -10, 10],
+        answerFormat: "tex",
+        identifiers: { type, to: to.toTex(), from, a },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, type, to, from, a }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
+    if (a !== undefined)
+        (0, exercise_1.tryToAddWrongProp)(propositions, a + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, to);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-5, 6) + "");
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return answer === ans;
+};
+exports.limitReading = {
+    id: "limitReading",
+    connector: "=",
+    label: "Conjecturer graphiquement la limite d'une fonction",
+    levels: ["1reSpé", "TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Limites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLimitReadingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/squareRoots/index.d.ts

@@ -1,3 +1,6 @@
 export * from "./simpifySquareRoot";
 export * from "./squareRootEquation";
+export * from "./squareRootIdentities";
+export * from "./squareRootsDistributivity";
+export * from "./squareRootsSum";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/index.ts"],"names":[],"mappings":"AAAA,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/index.ts"],"names":[],"mappings":"AAAA,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC;AACrC,cAAc,wBAAwB,CAAC;AACvC,cAAc,6BAA6B,CAAC;AAC5C,cAAc,kBAAkB,CAAC"}

package/lib/exercises/squareRoots/index.js

@@ -16,3 +16,6 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./simpifySquareRoot"), exports);
 __exportStar(require("./squareRootEquation"), exports);
+__exportStar(require("./squareRootIdentities"), exports);
+__exportStar(require("./squareRootsDistributivity"), exports);
+__exportStar(require("./squareRootsSum"), exports);

package/lib/exercises/squareRoots/squareRootIdentities.d.ts

@@ -0,0 +1,11 @@
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    type: number;
+    a: number;
+    x: number;
+    b: number | undefined;
+    y: number;
+};
+export declare const squareRootIdentities: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=squareRootIdentities.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"squareRootIdentities.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/squareRootIdentities.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAmBlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA2KF,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,WAAW,CAa1D,CAAC"}

package/lib/exercises/squareRoots/squareRootIdentities.js

@@ -0,0 +1,124 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.squareRootIdentities = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const real_1 = require("../../math/numbers/reals/real");
+const randint_1 = require("../../math/utils/random/randint");
+const sqrtNode_1 = require("../../tree/nodes/functions/sqrtNode");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const substractNode_1 = require("../../tree/nodes/operators/substractNode");
+const probaFlip_1 = require("../../utils/probaFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const getAnswer = (type, firstTerm, secondTerm) => {
+    switch (type) {
+        case 1: //(a+b)^2
+            return new addNode_1.AddNode(new powerNode_1.SquareNode(firstTerm), new addNode_1.AddNode(new powerNode_1.SquareNode(secondTerm), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(2), new multiplyNode_1.MultiplyNode(firstTerm, secondTerm)))).simplify();
+        case 2:
+            return new addNode_1.AddNode(new powerNode_1.SquareNode(firstTerm), new substractNode_1.SubstractNode(new powerNode_1.SquareNode(secondTerm), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(2), new multiplyNode_1.MultiplyNode(firstTerm, secondTerm)))).simplify();
+        case 3:
+        default:
+            return new substractNode_1.SubstractNode(new powerNode_1.SquareNode(firstTerm), new powerNode_1.SquareNode(secondTerm)).simplify();
+    }
+};
+//(x sqrt(a) +- [y || y*sqrt(b)])^2
+//ou (x sqrt(a) + [y || y*sqrt(b)])(x sqrt(a) - [y || y*sqrt(b)])
+const getSquareRootIdentitiesQuestion = () => {
+    const type = (0, randint_1.randint)(1, 4);
+    const a = real_1.SquareRootConstructor.randomIrreductible(10);
+    const x = (0, randint_1.randint)(1, 7);
+    let b;
+    let y = (0, randint_1.randint)(1, 7);
+    const otherTermIsSqrt = (0, probaFlip_1.probaFlip)(0.3);
+    if (otherTermIsSqrt) {
+        do {
+            b = real_1.SquareRootConstructor.randomIrreductible(10);
+        } while (b.operand === a.operand);
+    }
+    const firstTerm = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(x), a.toTree());
+    const secondTerm = otherTermIsSqrt
+        ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(y), b.toTree())
+        : new numberNode_1.NumberNode(y);
+    let statement;
+    switch (type) {
+        case 1: //(a+b)^2
+            statement = new powerNode_1.SquareNode(new addNode_1.AddNode(firstTerm, secondTerm));
+            break;
+        case 2:
+            statement = new powerNode_1.SquareNode(new substractNode_1.SubstractNode(firstTerm, secondTerm));
+            break;
+        case 3:
+        default:
+            statement = new multiplyNode_1.MultiplyNode(new addNode_1.AddNode(firstTerm, secondTerm), new substractNode_1.SubstractNode(firstTerm, secondTerm));
+    }
+    const answer = getAnswer(type, firstTerm, secondTerm).toTex();
+    const question = {
+        answer,
+        instruction: `Développer et simplifier : $${statement.toTex()}$`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { type, a: a.operand, b: b?.operand, x, y },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b, type, x, y }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const firstTerm = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(x), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(a)));
+    const secondTerm = b
+        ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(y), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b)))
+        : new numberNode_1.NumberNode(y);
+    switch (type) {
+        case 1:
+            (0, exercise_1.tryToAddWrongProp)(propositions, new addNode_1.AddNode(new powerNode_1.SquareNode(firstTerm), new powerNode_1.SquareNode(secondTerm))
+                .simplify({ forbidFactorize: true })
+                .toTex());
+            while (propositions.length < n) {
+                (0, exercise_1.tryToAddWrongProp)(propositions, new addNode_1.AddNode(new numberNode_1.NumberNode((0, randint_1.randint)(1, 100)), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(1, 100)), real_1.SquareRootConstructor.randomIrreductible().toTree())).toTex());
+            }
+            break;
+        case 2:
+            (0, exercise_1.tryToAddWrongProp)(propositions, new substractNode_1.SubstractNode(new powerNode_1.SquareNode(firstTerm), new powerNode_1.SquareNode(secondTerm))
+                .simplify({ forbidFactorize: true })
+                .toTex());
+            while (propositions.length < n) {
+                (0, exercise_1.tryToAddWrongProp)(propositions, new substractNode_1.SubstractNode(new numberNode_1.NumberNode((0, randint_1.randint)(1, 100)), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(1, 100)), real_1.SquareRootConstructor.randomIrreductible().toTree())).toTex());
+            }
+            break;
+        case 3:
+        default:
+            (0, exercise_1.tryToAddWrongProp)(propositions, new substractNode_1.SubstractNode(new powerNode_1.SquareNode(secondTerm), new powerNode_1.SquareNode(firstTerm))
+                .simplify({ forbidFactorize: true })
+                .toTex());
+            while (propositions.length < n) {
+                (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-100, 100) + "");
+            }
+            break;
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, type, x, y }) => {
+    const firstTerm = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(x), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(a)));
+    const secondTerm = b
+        ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(y), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b)))
+        : new numberNode_1.NumberNode(y);
+    const answer = getAnswer(type, firstTerm, secondTerm);
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.squareRootIdentities = {
+    id: "squareRootIdentities",
+    connector: "=",
+    label: "Identités remarquables avec des racines carrées",
+    levels: ["2nde", "1reSpé"],
+    isSingleStep: true,
+    sections: ["Racines carrées", "Calcul littéral"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSquareRootIdentitiesQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/squareRoots/squareRootsDistributivity.d.ts

@@ -0,0 +1,10 @@
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    a: number;
+    b: number;
+    c: number;
+    d: number;
+};
+export declare const squareRootsDistributivity: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=squareRootsDistributivity.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"squareRootsDistributivity.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/squareRootsDistributivity.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAiEF,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,WAAW,CAa/D,CAAC"}

package/lib/exercises/squareRoots/squareRootsDistributivity.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.squareRootsDistributivity = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const real_1 = require("../../math/numbers/reals/real");
+const randint_1 = require("../../math/utils/random/randint");
+const sqrtNode_1 = require("../../tree/nodes/functions/sqrtNode");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+/**
+ * a sqrt(b) (c + d sqrt(b))
+ */
+const getSquareRootsDistributivityQuestion = () => {
+    const a = (0, randint_1.randint)(1, 7);
+    const aNode = new numberNode_1.NumberNode(a);
+    const c = (0, randint_1.randint)(1, 7);
+    const cNode = new numberNode_1.NumberNode(c);
+    const d = (0, randint_1.randint)(-6, 7, [0]);
+    const dNode = new numberNode_1.NumberNode(d);
+    const b = real_1.SquareRootConstructor.randomIrreductible(10);
+    const bTree = b.toTree();
+    const statement = new multiplyNode_1.MultiplyNode(new multiplyNode_1.MultiplyNode(aNode, bTree), new addNode_1.AddNode(cNode, new multiplyNode_1.MultiplyNode(dNode, bTree)));
+    const answer = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new multiplyNode_1.MultiplyNode(aNode, cNode), bTree), new multiplyNode_1.MultiplyNode(new multiplyNode_1.MultiplyNode(aNode, dNode), new numberNode_1.NumberNode(b.operand)))
+        .simplify({ forbidFactorize: true })
+        .toTex();
+    const question = {
+        answer,
+        instruction: `Développer et simplifier : $${statement.toTex()}$`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { a, b: b.operand, c, d },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, b }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const sqrt = new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b));
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(1, 10)), sqrt), new numberNode_1.NumberNode((0, randint_1.randint)(-100, 100, [0]))).toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { a, b, c, d }) => {
+    const aNode = new numberNode_1.NumberNode(a);
+    const cNode = new numberNode_1.NumberNode(c);
+    const dNode = new numberNode_1.NumberNode(d);
+    const bTree = new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b));
+    const answer = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new multiplyNode_1.MultiplyNode(aNode, cNode), bTree), new multiplyNode_1.MultiplyNode(new multiplyNode_1.MultiplyNode(aNode, dNode), new numberNode_1.NumberNode(b))).simplify({ forbidFactorize: true });
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.squareRootsDistributivity = {
+    id: "squareRootsDistributivity",
+    connector: "=",
+    label: "Distributivité avec des racines carrées",
+    levels: ["2nde"],
+    isSingleStep: true,
+    sections: ["Racines carrées", "Calcul littéral"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSquareRootsDistributivityQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/squareRoots/squareRootsSum.d.ts

@@ -0,0 +1,13 @@
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    a: number;
+    b: number;
+    c: number;
+    d: number | undefined;
+    x: number;
+    y: number;
+    z: number | undefined;
+};
+export declare const squareRootsSum: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=squareRootsSum.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"squareRootsSum.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/squareRootsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvB,CAAC;AA2EF,eAAO,MAAM,cAAc,EAAE,YAAY,CAAC,WAAW,CAapD,CAAC"}