math-exercises 2.0.20 → 2.0.22

package/lib/exercises/calculLitteral/equation/equationType3Exercise.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"equationType3Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType3Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAgBlC;;GAEG;AACH,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAsDF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAc3D,CAAC"}
+{"version":3,"file":"equationType3Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType3Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAiBlC;;GAEG;AACH,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAsDF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAc3D,CAAC"}

package/lib/exercises/calculLitteral/equation/equationType3Exercise.js

@@ -15,15 +15,16 @@ const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
 const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
 const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
 const shuffle_1 = require("../../../utils/shuffle");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const getEquationType3ExerciseQuestion = () => {
     const interval = new intervals_1.Interval("[[-10; 10]]");
     const intervalStar = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
-    const b = intervalStar.getRandomElement();
-    const a = intervalStar.getRandomElement();
-    const c = interval.getRandomElement();
-    const affine = new affine_1.Affine(a.value, b.value).toTree();
-    const solution = new rational_1.Rational(c.value - b.value, a.value).simplify();
-    const statementTree = new equalNode_1.EqualNode(affine, c.toTree());
+    const b = (0, randint_1.randint)(-10, 11, [0]);
+    const a = (0, randint_1.randint)(-10, 11, [0, 1]);
+    const c = (0, randint_1.randint)(-10, 11);
+    const affine = new affine_1.Affine(a, b).toTree();
+    const solution = new rational_1.Rational(c - b, a).simplify();
+    const statementTree = new equalNode_1.EqualNode(affine, new numberNode_1.NumberNode(c));
     const answerTree = new equalNode_1.EqualNode(new variableNode_1.VariableNode("x"), solution.toTree());
     const answer = answerTree.toTex();
     const question = {
@@ -32,7 +33,7 @@ const getEquationType3ExerciseQuestion = () => {
         answer,
         keys: equationKeys_1.equationKeys,
         answerFormat: "tex",
-        identifiers: { a: a.value, b: b.value, c: c.value },
+        identifiers: { a, b, c },
     };
     return question;
 };

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType0.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"firstDegreeInequationsType0.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType0.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AA2DF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}
+{"version":3,"file":"firstDegreeInequationsType0.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType0.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AA8DF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType0.js

@@ -13,15 +13,16 @@ const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
 const shuffle_1 = require("../../../utils/shuffle");
+/**x +b < c */
 const getFirstDegreeInequationsQuestion = () => {
-    const affine = new affine_1.Affine(1, (0, randint_1.randint)(-10, 11));
+    const affine = new affine_1.Affine(1, (0, randint_1.randint)(-10, 11, [0]));
     const c = (0, randint_1.randint)(-10, 11);
     const result = c - affine.b;
     const ineqType = inequation_1.InequationSymbolConstructor.random();
     const answer = `x${ineqType.symbol}${result}`;
     const question = {
         answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${c}$ `,
+        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType.symbol} ${c}$ `,
         keys: inequationKeys_1.inequationKeys,
         answerFormat: "tex",
         identifiers: { ineqType: ineqType.symbol, b: affine.b, c },

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType1.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"firstDegreeInequationsType1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType1.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAa3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AAmEF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAcjE,CAAC"}
+{"version":3,"file":"firstDegreeInequationsType1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType1.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAS3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AAqEF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAcjE,CAAC"}

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType1.js

@@ -13,6 +13,7 @@ const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequa
 const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
 const shuffle_1 = require("../../../utils/shuffle");
+/**ax<b */
 const getFirstDegreeInequationsQuestion = () => {
     const affine = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, 1]), 0);
     const b = (0, randint_1.randint)(-10, 11);
@@ -22,7 +23,7 @@ const getFirstDegreeInequationsQuestion = () => {
     const answer = `x${affine.a > 0 ? ineqType.symbol : invIneqType}${result}`;
     const question = {
         answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${b}$ `,
+        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType.symbol} ${b}$ `,
         keys: inequationKeys_1.inequationKeys,
         answerFormat: "tex",
         identifiers: { a: affine.a, b, ineqType: ineqType.symbol },

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"firstDegreeInequationsType2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType2.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAc3C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAsEF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}
+{"version":3,"file":"firstDegreeInequationsType2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType2.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAc3C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAyEF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType2.js

@@ -13,6 +13,7 @@ const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequa
 const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
 const shuffle_1 = require("../../../utils/shuffle");
+/**ax+b<c */
 const getFirstDegreeInequationsQuestion = () => {
     const affine = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, 1]), (0, randint_1.randint)(-10, 10, [0]));
     const c = (0, randint_1.randint)(-10, 11);
@@ -25,7 +26,7 @@ const getFirstDegreeInequationsQuestion = () => {
     const answer = `x${affine.a > 0 ? ineqType.symbol : invIneqType}${result}`;
     const question = {
         answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${c}$ `,
+        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType.symbol} ${c}$ `,
         keys: inequationKeys_1.inequationKeys,
         answerFormat: "tex",
         identifiers: { a: affine.a, b: affine.b, c, ineqType: ineqType.symbol },

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType3.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"firstDegreeInequationsType3.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType3.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAkFF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}
+{"version":3,"file":"firstDegreeInequationsType3.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType3.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAqFF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType3.js

@@ -13,6 +13,7 @@ const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequa
 const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
 const shuffle_1 = require("../../../utils/shuffle");
+/**ax+b<cx+d */
 const getFirstDegreeInequationsQuestion = () => {
     const affine1 = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0]), (0, randint_1.randint)(-10, 10));
     const affine2 = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, affine1.a]), (0, randint_1.randint)(-10, 10));
@@ -26,7 +27,7 @@ const getFirstDegreeInequationsQuestion = () => {
     const answer = `x${coeff > 0 ? ineqType.symbol : invIneqType}${result}`;
     const question = {
         answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine1.toTex()} ${ineqType} ${affine2.toTex()}$ `,
+        instruction: `Résoudre l'inéquation : $${affine1.toTex()} ${ineqType.symbol} ${affine2.toTex()}$ `,
         keys: inequationKeys_1.inequationKeys,
         answerFormat: "tex",
         identifiers: {

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

@@ -0,0 +1,12 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    xA: number;
+    xB: number;
+    xC: number;
+    yA: number;
+    yB: number;
+    yC: number;
+};
+export declare const alignementViaColinearity: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=alignementViaColinearity.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"alignementViaColinearity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/alignementViaColinearity.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AAkDF,eAAO,MAAM,wBAAwB,EAAE,YAAY,CAAC,WAAW,CAY9D,CAAC"}

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

@@ -0,0 +1,64 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.alignementViaColinearity = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const point_1 = require("../../../math/geometry/point");
+const vector_1 = require("../../../math/geometry/vector");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const getAlignementViaColinearityQuestion = () => {
+    const points = point_1.PointConstructor.randomDifferent(["A", "B"]);
+    const AB = vector_1.VectorConstructor.fromPoints(points[0], points[1]);
+    let C;
+    const isAligned = (0, coinFlip_1.coinFlip)();
+    const coeff = new numberNode_1.NumberNode((0, randint_1.randint)(-4, 4, [0, 1]));
+    if (isAligned) {
+        console.log("1");
+        C = AB.times(coeff).getEndPoint(points[0], "C");
+    }
+    else {
+        do {
+            console.log(`2 : ${AB.x.toTex()} et ${AB.y.toTex()}`);
+            C = point_1.PointConstructor.random("C");
+        } while (AB.isColinear(vector_1.VectorConstructor.fromPoints(points[0], C)));
+    }
+    const answer = isAligned ? "Oui" : "Non";
+    const question = {
+        answer,
+        instruction: `Soient trois points $${points[0].toTexWithCoords()}$, $${points[1].toTexWithCoords()}$ et $${C.toTexWithCoords()}$. Les points $A$, $B$ et $C$ sont-ils alignés ?`,
+        keys: [],
+        answerFormat: "raw",
+        identifiers: {
+            xA: points[0].x.evaluate({}),
+            xB: points[1].x.evaluate({}),
+            xC: C.x.evaluate({}),
+            yA: points[0].y.evaluate({}),
+            yB: points[1].y.evaluate({}),
+            yC: C.y.evaluate({}),
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer, "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "Oui", "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "Non", "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "On ne peut pas savoir", "raw");
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.alignementViaColinearity = {
+    id: "alignementViaColinearity",
+    label: "Utiliser la colinéarité pour déterminer un alignement",
+    levels: ["2nde", "1reSpé"],
+    isSingleStep: true,
+    sections: ["Vecteurs", "Droites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAlignementViaColinearityQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    answerType: "QCM",
+};

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

@@ -0,0 +1,10 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    xu: number;
+    yu: number;
+    xv: number;
+    yv: number;
+};
+export declare const colinearity: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=colinearity.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"colinearity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/colinearity.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,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;AAyCF,eAAO,MAAM,WAAW,EAAE,YAAY,CAAC,WAAW,CAWjD,CAAC"}

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

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.colinearity = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const vector_1 = require("../../../math/geometry/vector");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const getColinearityQuestion = () => {
+    const u = vector_1.VectorConstructor.random("u", false);
+    const isColinear = (0, coinFlip_1.coinFlip)();
+    let v;
+    if (isColinear) {
+        const coeff = new numberNode_1.NumberNode((0, randint_1.randint)(-5, 5));
+        v = u.times(coeff, "v");
+    }
+    else {
+        do {
+            v = vector_1.VectorConstructor.random("v", false);
+        } while (u.isColinear(v));
+    }
+    // const isColinear = u.isColinear(v);
+    const answer = isColinear ? "Oui" : "Non";
+    const question = {
+        answer,
+        instruction: `Soit deux vecteurs $${u.toTexWithCoords()}$ et $${v.toTexWithCoords()}$. $${u.toTex()}$ et $${v.toTex()}$ sont-ils colinéaires ?`,
+        keys: [],
+        answerFormat: "raw",
+        identifiers: {
+            xu: u.x.evaluate({}),
+            xv: v.x.evaluate({}),
+            yu: u.y.evaluate({}),
+            yv: v.y.evaluate({}),
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer, "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "Oui", "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "Non", "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "On ne peut pas savoir", "raw");
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.colinearity = {
+    id: "colinearity",
+    label: "Déterminer si deux vecteurs sont colinéaires",
+    levels: ["2nde", "1reSpé"],
+    isSingleStep: true,
+    sections: ["Vecteurs"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getColinearityQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    answerType: "QCM",
+};

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

@@ -0,0 +1,14 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    xA: number;
+    xB: number;
+    xC: number;
+    xD: number;
+    yA: number;
+    yB: number;
+    yC: number;
+    yD: number;
+};
+export declare const fourthParallelogramPoint: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=fourthParallelogramPoint.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"fourthParallelogramPoint.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/fourthParallelogramPoint.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAWlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AAwDF,eAAO,MAAM,wBAAwB,EAAE,YAAY,CAAC,WAAW,CAY9D,CAAC"}

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

@@ -0,0 +1,65 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fourthParallelogramPoint = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const coordinatesKeys_1 = require("../../../exercises/utils/keys/coordinatesKeys");
+const point_1 = require("../../../math/geometry/point");
+const vector_1 = require("../../../math/geometry/vector");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getFourthParallelogramPointQuestion = () => {
+    const points = point_1.PointConstructor.randomDifferent(["A", "B"]);
+    const AB = vector_1.VectorConstructor.fromPoints(points[0], points[1]);
+    let D;
+    do {
+        D = point_1.PointConstructor.random("D");
+    } while (AB.isColinear(vector_1.VectorConstructor.fromPoints(D, points[0])));
+    const C = AB.getEndPoint(D, "C");
+    const answer = D.toCoords();
+    const question = {
+        answer,
+        instruction: `Soient les points $${points[0].toTexWithCoords()}$, $${points[1].toTexWithCoords()}$, et $${C.toTexWithCoords()}$. Quelles sont les coordonnées du point $D$ tel que $ABCD$ soit un parallélogramme ?`,
+        keys: coordinatesKeys_1.coordinatesKeys,
+        answerFormat: "tex",
+        identifiers: {
+            xA: points[0].x.evaluate({}),
+            xB: points[1].x.evaluate({}),
+            xC: C.x.evaluate({}),
+            xD: D.x.evaluate({}),
+            yA: points[0].y.evaluate({}),
+            yB: points[1].y.evaluate({}),
+            yC: C.y.evaluate({}),
+            yD: D.y.evaluate({}),
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, xA, xB, xC, yA, yB, yC, yD }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer, "tex");
+    const AB = new vector_1.Vector("u", new numberNode_1.NumberNode(xB - xA), new numberNode_1.NumberNode(yB - yA));
+    const C = new point_1.Point("C", new numberNode_1.NumberNode(xC), new numberNode_1.NumberNode(yC));
+    const fakeD = AB.getEndPoint(C);
+    (0, exercise_1.tryToAddWrongProp)(propositions, fakeD.toCoords());
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, `\\left(${(0, randint_1.randint)(-10, 10)};${(0, randint_1.randint)(-10, 10)}\\right)`);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return [ans, ans.replace(",", ";"), "\\left(" + ans + "\\right)"].includes(answer);
+};
+exports.fourthParallelogramPoint = {
+    id: "fourthParallelogramPoint",
+    label: "Déterminer les coordonnées du quatrième point d'un parallélogramme",
+    levels: ["2nde", "1reSpé"],
+    isSingleStep: true,
+    sections: ["Vecteurs", "Droites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFourthParallelogramPointQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

@@ -4,4 +4,9 @@ export * from "./determinant";
 export * from "./scalarProductViaCoords";
 export * from "./vectorCoordinatesFromTwoPoints";
 export * from "./scalarProductViaCos";
+export * from "./colinearity";
+export * from "./alignementViaColinearity";
+export * from "./paralellismViaColinearity";
+export * from "./parallelogramViaEqualVectors";
+export * from "./fourthParallelogramPoint";
 //# 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;AACjD,cAAc,uBAAuB,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;AACtC,cAAc,eAAe,CAAC;AAC9B,cAAc,4BAA4B,CAAC;AAC3C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,4BAA4B,CAAC"}

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

@@ -20,3 +20,8 @@ __exportStar(require("./determinant"), exports);
 __exportStar(require("./scalarProductViaCoords"), exports);
 __exportStar(require("./vectorCoordinatesFromTwoPoints"), exports);
 __exportStar(require("./scalarProductViaCos"), exports);
+__exportStar(require("./colinearity"), exports);
+__exportStar(require("./alignementViaColinearity"), exports);
+__exportStar(require("./paralellismViaColinearity"), exports);
+__exportStar(require("./parallelogramViaEqualVectors"), exports);
+__exportStar(require("./fourthParallelogramPoint"), exports);

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

@@ -0,0 +1,14 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    xA: number;
+    xB: number;
+    xC: number;
+    xD: number;
+    yA: number;
+    yB: number;
+    yC: number;
+    yD: number;
+};
+export declare const paralellismViaColinearity: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=paralellismViaColinearity.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"paralellismViaColinearity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/paralellismViaColinearity.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AA2DF,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,WAAW,CAY/D,CAAC"}

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

@@ -0,0 +1,75 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.paralellismViaColinearity = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const line_1 = require("../../../math/geometry/line");
+const point_1 = require("../../../math/geometry/point");
+const vector_1 = require("../../../math/geometry/vector");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const getParalellismViaColinearityQuestion = () => {
+    let points = [];
+    do {
+        points = point_1.PointConstructor.randomDifferent(["A", "B"]);
+    } while (points[0].x.equals(points[1].x));
+    const line = new line_1.Line(points[0], points[1]);
+    let C;
+    do {
+        C = point_1.PointConstructor.random("C");
+    } while (line.includes(C));
+    let D;
+    const coeff = new numberNode_1.NumberNode((0, randint_1.randint)(-4, 4, [0]));
+    const parallele = line.getParallele(C);
+    const isParallele = (0, coinFlip_1.coinFlip)();
+    if (isParallele) {
+        D = vector_1.VectorConstructor.fromPoints(points[0], points[1])
+            .times(coeff)
+            .getEndPoint(C, "D");
+    }
+    else {
+        do {
+            D = point_1.PointConstructor.random("D");
+        } while (parallele.includes(D));
+    }
+    const answer = isParallele ? "Oui" : "Non";
+    const question = {
+        answer,
+        instruction: `Soient les points $${points[0].toTexWithCoords()}$, $${points[1].toTexWithCoords()}$, $${C.toTexWithCoords()}$ et $${D.toTexWithCoords()}$. Les droites $(AB)$ et $(CD)$ sont-elles parallèles ?`,
+        keys: [],
+        answerFormat: "raw",
+        identifiers: {
+            xA: points[0].x.evaluate({}),
+            xB: points[1].x.evaluate({}),
+            xC: C.x.evaluate({}),
+            xD: D.x.evaluate({}),
+            yA: points[0].y.evaluate({}),
+            yB: points[1].y.evaluate({}),
+            yC: C.y.evaluate({}),
+            yD: D.y.evaluate({}),
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer, "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "Oui", "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "Non", "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "On ne peut pas savoir", "raw");
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.paralellismViaColinearity = {
+    id: "paralellismViaColinearity",
+    label: "Utiliser la colinéarité pour déterminer un parallélisme",
+    levels: ["2nde", "1reSpé"],
+    isSingleStep: true,
+    sections: ["Vecteurs", "Droites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getParalellismViaColinearityQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    answerType: "QCM",
+};

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

@@ -0,0 +1,14 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    xA: number;
+    xB: number;
+    xC: number;
+    xD: number;
+    yA: number;
+    yB: number;
+    yC: number;
+    yD: number;
+};
+export declare const parallelogramViaEqualVectors: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=parallelogramViaEqualVectors.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"parallelogramViaEqualVectors.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/parallelogramViaEqualVectors.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAWlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AAyDF,eAAO,MAAM,4BAA4B,EAAE,YAAY,CAAC,WAAW,CAYlE,CAAC"}

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

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.parallelogramViaEqualVectors = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const point_1 = require("../../../math/geometry/point");
+const vector_1 = require("../../../math/geometry/vector");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const getParallelogramViaEqualVectorsQuestion = () => {
+    const points = point_1.PointConstructor.randomDifferent(["A", "B"]);
+    const AB = vector_1.VectorConstructor.fromPoints(points[0], points[1]);
+    let D;
+    do {
+        console.log(`1 : points: ${points.map((p) => p.toCoords())}, vec : ${AB.x.toTex()} et ${AB.y.toTex()}`);
+        D = point_1.PointConstructor.random("D");
+    } while (AB.isColinear(vector_1.VectorConstructor.fromPoints(D, points[0])));
+    let C;
+    const isParallelogram = (0, coinFlip_1.coinFlip)();
+    if (isParallelogram) {
+        C = AB.getEndPoint(D, "C");
+    }
+    else {
+        do {
+            console.log("2");
+            C = point_1.PointConstructor.random("C");
+        } while (AB.equals(vector_1.VectorConstructor.fromPoints(D, C)));
+    }
+    const answer = isParallelogram ? "Oui" : "Non";
+    const question = {
+        answer,
+        instruction: `Soient les points $${points[0].toTexWithCoords()}$, $${points[1].toTexWithCoords()}$, $${C.toTexWithCoords()}$ et $${D.toTexWithCoords()}$. $ABCD$ est-il un parallélogramme ?`,
+        keys: [],
+        answerFormat: "raw",
+        identifiers: {
+            xA: points[0].x.evaluate({}),
+            xB: points[1].x.evaluate({}),
+            xC: C.x.evaluate({}),
+            xD: D.x.evaluate({}),
+            yA: points[0].y.evaluate({}),
+            yB: points[1].y.evaluate({}),
+            yC: C.y.evaluate({}),
+            yD: D.y.evaluate({}),
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer, "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "Oui", "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "Non", "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "On ne peut pas savoir", "raw");
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.parallelogramViaEqualVectors = {
+    id: "parallelogramViaEqualVectors",
+    label: "Utiliser les vecteurs pour reconnaître un parallélogramme",
+    levels: ["2nde", "1reSpé"],
+    isSingleStep: true,
+    sections: ["Vecteurs", "Droites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getParallelogramViaEqualVectorsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    answerType: "QCM",
+};

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

@@ -1 +1 @@
-{"version":3,"file":"vectorCoordinatesFromTwoPoints.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/vectorCoordinatesFromTwoPoints.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAKlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,EAAE,CAAC;IACZ,CAAC,EAAE,MAAM,EAAE,CAAC;CACb,CAAC;AAuDF,eAAO,MAAM,8BAA8B,EAAE,YAAY,CAAC,WAAW,CAapE,CAAC"}
+{"version":3,"file":"vectorCoordinatesFromTwoPoints.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/vectorCoordinatesFromTwoPoints.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAKlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,EAAE,CAAC;IACZ,CAAC,EAAE,MAAM,EAAE,CAAC;CACb,CAAC;AAyDF,eAAO,MAAM,8BAA8B,EAAE,YAAY,CAAC,WAAW,CAapE,CAAC"}

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

@@ -35,7 +35,7 @@ const getPropositions = (n, { answer, A, B }) => {
     return (0, exercise_1.shuffleProps)(propositions, n);
 };
 const isAnswerValid = (ans, { answer }) => {
-    return ans === answer;
+    return [ans, ans.replace(",", ";"), "\\left(" + ans + "\\right)"].includes(answer);
 };
 exports.vectorCoordinatesFromTwoPoints = {
     id: "vectorCoordinatesFromTwoPoints",

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

@@ -0,0 +1,9 @@
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    pA: number;
+    pB: number;
+    pUnion: number;
+};
+export declare const independancy: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=independancy.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"independancy.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/independancy.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAiDF,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,WAAW,CAalD,CAAC"}