math-exercises 3.0.201 → 3.0.203

package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfPointInCubeCoordSystemFromVecPath.js

@@ -271,7 +271,7 @@ const getHint = (identifiers) => {
     return `Le point $M$ est l'image du point $F$ par la translation de vecteur $${nodeEquationForVecs.rightChild.toTex()}$.
 Tu as deux possibilités : 
 - soit tu arrives à visualiser mentalement l'emplacement du point $M$ sur la figure et tu détermines ses coordonnées
-- soit tu détermines les coordonnées de $F$ et celles du vecteur $${nodeEquationForVecs.rightChild.toTex()}$ puis tu les additionne.`;
+- soit tu détermines les coordonnées de $F$ et celles du vecteur $${nodeEquationForVecs.rightChild.toTex()}$ puis tu les additionnes.`;
 };
 const getCorrection = (identifiers) => {
     const { nodeIdsEquationForVecs } = identifiers;

package/lib/exercises/math/spaceGeometry/orthogonalProjection/findOrthogonalProjectionOfPointOnPlane.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"findOrthogonalProjectionOfPointOnPlane.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/orthogonalProjection/findOrthogonalProjectionOfPointOnPlane.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAGL,sBAAsB,EACvB,MAAM,oCAAoC,CAAC;AAS5C,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AA0G7C,KAAK,QAAQ,GAAG;IACd,sBAAsB,EAAE,qBAAqB,CAAC;IAC9C,oBAAoB,EAAE,sBAAsB,CAAC;IAC7C,oBAAoB,EAAE,eAAe,CAAC;IACtC,kBAAkB,EAAE,MAAM,CAAC;IAC3B,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,QAAQ,CAAC;IACf,cAAc,EAAE,qBAAqB,CAAC;IACtC,qBAAqB,EAAE,qBAAqB,EAAE,CAAC;CAChD,CAAC;AA0ZF,KAAK,OAAO,GAAG;IACb,gBAAgB,EAAE,MAAM,CAAC;CAC1B,CAAC;AAqBF,eAAO,MAAM,sCAAsC,EAAE,QAAQ,CAC3D,WAAW,EACX,OAAO,CAqBR,CAAC"}
+{"version":3,"file":"findOrthogonalProjectionOfPointOnPlane.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/orthogonalProjection/findOrthogonalProjectionOfPointOnPlane.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAGL,sBAAsB,EACvB,MAAM,oCAAoC,CAAC;AAS5C,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AA2G7C,KAAK,QAAQ,GAAG;IACd,sBAAsB,EAAE,qBAAqB,CAAC;IAC9C,oBAAoB,EAAE,sBAAsB,CAAC;IAC7C,oBAAoB,EAAE,eAAe,CAAC;IACtC,kBAAkB,EAAE,MAAM,CAAC;IAC3B,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,QAAQ,CAAC;IACf,cAAc,EAAE,qBAAqB,CAAC;IACtC,qBAAqB,EAAE,qBAAqB,EAAE,CAAC;CAChD,CAAC;AAgZF,KAAK,OAAO,GAAG;IACb,gBAAgB,EAAE,MAAM,CAAC;CAC1B,CAAC;AAqBF,eAAO,MAAM,sCAAsC,EAAE,QAAQ,CAC3D,WAAW,EACX,OAAO,CAqBR,CAAC"}

package/lib/exercises/math/spaceGeometry/orthogonalProjection/findOrthogonalProjectionOfPointOnPlane.js

@@ -16,6 +16,7 @@ import { NodeComparator } from "../../../../tree/utilities/nodeComparator.js";
 import { coinFlip } from "../../../../utils/alea/coinFlip.js";
 import { random, randomMany } from "../../../../utils/alea/random.js";
 import { shuffle } from "../../../../utils/alea/shuffle.js";
+import { zip } from "../../../../utils/arrays/arrayZip.js";
 import { alignTex } from "../../../../utils/latex/alignTex.js";
 const [nodeVarX, nodeVarY, nodeVarZ] = ["x", "y", "z"].map((name) => new VariableNode(name));
 const createNodeCheckForIsPointBelongingToPlane = (spacePoint, nodePlaneEquation) => {
@@ -232,35 +233,21 @@ const getPropositions = (n, { answer, ...identifiers }) => {
 };
 const createRandomIdentifiers = (opts) => {
     const { typeDataForPlane } = opts;
-    const funcRand1 = () => randint(-3, 4, coinFlip() ? [0] : []).toTree();
-    const funcRand2 = () => randint(-6, 7, coinFlip() ? [0] : []).toTree();
-    const funcRand3 = () => randint(-9, 10, coinFlip() ? [0] : []).toTree();
-    function createRandomOrthogonalVector(vecSrc) {
-        const [nodeX, nodeY, nodeZ] = [vecSrc.x, vecSrc.y, vecSrc.z];
-        const nodeZero = (0).toTree();
-        const vec1 = new SpaceVector("v1", opposite(nodeY), nodeX, nodeZero);
-        const vec2 = new SpaceVector("v2", nodeZero, opposite(nodeZ), nodeY);
-        const vec3 = new SpaceVector("v3", opposite(nodeZ), nodeZero, nodeX);
-        const [factor1, factor2, factor3] = shuffle(random([
-            [coinFlip(), false, false],
-            [coinFlip(), coinFlip(), false],
-        ])).map((isCanBeZero) => randint(-3, 4, isCanBeZero ? [] : [0]).toTree());
-        return vec1
-            .times(factor1)
-            .add(vec2.times(factor2))
-            .add(vec3.times(factor3));
-    }
+    const funcRand1 = (isCanBeZero) => randint(-3, 4, isCanBeZero ? [] : [0]).toTree();
+    const funcRand2 = (isCanBeZero) => randint(-6, 7, isCanBeZero ? [] : [0]).toTree();
+    const funcRand3 = (isCanBeZero) => randint(-9, 10, isCanBeZero ? [] : [0]).toTree();
     //create vecR, vecS, vecT (base)
     const vecR = (() => {
-        const [funcRandX, funcRandY, funcRandZ] = shuffle([
-            funcRand1,
-            funcRand2,
-            funcRand3,
-        ]);
-        return new SpaceVector("r", funcRandX(), funcRandY(), funcRandZ());
+        const arrIsCanBeZero = shuffle(random([
+            [coinFlip(), false, false],
+            [coinFlip(), coinFlip(), false],
+        ]));
+        const arrFuncRand = shuffle([funcRand1, funcRand2, funcRand3]);
+        const [nodeX, nodeY, nodeZ] = zip(arrIsCanBeZero, arrFuncRand).map(([isCanBeZero, funcRand]) => funcRand(isCanBeZero));
+        return new SpaceVector("r", nodeX, nodeY, nodeZ);
     })();
     const vecS = (() => {
-        const vecRaw = createRandomOrthogonalVector(vecR);
+        const vecRaw = vecR.getRandomOrthogonalVectorNonZero();
         return new SpaceVector("s", vecRaw.x, vecRaw.y, vecRaw.z);
     })();
     const [vecU, vecV] = (() => {

package/lib/exercises/math/spaceGeometry/orthogonalProjection/index.d.ts

@@ -1,2 +1,2 @@
-export {};
+export * from "./findOrthogonalProjectionOfPointOnPlane.js";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/spaceGeometry/orthogonalProjection/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/orthogonalProjection/index.ts"],"names":[],"mappings":""}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/orthogonalProjection/index.ts"],"names":[],"mappings":"AAAA,cAAc,6CAA6C,CAAC"}

package/lib/exercises/math/spaceGeometry/orthogonalProjection/index.js

@@ -1,2 +1 @@
-export {};
-// export * from "./findOrthogonalProjectionOfPointOnPlane.js";
+export * from "./findOrthogonalProjectionOfPointOnPlane.js";

package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlanePointsCoords.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"findNormalVectorFromPlanePointsCoords.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/planes/findNormalVectorFromPlanePointsCoords.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAErC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAGL,sBAAsB,EACvB,MAAM,oCAAoC,CAAC;AAsE5C,KAAK,WAAW,GAAG;IACjB,wBAAwB,EAAE,qBAAqB,EAAE,CAAC;IAClD,sBAAsB,EAAE,sBAAsB,EAAE,CAAC;CAClD,CAAC;AAkRF,eAAO,MAAM,qCAAqC,EAAE,QAAQ,CAAC,WAAW,CAmBvE,CAAC"}
+{"version":3,"file":"findNormalVectorFromPlanePointsCoords.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/planes/findNormalVectorFromPlanePointsCoords.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAErC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAGL,sBAAsB,EACvB,MAAM,oCAAoC,CAAC;AAqE5C,KAAK,WAAW,GAAG;IACjB,wBAAwB,EAAE,qBAAqB,EAAE,CAAC;IAClD,sBAAsB,EAAE,sBAAsB,EAAE,CAAC;CAClD,CAAC;AAwQF,eAAO,MAAM,qCAAqC,EAAE,QAAQ,CAAC,WAAW,CAmBvE,CAAC"}

package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlanePointsCoords.js

@@ -3,7 +3,6 @@ import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQue
 import { SpacePoint, SpacePointConstructor, } from "../../../../math/geometry/spacePoint.js";
 import { SpaceVector, SpaceVectorConstructor, } from "../../../../math/geometry/spaceVector.js";
 import { randint } from "../../../../math/utils/random/randint.js";
-import { opposite } from "../../../../tree/nodes/functions/oppositeNode.js";
 import { frac } from "../../../../tree/nodes/operators/fractionNode.js";
 import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
 import { substract } from "../../../../tree/nodes/operators/substractNode.js";
@@ -133,35 +132,21 @@ const getPropositions = (n, { answer, ...identifiers }) => {
     return shuffleProps(propositions, n);
 };
 const createRandomIdentifiers = () => {
-    const funcRand1 = () => randint(-3, 4, coinFlip() ? [0] : []).toTree();
-    const funcRand2 = () => randint(-6, 7, coinFlip() ? [0] : []).toTree();
-    const funcRand3 = () => randint(-9, 10, coinFlip() ? [0] : []).toTree();
-    function createRandomOrthogonalVector(vecSrc) {
-        const [nodeX, nodeY, nodeZ] = [vecSrc.x, vecSrc.y, vecSrc.z];
-        const nodeZero = (0).toTree();
-        const vec1 = new SpaceVector("v1", opposite(nodeY), nodeX, nodeZero);
-        const vec2 = new SpaceVector("v2", nodeZero, opposite(nodeZ), nodeY);
-        const vec3 = new SpaceVector("v3", opposite(nodeZ), nodeZero, nodeX);
-        const [factor1, factor2, factor3] = shuffle(random([
-            [coinFlip(), false, false],
-            [coinFlip(), coinFlip(), false],
-        ])).map((isCanBeZero) => randint(-3, 4, isCanBeZero ? [] : [0]).toTree());
-        return vec1
-            .times(factor1)
-            .add(vec2.times(factor2))
-            .add(vec3.times(factor3));
-    }
+    const funcRand1 = (isCanBeZero) => randint(-3, 4, isCanBeZero ? [] : [0]).toTree();
+    const funcRand2 = (isCanBeZero) => randint(-6, 7, isCanBeZero ? [] : [0]).toTree();
+    const funcRand3 = (isCanBeZero) => randint(-9, 10, isCanBeZero ? [] : [0]).toTree();
     //create vecR, vecS, vecT (base)
     const vecR = (() => {
-        const [funcRandX, funcRandY, funcRandZ] = shuffle([
-            funcRand1,
-            funcRand2,
-            funcRand3,
-        ]);
-        return new SpaceVector("r", funcRandX(), funcRandY(), funcRandZ());
+        const arrIsCanBeZero = shuffle(random([
+            [coinFlip(), false, false],
+            [coinFlip(), coinFlip(), false],
+        ]));
+        const arrFuncRand = shuffle([funcRand1, funcRand2, funcRand3]);
+        const [nodeX, nodeY, nodeZ] = zip(arrIsCanBeZero, arrFuncRand).map(([isCanBeZero, funcRand]) => funcRand(isCanBeZero));
+        return new SpaceVector("r", nodeX, nodeY, nodeZ);
     })();
     const vecS = (() => {
-        const vecRaw = createRandomOrthogonalVector(vecR);
+        const vecRaw = vecR.getRandomOrthogonalVectorNonZero();
         return new SpaceVector("s", vecRaw.x, vecRaw.y, vecRaw.z);
     })();
     const [vecU, vecV] = (() => {

package/lib/exercises/math/spaceGeometry/planes/index.d.ts

@@ -2,5 +2,6 @@ export * from "./checkIsPointBelongingToPlane.js";
 export * from "./planeEquationFromNormalVectorAndContainedPoint.js";
 export * from "./findNormalVectorFromPlaneEquation.js";
 export * from "./planeEquationFromOrthogonalLineAndContainedPoint.js";
+export * from "./findNormalVectorFromPlanePointsCoords.js";
 export * from "./planePlaneRelativePositions.js";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/spaceGeometry/planes/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/planes/index.ts"],"names":[],"mappings":"AAAA,cAAc,mCAAmC,CAAC;AAClD,cAAc,qDAAqD,CAAC;AACpE,cAAc,wCAAwC,CAAC;AACvD,cAAc,uDAAuD,CAAC;AAEtE,cAAc,kCAAkC,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/planes/index.ts"],"names":[],"mappings":"AAAA,cAAc,mCAAmC,CAAC;AAClD,cAAc,qDAAqD,CAAC;AACpE,cAAc,wCAAwC,CAAC;AACvD,cAAc,uDAAuD,CAAC;AACtE,cAAc,4CAA4C,CAAC;AAC3D,cAAc,kCAAkC,CAAC"}

package/lib/exercises/math/spaceGeometry/planes/index.js

@@ -2,5 +2,5 @@ export * from "./checkIsPointBelongingToPlane.js";
 export * from "./planeEquationFromNormalVectorAndContainedPoint.js";
 export * from "./findNormalVectorFromPlaneEquation.js";
 export * from "./planeEquationFromOrthogonalLineAndContainedPoint.js";
-// export * from "./findNormalVectorFromPlanePointsCoords.js";
+export * from "./findNormalVectorFromPlanePointsCoords.js";
 export * from "./planePlaneRelativePositions.js";

package/lib/exercises/math/spaceGeometry/planes/planePlaneRelativePositions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"planePlaneRelativePositions.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/planes/planePlaneRelativePositions.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAGL,sBAAsB,EACvB,MAAM,oCAAoC,CAAC;AAS5C,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAkH7C,KAAK,QAAQ,GAAG;IACd,sBAAsB,EAAE,qBAAqB,CAAC;IAC9C,oBAAoB,EAAE,sBAAsB,CAAC;IAC7C,oBAAoB,EAAE,eAAe,CAAC;IACtC,kBAAkB,EAAE,MAAM,CAAC;IAC3B,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,QAAQ,CAAC;IAChB,KAAK,EAAE,QAAQ,CAAC;CACjB,CAAC;AAsiBF,KAAK,OAAO,GAAG;IACb,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;CAC3B,CAAC;AA8BF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAoBtE,CAAC"}
+{"version":3,"file":"planePlaneRelativePositions.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/planes/planePlaneRelativePositions.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAGL,sBAAsB,EACvB,MAAM,oCAAoC,CAAC;AAS5C,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAkH7C,KAAK,QAAQ,GAAG;IACd,sBAAsB,EAAE,qBAAqB,CAAC;IAC9C,oBAAoB,EAAE,sBAAsB,CAAC;IAC7C,oBAAoB,EAAE,eAAe,CAAC;IACtC,kBAAkB,EAAE,MAAM,CAAC;IAC3B,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,QAAQ,CAAC;IAChB,KAAK,EAAE,QAAQ,CAAC;CACjB,CAAC;AA4hBF,KAAK,OAAO,GAAG;IACb,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;CAC3B,CAAC;AA8BF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAoBtE,CAAC"}

package/lib/exercises/math/spaceGeometry/planes/planePlaneRelativePositions.js

@@ -327,35 +327,21 @@ const getPropositions = (_n, { answer }) => {
 };
 const createRandomIdentifiers = (opts) => {
     const { typeDataForPlane1, typeDataForPlane2 } = opts;
-    const funcRand1 = () => randint(-3, 4, coinFlip() ? [0] : []).toTree();
-    const funcRand2 = () => randint(-6, 7, coinFlip() ? [0] : []).toTree();
-    const funcRand3 = () => randint(-9, 10, coinFlip() ? [0] : []).toTree();
-    function createRandomOrthogonalVector(vecSrc) {
-        const [nodeX, nodeY, nodeZ] = [vecSrc.x, vecSrc.y, vecSrc.z];
-        const nodeZero = (0).toTree();
-        const vec1 = new SpaceVector("v1", opposite(nodeY), nodeX, nodeZero);
-        const vec2 = new SpaceVector("v2", nodeZero, opposite(nodeZ), nodeY);
-        const vec3 = new SpaceVector("v3", opposite(nodeZ), nodeZero, nodeX);
-        const [factor1, factor2, factor3] = shuffle(random([
-            [coinFlip(), false, false],
-            [coinFlip(), coinFlip(), false],
-        ])).map((isCanBeZero) => randint(-3, 4, isCanBeZero ? [] : [0]).toTree());
-        return vec1
-            .times(factor1)
-            .add(vec2.times(factor2))
-            .add(vec3.times(factor3));
-    }
+    const funcRand1 = (isCanBeZero) => randint(-3, 4, isCanBeZero ? [] : [0]).toTree();
+    const funcRand2 = (isCanBeZero) => randint(-6, 7, isCanBeZero ? [] : [0]).toTree();
+    const funcRand3 = (isCanBeZero) => randint(-9, 10, isCanBeZero ? [] : [0]).toTree();
     //create vecR, vecS, vecT (base)
     const vecR = (() => {
-        const [funcRandX, funcRandY, funcRandZ] = shuffle([
-            funcRand1,
-            funcRand2,
-            funcRand3,
-        ]);
-        return new SpaceVector("r", funcRandX(), funcRandY(), funcRandZ());
+        const arrIsCanBeZero = shuffle(random([
+            [coinFlip(), false, false],
+            [coinFlip(), coinFlip(), false],
+        ]));
+        const arrFuncRand = shuffle([funcRand1, funcRand2, funcRand3]);
+        const [nodeX, nodeY, nodeZ] = zip(arrIsCanBeZero, arrFuncRand).map(([isCanBeZero, funcRand]) => funcRand(isCanBeZero));
+        return new SpaceVector("r", nodeX, nodeY, nodeZ);
     })();
     const vecS = (() => {
-        const vecRaw = createRandomOrthogonalVector(vecR);
+        const vecRaw = vecR.getRandomOrthogonalVectorNonZero();
         return new SpaceVector("s", vecRaw.x, vecRaw.y, vecRaw.z);
     })();
     const [vecU, vecV] = (() => {

package/lib/exercises/math/spaceGeometry/scalarProduct/angleFromScalarProductFromSpacePointCoords.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"angleFromScalarProductFromSpacePointCoords.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/scalarProduct/angleFromScalarProductFromSpacePointCoords.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAiD3C,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,qBAAqB,EAAE,CAAC;CACxC,CAAC;AA+QF,eAAO,MAAM,0CAA0C,EAAE,QAAQ,CAAC,WAAW,CAoB1E,CAAC"}
+{"version":3,"file":"angleFromScalarProductFromSpacePointCoords.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/scalarProduct/angleFromScalarProductFromSpacePointCoords.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAmD3C,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,qBAAqB,EAAE,CAAC;CACxC,CAAC;AAuSF,eAAO,MAAM,0CAA0C,EAAE,QAAQ,CAAC,WAAW,CAoB1E,CAAC"}

package/lib/exercises/math/spaceGeometry/scalarProduct/angleFromScalarProductFromSpacePointCoords.js

@@ -15,6 +15,8 @@ import { square } from "../../../../tree/nodes/operators/powerNode.js";
 import { substract } from "../../../../tree/nodes/operators/substractNode.js";
 import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
 import { coinFlip } from "../../../../utils/alea/coinFlip.js";
+import { random } from "../../../../utils/alea/random.js";
+import { shuffle } from "../../../../utils/alea/shuffle.js";
 import { zip } from "../../../../utils/arrays/arrayZip.js";
 import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
 import { alignTex } from "../../../../utils/latex/alignTex.js";
@@ -176,13 +178,31 @@ const isAnswerValid = (ans, { answer }) => {
     }
 };
 const createRandomIdentifiers = () => {
-    const funcRand1 = () => randint(-3, 4, coinFlip() ? [0] : []).toTree();
-    const funcRand2 = () => randint(-6, 7, coinFlip() ? [0] : []).toTree();
-    const funcRand3 = () => randint(-9, 10, coinFlip() ? [0] : []).toTree();
-    const [vecU, vecV] = zip(["u", "v"], [
+    const funcRand1 = (isCanBeZero) => randint(-3, 4, isCanBeZero ? [] : [0]).toTree();
+    const funcRand2 = (isCanBeZero) => randint(-6, 7, isCanBeZero ? [] : [0]).toTree();
+    const funcRand3 = (isCanBeZero) => randint(-9, 10, isCanBeZero ? [] : [0]).toTree();
+    const [vec1, vec2] = zip(["u", "v"], [
         [funcRand1, funcRand2, funcRand3],
         [funcRand3, funcRand2, funcRand1],
-    ]).map(([name, [funcRandX, funcRandY, funcRandZ]]) => new SpaceVector(name, funcRandX(), funcRandY(), funcRandZ()));
+    ]).map(([name, arrFuncRand]) => {
+        const arrIsCanBeZero = shuffle(random([
+            [coinFlip(), false, false],
+            [coinFlip(), coinFlip(), false],
+        ]));
+        const [nodeX, nodeY, nodeZ] = zip(arrIsCanBeZero, arrFuncRand).map(([isCanBeZero, funcRand]) => funcRand(isCanBeZero));
+        return new SpaceVector(name, nodeX, nodeY, nodeZ);
+    });
+    const vecU = vec1;
+    const vecV = (() => {
+        const isVec2EqualsVec1 = vec2.equals(vec1);
+        if (isVec2EqualsVec1) {
+            const vec1Orth = vec1.getRandomOrthogonalVectorNonZero();
+            return vec2.add(vec1Orth);
+        }
+        else {
+            return vec2;
+        }
+    })();
     const A = new SpacePoint("A", randint(-5, 6).toTree(), randint(-5, 6).toTree(), randint(-5, 6).toTree());
     const [B, C] = [
         ["B", vecU],

package/lib/exercises/math/spaceGeometry/scalarProduct/index.d.ts

@@ -1,5 +1,6 @@
 export * from "./scalarProductFromCubeOuterPoints.js";
 export * from "./scalarProductFromSpacePointCoords.js";
+export * from "./angleFromScalarProductFromSpacePointCoords.js";
 export * from "./checkIsOrthogonalSpaceVecsFromCoords.js";
 export * from "./checkIsSpaceVecOrthogonalToPlaneFromCoords.js";
 export * from "./checkIsOrthogonalLinesFromParametricReps.js";

package/lib/exercises/math/spaceGeometry/scalarProduct/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/scalarProduct/index.ts"],"names":[],"mappings":"AAAA,cAAc,uCAAuC,CAAC;AACtD,cAAc,wCAAwC,CAAC;AAEvD,cAAc,2CAA2C,CAAC;AAC1D,cAAc,iDAAiD,CAAC;AAChE,cAAc,+CAA+C,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/scalarProduct/index.ts"],"names":[],"mappings":"AAAA,cAAc,uCAAuC,CAAC;AACtD,cAAc,wCAAwC,CAAC;AACvD,cAAc,iDAAiD,CAAC;AAChE,cAAc,2CAA2C,CAAC;AAC1D,cAAc,iDAAiD,CAAC;AAChE,cAAc,+CAA+C,CAAC"}

package/lib/exercises/math/spaceGeometry/scalarProduct/index.js

@@ -1,6 +1,6 @@
 export * from "./scalarProductFromCubeOuterPoints.js";
 export * from "./scalarProductFromSpacePointCoords.js";
-// export * from "./angleFromScalarProductFromSpacePointCoords.js";
+export * from "./angleFromScalarProductFromSpacePointCoords.js";
 export * from "./checkIsOrthogonalSpaceVecsFromCoords.js";
 export * from "./checkIsSpaceVecOrthogonalToPlaneFromCoords.js";
 export * from "./checkIsOrthogonalLinesFromParametricReps.js";

package/lib/exercises/math/spaceGeometry/vectors/findLinearDecompositionWrtCoplanarUVFromCoords.js

@@ -69,8 +69,8 @@ $$
 \\overrightarrow{w} = a \\overrightarrow{u} + b \\overrightarrow{v}
 $$
 
-Cela donne un système de $2$ équations: une pour chaque composante du vecteur \\overrightarrow{w}.
-Résout ce système, autrement dit détermine $a$ et $b$.
+Cela donne un système de $2$ équations: une pour chaque composante du vecteur $\\overrightarrow{w}$.
+Résous ce système, autrement dit détermine $a$ et $b$.
 
 Les coordonnées de $\\overrightarrow{w}$ dans la base $(\\overrightarrow{u};\\overrightarrow{v})$.`;
 };

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

@@ -1 +1 @@
-{"version":3,"file":"equationCosOnRandomInterval.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/trigonometry/functions/equationCosOnRandomInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAmBrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,mBAAmB,EAAE,MAAM,CAAC;CAC7B,CAAC;AAkIF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAc7D,CAAC"}
+{"version":3,"file":"equationCosOnRandomInterval.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/trigonometry/functions/equationCosOnRandomInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAsBrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,mBAAmB,EAAE,MAAM,CAAC;CAC7B,CAAC;AA+OF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAe7D,CAAC"}

package/lib/exercises/math/trigonometry/functions/equationCosOnRandomInterval.js

@@ -6,7 +6,7 @@ import { EquationSolutionNode } from "../../../../tree/nodes/equations/equationS
 import { CosNode } from "../../../../tree/nodes/functions/cosNode.js";
 import { PiNode } from "../../../../tree/nodes/numbers/piNode.js";
 import { AddNode } from "../../../../tree/nodes/operators/addNode.js";
-import { MultiplyNode } from "../../../../tree/nodes/operators/multiplyNode.js";
+import { multiply, MultiplyNode, } from "../../../../tree/nodes/operators/multiplyNode.js";
 import { ClosureType } from "../../../../tree/nodes/sets/closure.js";
 import { DiscreteSetNode } from "../../../../tree/nodes/sets/discreteSetNode.js";
 import { IntervalNode } from "../../../../tree/nodes/sets/intervalNode.js";
@@ -16,7 +16,10 @@ const getPropositions = (n, { answer, degree, leftBoundPiMultiple }) => {
     addValidProp(propositions, answer);
     //distracteur avec une solution manquante
     if (degree !== 0 && degree !== 180) {
-        const answerNode = getAnswerNode({ degree, leftBoundPiMultiple });
+        const answerNode = getAnswerStuff({
+            degree,
+            leftBoundPiMultiple,
+        }).nodeEquationSolution;
         const newSet = answerNode.solutionsSet.toDeleteRandomElement();
         tryToAddWrongProp(propositions, new EquationSolutionNode(newSet).toTex());
     }
@@ -27,7 +30,7 @@ const getPropositions = (n, { answer, degree, leftBoundPiMultiple }) => {
     });
     return shuffleProps(propositions, n);
 };
-const getAnswerNode = (identifiers) => {
+const getAnswerStuff = (identifiers) => {
     const coeff = identifiers.leftBoundPiMultiple;
     /**
      * Si l'intervalle est centré autour d'un multiple de 2pi (coeff impair) (genre ]3pi, 5pi]) on ajoute (coeff+1)/2 tours
@@ -38,20 +41,82 @@ const getAnswerNode = (identifiers) => {
         .find((v) => v.degree === identifiers.degree)
         .cos.evaluate({});
     const values = (Math.abs(coeff % 2) === 1 ? mainTrigoValues : trigoValuesOnZeroTwoPIOF).filter((v) => v.cos.evaluate({}) === cos);
-    if (values.length === 1) {
-        const value = values[0];
-        const newValue = new AddNode(value.angle, new MultiplyNode((turnsToAdd * 2).toTree(), PiNode)).simplify();
-        return new EquationSolutionNode(new DiscreteSetNode([newValue]));
-    }
-    else {
-        const newValues = values.map((v) => {
-            return new AddNode(v.angle, new MultiplyNode((turnsToAdd * 2).toTree(), PiNode)).simplify();
-        });
-        return new EquationSolutionNode(new DiscreteSetNode(newValues.sort((a, b) => a.evaluate({}) - b.evaluate({}))));
-    }
+    const [nodeEquationSolutionOn02Pi, nodeEquationSolution] = (() => {
+        if (values.length === 1) {
+            const value = values[0];
+            const newValue = new AddNode(value.angle, new MultiplyNode((turnsToAdd * 2).toTree(), PiNode)).simplify();
+            return [
+                new EquationSolutionNode(new DiscreteSetNode([value.angle])),
+                new EquationSolutionNode(new DiscreteSetNode([newValue])),
+            ];
+        }
+        else {
+            const newValues = values.map((v) => {
+                return new AddNode(v.angle, new MultiplyNode((turnsToAdd * 2).toTree(), PiNode)).simplify();
+            });
+            return [
+                new EquationSolutionNode(new DiscreteSetNode(values.map((value) => value.angle))),
+                new EquationSolutionNode(new DiscreteSetNode(newValues.sort((a, b) => a.evaluate({}) - b.evaluate({})))),
+            ];
+        }
+    })();
+    return {
+        nodeEquationSolutionOn02Pi,
+        nodeEquationSolution,
+        turnsToAdd,
+    };
 };
 const getAnswer = (identifiers) => {
-    return getAnswerNode(identifiers).toTex();
+    return getAnswerStuff(identifiers).nodeEquationSolution.toTex();
+};
+const getHint = (identifiers) => {
+    const { leftBoundPiMultiple } = identifiers;
+    const interval02Pi = new IntervalNode(multiply(0, PiNode).simplify(), multiply(2, PiNode).simplify(), ClosureType.OF);
+    const intervalMinusPiPi = new IntervalNode(multiply(-1, PiNode).simplify(), multiply(+1, PiNode).simplify(), ClosureType.OF);
+    const intervalEasier = leftBoundPiMultiple % 2 === 0 ? interval02Pi : intervalMinusPiPi;
+    return `Commence par résoudre l'équation sur $${intervalEasier.toTex()}$.
+
+Ensuite, puisque la fonction $\\cos$ est $${multiply(2, PiNode).toTex()}$-périodique, ajoute ou ôte $${multiply(2, PiNode).toTex()}$ à tes solutions autant de fois que nécessaire jusqu'à être dans l'intervalle de l'énoncé.`;
+};
+const getCorrection = (identifiers) => {
+    const { degree, leftBoundPiMultiple } = identifiers;
+    const value = mainPositiveTrigovalues.find((v) => v.degree === degree);
+    const offsetFactor2Pi = Math.ceil(leftBoundPiMultiple / 2);
+    const interval02Pi = new IntervalNode(multiply(0, PiNode).simplify(), multiply(2, PiNode).simplify(), ClosureType.OF);
+    const intervalMinusPiPi = new IntervalNode(multiply(-1, PiNode).simplify(), multiply(+1, PiNode).simplify(), ClosureType.OF);
+    const intervalEasier = leftBoundPiMultiple % 2 === 0 ? interval02Pi : intervalMinusPiPi;
+    const leftBound = new MultiplyNode(leftBoundPiMultiple.toTree(), PiNode).simplify();
+    const rightBound = new MultiplyNode((leftBoundPiMultiple + 2).toTree(), PiNode).simplify();
+    const interval = new IntervalNode(leftBound, rightBound, ClosureType.OF);
+    const { nodeEquationSolutionOn02Pi, nodeEquationSolution } = getAnswerStuff(identifiers);
+    return `Sur l'intervalle $${intervalEasier.toTex()}$, la solution de 
+  
+$$
+${new CosNode("x".toTree()).toTex()}=${value.cos.toTex()}
+$$
+
+est : 
+
+$$
+${nodeEquationSolutionOn02Pi.toTex()}
+$$
+
+${(() => {
+        if (intervalEasier.toTex() !== interval.toTex()) {
+            return `Pour avoir la solution sur l'intervalle $${interval.toTex()}$, on ajoute $${offsetFactor2Pi.frenchify()}$ fois $${multiply(2, PiNode).toTex()}$.
+
+La solution est donc : 
+
+$$
+${nodeEquationSolution.toTex()}
+$$
+
+`;
+        }
+        else {
+            return ``;
+        }
+    })()}`;
 };
 const getInstruction = ({ degree, leftBoundPiMultiple, }) => {
     const value = mainPositiveTrigovalues.find((v) => v.degree === degree);
@@ -64,17 +129,14 @@ $$
 ${new CosNode("x".toTree()).toTex()}=${value.cos.toTex()}
 $$`;
 };
-// const getHint: GetHint<Identifiers> = (identifiers) => {
-//   return "";
-// };
-// const getCorrection: GetCorrection<Identifiers> = (identifiers) => {
-//   return "";
-// };
 const getKeys = () => {
     return ["x", "S", "equal", "lbrace", "semicolon", "rbrace", "pi"];
 };
 const isAnswerValid = (ans, { degree, leftBoundPiMultiple }) => {
-    const answerNode = getAnswerNode({ degree, leftBoundPiMultiple });
+    const answerNode = getAnswerStuff({
+        degree,
+        leftBoundPiMultiple,
+    }).nodeEquationSolution;
     return answerNode.toAllValidTexs().includes(ans);
 };
 const getEquationCosOnRandomIntervalQuestion = () => {
@@ -91,8 +153,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: getKeys(identifiers),
         answerFormat: "tex",
         identifiers,
-        // hint: getHint(identifiers),
-        // correction: getCorrection(identifiers),
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -108,4 +170,5 @@ export const equationCosOnRandomInterval = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/pc/mathExosInPC.d.ts

@@ -18,7 +18,7 @@ export * from "../math/functions/affines/affineExpressionReading.js";
 export * from "../math/geometry/thales/thales.js";
 export * from "../math/geometry/thales/thalesCalcul.js";
 export * from "../math/equaDiff/equaDiffCheckSolutionFirstOrder.js";
-export * from "../math/equaDiff/equaDiffGeneralForme.js";
+export * from "../math/equaDiff/exponentialDifferentialEquation.js";
 export * from "../math/equaDiff/exponentialDifferentialEquationWithIC.js";
 export * from "../math/derivation/tangent/derivativeNumberReading.js";
 export * from "../math/derivation/derivative/polynomial/usualderivative.js";

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

@@ -1 +1 @@
-{"version":3,"file":"mathExosInPC.d.ts","sourceRoot":"","sources":["../../../src/exercises/pc/mathExosInPC.ts"],"names":[],"mappings":"AAAA,yBAAyB;AACzB,cAAc,mCAAmC,CAAC;AAClD,cAAc,wDAAwD,CAAC;AACvE,OAAO,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AACvE,cAAc,uCAAuC,CAAC;AACtD,cAAc,gDAAgD,CAAC;AAC/D,OAAO,EAAE,qBAAqB,EAAE,MAAM,sDAAsD,CAAC;AAC7F,OAAO,EAAE,mBAAmB,EAAE,MAAM,iDAAiD,CAAC;AACtF,OAAO,EAAE,kBAAkB,EAAE,MAAM,iDAAiD,CAAC;AACrF,cAAc,sDAAsD,CAAC;AACrE,cAAc,sDAAsD,CAAC;AACrE,cAAc,sDAAsD,CAAC;AACrE,cAAc,sDAAsD,CAAC;AACrE,cAAc,kEAAkE,CAAC;AACjF,cAAc,+DAA+D,CAAC;AAC9E,cAAc,gDAAgD,CAAC;AAC/D,cAAc,sDAAsD,CAAC;AACrE,cAAc,mCAAmC,CAAC;AAClD,cAAc,yCAAyC,CAAC;AACxD,cAAc,qDAAqD,CAAC;AACpE,cAAc,0CAA0C,CAAC;AACzD,cAAc,2DAA2D,CAAC;AAC1E,cAAc,uDAAuD,CAAC;AACtE,cAAc,6DAA6D,CAAC;AAC5E,OAAO,EAAE,qBAAqB,EAAE,MAAM,mEAAmE,CAAC;AAC1G,OAAO,EAAE,qBAAqB,EAAE,MAAM,mEAAmE,CAAC;AAC1G,OAAO,EAAE,sBAAsB,EAAE,MAAM,oEAAoE,CAAC;AAC5G,cAAc,yDAAyD,CAAC;AACxE,cAAc,0DAA0D,CAAC"}
+{"version":3,"file":"mathExosInPC.d.ts","sourceRoot":"","sources":["../../../src/exercises/pc/mathExosInPC.ts"],"names":[],"mappings":"AAAA,yBAAyB;AACzB,cAAc,mCAAmC,CAAC;AAClD,cAAc,wDAAwD,CAAC;AACvE,OAAO,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AACvE,cAAc,uCAAuC,CAAC;AACtD,cAAc,gDAAgD,CAAC;AAC/D,OAAO,EAAE,qBAAqB,EAAE,MAAM,sDAAsD,CAAC;AAC7F,OAAO,EAAE,mBAAmB,EAAE,MAAM,iDAAiD,CAAC;AACtF,OAAO,EAAE,kBAAkB,EAAE,MAAM,iDAAiD,CAAC;AACrF,cAAc,sDAAsD,CAAC;AACrE,cAAc,sDAAsD,CAAC;AACrE,cAAc,sDAAsD,CAAC;AACrE,cAAc,sDAAsD,CAAC;AACrE,cAAc,kEAAkE,CAAC;AACjF,cAAc,+DAA+D,CAAC;AAC9E,cAAc,gDAAgD,CAAC;AAC/D,cAAc,sDAAsD,CAAC;AACrE,cAAc,mCAAmC,CAAC;AAClD,cAAc,yCAAyC,CAAC;AACxD,cAAc,qDAAqD,CAAC;AACpE,cAAc,qDAAqD,CAAC;AACpE,cAAc,2DAA2D,CAAC;AAC1E,cAAc,uDAAuD,CAAC;AACtE,cAAc,6DAA6D,CAAC;AAC5E,OAAO,EAAE,qBAAqB,EAAE,MAAM,mEAAmE,CAAC;AAC1G,OAAO,EAAE,qBAAqB,EAAE,MAAM,mEAAmE,CAAC;AAC1G,OAAO,EAAE,sBAAsB,EAAE,MAAM,oEAAoE,CAAC;AAC5G,cAAc,yDAAyD,CAAC;AACxE,cAAc,0DAA0D,CAAC"}

package/lib/exercises/pc/mathExosInPC.js

@@ -18,7 +18,7 @@ export * from "../math/functions/affines/affineExpressionReading.js";
 export * from "../math/geometry/thales/thales.js";
 export * from "../math/geometry/thales/thalesCalcul.js";
 export * from "../math/equaDiff/equaDiffCheckSolutionFirstOrder.js";
-export * from "../math/equaDiff/equaDiffGeneralForme.js";
+export * from "../math/equaDiff/exponentialDifferentialEquation.js";
 export * from "../math/equaDiff/exponentialDifferentialEquationWithIC.js";
 export * from "../math/derivation/tangent/derivativeNumberReading.js";
 export * from "../math/derivation/derivative/polynomial/usualderivative.js";

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

@@ -1 +1 @@
-{"version":3,"file":"polynomialVEA.d.ts","sourceRoot":"","sources":["../../../src/exercises/vea/polynomialVEA.ts"],"names":[],"mappings":"AAMA,eAAO,MAAM,aAAa,GAAI,KAAK,MAAM,EAAE,QAAQ,MAAM,YAmBxD,CAAC"}
+{"version":3,"file":"polynomialVEA.d.ts","sourceRoot":"","sources":["../../../src/exercises/vea/polynomialVEA.ts"],"names":[],"mappings":"AAOA,eAAO,MAAM,aAAa,GAAI,KAAK,MAAM,EAAE,QAAQ,MAAM,YAuBxD,CAAC"}

package/lib/exercises/vea/polynomialVEA.js

@@ -1,11 +1,15 @@
 import { getArrNodeCoeffOfPolynomialNode } from "../../math/utils/polynomial/polynomialUtils.js";
 import { substract } from "../../tree/nodes/operators/substractNode.js";
+import { isIDontKnowNode } from "../../tree/nodes/student/iDontKnowNode.js";
 import { parseAlgebraic } from "../../tree/parsers/latexParser.js";
 import { zip } from "../../utils/arrays/arrayZip.js";
 import { handleVEAError } from "../../utils/errors/handleVEAError.js";
 export const polynomialVEA = (ans, answer) => {
     try {
         const nodeAns = parseAlgebraic(ans);
+        if (isIDontKnowNode(nodeAns)) {
+            return false;
+        }
         const nodeAnswer = parseAlgebraic(answer);
         const [arrNodeCoeffAns, arrNodeCoeffAnswer] = [nodeAns, nodeAnswer].map((node) => getArrNodeCoeffOfPolynomialNode(node));
         return (arrNodeCoeffAns.length === arrNodeCoeffAnswer.length &&