math-exercises 2.1.11 → 2.1.12
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/lib/exercises/exercise.d.ts +3 -0
- package/lib/exercises/exercise.d.ts.map +1 -1
- package/lib/exercises/math/functions/affines/affineAdjustment.js +2 -2
- package/lib/exercises/math/functions/affines/affineAdjustmentComplete.js +8 -8
- package/lib/exercises/math/functions/affines/affineAdjustmentRsquared.js +2 -2
- package/lib/exercises/math/functions/trinoms/extremumTypeFromAlgebricForm.d.ts.map +1 -1
- package/lib/exercises/math/functions/trinoms/extremumTypeFromAlgebricForm.js +3 -2
- package/lib/exercises/math/geometry/convexity/convexityQuadrinomialsGeo.d.ts.map +1 -1
- package/lib/exercises/math/geometry/convexity/convexityQuadrinomialsGeo.js +3 -9
- package/lib/exercises/math/geometry/convexity/convexityTrinomialsGeo.d.ts.map +1 -1
- package/lib/exercises/math/geometry/convexity/convexityTrinomialsGeo.js +3 -1
- package/lib/exercises/math/probaStat/stats1var/median.js +2 -2
- package/lib/exercises/math/probaStat/stats1var/quartiles.js +2 -2
- package/lib/exercises/math/probaStat/stats2var/averagePoint.js +2 -2
- package/lib/exercises/math/probaStat/stats2var/fineAdjustementExercise.js +1 -1
- package/package.json +1 -1
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"exercise.d.ts","sourceRoot":"","sources":["../../src/exercises/exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAI3C,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,iBAAiB,UACrB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAUtB,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,WAAW,EAAE,KAAK,MAAM,kBAE3D,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAElC,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC;CACvB,CAAC;AACF,MAAM,WAAW,QAAQ,CAAC,YAAY,GAAG,EAAE;IACzC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,CAAC,EAAE;QACR,YAAY,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC;QACxC,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,UAAU,CAAC,EAAE,OAAO,CAAC;QACrB,YAAY,CAAC,EAAE,OAAO,CAAC;QACvB,gBAAgB,CAAC,EAAE,OAAO,CAAC;QAC3B,cAAc,CAAC,EAAE,OAAO,CAAC;KAC1B,CAAC;IACF,cAAc,CAAC,EAAE,UAAU,GAAG,QAAQ,CAAC;IACvC,WAAW,EAAE,YAAY,CAAC;CAC3B;AAED,MAAM,MAAM,YAAY,CAAC,YAAY,IAAI,CACvC,CAAC,EAAE,MAAM,EACT,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,WAAW,EAAE,CAAC;AACnB,MAAM,MAAM,GAAG,CAAC,YAAY,IAAI,CAC9B,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,OAAO,CAAC;AACb,MAAM,MAAM,iBAAiB,CAAC,YAAY,GAAG,EAAE,EAAE,QAAQ,GAAG,EAAE,IAAI,CAChE,IAAI,CAAC,EAAE,QAAQ,KACZ,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC5B,MAAM,WAAW,QAAQ,CAAC,YAAY,GAAG,EAAE;IACzC,EAAE,EAAE,MAAM,CAAC;IACX,YAAY,EAAE,OAAO,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,CAAC,WAAW,GAAG,SAAS,CAAC,EAAE,CAAC;IACtC,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,SAAS,CAAC,EAAE,GAAG,GAAG,OAAO,GAAG,UAAU,CAAC;IACvC,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;IACnD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,YAAY,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,YAAY,CAAC,CAAC;IAClE,aAAa,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;IAClC,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,OAAO,EAAE,eAAe,GAAG,QAAQ,GAAG,UAAU,CAAC;CAClD;AAED,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,UAAU,GACV,SAAS,GACT,UAAU,GACV,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,cAAc,GACd,iBAAiB,GACjB,SAAS,GACT,8BAA8B,GAC9B,aAAa,GACb,YAAY,GACZ,SAAS,GACT,0BAA0B,GAC1B,WAAW,GACX,2BAA2B,GAC3B,eAAe,GACf,eAAe,GACf,kBAAkB,GAClB,WAAW,GACX,mBAAmB,GACnB,wBAAwB,GACxB,WAAW,GACX,uBAAuB,GACvB,uBAAuB,GACvB,aAAa,GACb,aAAa,GACb,SAAS,GACT,qBAAqB,GACrB,oBAAoB,GACpB,UAAU,GACV,mBAAmB,GACnB,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,kBAAkB,GAClB,QAAQ,GACR,YAAY,GACZ,QAAQ,GACR,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,UAAU,GACV,uBAAuB,GACvB,oBAAoB,GACpB,eAAe,GACf,gBAAgB,GAChB,UAAU,CAAC;AAEf,MAAM,MAAM,SAAS,GACjB,mBAAmB,GACnB,sBAAsB,GACtB,QAAQ,GACR,kBAAkB,GAClB,WAAW,GACX,SAAS,GACT,cAAc,GACd,+CAA+C,GAC/C,OAAO,GACP,KAAK,GACL,wBAAwB,GACxB,SAAS,GACT,KAAK,GACL,aAAa,CAAC"}
|
|
1
|
+
{"version":3,"file":"exercise.d.ts","sourceRoot":"","sources":["../../src/exercises/exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAI3C,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,iBAAiB,UACrB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAUtB,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,WAAW,EAAE,KAAK,MAAM,kBAE3D,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAElC,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC;CACvB,CAAC;AACF,MAAM,WAAW,QAAQ,CAAC,YAAY,GAAG,EAAE;IACzC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,CAAC,EAAE;QACR,YAAY,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC;QACxC,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,UAAU,CAAC,EAAE,OAAO,CAAC;QACrB,YAAY,CAAC,EAAE,OAAO,CAAC;QACvB,gBAAgB,CAAC,EAAE,OAAO,CAAC;QAC3B,cAAc,CAAC,EAAE,OAAO,CAAC;KAC1B,CAAC;IACF,KAAK,CAAC,EAAE;QACN,gBAAgB,CAAC,EAAE,OAAO,CAAC;KAC5B,CAAC;IACF,cAAc,CAAC,EAAE,UAAU,GAAG,QAAQ,CAAC;IACvC,WAAW,EAAE,YAAY,CAAC;CAC3B;AAED,MAAM,MAAM,YAAY,CAAC,YAAY,IAAI,CACvC,CAAC,EAAE,MAAM,EACT,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,WAAW,EAAE,CAAC;AACnB,MAAM,MAAM,GAAG,CAAC,YAAY,IAAI,CAC9B,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,OAAO,CAAC;AACb,MAAM,MAAM,iBAAiB,CAAC,YAAY,GAAG,EAAE,EAAE,QAAQ,GAAG,EAAE,IAAI,CAChE,IAAI,CAAC,EAAE,QAAQ,KACZ,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC5B,MAAM,WAAW,QAAQ,CAAC,YAAY,GAAG,EAAE;IACzC,EAAE,EAAE,MAAM,CAAC;IACX,YAAY,EAAE,OAAO,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,CAAC,WAAW,GAAG,SAAS,CAAC,EAAE,CAAC;IACtC,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,SAAS,CAAC,EAAE,GAAG,GAAG,OAAO,GAAG,UAAU,CAAC;IACvC,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;IACnD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,YAAY,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,YAAY,CAAC,CAAC;IAClE,aAAa,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;IAClC,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,OAAO,EAAE,eAAe,GAAG,QAAQ,GAAG,UAAU,CAAC;CAClD;AAED,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,UAAU,GACV,SAAS,GACT,UAAU,GACV,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,cAAc,GACd,iBAAiB,GACjB,SAAS,GACT,8BAA8B,GAC9B,aAAa,GACb,YAAY,GACZ,SAAS,GACT,0BAA0B,GAC1B,WAAW,GACX,2BAA2B,GAC3B,eAAe,GACf,eAAe,GACf,kBAAkB,GAClB,WAAW,GACX,mBAAmB,GACnB,wBAAwB,GACxB,WAAW,GACX,uBAAuB,GACvB,uBAAuB,GACvB,aAAa,GACb,aAAa,GACb,SAAS,GACT,qBAAqB,GACrB,oBAAoB,GACpB,UAAU,GACV,mBAAmB,GACnB,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,kBAAkB,GAClB,QAAQ,GACR,YAAY,GACZ,QAAQ,GACR,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,UAAU,GACV,uBAAuB,GACvB,oBAAoB,GACpB,eAAe,GACf,gBAAgB,GAChB,UAAU,CAAC;AAEf,MAAM,MAAM,SAAS,GACjB,mBAAmB,GACnB,sBAAsB,GACtB,QAAQ,GACR,kBAAkB,GAClB,WAAW,GACX,SAAS,GACT,cAAc,GACd,+CAA+C,GAC/C,OAAO,GACP,KAAK,GACL,wBAAwB,GACxB,SAAS,GACT,KAAK,GACL,aAAa,CAAC"}
|
|
@@ -42,9 +42,8 @@ const getAffineAdjustmentQuestion = () => {
|
|
|
42
42
|
const bfixed = (0, round_1.round)(b, 2);
|
|
43
43
|
const answer = new equalNode_1.EqualNode(new variableNode_1.VariableNode("y"), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(afixed), new variableNode_1.VariableNode("x")), new numberNode_1.NumberNode(bfixed)).simplify({ forbidFactorize: true })).toTex();
|
|
44
44
|
let dataTable = `
|
|
45
|
-
| | | | | | | | | | | |
|
|
46
|
-
|-|-|-|-|-|-|-|-|-|-|-|
|
|
47
45
|
| $x$ | ${xValues.join(" | ")} |
|
|
46
|
+
|-|-|-|-|-|-|-|-|-|-|-|
|
|
48
47
|
| $y$ | ${yValues.map((n) => n.frenchify()).join(" | ")} |
|
|
49
48
|
`;
|
|
50
49
|
const question = {
|
|
@@ -54,6 +53,7 @@ const getAffineAdjustmentQuestion = () => {
|
|
|
54
53
|
keys: ["equal", "y", "x", "a", "b"],
|
|
55
54
|
answerFormat: "tex",
|
|
56
55
|
identifiers: { G1x, G2x, G1y, G2y },
|
|
56
|
+
style: { tableHasNoHeader: true },
|
|
57
57
|
};
|
|
58
58
|
return question;
|
|
59
59
|
};
|
|
@@ -59,18 +59,18 @@ const getAffineAdjustmentCompleteQuestion = () => {
|
|
|
59
59
|
const answerEq = new equalNode_1.EqualNode(new variableNode_1.VariableNode("y"), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(afixed), new variableNode_1.VariableNode("x")), new numberNode_1.NumberNode(bfixed)).simplify({ forbidFactorize: true })).toTex();
|
|
60
60
|
const answerR = new equalNode_1.EqualNode(new powerNode_1.PowerNode(new variableNode_1.VariableNode("R"), new numberNode_1.NumberNode(2)), (0, round_1.round)(rSquared, 2).toTree()).toTex();
|
|
61
61
|
let dataTable = `
|
|
62
|
-
| | | | | | | | | | | |
|
|
63
|
-
|-|-|-|-|-|-|-|-|-|-|-|
|
|
64
62
|
| $x$ | ${xValues.join(" | ")} |
|
|
63
|
+
|-|-|-|-|-|-|-|-|-|-|-|
|
|
65
64
|
| $y$ | ${yValues.map((n) => n.frenchify()).join(" | ")} |
|
|
66
65
|
`;
|
|
67
66
|
const question = {
|
|
68
|
-
answer: `${answerEq}\\
|
|
67
|
+
answer: `${answerEq}\\newline ${answerR}`,
|
|
69
68
|
instruction: `On considère la série statistique ci-dessous. A l'aide de la calculatrice, déterminer l'équation de la droite d'ajustement et la valeur du coefficient de détermination. Arrondir au centième. ${dataTable}
|
|
70
69
|
`,
|
|
71
70
|
keys: [],
|
|
72
71
|
answerFormat: "tex",
|
|
73
72
|
identifiers: { G1x, G2x, G1y, G2y, rSquared },
|
|
73
|
+
style: { tableHasNoHeader: true },
|
|
74
74
|
};
|
|
75
75
|
return question;
|
|
76
76
|
};
|
|
@@ -88,10 +88,10 @@ const getPropositions = (n, { answer, G1x, G2x, G1y, G2y, rSquared }) => {
|
|
|
88
88
|
const wrongAnswerEq2 = new equalNode_1.EqualNode(new variableNode_1.VariableNode("y"), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, round_1.round)(awrong, 2)), new variableNode_1.VariableNode("x")), new numberNode_1.NumberNode(bfixed)).simplify({ forbidFactorize: true })).toTex();
|
|
89
89
|
const wrongAnswerR1 = new equalNode_1.EqualNode(new variableNode_1.VariableNode("R"), (0, round_1.round)(rSquared, 2).toTree()).toTex();
|
|
90
90
|
const wrongAnswerR2 = new equalNode_1.EqualNode(new powerNode_1.PowerNode(new variableNode_1.VariableNode("R"), new numberNode_1.NumberNode(2)), (-(0, round_1.round)(rSquared, 2)).toTree()).toTex();
|
|
91
|
-
const wrongAnswer1 = `${answerEq}\\
|
|
92
|
-
const wrongAnswer2 = `${answerEq}\\
|
|
93
|
-
const wrongAnswer3 = `${wrongAnswerEq1}\\
|
|
94
|
-
const wrongAnswer4 = `${wrongAnswerEq2}\\
|
|
91
|
+
const wrongAnswer1 = `${answerEq}\\newline ${wrongAnswerR1}`;
|
|
92
|
+
const wrongAnswer2 = `${answerEq}\\newline ${wrongAnswerR2}`;
|
|
93
|
+
const wrongAnswer3 = `${wrongAnswerEq1}\\newline ${answerR}`;
|
|
94
|
+
const wrongAnswer4 = `${wrongAnswerEq2}\\newline ${answerR}`;
|
|
95
95
|
(0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer1);
|
|
96
96
|
(0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer2);
|
|
97
97
|
(0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer3);
|
|
@@ -101,7 +101,7 @@ const getPropositions = (n, { answer, G1x, G2x, G1y, G2y, rSquared }) => {
|
|
|
101
101
|
const b = (0, randint_1.randint)(-10, 10);
|
|
102
102
|
const wrongAnswerEq = new equalNode_1.EqualNode(new variableNode_1.VariableNode("y"), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new variableNode_1.VariableNode("x")), new numberNode_1.NumberNode(b)).simplify({ forbidFactorize: true })).toTex();
|
|
103
103
|
const wrongAnswerR = new equalNode_1.EqualNode(new powerNode_1.PowerNode(new variableNode_1.VariableNode("R"), new numberNode_1.NumberNode(2)), (0, round_1.round)(Math.random(), 2).toTree()).toTex();
|
|
104
|
-
const wrongAnswer = `${wrongAnswerEq}\\
|
|
104
|
+
const wrongAnswer = `${wrongAnswerEq}\\newline ${wrongAnswerR}`;
|
|
105
105
|
(0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
|
|
106
106
|
}
|
|
107
107
|
return (0, exercise_1.shuffleProps)(propositions, n);
|
|
@@ -47,9 +47,8 @@ const getAffineAdjustmentRsquaredQuestion = () => {
|
|
|
47
47
|
const rSquared = calculateRSquared(xValues, yValues);
|
|
48
48
|
const answer = new equalNode_1.EqualNode(new powerNode_1.PowerNode(new variableNode_1.VariableNode("R"), new numberNode_1.NumberNode(2)), (0, round_1.round)(rSquared, 2).toTree()).toTex();
|
|
49
49
|
let dataTable = `
|
|
50
|
-
| | | | | | | | | | | |
|
|
51
|
-
|-|-|-|-|-|-|-|-|-|-|-|
|
|
52
50
|
| $x$ | ${xValues.join(" | ")} |
|
|
51
|
+
|-|-|-|-|-|-|-|-|-|-|-|
|
|
53
52
|
| $y$ | ${yValues.map((n) => n.frenchify()).join(" | ")} |
|
|
54
53
|
`;
|
|
55
54
|
const question = {
|
|
@@ -59,6 +58,7 @@ const getAffineAdjustmentRsquaredQuestion = () => {
|
|
|
59
58
|
keys: ["R", "equal"],
|
|
60
59
|
answerFormat: "tex",
|
|
61
60
|
identifiers: { rSquared },
|
|
61
|
+
style: { tableHasNoHeader: true },
|
|
62
62
|
};
|
|
63
63
|
return question;
|
|
64
64
|
};
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"extremumTypeFromAlgebricForm.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/trinoms/extremumTypeFromAlgebricForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;
|
|
1
|
+
{"version":3,"file":"extremumTypeFromAlgebricForm.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/trinoms/extremumTypeFromAlgebricForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAkCF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAc9D,CAAC"}
|
|
@@ -25,9 +25,10 @@ const getPropositions = (n, { answer, a }) => {
|
|
|
25
25
|
const propositions = [];
|
|
26
26
|
(0, exercise_1.addValidProp)(propositions, answer, "raw");
|
|
27
27
|
(0, exercise_1.tryToAddWrongProp)(propositions, a < 0 ? "Un minimum" : "Un maximum", "raw");
|
|
28
|
-
(0,
|
|
28
|
+
(0, shuffle_1.shuffle)(propositions);
|
|
29
29
|
(0, exercise_1.addWrongProp)(propositions, "On ne peut pas savoir", "raw");
|
|
30
|
-
|
|
30
|
+
(0, exercise_1.addWrongProp)(propositions, "Ni l'un ni l'autre", "raw");
|
|
31
|
+
return propositions;
|
|
31
32
|
};
|
|
32
33
|
exports.extremumTypeFromAlgebricForm = {
|
|
33
34
|
id: "extremumTypeFromAlgebricForm",
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"convexityQuadrinomialsGeo.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/convexity/convexityQuadrinomialsGeo.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAoBlC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;CACxB,CAAC;
|
|
1
|
+
{"version":3,"file":"convexityQuadrinomialsGeo.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/convexity/convexityQuadrinomialsGeo.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAoBlC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;CACxB,CAAC;AA0LF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAc3D,CAAC"}
|
|
@@ -9,8 +9,6 @@ const polynomial_1 = require("../../../../math/polynomials/polynomial");
|
|
|
9
9
|
const randint_1 = require("../../../../math/utils/random/randint");
|
|
10
10
|
const infiniteNode_1 = require("../../../../tree/nodes/numbers/infiniteNode");
|
|
11
11
|
const numberNode_1 = require("../../../../tree/nodes/numbers/numberNode");
|
|
12
|
-
const fractionNode_1 = require("../../../../tree/nodes/operators/fractionNode");
|
|
13
|
-
const multiplyNode_1 = require("../../../../tree/nodes/operators/multiplyNode");
|
|
14
12
|
const closure_1 = require("../../../../tree/nodes/sets/closure");
|
|
15
13
|
const intervalNode_1 = require("../../../../tree/nodes/sets/intervalNode");
|
|
16
14
|
const coinFlip_1 = require("../../../../utils/coinFlip");
|
|
@@ -84,15 +82,11 @@ const getConvexityQuadrinomialsGeoQuestion = () => {
|
|
|
84
82
|
};
|
|
85
83
|
return question;
|
|
86
84
|
};
|
|
87
|
-
const getPropositions = (n, { answer,
|
|
85
|
+
const getPropositions = (n, { answer, inflexionPoint }) => {
|
|
88
86
|
const propositions = [];
|
|
89
87
|
(0, exercise_1.addValidProp)(propositions, answer, "tex");
|
|
90
|
-
const
|
|
91
|
-
const
|
|
92
|
-
const seconddcoeffs = secondderivative.coefficients;
|
|
93
|
-
const inflexionPoint = new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(seconddcoeffs[0].toTree(), new numberNode_1.NumberNode(-1)), seconddcoeffs[1].toTree()).simplify();
|
|
94
|
-
const wrongInterval1 = new intervalNode_1.IntervalNode(inflexionPoint, infiniteNode_1.PlusInfinityNode, closure_1.ClosureType.OO).toTex();
|
|
95
|
-
const wrongInterval2 = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, inflexionPoint, closure_1.ClosureType.OO).toTex();
|
|
88
|
+
const wrongInterval1 = new intervalNode_1.IntervalNode(inflexionPoint.toTree(), infiniteNode_1.PlusInfinityNode, closure_1.ClosureType.OO).toTex();
|
|
89
|
+
const wrongInterval2 = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, inflexionPoint.toTree(), closure_1.ClosureType.OO).toTex();
|
|
96
90
|
const wrongInterval3 = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, infiniteNode_1.PlusInfinityNode, closure_1.ClosureType.OO).toTex();
|
|
97
91
|
const wrongInterval4 = new intervalNode_1.IntervalNode(new numberNode_1.NumberNode((0, randint_1.randint)(-1, 2)), infiniteNode_1.PlusInfinityNode, closure_1.ClosureType.FO).toTex();
|
|
98
92
|
(0, exercise_1.tryToAddWrongProp)(propositions, wrongInterval1);
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"convexityTrinomialsGeo.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/convexity/convexityTrinomialsGeo.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;
|
|
1
|
+
{"version":3,"file":"convexityTrinomialsGeo.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/convexity/convexityTrinomialsGeo.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAkDF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAexD,CAAC"}
|
|
@@ -6,6 +6,7 @@ const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQ
|
|
|
6
6
|
const colors_1 = require("../../../../geogebra/colors");
|
|
7
7
|
const geogebraConstructor_1 = require("../../../../geogebra/geogebraConstructor");
|
|
8
8
|
const trinom_1 = require("../../../../math/polynomials/trinom");
|
|
9
|
+
const shuffle_1 = require("../../../../utils/shuffle");
|
|
9
10
|
const getConvexityTrinomialsGeoQuestion = () => {
|
|
10
11
|
const trinom = trinom_1.TrinomConstructor.random();
|
|
11
12
|
const instruction = `Ci-dessous est tracée la courbe représentative $\\mathcal C_f$ d'une fonction $f$. Sur $\\mathbb{R}$, la fonction $f$ est :`;
|
|
@@ -37,9 +38,10 @@ const getPropositions = (n, { answer }) => {
|
|
|
37
38
|
(0, exercise_1.addValidProp)(propositions, answer, "raw");
|
|
38
39
|
(0, exercise_1.tryToAddWrongProp)(propositions, "Concave", "raw");
|
|
39
40
|
(0, exercise_1.tryToAddWrongProp)(propositions, "Convexe", "raw");
|
|
41
|
+
(0, shuffle_1.shuffle)(propositions);
|
|
40
42
|
(0, exercise_1.tryToAddWrongProp)(propositions, "Ni l'un ni l'autre", "raw");
|
|
41
43
|
(0, exercise_1.tryToAddWrongProp)(propositions, "On ne peut pas savoir", "raw");
|
|
42
|
-
return
|
|
44
|
+
return propositions;
|
|
43
45
|
};
|
|
44
46
|
const isAnswerValid = (ans, { answer }) => {
|
|
45
47
|
return ans === answer;
|
|
@@ -32,9 +32,8 @@ const getMedianWithTable = () => {
|
|
|
32
32
|
const question = {
|
|
33
33
|
instruction: `On considère le tableau d'effectifs suivant :
|
|
34
34
|
|
|
35
|
-
| | | | | | |
|
|
36
|
-
|-|-|-|-|-|-|
|
|
37
35
|
|Valeur|${randomValues[0]}|${randomValues[1]}|${randomValues[2]}|${randomValues[3]}|${randomValues[4]}|
|
|
36
|
+
|-|-|-|-|-|-|
|
|
38
37
|
|Effectif|${randomEffectives[0]}|${randomEffectives[1]}|${randomEffectives[2]}|${randomEffectives[3]}|${randomEffectives[4]}|
|
|
39
38
|
|
|
40
39
|
Calculer la médiane de cette série de valeurs.`,
|
|
@@ -42,6 +41,7 @@ Calculer la médiane de cette série de valeurs.`,
|
|
|
42
41
|
keys: [],
|
|
43
42
|
answerFormat: "tex",
|
|
44
43
|
identifiers: { randomValues },
|
|
44
|
+
style: { tableHasNoHeader: true },
|
|
45
45
|
};
|
|
46
46
|
return question;
|
|
47
47
|
};
|
|
@@ -45,9 +45,8 @@ const getQuartiles = () => {
|
|
|
45
45
|
const question = {
|
|
46
46
|
instruction: `On considère le tableau d'effectifs suivant :
|
|
47
47
|
|
|
48
|
-
| | | | | | |
|
|
49
|
-
|-|-|-|-|-|-|
|
|
50
48
|
|Valeur|${randomValues[0]}|${randomValues[1]}|${randomValues[2]}|${randomValues[3]}|${randomValues[4]}|
|
|
49
|
+
|-|-|-|-|-|-|
|
|
51
50
|
|Effectif|${randomEffectives[0]}|${randomEffectives[1]}|${randomEffectives[2]}|${randomEffectives[3]}|${randomEffectives[4]}|
|
|
52
51
|
|
|
53
52
|
Calculer le ${quartileToString} de cette série de valeurs.`,
|
|
@@ -55,6 +54,7 @@ Calculer le ${quartileToString} de cette série de valeurs.`,
|
|
|
55
54
|
keys: [],
|
|
56
55
|
answerFormat: "tex",
|
|
57
56
|
identifiers: { randomValues, randomEffectives, randomQuartile },
|
|
57
|
+
style: { tableHasNoHeader: true },
|
|
58
58
|
};
|
|
59
59
|
return question;
|
|
60
60
|
};
|
|
@@ -14,9 +14,8 @@ const getAveragePointQuestion = () => {
|
|
|
14
14
|
const points = (0, randTupleInt_1.distinctRandTupleInt)(4, 2, { from: -9, to: 10 });
|
|
15
15
|
const sortedPoints = points.sort((a, b) => a[0] - b[0]);
|
|
16
16
|
const tab = `
|
|
17
|
-
| | | | | |
|
|
18
|
-
|-|-|-|-|-|
|
|
19
17
|
|x|${sortedPoints[0][0]}|${sortedPoints[1][0]}|${sortedPoints[2][0]}|${sortedPoints[3][0]}|
|
|
18
|
+
|-|-|-|-|-|
|
|
20
19
|
|y|${sortedPoints[0][1]}|${sortedPoints[1][1]}|${sortedPoints[2][1]}|${sortedPoints[3][1]}|
|
|
21
20
|
`;
|
|
22
21
|
const instruction = `On considère la liste de points suivante : ${tab}
|
|
@@ -35,6 +34,7 @@ const getAveragePointQuestion = () => {
|
|
|
35
34
|
xValues: sortedPoints.map((el) => el[0]),
|
|
36
35
|
yValues: sortedPoints.map((el) => el[1]),
|
|
37
36
|
},
|
|
37
|
+
style: { tableHasNoHeader: true },
|
|
38
38
|
};
|
|
39
39
|
return question;
|
|
40
40
|
};
|
|
@@ -33,7 +33,7 @@ const getFineAdjustementExerciseQuestion = () => {
|
|
|
33
33
|
const yMax = Math.max(...yValues);
|
|
34
34
|
const question = {
|
|
35
35
|
answer: exercise.correctAnswer,
|
|
36
|
-
instruction: `On considère le nuage de points ci-dessous.
|
|
36
|
+
instruction: `On considère le nuage de points ci-dessous. Un ajustement affine semble-t-il justifié ? Quelle peut être la valeur du coefficient de détermination ?`,
|
|
37
37
|
commands: ggb.commands,
|
|
38
38
|
options: ggb.getOptions(),
|
|
39
39
|
coords: ggb.getAdaptedCoords({ xMin, xMax, yMin, yMax }),
|