math-exercises 2.2.45 → 2.2.47

package/lib/exercises/math/calcul/fractions/fractionsSum.js

@@ -47,7 +47,7 @@ const isAnswerValid = (ans, { rational, rational2 }, opts) => {
     const texs = answerTree.toAllValidTexs();
     if (allow)
         try {
-            const parsed = (0, latexParser_1.parseLatex)(ans).simplify().toTex();
+            const parsed = (0, latexParser_1.parseAlgebraic)(ans).simplify().toTex();
             return texs.includes(parsed);
         }
         catch (err) {

package/lib/exercises/math/calculLitteral/equation/equationType4Exercise.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"equationType4Exercise.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/equation/equationType4Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAclC;;GAEG;AAEH,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;AA4EF,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAAC,WAAW,CAcvD,CAAC"}
+{"version":3,"file":"equationType4Exercise.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/equation/equationType4Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAgBlC;;GAEG;AAEH,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;AAyFF,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAAC,WAAW,CAcvD,CAAC"}

package/lib/exercises/math/calculLitteral/equation/equationType4Exercise.js

@@ -62,6 +62,18 @@ const getPropositions = (n, { answer, a, b, c, d }) => {
     return (0, shuffle_1.shuffle)(propositions);
 };
 const isAnswerValid = (ans, { a, b, c, d }) => {
+    // try {
+    //   const parsed = equationSolutionParser(ans);
+    //   if (!parsed) return false;
+    //   console.log("parsed", parsed.toTex());
+    //   const solution = new Rational(d - b, a - c).simplify().toTree();
+    //   const solutionTex = solution.toTex();
+    //   const decimal = round(solution.evaluate({}), 12).frenchify();
+    //   const parsedSolution = parsed.simplify().toTex();
+    //   return solutionTex === parsedSolution || decimal === parsedSolution;
+    // } catch (err) {
+    //   return false;
+    // }
     const solution = new rational_1.Rational(d - b, a - c).simplify().toTree();
     const answerTree = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([solution]), {
         opts: { allowFractionToDecimal: true, allowRawRightChildAsSolution: true },

package/lib/exercises/math/complex/argumentFromAlgebraicComplex.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"argumentFromAlgebraicComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/argumentFromAlgebraicComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AA4CF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAc9D,CAAC"}
+{"version":3,"file":"argumentFromAlgebraicComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/argumentFromAlgebraicComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AA8CF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAc9D,CAAC"}

package/lib/exercises/math/complex/argumentFromAlgebraicComplex.js

@@ -5,7 +5,6 @@ const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const integer_1 = require("../../../math/numbers/integer/integer");
 const rational_1 = require("../../../math/numbers/rationals/rational");
-const remarkableValue_1 = require("../../../math/trigonometry/remarkableValue");
 const remarkableValues_1 = require("../../../math/trigonometry/remarkableValues");
 const randint_1 = require("../../../math/utils/random/randint");
 const complexNode_1 = require("../../../tree/nodes/complex/complexNode");
@@ -14,9 +13,9 @@ const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
 const random_1 = require("../../../utils/alea/random");
 const getArgumentFromAlgebraicComplexQuestion = () => {
-    const arg = remarkableValue_1.RemarkableValueConstructor.mainInterval();
+    const arg = (0, random_1.random)(remarkableValues_1.mainTrigoValues);
     const factor = (0, random_1.random)([
-        new integer_1.Integer((0, randint_1.randint)(-5, 6, [0, 1])).toTree(),
+        new integer_1.Integer((0, randint_1.randint)(2, 6)).toTree(),
         rational_1.RationalConstructor.randomIrreductible().toTree(),
         (0, random_1.random)([new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3))]),
     ]);
@@ -38,13 +37,13 @@ const getPropositions = (n, { answer }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
     while (propositions.length < n) {
-        const randomPoint = remarkableValue_1.RemarkableValueConstructor.mainInterval();
+        const randomPoint = (0, random_1.random)(remarkableValues_1.mainTrigoValues);
         (0, exercise_1.tryToAddWrongProp)(propositions, randomPoint.angle.toTex());
     }
     return (0, exercise_1.shuffleProps)(propositions, n);
 };
 const isAnswerValid = (ans, { arg }) => {
-    const point = remarkableValues_1.remarkableTrigoValues.find((point) => point.angle.evaluate({}) === arg);
+    const point = remarkableValues_1.mainTrigoValues.find((point) => point.angle.evaluate({}) === arg);
     const texs = point.angle.toAllValidTexs();
     return texs.includes(ans);
 };

package/lib/exercises/math/derivation/derivative/sqrtCompositionDerivation.js

@@ -39,7 +39,7 @@ const getPropositions = (n, { answer, affineA, affineB }) => {
 };
 const isAnswerValid = (ans, { answer, affineA, affineB }) => {
     try {
-        const parsed = (0, latexParser_1.parseLatex)(ans);
+        const parsed = (0, latexParser_1.parseAlgebraic)(ans);
         const simplified = parsed.simplify();
         return simplified.toTex() === answer;
     }

package/lib/exercises/math/functions/affines/affineExpressionFromTwoImages.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"affineExpressionFromTwoImages.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/affines/affineExpressionFromTwoImages.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,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;CACZ,CAAC;AAsFF,eAAO,MAAM,6BAA6B,EAAE,QAAQ,CAAC,WAAW,CAe/D,CAAC"}
+{"version":3,"file":"affineExpressionFromTwoImages.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/affines/affineExpressionFromTwoImages.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,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;CACZ,CAAC;AA2GF,eAAO,MAAM,6BAA6B,EAAE,QAAQ,CAAC,WAAW,CAgB/D,CAAC"}

package/lib/exercises/math/functions/affines/affineExpressionFromTwoImages.js

@@ -7,32 +7,27 @@ const rational_1 = require("../../../../math/numbers/rationals/rational");
 const affine_1 = require("../../../../math/polynomials/affine");
 const randint_1 = require("../../../../math/utils/random/randint");
 const addNode_1 = require("../../../../tree/nodes/operators/addNode");
+const fractionNode_1 = require("../../../../tree/nodes/operators/fractionNode");
 const multiplyNode_1 = require("../../../../tree/nodes/operators/multiplyNode");
 const substractNode_1 = require("../../../../tree/nodes/operators/substractNode");
 const variableNode_1 = require("../../../../tree/nodes/variables/variableNode");
 const shuffle_1 = require("../../../../utils/alea/shuffle");
-const getAffineExpressionFromTwoImagesQuestion = () => {
-    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
-    const xB = (0, randint_1.randint)(-9, 10, [xA]);
-    const yB = (0, randint_1.randint)(-9, 10);
-    const a = new rational_1.Rational(yB - yA, xB - xA).simplify().toTree();
-    //yA = axA+b donc b = yA-axA
+const alignTex_1 = require("../../../../utils/latex/alignTex");
+const getCorrection = (identifiers) => {
+    const { xA, xB, yA, yB } = identifiers;
+    const a = new fractionNode_1.FractionNode(new substractNode_1.SubstractNode(yB.toTree(), yA.toTree()), new substractNode_1.SubstractNode(xB.toTree(), xA.toTree()));
+    const aSimplified = a.simplify();
     const b = new substractNode_1.SubstractNode(yA.toTree(), new multiplyNode_1.MultiplyNode(a, xA.toTree())).simplify();
     const answer = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(a, new variableNode_1.VariableNode("x")), b)
         .simplify({ forceDistributeFractions: true })
         .toTex();
-    const question = {
-        instruction: `Soit $f$ une fonction affine telle que $f(${xA}) = ${yA}$ et $f(${xB}) = ${yB}$.
+    return `On calcule d'abord le taux d'accroissement $a$ : 
     
-Quelle est l'expression algébrique de $f$ ?`,
-        startStatement: "a",
-        answer,
-        hint: "Calcule d'abord le taux d'accroissement de $f$ en utilisant la formule $a = \\frac{y_2-y_1}{x_2-x_1}$. Ensuite, utilise les coordonnées d'un des deux points pour déterminer l'ordonnée à l'origine.",
-        correction: `On calcule d'abord le taux d'accroissement $a$ : 
-    
-$$
-a = \\frac{y_2-y_1}{x_2-x_1} = \\frac{${yB}-${yA}}{${xB}-${xA}} = ${a.toTex()}
-$$
+${(0, alignTex_1.alignTex)([
+        ["a", "=", `\\frac{y_2-y_1}{x_2-x_1}`],
+        ["", "=", `${a.toTex()}`],
+        ["", "=", `${aSimplified.toTex()}`],
+    ])}
 
 Il faut ensuite trouver l'ordonnée à l'origine $b$. On sait que $f(${xA}) = ${yA}$. Or pour tout $x$ réel, on a $f(x) = ax+b$. 
 
@@ -49,10 +44,30 @@ b = ${new substractNode_1.SubstractNode(yA.toTree(), new multiplyNode_1.Multiply
 $$
 
 Ainsi, $f(x) = ${answer}$.
-    `,
+    `;
+};
+const getAffineExpressionFromTwoImagesQuestion = () => {
+    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
+    const xB = (0, randint_1.randint)(-9, 10, [xA]);
+    const yB = (0, randint_1.randint)(-9, 10);
+    const a = new rational_1.Rational(yB - yA, xB - xA).simplify().toTree();
+    //yA = axA+b donc b = yA-axA
+    const b = new substractNode_1.SubstractNode(yA.toTree(), new multiplyNode_1.MultiplyNode(a, xA.toTree())).simplify();
+    const answer = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(a, new variableNode_1.VariableNode("x")), b)
+        .simplify({ forceDistributeFractions: true })
+        .toTex();
+    const identifiers = { xA, xB, yA, yB };
+    const question = {
+        instruction: `Soit $f$ une fonction affine telle que $f(${xA}) = ${yA}$ et $f(${xB}) = ${yB}$.
+    
+Quelle est l'expression algébrique de $f$ ?`,
+        startStatement: "a",
+        answer,
+        hint: "Calcule d'abord le taux d'accroissement de $f$ en utilisant la formule $a = \\frac{y_2-y_1}{x_2-x_1}$. Ensuite, utilise les coordonnées d'un des deux points pour déterminer l'ordonnée à l'origine.",
+        correction: getCorrection(identifiers),
         answerFormat: "tex",
         keys: ["x"],
-        identifiers: { xA, xB, yA, yB },
+        identifiers,
     };
     return question;
 };
@@ -89,4 +104,5 @@ exports.affineExpressionFromTwoImages = {
     isAnswerValid,
     subject: "Mathématiques",
     hasHintAndCorrection: true,
+    getCorrection,
 };

package/lib/exercises/math/geometry/cartesian/readAbscissOnLine.js

@@ -16,7 +16,7 @@ const random_1 = require("../../../../utils/alea/random");
 const getPropositions = (n, { answer, absciss, abscissTex, abscissType, axisUnit, oneUnitTex }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    const unitNode = (0, latexParser_1.parseLatex)(oneUnitTex);
+    const unitNode = (0, latexParser_1.parseAlgebraic)(oneUnitTex);
     while (propositions.length < n) {
         const coeff = (0, randint_1.randint)(-6, 7, [0, 1]);
         (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(unitNode, coeff.toTree()).simplify().toTex());
@@ -61,8 +61,8 @@ const getKeys = (identifiers) => {
 };
 const isAnswerValid = (ans, { answer, abscissTex }) => {
     try {
-        const answerNode = (0, latexParser_1.parseLatex)(ans);
-        const node = (0, latexParser_1.parseLatex)(abscissTex);
+        const answerNode = (0, latexParser_1.parseAlgebraic)(ans);
+        const node = (0, latexParser_1.parseAlgebraic)(abscissTex);
         return Math.abs(node.evaluate({}) - answerNode.evaluate({})) < 0.00001;
     }
     catch (err) {

package/lib/exercises/math/geometry/cartesian/readAbscissOnSemiLine.js

@@ -16,7 +16,7 @@ const random_1 = require("../../../../utils/alea/random");
 const getPropositions = (n, { answer, absciss, abscissTex, abscissType, axisUnit, oneUnitTex }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    const unitNode = (0, latexParser_1.parseLatex)(oneUnitTex);
+    const unitNode = (0, latexParser_1.parseAlgebraic)(oneUnitTex);
     while (propositions.length < n) {
         const coeff = (0, randint_1.randint)(2, 10);
         (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(unitNode, coeff.toTree()).simplify().toTex());
@@ -62,8 +62,8 @@ const getKeys = (identifiers) => {
 };
 const isAnswerValid = (ans, { answer, abscissTex }) => {
     try {
-        const answerNode = (0, latexParser_1.parseLatex)(ans);
-        const node = (0, latexParser_1.parseLatex)(abscissTex);
+        const answerNode = (0, latexParser_1.parseAlgebraic)(ans);
+        const node = (0, latexParser_1.parseAlgebraic)(abscissTex);
         return Math.abs(node.evaluate({}) - answerNode.evaluate({})) < 0.00001;
     }
     catch (err) {

package/lib/exercises/math/geometry/euclidian/choseMethodToCalculateLength.d.ts

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

package/lib/exercises/math/geometry/euclidian/choseMethodToCalculateLength.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"choseMethodToCalculateLength.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidian/choseMethodToCalculateLength.ts"],"names":[],"mappings":""}

package/lib/exercises/math/geometry/euclidian/choseMethodToCalculateLength.js

@@ -0,0 +1,79 @@
+"use strict";
+// import {
+//   Exercise,
+//   Proposition,
+//   QCMGenerator,
+//   Question,
+//   QuestionGenerator,
+//   VEA,
+//   addValidProp,
+//   shuffleProps,
+//   GetAnswer,
+//   GetHint,
+//   GetCorrection,
+//   GetInstruction,
+//   GetKeys,
+//   tryToAddWrongProp,
+// } from "../../../../exercises/exercise";
+// import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions";
+// type Identifiers = {
+//   type: "pythagore" | "thalès" | "trigo";
+// };
+// const getPropositions: QCMGenerator<Identifiers> = (n, { answer }) => {
+//   const propositions: Proposition[] = [];
+//   addValidProp(propositions, answer, "raw");
+//   tryToAddWrongProp(propositions, "Le théorème de Pythagore", "raw");
+//   tryToAddWrongProp(propositions, "Le théorème de Thalès", "raw");
+//   tryToAddWrongProp(propositions, "La trigonométrie", "raw");
+//   return shuffleProps(propositions, n);
+// };
+// const getAnswer: GetAnswer<Identifiers> = (identifiers) => {
+//   switch (identifiers.type) {
+//     case "pythagore":
+//       return "Le théorème de Pythagore";
+//     case "thalès":
+//       return "Le théorème de Thalès";
+//     case "trigo":
+//       return "La trigonométrie";
+//   }
+// };
+// const getInstruction: GetInstruction<Identifiers> = (identifiers) => {};
+// const getHint: GetHint<Identifiers> = (identifiers) => {};
+// const getCorrection: GetCorrection<Identifiers> = (identifiers) => {};
+// const getKeys: GetKeys<Identifiers> = (identifiers) => {
+//   return [];
+// };
+// const isAnswerValid: VEA<Identifiers> = (ans, { answer }) => {
+//   throw Error("VEA not implemented");
+// };
+// const getChoseMethodToCalculateLengthQuestion: QuestionGenerator<
+//   Identifiers
+// > = () => {
+//   const identifiers: Identifiers = {};
+//   const question: Question<Identifiers> = {
+//     answer: getAnswer(identifiers),
+//     instruction: getInstruction(identifiers),
+//     keys: getKeys(identifiers),
+//     answerFormat: "tex",
+//     identifiers,
+//     hint: getHint(identifiers),
+//     correction: getCorrection(identifiers),
+//   };
+//   return question;
+// };
+// export const choseMethodToCalculateLength: Exercise<Identifiers> = {
+//   id: "choseMethodToCalculateLength",
+//   connector: "",
+//   label: undefined,
+//   isSingleStep: true,
+//   generator: (nb: number) =>
+//     getDistinctQuestions(getChoseMethodToCalculateLengthQuestion, nb),
+//   qcmTimer: 60,
+//   freeTimer: 60,
+//   getPropositions,
+//   isAnswerValid,
+//   subject: "Mathématiques",
+//   getHint,
+//   getCorrection,
+//   getAnswer,
+// };

package/lib/exercises/math/geometry/euclidian/index.d.ts

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

package/lib/exercises/math/geometry/euclidian/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidian/index.ts"],"names":[],"mappings":""}

package/lib/exercises/math/geometry/euclidian/index.js

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

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

@@ -25,3 +25,4 @@ __exportStar(require("./volumes"), exports);
 // export * from "./triangles";
 __exportStar(require("./euclidianConstructions"), exports);
 __exportStar(require("./shapes"), exports);
+// export * from "./euclidian";

package/lib/exercises/math/geometry/pythagore/index.d.ts

@@ -1,3 +1,4 @@
 export * from "./pythagore";
 export * from "./pythagoreCalcul";
+export * from "./isTriangleRight";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/geometry/pythagore/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/pythagore/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,mBAAmB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/pythagore/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC"}

package/lib/exercises/math/geometry/pythagore/index.js

@@ -16,3 +16,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./pythagore"), exports);
 __exportStar(require("./pythagoreCalcul"), exports);
+__exportStar(require("./isTriangleRight"), exports);

package/lib/exercises/math/geometry/pythagore/isTriangleRight.d.ts

@@ -0,0 +1,11 @@
+import { Exercise } from "../../../../exercises/exercise";
+type Identifiers = {
+    isRight: boolean;
+    a: number;
+    b: number;
+    c: number;
+    vertices: string[];
+};
+export declare const isTriangleRight: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=isTriangleRight.d.ts.map

package/lib/exercises/math/geometry/pythagore/isTriangleRight.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"isTriangleRight.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/pythagore/isTriangleRight.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,0BAA0B,CAAC;AAelC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB,CAAC;AAyGF,eAAO,MAAM,eAAe,EAAE,QAAQ,CAAC,WAAW,CAiBjD,CAAC"}

package/lib/exercises/math/geometry/pythagore/isTriangleRight.js

@@ -0,0 +1,108 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isTriangleRight = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const pythagoricianTriplets_1 = require("../../../../math/utils/geometry/pythagoricianTriplets");
+const round_1 = require("../../../../math/utils/round");
+const addNode_1 = require("../../../../tree/nodes/operators/addNode");
+const powerNode_1 = require("../../../../tree/nodes/operators/powerNode");
+const coinFlip_1 = require("../../../../utils/alea/coinFlip");
+const random_1 = require("../../../../utils/alea/random");
+const doWhile_1 = require("../../../../utils/doWhile");
+const alignTex_1 = require("../../../../utils/latex/alignTex");
+const randomLetter_1 = require("../../../../utils/strings/randomLetter");
+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, exercise_1.shuffleProps)(propositions, n);
+};
+const getAnswer = (identifiers) => {
+    return identifiers.isRight ? "Oui" : "Non";
+};
+const getInstruction = (identifiers) => {
+    const triangleName = identifiers.vertices.join("");
+    const sides = identifiers.vertices.map((vertex, index) => vertex + identifiers.vertices[(index + 1) % 3]);
+    return `Soit $${triangleName}$ un triangle avec $${sides[0]} = ${identifiers.a.frenchify()}$, $${sides[1]} = ${identifiers.b.frenchify()}$ et $${sides[2]} = ${identifiers.c.frenchify()}$. Le triangle $${triangleName}$ est-il rectangle ?`;
+};
+const getHint = (identifiers) => {
+    return `Si la somme des carrés des côtés est égale au carré de l'hypoténuse, alors le triangle est rectangle, d'après la réciproque du théorème de Pythagore. Si ce n'est pas le cas, alors le triangle n'est pas rectangle, d'après le théorème de Pythagore. L'hypoténuse est toujours le côté le plus grand dans un triangle.`;
+};
+const getCorrection = (identifiers) => {
+    const hypo = Math.max(identifiers.a, identifiers.b, identifiers.c);
+    const sides = [identifiers.a, identifiers.b, identifiers.c].filter((e) => e !== hypo);
+    return `La somme des carrés des côtés est égale à : 
+  
+${(0, alignTex_1.alignTex)([
+        [
+            new addNode_1.AddNode(new powerNode_1.SquareNode(sides[0].toTree()), new powerNode_1.SquareNode(sides[1].toTree())).toTex(),
+            "=",
+            (0, round_1.round)(sides[0] ** 2, 6).frenchify() +
+                "+" +
+                (0, round_1.round)(sides[1] ** 2, 6).frenchify(),
+        ],
+        ["", "=", (0, round_1.round)(sides[0] ** 2 + sides[1] ** 2, 6).frenchify()],
+    ])}
+
+Le carré de l'hypoténuse vaut : 
+
+$$
+${new powerNode_1.SquareNode(hypo.toTree()).toTex()} = ${(0, round_1.round)(hypo ** 2, 6).frenchify()}
+$$
+
+${identifiers.isRight
+        ? "La somme des carrés des côtés est donc égale au carré de l'hypoténuse. D'après la réciproque du théorème de Pythagore, le triangle est donc rectangle."
+        : "La somme des carrés des côtés n'est donc pas égale au carré de l'hypoténuse. D'après le théorème de Pythagore, le triangle n'est donc pas rectangle."}`;
+};
+const getKeys = (identifiers) => {
+    return [];
+};
+const isAnswerValid = (ans, { answer }) => {
+    throw Error("VEA not implemented");
+};
+const getIsTriangleRightQuestion = () => {
+    const isRight = (0, coinFlip_1.coinFlip)();
+    const startVertix = (0, randomLetter_1.randomLetter)(true, ["Y", "Z"]);
+    const vertices = [
+        startVertix,
+        String.fromCharCode(startVertix.charCodeAt(0) + 1),
+        String.fromCharCode(startVertix.charCodeAt(0) + 2),
+    ];
+    const triplet = (0, random_1.random)(pythagoricianTriplets_1.pythagoricianTriplets);
+    const coeff = (0, random_1.random)([1, 2, 3, 4, 0.1, 0.2, 0.4, 0.5]);
+    let [a, b, c] = triplet.map((e) => (0, round_1.round)(e * coeff, 4));
+    if (!isRight) {
+        c = (0, doWhile_1.doWhile)(() => (0, round_1.round)(coeff * (triplet[2] + (0, random_1.random)([-1, 1])), 4), (x) => x === a || x === b);
+    }
+    const identifiers = { isRight, vertices, a, b, c };
+    const question = {
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
+        keys: getKeys(identifiers),
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+    return question;
+};
+exports.isTriangleRight = {
+    id: "isTriangleRight",
+    connector: "\\iff",
+    label: "Déterminer si un triangle est rectangle via Pythagore",
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getIsTriangleRightQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getHint,
+    getCorrection,
+    getAnswer,
+    hasHintAndCorrection: true,
+    answerType: "QCU",
+};

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

@@ -1 +1 @@
-{"version":3,"file":"scalarProductViaCos.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/geometry/vectors/scalarProduct/scalarProductViaCos.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,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,QAAQ,CAAC,WAAW,CAcrD,CAAC"}
+{"version":3,"file":"scalarProductViaCos.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/geometry/vectors/scalarProduct/scalarProductViaCos.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAclC,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,QAAQ,CAAC,WAAW,CAcrD,CAAC"}

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

@@ -3,18 +3,18 @@ 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/strings/randomLetter");
 const shuffle_1 = require("../../../../../utils/alea/shuffle");
+const random_1 = require("../../../../../utils/alea/random");
 //|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 trigo = (0, random_1.random)(remarkableValues_1.mainTrigoValues);
     const answer = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(AB * AC), trigo.cos)
         .simplify()
         .toTex();
@@ -40,7 +40,7 @@ const getPropositions = (n, { answer, AB, AC, trigoPoint }) => {
     (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();
+        const trigoValue = (0, random_1.random)(remarkableValues_1.mainTrigoValues);
         (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(coeff, trigoValue.sin).simplify().toTex());
     }
     return (0, shuffle_1.shuffle)(propositions);

package/lib/exercises/math/matrices/matrixInversibilityDomain.js

@@ -66,10 +66,10 @@ const getMatrixInversibilityDomainQuestion = () => {
 const getPropositions = (n, { answer, a, b, c, d }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    const aTree = (0, latexParser_1.parseLatex)(a);
-    const bTree = (0, latexParser_1.parseLatex)(b);
-    const cTree = (0, latexParser_1.parseLatex)(c);
-    const dTree = (0, latexParser_1.parseLatex)(d);
+    const aTree = (0, latexParser_1.parseAlgebraic)(a);
+    const bTree = (0, latexParser_1.parseAlgebraic)(b);
+    const cTree = (0, latexParser_1.parseAlgebraic)(c);
+    const dTree = (0, latexParser_1.parseAlgebraic)(d);
     const det = new substractNode_1.SubstractNode(new multiplyNode_1.MultiplyNode(aTree, dTree), new multiplyNode_1.MultiplyNode(bTree, cTree)).simplify();
     (0, exercise_1.tryToAddWrongProp)(propositions, unionIntervalNode_1.UnionIntervalNodeBuilder.realMinus(det).toTex());
     while (propositions.length < n) {

package/lib/exercises/math/percent/reciprocalPercentage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reciprocalPercentage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/percent/reciprocalPercentage.ts"],"names":[],"mappings":"AACA,OAAO,EACL,QAAQ,EAQT,MAAM,gBAAgB,CAAC;AAMxB,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,OAAO,CAAC;CACf,CAAC;AAsFF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAetD,CAAC"}
+{"version":3,"file":"reciprocalPercentage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/percent/reciprocalPercentage.ts"],"names":[],"mappings":"AACA,OAAO,EACL,QAAQ,EAST,MAAM,gBAAgB,CAAC;AAMxB,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,OAAO,CAAC;CACf,CAAC;AA2GF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAgBtD,CAAC"}

package/lib/exercises/math/percent/reciprocalPercentage.js

@@ -8,27 +8,18 @@ const shuffle_1 = require("../../../utils/alea/shuffle");
 const coinFlip_1 = require("../../../utils/alea/coinFlip");
 const round_1 = require("../../../math/utils/round");
 const percentParser_1 = require("../../../tree/parsers/percentParser");
-const getReciprocalPercentageQuestion = () => {
-    const randPercent = (0, randint_1.randint)(1, 50);
+const getCorrection = (identifiers) => {
     let ans = 0;
-    const isUp = (0, coinFlip_1.coinFlip)();
-    let instruction = `Le prix d'un article subit une ${isUp ? "hausse" : "baisse"} de $${randPercent}\\%$. Quelle évolution devra-t-il subir pour revenir à son prix initial (arrondir au centième de pourcentage) ?`;
-    ans = isUp
-        ? (1 / (1 + randPercent / 100) - 1) * 100
-        : (1 / (1 - randPercent / 100) - 1) * 100;
+    const { isUp, randPercent } = identifiers;
+    ans = identifiers.isUp
+        ? (1 / (1 + identifiers.randPercent / 100) - 1) * 100
+        : (1 / (1 - identifiers.randPercent / 100) - 1) * 100;
     const answer = `${(ans > 0
         ? "+" + (0, round_1.round)(ans, 2)
         : "" + (0, round_1.round)(ans, 2)).replace(".", ",")}\\%`;
-    const cm = (0, round_1.round)(1 + (isUp ? randPercent / 100 : -randPercent / 100), 4);
+    const cm = (0, round_1.round)(1 + (identifiers.isUp ? identifiers.randPercent / 100 : -randPercent / 100), 4);
     const recipCm = (0, round_1.round)(1 / cm, 4);
-    const question = {
-        instruction,
-        answer,
-        keys: ["percent"],
-        answerFormat: "tex",
-        identifiers: { isUp, randPercent },
-        hint: `Calcule le coefficient multiplicateur associé à une ${isUp ? "hausse" : "baisse"} de $${randPercent}\\%$. Puis, calcule le coefficient multiplicateur réciproque : c'est l'inverse du coefficient multiplicateur. Il ne reste alors plus qu'à transformer le coefficient multiplicateur réciproque en taux d'évolution.`,
-        correction: `Le coefficient multiplicateur correspondant à une ${isUp ? "hausse" : "baisse"} de $${randPercent}\\%$ est :
+    return `Le coefficient multiplicateur correspondant à une ${isUp ? "hausse" : "baisse"} de $${randPercent}\\%$ est :
     
 $$
 1${isUp ? "+" : "-"}\\frac{${randPercent}}{100} = ${cm.frenchify()}
@@ -47,7 +38,30 @@ $$
 $$
 
 Ainsi, le taux d'évolution permettant de revenir au prix initial est de $${answer}$.
-    `,
+    `;
+};
+const getReciprocalPercentageQuestion = () => {
+    const randPercent = (0, randint_1.randint)(1, 50);
+    let ans = 0;
+    const isUp = (0, coinFlip_1.coinFlip)();
+    let instruction = `Le prix d'un article subit une ${isUp ? "hausse" : "baisse"} de $${randPercent}\\%$. Quelle évolution devra-t-il subir pour revenir à son prix initial (arrondir au centième de pourcentage) ?`;
+    ans = isUp
+        ? (1 / (1 + randPercent / 100) - 1) * 100
+        : (1 / (1 - randPercent / 100) - 1) * 100;
+    const answer = `${(ans > 0
+        ? "+" + (0, round_1.round)(ans, 2)
+        : "" + (0, round_1.round)(ans, 2)).replace(".", ",")}\\%`;
+    const cm = (0, round_1.round)(1 + (isUp ? randPercent / 100 : -randPercent / 100), 4);
+    const recipCm = (0, round_1.round)(1 / cm, 4);
+    const identifiers = { isUp, randPercent };
+    const question = {
+        instruction,
+        answer,
+        keys: ["percent"],
+        answerFormat: "tex",
+        identifiers: { isUp, randPercent },
+        hint: `Calcule le coefficient multiplicateur associé à une ${isUp ? "hausse" : "baisse"} de $${randPercent}\\%$. Puis, calcule le coefficient multiplicateur réciproque : c'est l'inverse du coefficient multiplicateur. Il ne reste alors plus qu'à transformer le coefficient multiplicateur réciproque en taux d'évolution.`,
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -82,4 +96,5 @@ exports.reciprocalPercentage = {
     isAnswerValid,
     subject: "Mathématiques",
     hasHintAndCorrection: true,
+    getCorrection,
 };

package/lib/exercises/math/trigonometry/equationCosOnRandomInterval.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"equationCosOnRandomInterval.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/trigonometry/equationCosOnRandomInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,0BAA0B,CAAC;AAqBlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,mBAAmB,EAAE,MAAM,CAAC;CAC7B,CAAC;AA6HF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAgB7D,CAAC"}
+{"version":3,"file":"equationCosOnRandomInterval.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/trigonometry/equationCosOnRandomInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,0BAA0B,CAAC;AAmBlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,mBAAmB,EAAE,MAAM,CAAC;CAC7B,CAAC;AA6HF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAgB7D,CAAC"}

package/lib/exercises/math/trigonometry/mainAngleMeasure.js

@@ -56,7 +56,7 @@ const getKeys = (identifiers) => {
 const isAnswerValid = (ans, { answer, degree }) => {
     const value = remarkableValues_1.mainTrigoValues.find((e) => e.degree === degree);
     try {
-        const parsed = (0, latexParser_1.parseLatex)(ans);
+        const parsed = (0, latexParser_1.parseAlgebraic)(ans);
         const simplified = parsed.simplify().toTex();
         return simplified === answer;
         // return value.angle.toAllValidTexs().includes(ans);

package/lib/index.d.ts

@@ -915,6 +915,12 @@ declare const mathExercises: (import("./exercises/exercise").Exercise<{
 }, {}> | import("./exercises/exercise").Exercise<{
     square: number;
     sideLengths: number[];
+}, {}> | import("./exercises/exercise").Exercise<{
+    isRight: boolean;
+    a: number;
+    b: number;
+    c: number;
+    vertices: string[];
 }, {}> | import("./exercises/exercise").Exercise<{
     vertices: string[];
 }, {}> | import("./exercises/exercise").Exercise<{