math-exercises 2.2.56 → 2.2.57

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.
Files changed (160) hide show
  1. package/lib/exercises/math/functions/trinoms/coefficientsIdentification.d.ts +11 -0
  2. package/lib/exercises/math/functions/trinoms/coefficientsIdentification.d.ts.map +1 -0
  3. package/lib/exercises/math/functions/trinoms/coefficientsIdentification.js +131 -0
  4. package/lib/exercises/math/functions/trinoms/index.d.ts +1 -0
  5. package/lib/exercises/math/functions/trinoms/index.d.ts.map +1 -1
  6. package/lib/exercises/math/functions/trinoms/index.js +1 -0
  7. package/lib/exercises/math/functions/trinoms/summitAbscissFromDevForm.d.ts.map +1 -1
  8. package/lib/exercises/math/functions/trinoms/summitAbscissFromDevForm.js +39 -1
  9. package/lib/exercises/math/geometry/areas/rightTriangleArea.js +2 -2
  10. package/lib/exercises/math/geometry/areas/triangleArea.js +2 -2
  11. package/lib/exercises/math/geometry/euclidianConstructions/buildTriangleWithSizes.d.ts +7 -0
  12. package/lib/exercises/math/geometry/euclidianConstructions/buildTriangleWithSizes.d.ts.map +1 -0
  13. package/lib/exercises/math/geometry/euclidianConstructions/buildTriangleWithSizes.js +117 -0
  14. package/lib/exercises/math/geometry/euclidianConstructions/index.d.ts +2 -0
  15. package/lib/exercises/math/geometry/euclidianConstructions/index.d.ts.map +1 -1
  16. package/lib/exercises/math/geometry/euclidianConstructions/index.js +2 -0
  17. package/lib/exercises/math/geometry/euclidianConstructions/pointImageFromTranslation.d.ts +10 -0
  18. package/lib/exercises/math/geometry/euclidianConstructions/pointImageFromTranslation.d.ts.map +1 -0
  19. package/lib/exercises/math/geometry/euclidianConstructions/pointImageFromTranslation.js +102 -0
  20. package/lib/exercises/math/geometry/pythagore/pythagore.d.ts +2 -0
  21. package/lib/exercises/math/geometry/pythagore/pythagore.d.ts.map +1 -1
  22. package/lib/exercises/math/geometry/pythagore/pythagore.js +4 -3
  23. package/lib/exercises/math/geometry/pythagore/pythagoreCalcul.d.ts +2 -0
  24. package/lib/exercises/math/geometry/pythagore/pythagoreCalcul.d.ts.map +1 -1
  25. package/lib/exercises/math/geometry/pythagore/pythagoreCalcul.js +4 -3
  26. package/lib/exercises/math/geometry/thales/index.d.ts.map +1 -1
  27. package/lib/exercises/math/geometry/thales/index.js +1 -0
  28. package/lib/exercises/math/geometry/thales/thales.d.ts +7 -0
  29. package/lib/exercises/math/geometry/thales/thales.d.ts.map +1 -1
  30. package/lib/exercises/math/geometry/thales/thales.js +1 -1
  31. package/lib/exercises/math/geometry/thales/thalesCalcul.d.ts +11 -5
  32. package/lib/exercises/math/geometry/thales/thalesCalcul.d.ts.map +1 -1
  33. package/lib/exercises/math/geometry/thales/thalesCalcul.js +166 -118
  34. package/lib/exercises/math/geometry/thales/thalesCalculOld.d.ts +1 -0
  35. package/lib/exercises/math/geometry/thales/thalesCalculOld.d.ts.map +1 -0
  36. package/lib/exercises/math/geometry/thales/thalesCalculOld.js +214 -0
  37. package/lib/exercises/math/probaStat/binomial/binomialInequation.d.ts +16 -0
  38. package/lib/exercises/math/probaStat/binomial/binomialInequation.d.ts.map +1 -0
  39. package/lib/exercises/math/probaStat/binomial/binomialInequation.js +159 -0
  40. package/lib/exercises/math/probaStat/binomial/calculateProbaOfBinomialDistribution.d.ts +13 -0
  41. package/lib/exercises/math/probaStat/binomial/calculateProbaOfBinomialDistribution.d.ts.map +1 -0
  42. package/lib/exercises/math/probaStat/binomial/calculateProbaOfBinomialDistribution.js +106 -0
  43. package/lib/exercises/math/probaStat/binomial/expectedValueOfBinomialProba.d.ts +9 -0
  44. package/lib/exercises/math/probaStat/binomial/expectedValueOfBinomialProba.d.ts.map +1 -0
  45. package/lib/exercises/math/probaStat/binomial/expectedValueOfBinomialProba.js +89 -0
  46. package/lib/exercises/math/probaStat/binomial/index.d.ts +5 -0
  47. package/lib/exercises/math/probaStat/binomial/index.d.ts.map +1 -0
  48. package/lib/exercises/math/probaStat/binomial/index.js +20 -0
  49. package/lib/exercises/math/probaStat/binomial/varianceOfBinomialProba.d.ts +9 -0
  50. package/lib/exercises/math/probaStat/binomial/varianceOfBinomialProba.d.ts.map +1 -0
  51. package/lib/exercises/math/probaStat/binomial/varianceOfBinomialProba.js +94 -0
  52. package/lib/exercises/math/probaStat/cardBasicProbas.d.ts +3 -0
  53. package/lib/exercises/math/probaStat/cardBasicProbas.d.ts.map +1 -1
  54. package/lib/exercises/math/probaStat/cardBasicProbas.js +3 -2
  55. package/lib/exercises/math/probaStat/diceBasicProbas.d.ts +1 -0
  56. package/lib/exercises/math/probaStat/diceBasicProbas.d.ts.map +1 -1
  57. package/lib/exercises/math/probaStat/diceBasicProbas.js +8 -4
  58. package/lib/exercises/math/probaStat/index.d.ts +1 -3
  59. package/lib/exercises/math/probaStat/index.d.ts.map +1 -1
  60. package/lib/exercises/math/probaStat/index.js +1 -3
  61. package/lib/exercises/math/probaStat/issuesCountingForCards.d.ts +2 -0
  62. package/lib/exercises/math/probaStat/issuesCountingForCards.d.ts.map +1 -1
  63. package/lib/exercises/math/probaStat/issuesCountingForCards.js +1 -1
  64. package/lib/exercises/math/probaStat/stats2var/fineAdjustementExercise.d.ts +2 -0
  65. package/lib/exercises/math/probaStat/stats2var/fineAdjustementExercise.d.ts.map +1 -1
  66. package/lib/exercises/math/probaStat/stats2var/fineAdjustementExercise.js +4 -1
  67. package/lib/exercises/math/trigonometry/associatePoint.d.ts +3 -0
  68. package/lib/exercises/math/trigonometry/associatePoint.d.ts.map +1 -1
  69. package/lib/exercises/math/trigonometry/associatePoint.js +5 -1
  70. package/lib/exercises/math/trigonometry/trigonometry.js +2 -2
  71. package/lib/exercises/math/trigonometry/trigonometryAngleCalcul.js +2 -2
  72. package/lib/exercises/math/trigonometry/trigonometrySideCalcul.js +2 -2
  73. package/lib/exercises/pc/calibrationCurveOfSolution.d.ts +1 -0
  74. package/lib/exercises/pc/calibrationCurveOfSolution.d.ts.map +1 -1
  75. package/lib/exercises/pc/calibrationCurveOfSolution.js +2 -0
  76. package/lib/exercises/pc/chemicalReactions/stoichiometricReaction.d.ts +6 -1
  77. package/lib/exercises/pc/chemicalReactions/stoichiometricReaction.d.ts.map +1 -1
  78. package/lib/exercises/pc/chemicalReactions/stoichiometricReaction.js +1 -1
  79. package/lib/exercises/pc/electricity/ohmicConductorOrGenerator.d.ts +4 -1
  80. package/lib/exercises/pc/electricity/ohmicConductorOrGenerator.d.ts.map +1 -1
  81. package/lib/exercises/pc/electricity/ohmicConductorOrGenerator.js +2 -1
  82. package/lib/exercises/pc/identifyAtomicMassOrAtomicNb.d.ts +2 -0
  83. package/lib/exercises/pc/identifyAtomicMassOrAtomicNb.d.ts.map +1 -1
  84. package/lib/exercises/pc/identifyAtomicMassOrAtomicNb.js +2 -0
  85. package/lib/exercises/pc/mole/molarMass.js +1 -1
  86. package/lib/exercises/pc/motion/typeOfAcceleration.d.ts +4 -1
  87. package/lib/exercises/pc/motion/typeOfAcceleration.d.ts.map +1 -1
  88. package/lib/exercises/pc/motion/typeOfAcceleration.js +5 -1
  89. package/lib/exercises/pc/motion/typeOfMovement.d.ts +4 -1
  90. package/lib/exercises/pc/motion/typeOfMovement.d.ts.map +1 -1
  91. package/lib/exercises/pc/motion/typeOfMovement.js +1 -1
  92. package/lib/exercises/pc/recognizeRefractionOrReflectionAngles.d.ts +3 -1
  93. package/lib/exercises/pc/recognizeRefractionOrReflectionAngles.d.ts.map +1 -1
  94. package/lib/exercises/pc/recognizeRefractionOrReflectionAngles.js +1 -1
  95. package/lib/exercises/utils/geogebra/toGGBCommandsProps.d.ts +3 -0
  96. package/lib/exercises/utils/geogebra/toGGBCommandsProps.d.ts.map +1 -1
  97. package/lib/exercises/utils/geogebra/toolBarConstructor.d.ts +4 -0
  98. package/lib/exercises/utils/geogebra/toolBarConstructor.d.ts.map +1 -1
  99. package/lib/exercises/utils/geogebra/toolBarConstructor.js +8 -0
  100. package/lib/exercises/utils/getDistinctQuestions.d.ts.map +1 -1
  101. package/lib/exercises/utils/getDistinctQuestions.js +11 -4
  102. package/lib/index.d.ts +88 -22
  103. package/lib/index.d.ts.map +1 -1
  104. package/lib/math/geometry/CloudPoints.d.ts +5 -1
  105. package/lib/math/geometry/CloudPoints.d.ts.map +1 -1
  106. package/lib/math/geometry/CloudPoints.js +5 -0
  107. package/lib/math/geometry/line.d.ts +23 -1
  108. package/lib/math/geometry/line.d.ts.map +1 -1
  109. package/lib/math/geometry/line.js +53 -2
  110. package/lib/math/geometry/point.d.ts +15 -13
  111. package/lib/math/geometry/point.d.ts.map +1 -1
  112. package/lib/math/geometry/point.js +28 -12
  113. package/lib/math/geometry/segment.d.ts +11 -1
  114. package/lib/math/geometry/segment.d.ts.map +1 -1
  115. package/lib/math/geometry/segment.js +12 -0
  116. package/lib/math/geometry/triangle.d.ts +67 -0
  117. package/lib/math/geometry/triangle.d.ts.map +1 -0
  118. package/lib/math/geometry/triangle.js +227 -0
  119. package/lib/math/numbers/rationals/rational.d.ts +1 -0
  120. package/lib/math/numbers/rationals/rational.d.ts.map +1 -1
  121. package/lib/math/numbers/rationals/rational.js +5 -0
  122. package/lib/math/polynomials/generalTrinom.d.ts +2 -2
  123. package/lib/math/polynomials/generalTrinom.d.ts.map +1 -1
  124. package/lib/math/probability/binomial.d.ts +10 -0
  125. package/lib/math/probability/binomial.d.ts.map +1 -0
  126. package/lib/math/probability/binomial.js +30 -0
  127. package/lib/math/sets/intervals/intervals.d.ts +1 -1
  128. package/lib/math/systems/generalSystem.d.ts +11 -0
  129. package/lib/math/systems/generalSystem.d.ts.map +1 -0
  130. package/lib/math/systems/generalSystem.js +79 -0
  131. package/lib/playground.d.ts.map +1 -1
  132. package/lib/playground.js +1 -4
  133. package/lib/server.js +0 -2
  134. package/lib/tree/nodes/geometry/pointNode.d.ts +1 -10
  135. package/lib/tree/nodes/geometry/pointNode.d.ts.map +1 -1
  136. package/lib/tree/nodes/inequations/inequationNode.js +1 -1
  137. package/lib/tree/nodes/inequations/inequationSolutionNode.d.ts +2 -11
  138. package/lib/tree/nodes/inequations/inequationSolutionNode.d.ts.map +1 -1
  139. package/lib/tree/nodes/node.d.ts +2 -1
  140. package/lib/tree/nodes/node.d.ts.map +1 -1
  141. package/lib/tree/nodes/node.js +1 -0
  142. package/lib/tree/nodes/nodeConstructor.d.ts +4 -3
  143. package/lib/tree/nodes/nodeConstructor.d.ts.map +1 -1
  144. package/lib/tree/nodes/nodeConstructor.js +4 -0
  145. package/lib/tree/nodes/operators/addNode.d.ts.map +1 -1
  146. package/lib/tree/nodes/operators/addNode.js +20 -8
  147. package/lib/tree/nodes/operators/binomialCoefficientNode.d.ts +35 -0
  148. package/lib/tree/nodes/operators/binomialCoefficientNode.d.ts.map +1 -0
  149. package/lib/tree/nodes/operators/binomialCoefficientNode.js +52 -0
  150. package/lib/tree/nodes/operators/fractionNode.d.ts +1 -1
  151. package/lib/tree/nodes/operators/fractionNode.d.ts.map +1 -1
  152. package/lib/tree/nodes/operators/fractionNode.js +2 -2
  153. package/lib/tree/nodes/operators/operatorNode.d.ts +2 -1
  154. package/lib/tree/nodes/operators/operatorNode.d.ts.map +1 -1
  155. package/lib/tree/nodes/operators/operatorNode.js +1 -0
  156. package/lib/tree/nodes/sets/intervalNode.d.ts +9 -10
  157. package/lib/tree/nodes/sets/intervalNode.d.ts.map +1 -1
  158. package/lib/tree/nodes/sets/intervalNode.js +1 -0
  159. package/lib/utils/alea/random.d.ts.map +1 -1
  160. package/package.json +1 -1
@@ -0,0 +1,67 @@
1
+ import { Point, PointIdentifiers } from "./point";
2
+ import { SqrtNode } from "../../tree/nodes/functions/sqrtNode";
3
+ import { Segment } from "./segment";
4
+ export type TriangleIdentifiers = {
5
+ vertexA: PointIdentifiers;
6
+ vertexB: PointIdentifiers;
7
+ vertexC: PointIdentifiers;
8
+ };
9
+ export declare abstract class TriangleConstructor {
10
+ static fromIdentifiers(identifiers: TriangleIdentifiers): Triangle;
11
+ static createRandomRightTriangle({ minRapport, maxRapport, names, }: {
12
+ minRapport?: number | undefined;
13
+ maxRapport?: number | undefined;
14
+ names?: string[] | undefined;
15
+ }): Triangle;
16
+ static createRandomTriangle({ minAngle, maxAngle, names, }: {
17
+ minAngle?: number | undefined;
18
+ maxAngle?: number | undefined;
19
+ names?: string[] | undefined;
20
+ }): Triangle;
21
+ static randomName(): string[];
22
+ }
23
+ type GenerateCommandsProps = {
24
+ highlightedAngle?: string;
25
+ colorHighlightedAngle?: string;
26
+ highlightedSide?: string;
27
+ colorHighlightedSide?: string;
28
+ showLabels?: string[];
29
+ setCaptions?: string[];
30
+ showAxes?: boolean;
31
+ showGrid?: boolean;
32
+ };
33
+ export declare class Triangle {
34
+ vertexA: Point;
35
+ vertexB: Point;
36
+ vertexC: Point;
37
+ constructor(vertexA: Point, vertexB: Point, vertexC: Point);
38
+ getSegments(): Segment[];
39
+ getSideASegment(): Segment;
40
+ getSideBSegment(): Segment;
41
+ getSideCSegment(): Segment;
42
+ toIdentifiers(): TriangleIdentifiers;
43
+ getSideAnumber(): number;
44
+ getSideBnumber(): number;
45
+ getSideCnumber(): number;
46
+ getTriangleName(): string;
47
+ getSideAnode(): SqrtNode;
48
+ getSideBnode(): SqrtNode;
49
+ getSideCnode(): SqrtNode;
50
+ getAngleA(): number;
51
+ getAngleB(): number;
52
+ getAngleC(): number;
53
+ getPerimeter(): number;
54
+ getArea(): number;
55
+ isRight(): Boolean;
56
+ isEquilateral(): Boolean;
57
+ isIsosceles(): Boolean;
58
+ isScalene(): boolean;
59
+ getRightAngle(): string;
60
+ generateCommands({ highlightedAngle: highlightedAngle, colorHighlightedAngle: colorHighlightedAngle, showLabels: showLabels, setCaptions: setCaptions, highlightedSide: highlightedSide, colorHighlightedSide: colorHighlightedSide, }: GenerateCommandsProps): string[];
61
+ generateCoords(): number[];
62
+ getSideAName(): string;
63
+ getSideBName(): string;
64
+ getSideCName(): string;
65
+ }
66
+ export {};
67
+ //# sourceMappingURL=triangle.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"triangle.d.ts","sourceRoot":"","sources":["../../../src/math/geometry/triangle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAoB,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAKpE,OAAO,EAAE,QAAQ,EAAE,MAAM,qCAAqC,CAAC;AAI/D,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,MAAM,MAAM,mBAAmB,GAAG;IAChC,OAAO,EAAE,gBAAgB,CAAC;IAC1B,OAAO,EAAE,gBAAgB,CAAC;IAC1B,OAAO,EAAE,gBAAgB,CAAC;CAC3B,CAAC;AACF,8BAAsB,mBAAmB;IACvC,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,mBAAmB,GAAG,QAAQ;IAOlE,MAAM,CAAC,yBAAyB,CAAC,EAC/B,UAAc,EACd,UAAc,EACd,KAAuB,GACxB;;;;KAAA,GAAG,QAAQ;IAkBZ,MAAM,CAAC,oBAAoB,CAAC,EAC1B,QAAe,EACf,QAAc,EACd,KAAuB,GACxB;;;;KAAA,GAAG,QAAQ;IA+BZ,MAAM,CAAC,UAAU;CAQlB;AAED,KAAK,qBAAqB,GAAG;IAC3B,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;IACvB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB,CAAC;AAEF,qBAAa,QAAQ;IACnB,OAAO,EAAE,KAAK,CAAC;IACf,OAAO,EAAE,KAAK,CAAC;IACf,OAAO,EAAE,KAAK,CAAC;gBAEH,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK;IAK1D,WAAW;IAOX,eAAe;IAGf,eAAe;IAGf,eAAe;IAGf,aAAa,IAAI,mBAAmB;IAQpC,cAAc,IAAI,MAAM;IAOxB,cAAc,IAAI,MAAM;IAOxB,cAAc,IAAI,MAAM;IAIxB,eAAe,IAAI,MAAM;IAIzB,YAAY;IAeZ,YAAY;IAeZ,YAAY;IAeZ,SAAS,IAAI,MAAM;IASnB,SAAS,IAAI,MAAM;IASnB,SAAS,IAAI,MAAM;IASnB,YAAY,IAAI,MAAM;IAMtB,OAAO,IAAI,MAAM;IAUjB,OAAO,IAAI,OAAO;IAOlB,aAAa,IAAI,OAAO;IAOxB,WAAW,IAAI,OAAO;IAQtB,SAAS,IAAI,OAAO;IAQpB,aAAa,IAAI,MAAM;IAOvB,gBAAgB,CAAC,EACf,gBAAgB,EAAE,gBAAgB,EAClC,qBAAqB,EAAE,qBAAqB,EAC5C,UAAU,EAAE,UAAU,EACtB,WAAW,EAAE,WAAW,EACxB,eAAe,EAAE,eAAe,EAChC,oBAAoB,EAAE,oBAAoB,GAC3C,EAAE,qBAAqB,GAAG,MAAM,EAAE;IAoEnC,cAAc,IAAI,MAAM,EAAE;IAyB1B,YAAY,IAAI,MAAM;IAItB,YAAY,IAAI,MAAM;IAItB,YAAY,IAAI,MAAM;CAGvB"}
@@ -0,0 +1,227 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.Triangle = exports.TriangleConstructor = void 0;
4
+ const point_1 = require("./point");
5
+ const substractNode_1 = require("../../tree/nodes/operators/substractNode");
6
+ const powerNode_1 = require("../../tree/nodes/operators/powerNode");
7
+ const addNode_1 = require("../../tree/nodes/operators/addNode");
8
+ const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
9
+ const sqrtNode_1 = require("../../tree/nodes/functions/sqrtNode");
10
+ const randint_1 = require("../utils/random/randint");
11
+ const randomLetter_1 = require("../../utils/strings/randomLetter");
12
+ const segment_1 = require("./segment");
13
+ class TriangleConstructor {
14
+ static fromIdentifiers(identifiers) {
15
+ return new Triangle(point_1.PointConstructor.fromIdentifiers(identifiers.vertexA), point_1.PointConstructor.fromIdentifiers(identifiers.vertexB), point_1.PointConstructor.fromIdentifiers(identifiers.vertexC));
16
+ }
17
+ static createRandomRightTriangle({ minRapport = 0, maxRapport = 5, names = ["A", "B", "C"], }) {
18
+ let pointA, pointB, pointC, d1, d2;
19
+ do {
20
+ const xA = (0, randint_1.randint)(-10, 11);
21
+ const yA = (0, randint_1.randint)(-10, 11);
22
+ const xB = (0, randint_1.randint)(-10, 11);
23
+ const yB = (0, randint_1.randint)(-10, 11);
24
+ pointA = new point_1.Point(names[0], new numberNode_1.NumberNode(xA), new numberNode_1.NumberNode(yA));
25
+ pointB = new point_1.Point(names[1], new numberNode_1.NumberNode(xB), new numberNode_1.NumberNode(yB));
26
+ d1 = pointA.distanceTo(pointB);
27
+ const xC = (0, randint_1.randint)(-11, 10);
28
+ const yC = yA - ((xB - xA) * (xC - xA)) / (yB - yA);
29
+ pointC = new point_1.Point(names[2], new numberNode_1.NumberNode(xC), new numberNode_1.NumberNode(yC));
30
+ d2 = pointA.distanceTo(pointC);
31
+ } while (!d1 || !d2 || d1 / d2 < minRapport || d1 / d2 > maxRapport);
32
+ return new Triangle(pointA, pointB, pointC);
33
+ }
34
+ static createRandomTriangle({ minAngle = 0.69, maxAngle = 1.5, names = ["A", "B", "C"], }) {
35
+ let pointA, pointB, pointC, triangle;
36
+ do {
37
+ pointA = new point_1.Point(names[0], new numberNode_1.NumberNode((0, randint_1.randint)(-10, 11)), new numberNode_1.NumberNode((0, randint_1.randint)(-10, 11)));
38
+ pointB = new point_1.Point(names[1], new numberNode_1.NumberNode((0, randint_1.randint)(-10, 11)), new numberNode_1.NumberNode((0, randint_1.randint)(-10, 11)));
39
+ pointC = new point_1.Point(names[2], new numberNode_1.NumberNode((0, randint_1.randint)(-10, 11)), new numberNode_1.NumberNode((0, randint_1.randint)(-10, 11)));
40
+ triangle = new Triangle(pointA, pointB, pointC);
41
+ } while (triangle.isRight() ||
42
+ pointA.distanceTo(pointB) === 0 ||
43
+ pointB.distanceTo(pointC) === 0 ||
44
+ pointC.distanceTo(pointA) === 0 ||
45
+ triangle.getAngleA() < minAngle ||
46
+ triangle.getAngleA() > maxAngle ||
47
+ triangle.getAngleB() < minAngle ||
48
+ triangle.getAngleB() > maxAngle);
49
+ return new Triangle(pointA, pointB, pointC);
50
+ }
51
+ static randomName() {
52
+ const startVertix = (0, randomLetter_1.randomLetter)(true, ["Y", "Z"]);
53
+ return [
54
+ startVertix,
55
+ String.fromCharCode(startVertix.charCodeAt(0) + 1),
56
+ String.fromCharCode(startVertix.charCodeAt(0) + 2),
57
+ ];
58
+ }
59
+ }
60
+ exports.TriangleConstructor = TriangleConstructor;
61
+ class Triangle {
62
+ constructor(vertexA, vertexB, vertexC) {
63
+ this.vertexA = vertexA;
64
+ this.vertexB = vertexB;
65
+ this.vertexC = vertexC;
66
+ }
67
+ getSegments() {
68
+ return [
69
+ this.getSideASegment(),
70
+ this.getSideBSegment(),
71
+ this.getSideCSegment(),
72
+ ];
73
+ }
74
+ getSideASegment() {
75
+ return new segment_1.Segment(this.vertexB, this.vertexC);
76
+ }
77
+ getSideBSegment() {
78
+ return new segment_1.Segment(this.vertexA, this.vertexC);
79
+ }
80
+ getSideCSegment() {
81
+ return new segment_1.Segment(this.vertexA, this.vertexB);
82
+ }
83
+ toIdentifiers() {
84
+ return {
85
+ vertexA: this.vertexA.toIdentifiers(),
86
+ vertexB: this.vertexB.toIdentifiers(),
87
+ vertexC: this.vertexC.toIdentifiers(),
88
+ };
89
+ }
90
+ getSideAnumber() {
91
+ return Math.hypot(this.vertexC.getXnumber() - this.vertexB.getXnumber(), this.vertexC.getYnumber() - this.vertexB.getYnumber());
92
+ }
93
+ getSideBnumber() {
94
+ return Math.hypot(this.vertexA.getXnumber() - this.vertexC.getXnumber(), this.vertexA.getYnumber() - this.vertexC.getYnumber());
95
+ }
96
+ getSideCnumber() {
97
+ return this.vertexA.distanceTo(this.vertexB);
98
+ }
99
+ getTriangleName() {
100
+ return this.vertexA.name + this.vertexB.name + this.vertexC.name;
101
+ }
102
+ getSideAnode() {
103
+ return new sqrtNode_1.SqrtNode(new addNode_1.AddNode(new powerNode_1.PowerNode(new substractNode_1.SubstractNode(this.vertexC.x, this.vertexB.x), new numberNode_1.NumberNode(2)), new powerNode_1.PowerNode(new substractNode_1.SubstractNode(this.vertexC.y, this.vertexB.y), new numberNode_1.NumberNode(2))));
104
+ }
105
+ getSideBnode() {
106
+ return new sqrtNode_1.SqrtNode(new addNode_1.AddNode(new powerNode_1.PowerNode(new substractNode_1.SubstractNode(this.vertexC.x, this.vertexA.x), new numberNode_1.NumberNode(2)), new powerNode_1.PowerNode(new substractNode_1.SubstractNode(this.vertexC.y, this.vertexA.y), new numberNode_1.NumberNode(2))));
107
+ }
108
+ getSideCnode() {
109
+ return new sqrtNode_1.SqrtNode(new addNode_1.AddNode(new powerNode_1.PowerNode(new substractNode_1.SubstractNode(this.vertexA.x, this.vertexB.x), new numberNode_1.NumberNode(2)), new powerNode_1.PowerNode(new substractNode_1.SubstractNode(this.vertexC.y, this.vertexB.y), new numberNode_1.NumberNode(2))));
110
+ }
111
+ getAngleA() {
112
+ return Math.acos((this.getSideBnumber() ** 2 +
113
+ this.getSideCnumber() ** 2 -
114
+ this.getSideAnumber() ** 2) /
115
+ (2 * this.getSideBnumber() * this.getSideCnumber()));
116
+ }
117
+ getAngleB() {
118
+ return Math.acos((this.getSideAnumber() ** 2 +
119
+ this.getSideCnumber() ** 2 -
120
+ this.getSideBnumber() ** 2) /
121
+ (2 * this.getSideAnumber() * this.getSideCnumber()));
122
+ }
123
+ getAngleC() {
124
+ return Math.acos((this.getSideAnumber() ** 2 +
125
+ this.getSideBnumber() ** 2 -
126
+ this.getSideCnumber() ** 2) /
127
+ (2 * this.getSideAnumber() * this.getSideBnumber()));
128
+ }
129
+ getPerimeter() {
130
+ return (this.getSideAnumber() + this.getSideBnumber() + this.getSideCnumber());
131
+ }
132
+ getArea() {
133
+ const s = this.getPerimeter() / 2;
134
+ return Math.sqrt(s *
135
+ (s - this.getSideAnumber()) *
136
+ (s - this.getSideBnumber()) *
137
+ (s - this.getSideCnumber()));
138
+ }
139
+ isRight() {
140
+ if (Math.abs(Math.cos(this.getAngleA())) < 0.001)
141
+ return true;
142
+ if (Math.abs(Math.cos(this.getAngleB())) < 0.001)
143
+ return true;
144
+ if (Math.abs(Math.cos(this.getAngleC())) < 0.001)
145
+ return true;
146
+ return false;
147
+ }
148
+ isEquilateral() {
149
+ return (this.getSideAnumber() === this.getSideBnumber() &&
150
+ this.getSideAnumber() === this.getSideCnumber());
151
+ }
152
+ isIsosceles() {
153
+ return (this.getSideAnumber() === this.getSideBnumber() ||
154
+ this.getSideAnumber() === this.getSideCnumber() ||
155
+ this.getSideBnumber() === this.getSideCnumber());
156
+ }
157
+ isScalene() {
158
+ return (this.getSideAnumber() !== this.getSideBnumber() &&
159
+ this.getSideBnumber() !== this.getSideCnumber() &&
160
+ this.getSideCnumber() !== this.getSideAnumber());
161
+ }
162
+ getRightAngle() {
163
+ if (Math.abs(Math.cos(this.getAngleA())) < 0.001)
164
+ return this.vertexA.name;
165
+ if (Math.abs(Math.cos(this.getAngleB())) < 0.001)
166
+ return this.vertexB.name;
167
+ if (Math.abs(Math.cos(this.getAngleC())) < 0.001)
168
+ return this.vertexC.name;
169
+ return "";
170
+ }
171
+ generateCommands({ highlightedAngle: highlightedAngle, colorHighlightedAngle: colorHighlightedAngle, showLabels: showLabels, setCaptions: setCaptions, highlightedSide: highlightedSide, colorHighlightedSide: colorHighlightedSide, }) {
172
+ let commands = [
173
+ `${this.vertexA.name} = Point({${this.vertexA.getXnumber()}, ${this.vertexA.getYnumber()}})`,
174
+ `${this.vertexB.name} = Point({${this.vertexB.getXnumber()}, ${this.vertexB.getYnumber()}})`,
175
+ `${this.vertexC.name} = Point({${this.vertexC.getXnumber()}, ${this.vertexC.getYnumber()}})`,
176
+ `ShowLabel(${this.vertexA.name}, true)`,
177
+ `ShowLabel(${this.vertexB.name}, true)`,
178
+ `ShowLabel(${this.vertexC.name}, true)`,
179
+ `${this.getSideCName()} = Segment(${this.vertexA.name}, ${this.vertexB.name})`,
180
+ `${this.getSideBName()} = Segment(${this.vertexA.name}, ${this.vertexC.name})`,
181
+ `${this.getSideAName()} = Segment(${this.vertexC.name}, ${this.vertexB.name})`,
182
+ `ShowLabel(${this.getSideCName()}, false)`,
183
+ `ShowLabel(${this.getSideBName()}, false)`,
184
+ `ShowLabel(${this.getSideBName()}, false)`,
185
+ ];
186
+ if (this.isRight())
187
+ commands.push(`alpha = Angle(${this.vertexB.name},${this.vertexA.name},${this.vertexC.name}, Line(${this.vertexB.name},${this.vertexA.name}))`, `ShowLabel(alpha, false)`);
188
+ const defautColor = "Red";
189
+ if (highlightedAngle) {
190
+ let temp = [""];
191
+ if (highlightedAngle === this.vertexB.name)
192
+ temp = [this.vertexA.name, this.vertexB.name, this.vertexC.name];
193
+ if (highlightedAngle === this.vertexC.name)
194
+ temp = [this.vertexB.name, this.vertexC.name, this.vertexA.name];
195
+ if (highlightedAngle === this.vertexA.name)
196
+ temp = [this.vertexC.name, this.vertexA.name, this.vertexB.name];
197
+ commands.push(`be = Angle(${temp[0]}, ${temp[1]}, ${temp[2]}, Line(${temp[0]}, ${temp[1]}))`, `ShowLabel(be, false)`, `SetColor(be, "${colorHighlightedAngle ?? defautColor}")`);
198
+ }
199
+ if (showLabels)
200
+ for (let i = 0; i < showLabels.length; i++) {
201
+ commands.push(`ShowLabel(${showLabels[i]}, true)`);
202
+ if (setCaptions)
203
+ commands.push(`SetCaption(${showLabels[i]}, "${setCaptions[i]}")`);
204
+ }
205
+ if (highlightedSide)
206
+ commands.push(`SetColor(${highlightedSide}, "${colorHighlightedSide ?? defautColor}")`);
207
+ return commands;
208
+ }
209
+ generateCoords() {
210
+ return [
211
+ Math.min(this.vertexA.getXnumber(), this.vertexB.getXnumber(), this.vertexC.getXnumber()) - 1,
212
+ Math.max(this.vertexA.getXnumber(), this.vertexB.getXnumber(), this.vertexC.getXnumber()) + 1,
213
+ Math.min(this.vertexA.getYnumber(), this.vertexB.getYnumber(), this.vertexC.getYnumber()) - 1,
214
+ Math.max(this.vertexA.getYnumber(), this.vertexB.getYnumber(), this.vertexC.getYnumber()) + 1,
215
+ ];
216
+ }
217
+ getSideAName() {
218
+ return this.vertexB.name + this.vertexC.name;
219
+ }
220
+ getSideBName() {
221
+ return this.vertexC.name + this.vertexA.name;
222
+ }
223
+ getSideCName() {
224
+ return this.vertexA.name + this.vertexB.name;
225
+ }
226
+ }
227
+ exports.Triangle = Triangle;
@@ -9,6 +9,7 @@ export declare abstract class RationalConstructor {
9
9
  */
10
10
  static randomSimplifiable(maxGcd?: number): Rational;
11
11
  static randomIrreductible(max?: number): Rational;
12
+ static randomIrreductibleProba(maxDenum?: number): Rational | Integer;
12
13
  static randomIrreductibleWithSign(max?: number): Rational;
13
14
  static randomPureRational(): Rational;
14
15
  }
@@ -1 +1 @@
1
- {"version":3,"file":"rational.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/rationals/rational.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AACvE,OAAO,EAAQ,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAE1D,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAKvE,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAE7C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE/C,8BAAsB,mBAAmB;IACvC;;OAEG;IACH,MAAM,CAAC,kBAAkB,CAAC,MAAM,GAAE,MAAW;IAW7C,MAAM,CAAC,kBAAkB,CAAC,GAAG,GAAE,MAAW;IAO1C,MAAM,CAAC,0BAA0B,CAAC,GAAG,GAAE,MAAW;IAQlD,MAAM,CAAC,kBAAkB;CAO1B;AAED,qBAAa,QAAS,YAAW,MAAM;IACrC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,OAAO,CAAC;IACtB,IAAI,EAAE,UAAU,CAAC;gBAEL,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAYlD,MAAM,CAAC,CAAC,EAAE,MAAM;IAGhB,KAAK;IAML,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAkBvB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,OAAO;IAgBxC,OAAO,CAAC,cAAc,EAAE,OAAO,GAAG,MAAM;IAIxC,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgB1B,QAAQ,IAAI,QAAQ;IAIpB,MAAM,CAAC,IAAI,CAAC,EAAE,WAAW;IAgBzB,cAAc;IAId,QAAQ,IAAI,OAAO,GAAG,QAAQ;CAS/B"}
1
+ {"version":3,"file":"rational.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/rationals/rational.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AACvE,OAAO,EAAQ,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAE1D,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAKvE,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAE7C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE/C,8BAAsB,mBAAmB;IACvC;;OAEG;IACH,MAAM,CAAC,kBAAkB,CAAC,MAAM,GAAE,MAAW;IAW7C,MAAM,CAAC,kBAAkB,CAAC,GAAG,GAAE,MAAW;IAO1C,MAAM,CAAC,uBAAuB,CAAC,QAAQ,GAAE,MAAW;IAKpD,MAAM,CAAC,0BAA0B,CAAC,GAAG,GAAE,MAAW;IAQlD,MAAM,CAAC,kBAAkB;CAO1B;AAED,qBAAa,QAAS,YAAW,MAAM;IACrC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,OAAO,CAAC;IACtB,IAAI,EAAE,UAAU,CAAC;gBAEL,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAYlD,MAAM,CAAC,CAAC,EAAE,MAAM;IAGhB,KAAK;IAML,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAkBvB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,OAAO;IAgBxC,OAAO,CAAC,cAAc,EAAE,OAAO,GAAG,MAAM;IAIxC,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgB1B,QAAQ,IAAI,QAAQ;IAIpB,MAAM,CAAC,IAAI,CAAC,EAAE,WAAW;IAgBzB,cAAc;IAId,QAAQ,IAAI,OAAO,GAAG,QAAQ;CAS/B"}
@@ -38,6 +38,11 @@ class RationalConstructor {
38
38
  const [num, denum] = (0, shuffle_1.shuffle)([a, b]);
39
39
  return new Rational(num, denum);
40
40
  }
41
+ static randomIrreductibleProba(maxDenum = 11) {
42
+ const b = (0, randint_1.randint)(2, maxDenum);
43
+ const a = (0, randint_1.randint)(1, b);
44
+ return new Rational(a, b).simplify();
45
+ }
41
46
  static randomIrreductibleWithSign(max = 11) {
42
47
  const sign = (0, coinFlip_1.coinFlip)() ? 1 : -1;
43
48
  const a = (0, randint_1.randint)(2, max);
@@ -32,7 +32,7 @@ export declare abstract class GeneralTrinomConstructor {
32
32
  static randomNiceRoots(nbOfRoots?: number): GeneralTrinom;
33
33
  static fromCoeffs(coeffs: number[]): GeneralTrinom;
34
34
  }
35
- type TrinomOptions = {
35
+ type GeneralTrinomOptions = {
36
36
  variable: string;
37
37
  };
38
38
  export declare class GeneralTrinom {
@@ -41,7 +41,7 @@ export declare class GeneralTrinom {
41
41
  c: AlgebraicNode;
42
42
  variable: string;
43
43
  type: NodeType;
44
- constructor(a: AlgebraicNode | number, b: AlgebraicNode | number, c: AlgebraicNode | number, opts?: TrinomOptions);
44
+ constructor(a: AlgebraicNode | number, b: AlgebraicNode | number, c: AlgebraicNode | number, opts?: GeneralTrinomOptions);
45
45
  getDelta(): AlgebraicNode;
46
46
  getRoots(): AlgebraicNode[];
47
47
  toTree(): AddNode;
@@ -1 +1 @@
1
- {"version":3,"file":"generalTrinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/generalTrinom.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,OAAO,EAAO,MAAM,oCAAoC,CAAC;AA0BlE,OAAO,EAAE,aAAa,EAAmB,MAAM,gCAAgC,CAAC;AAIhF,OAAO,EAGL,QAAQ,EAET,MAAM,uBAAuB,CAAC;AAG/B,8BAAsB,wBAAwB;IAC5C,MAAM,CAAC,MAAM,CACX,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC3D,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC3D,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC1D,aAAa;IAmBhB,MAAM,CAAC,eAAe,CACpB,KAAK,CAAC,EAAE;QACN,GAAG,CAAC,EAAE,MAAM,CAAC;QACb,GAAG,CAAC,EAAE,MAAM,CAAC;QACb,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;QACpB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;KACjB,EACD,SAAS,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC/D,QAAQ,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC7D,aAAa;IAmBhB,MAAM,CAAC,eAAe,CAAC,SAAS,GAAE,MAAU;IAqB5C,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE;CAGnC;AAED,KAAK,aAAa,GAAG;IAAE,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC;AAC1C,qBAAa,aAAa;IACxB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,QAAQ,CAAmB;gBAG/B,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,IAAI,CAAC,EAAE,aAAa;IAStB,QAAQ;IAiBR,QAAQ,IAAI,aAAa,EAAE;IAgB3B,MAAM;IAON,KAAK;IAGL,SAAS;CAGV"}
1
+ {"version":3,"file":"generalTrinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/generalTrinom.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,OAAO,EAAO,MAAM,oCAAoC,CAAC;AA0BlE,OAAO,EAAE,aAAa,EAAmB,MAAM,gCAAgC,CAAC;AAIhF,OAAO,EAGL,QAAQ,EAET,MAAM,uBAAuB,CAAC;AAG/B,8BAAsB,wBAAwB;IAC5C,MAAM,CAAC,MAAM,CACX,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC3D,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC3D,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC1D,aAAa;IAmBhB,MAAM,CAAC,eAAe,CACpB,KAAK,CAAC,EAAE;QACN,GAAG,CAAC,EAAE,MAAM,CAAC;QACb,GAAG,CAAC,EAAE,MAAM,CAAC;QACb,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;QACpB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;KACjB,EACD,SAAS,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC/D,QAAQ,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC7D,aAAa;IAmBhB,MAAM,CAAC,eAAe,CAAC,SAAS,GAAE,MAAU;IAqB5C,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE;CAGnC;AAED,KAAK,oBAAoB,GAAG;IAAE,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC;AACjD,qBAAa,aAAa;IACxB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,QAAQ,CAAmB;gBAG/B,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,IAAI,CAAC,EAAE,oBAAoB;IAS7B,QAAQ;IAiBR,QAAQ,IAAI,aAAa,EAAE;IAgB3B,MAAM;IAON,KAAK;IAGL,SAAS;CAGV"}
@@ -0,0 +1,10 @@
1
+ import { AlgebraicNode } from "../../tree/nodes/algebraicNode";
2
+ export declare class Binomial {
3
+ n: number;
4
+ p: AlgebraicNode;
5
+ constructor(n: number, p: AlgebraicNode);
6
+ sup(k: number): number;
7
+ inf(k: number): number;
8
+ ineq(a: number, b: number): number;
9
+ }
10
+ //# sourceMappingURL=binomial.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"binomial.d.ts","sourceRoot":"","sources":["../../../src/math/probability/binomial.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAK/D,qBAAa,QAAQ;IACnB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,aAAa,CAAC;gBACL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,aAAa;IAKvC,GAAG,CAAC,CAAC,EAAE,MAAM;IAWb,GAAG,CAAC,CAAC,EAAE,MAAM;IAWb,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;CAW1B"}
@@ -0,0 +1,30 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.Binomial = void 0;
4
+ const combination_1 = require("../utils/combinatorics/combination");
5
+ const sum_1 = require("../utils/sum");
6
+ class Binomial {
7
+ constructor(n, p) {
8
+ this.n = n;
9
+ this.p = p;
10
+ }
11
+ sup(k) {
12
+ const proba = this.p.evaluate();
13
+ return (0, sum_1.sum)(k, this.n, (i) => (0, combination_1.combinations)(i, this.n) *
14
+ Math.pow(proba, i) *
15
+ Math.pow(1 - proba, this.n - i));
16
+ }
17
+ inf(k) {
18
+ const proba = this.p.evaluate();
19
+ return (0, sum_1.sum)(0, k, (i) => (0, combination_1.combinations)(i, this.n) *
20
+ Math.pow(proba, i) *
21
+ Math.pow(1 - proba, this.n - i));
22
+ }
23
+ ineq(a, b) {
24
+ const proba = this.p.evaluate();
25
+ return (0, sum_1.sum)(a, b, (i) => (0, combination_1.combinations)(i, this.n) *
26
+ Math.pow(proba, i) *
27
+ Math.pow(1 - proba, this.n - i));
28
+ }
29
+ }
30
+ exports.Binomial = Binomial;
@@ -26,7 +26,7 @@ export declare class Interval implements MathSetInterface {
26
26
  constructor(min: AlgebraicNode, max: AlgebraicNode, closure: ClosureType);
27
27
  equals(interval: Interval): boolean;
28
28
  union(interval: Interval): MathSet;
29
- intersection(interval: Interval): IntervalNode | DiscreteSetNode;
29
+ intersection(interval: Interval): DiscreteSetNode | IntervalNode;
30
30
  insideToTex(): string;
31
31
  toTex(): string;
32
32
  toInequality(): string;
@@ -0,0 +1,11 @@
1
+ import { AlgebraicNode } from "../../tree/nodes/algebraicNode";
2
+ export declare class GeneralSystem {
3
+ coeffs: AlgebraicNode[][];
4
+ constructor(coeffs: AlgebraicNode[][]);
5
+ solve(): {
6
+ x: AlgebraicNode;
7
+ y: AlgebraicNode;
8
+ };
9
+ toTex(): string;
10
+ }
11
+ //# sourceMappingURL=generalSystem.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"generalSystem.d.ts","sourceRoot":"","sources":["../../../src/math/systems/generalSystem.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAgB/D,qBAAa,aAAa;IACxB,MAAM,EAAE,aAAa,EAAE,EAAE,CAAC;gBAWd,MAAM,EAAE,aAAa,EAAE,EAAE;IAGrC,KAAK;;;;IA4CL,KAAK;CAYN"}
@@ -0,0 +1,79 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.GeneralSystem = void 0;
4
+ const addNode_1 = require("../../tree/nodes/operators/addNode");
5
+ const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
6
+ const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
7
+ const substractNode_1 = require("../../tree/nodes/operators/substractNode");
8
+ class GeneralSystem {
9
+ //coeffs[i][0]x+coeffs[i][1]y = coeffs[i][2]
10
+ //ax+by = c
11
+ //a2x = c2
12
+ //x = c2/a2
13
+ //a(c2/a2) +by = c
14
+ //y = (c-a(c2/a2))/b
15
+ //ax+by =c
16
+ //dx+ey =f
17
+ constructor(coeffs) {
18
+ this.coeffs = coeffs;
19
+ }
20
+ solve() {
21
+ if (this.coeffs.length !== 2)
22
+ throw Error("General system resolution not implemented yet");
23
+ const [a, b, c] = this.coeffs[0];
24
+ const [d, e, f] = this.coeffs[1];
25
+ const db = (0, multiplyNode_1.multiply)(d, b);
26
+ const ea = (0, multiplyNode_1.multiply)(e, a);
27
+ let x;
28
+ let y;
29
+ if (b.evaluate() === 0) {
30
+ if (a.evaluate() === 0)
31
+ throw Error("No solution");
32
+ x = (0, fractionNode_1.frac)(c, a).simplify();
33
+ if (e.evaluate() === 0)
34
+ throw Error("No solution");
35
+ y = (0, fractionNode_1.frac)((0, substractNode_1.substract)(f, (0, multiplyNode_1.multiply)(d, x)), e).simplify();
36
+ }
37
+ else if (a.evaluate() === 0) {
38
+ if (b.evaluate() === 0)
39
+ throw Error("No solution");
40
+ y = (0, fractionNode_1.frac)(c, b).simplify();
41
+ if (d.evaluate() === 0)
42
+ throw Error("No solution");
43
+ x = (0, fractionNode_1.frac)((0, substractNode_1.substract)(f, (0, multiplyNode_1.multiply)(e, y)), d).simplify();
44
+ }
45
+ else if (d.evaluate() === 0) {
46
+ if (e.evaluate() === 0)
47
+ throw Error("No solution");
48
+ y = (0, fractionNode_1.frac)(f, e).simplify();
49
+ if (a.evaluate() === 0)
50
+ throw Error("No solution");
51
+ x = (0, fractionNode_1.frac)((0, substractNode_1.substract)(c, (0, multiplyNode_1.multiply)(b, y)), a).simplify();
52
+ }
53
+ else if (e.evaluate() === 0) {
54
+ if (d.evaluate() === 0)
55
+ throw Error("No solution");
56
+ x = (0, fractionNode_1.frac)(f, d).simplify();
57
+ if (b.evaluate() === 0)
58
+ throw Error("No solution");
59
+ y = (0, fractionNode_1.frac)((0, substractNode_1.substract)(c, (0, multiplyNode_1.multiply)(a, x)), b).simplify();
60
+ }
61
+ else if (db.equals(ea))
62
+ throw Error("No solution");
63
+ else {
64
+ x = (0, fractionNode_1.frac)((0, substractNode_1.substract)((0, multiplyNode_1.multiply)(b, f), (0, multiplyNode_1.multiply)(e, c)), (0, substractNode_1.substract)(db, ea)).simplify();
65
+ y = (0, fractionNode_1.frac)((0, substractNode_1.substract)(c, (0, multiplyNode_1.multiply)(a, x)), b).simplify();
66
+ }
67
+ return {
68
+ x,
69
+ y,
70
+ };
71
+ }
72
+ toTex() {
73
+ return `\\left\\{\\begin{matrix}
74
+ ${(0, addNode_1.add)((0, multiplyNode_1.multiply)(this.coeffs[0][0], "x"), (0, multiplyNode_1.multiply)(this.coeffs[0][1], "y")).toTex()}=${this.coeffs[0][2]} \\\\
75
+ ${new addNode_1.AddNode((0, multiplyNode_1.multiply)(this.coeffs[1][0], "x"), (0, multiplyNode_1.multiply)(this.coeffs[1][1], "y")).toTex()}=${this.coeffs[1][2]}
76
+ \\end{matrix}\\right.`;
77
+ }
78
+ }
79
+ exports.GeneralSystem = GeneralSystem;
@@ -1 +1 @@
1
- {"version":3,"file":"playground.d.ts","sourceRoot":"","sources":["../src/playground.ts"],"names":[],"mappings":"AAiCA,eAAO,MAAM,UAAU,YAGtB,CAAC"}
1
+ {"version":3,"file":"playground.d.ts","sourceRoot":"","sources":["../src/playground.ts"],"names":[],"mappings":"AAoCA,eAAO,MAAM,UAAU,YAAW,CAAC"}
package/lib/playground.js CHANGED
@@ -1,8 +1,5 @@
1
1
  "use strict";
2
2
  Object.defineProperty(exports, "__esModule", { value: true });
3
3
  exports.playground = void 0;
4
- const playground = () => {
5
- // const node = multiply(sqrt(3), sqrt(8)).simplify();
6
- // console.log(node.toTex());
7
- };
4
+ const playground = () => { };
8
5
  exports.playground = playground;
package/lib/server.js CHANGED
@@ -58,11 +58,9 @@ const runServer = () => {
58
58
  });
59
59
  app.get("/exo", (req, res) => {
60
60
  const exoId = req.query.exoId;
61
- console.log(req.query.options);
62
61
  const options = req.query.options
63
62
  ? JSON.parse(req.query.options)
64
63
  : undefined;
65
- console.log("parsed", options);
66
64
  const exoIndex = allExercises.findIndex((exo) => exo.id == exoId);
67
65
  const exo = allExercises[exoIndex];
68
66
  if (!exo)
@@ -7,16 +7,7 @@ export declare class PointNode implements Node {
7
7
  constructor(point: Point, opts?: NodeOptions);
8
8
  toIdentifiers(): {
9
9
  id: NodeIds;
10
- point: {
11
- id: string;
12
- name: string;
13
- x: {
14
- id: NodeIds;
15
- } & Record<string, any>;
16
- y: {
17
- id: NodeIds;
18
- } & Record<string, any>;
19
- };
10
+ point: import("../../../math/geometry/point").PointIdentifiers;
20
11
  };
21
12
  toAllTexs(): string[];
22
13
  toAllValidTexs(): string[];
@@ -1 +1 @@
1
- {"version":3,"file":"pointNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/geometry/pointNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAElD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAE/D,qBAAa,SAAU,YAAW,IAAI;IACpC,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,KAAK,EAAE,KAAK,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;gBAEH,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,WAAW;IAK5C,aAAa;;;;;;;;;;;;;IAMb,SAAS;IAGT,cAAc;IAMd,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAepC,YAAY;IAGZ,QAAQ;IAIR,KAAK;IAGL,QAAQ;CAGT"}
1
+ {"version":3,"file":"pointNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/geometry/pointNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAElD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAE/D,qBAAa,SAAU,YAAW,IAAI;IACpC,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,KAAK,EAAE,KAAK,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;gBAEH,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,WAAW;IAK5C,aAAa;;;;IAMb,SAAS;IAGT,cAAc;IAMd,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAepC,YAAY;IAGZ,QAAQ;IAIR,KAAK;IAGL,QAAQ;CAGT"}
@@ -23,7 +23,7 @@ class InequationNode {
23
23
  this.tex += children[i].toTex();
24
24
  if (i < children.length - 1) {
25
25
  const shouldAddSpace = (this.symbols[i] === "\\le" || this.symbols[i] === "\\ge") &&
26
- (0, isLetter_1.isLetter)(children[i + 1].toTex());
26
+ (0, isLetter_1.isLetter)(children[i + 1].toTex()[0]);
27
27
  this.tex += `${this.symbols[i]}${shouldAddSpace ? " " : ""}`;
28
28
  }
29
29
  }
@@ -18,20 +18,11 @@ export declare class InequationSolutionNode implements Node {
18
18
  children: ({
19
19
  id: NodeIds;
20
20
  } & Record<string, any>)[];
21
- } | {
22
- id: NodeIds;
23
- leftChild: {
24
- id: NodeIds;
25
- } & Record<string, any>;
26
- rightChild: {
27
- id: NodeIds;
28
- } & Record<string, any>;
29
- closure: import("../sets/closure").ClosureType;
30
- };
21
+ } | import("../sets/intervalNode").IntervalNodeIdentifiers;
31
22
  };
32
23
  toAllTexs(): string[];
33
24
  toAllValidTexs(): string[];
34
- toEquivalentNodes(opts?: NodeOptions): (import("./inequationNode").InequationNode | InequationSolutionNode)[];
25
+ toEquivalentNodes(opts?: NodeOptions): (InequationSolutionNode | import("./inequationNode").InequationNode)[];
35
26
  toMathString(): string;
36
27
  toMathjs(): string;
37
28
  toTex(): string;
@@ -1 +1 @@
1
- {"version":3,"file":"inequationSolutionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/inequations/inequationSolutionNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EAAE,YAAY,EAAkB,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAE9D,KAAK,6BAA6B,GAAG;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,WAAW,CAAA;CAAE,CAAC;AAC/E,qBAAa,sBAAuB,YAAW,IAAI;IACjD,IAAI,EAAE,QAAQ,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,gBAAgB,EAAE,YAAY,GAAG,iBAAiB,CAAC;IACnD,IAAI,CAAC,EAAE,WAAW,CAAC;gBAEjB,gBAAgB,EAAE,YAAY,GAAG,iBAAiB,EAClD,MAAM,CAAC,EAAE,6BAA6B;IAaxC,aAAa;;;;;;;;;;;;;;;;;;IAMb,SAAS;IAUT,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAepC,YAAY;IAGZ,QAAQ;IAGR,KAAK;IAGL,QAAQ;CAGT"}
1
+ {"version":3,"file":"inequationSolutionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/inequations/inequationSolutionNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EAAE,YAAY,EAAkB,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAE9D,KAAK,6BAA6B,GAAG;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,WAAW,CAAA;CAAE,CAAC;AAC/E,qBAAa,sBAAuB,YAAW,IAAI;IACjD,IAAI,EAAE,QAAQ,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,gBAAgB,EAAE,YAAY,GAAG,iBAAiB,CAAC;IACnD,IAAI,CAAC,EAAE,WAAW,CAAC;gBAEjB,gBAAgB,EAAE,YAAY,GAAG,iBAAiB,EAClD,MAAM,CAAC,EAAE,6BAA6B;IAaxC,aAAa;;;;;;;;;IAMb,SAAS;IAUT,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAepC,YAAY;IAGZ,QAAQ;IAGR,KAAK;IAGL,QAAQ;CAGT"}
@@ -74,7 +74,8 @@ export declare enum NodeIds {
74
74
  point = 34,
75
75
  vector = 35,
76
76
  inequation = 36,
77
- inequationSolution = 37
77
+ inequationSolution = 37,
78
+ binomialCoefficient = 38
78
79
  }
79
80
  export interface Node {
80
81
  type: NodeType;
@@ -1 +1 @@
1
- {"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/node.ts"],"names":[],"mappings":"AAEA,oBAAY,QAAQ;IAClB,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,UAAU,IAAA;IACV,KAAK,IAAA;IACL,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,OAAO,IAAA;IACP,MAAM,KAAA;IACN,GAAG,KAAA;IACH,MAAM,KAAA;CACP;AACD,MAAM,MAAM,WAAW,GAAG;IACxB,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,YAAY,CAAC,EAAE,YAAY,CAAC;CAC7B,CAAC;AAEF,MAAM,MAAM,YAAY,GAAG;IACzB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,YAAY,CAAC,EAAE,OAAO,CAAC;IAEvB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,qBAAqB,CAAC,EAAE,OAAO,CAAC;IAChC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF,oBAAY,OAAO;IACjB,GAAG,IAAA;IACH,SAAS,IAAA;IACT,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,MAAM,IAAA;IACN,KAAK,IAAA;IACL,KAAK,IAAA;IACL,MAAM,IAAA;IACN,OAAO,IAAA;IACP,QAAQ,IAAA;IACR,QAAQ,KAAA;IACR,OAAO,KAAA;IACP,WAAW,KAAA;IACX,QAAQ,KAAA;IACR,KAAK,KAAA;IACL,OAAO,KAAA;IACP,KAAK,KAAA;IACL,UAAU,KAAA;IACV,gBAAgB,KAAA;IAChB,GAAG,KAAA;IACH,MAAM,KAAA;IACN,MAAM,KAAA;IACN,MAAM,KAAA;IACN,GAAG,KAAA;IACH,GAAG,KAAA;IACH,GAAG,KAAA;IACH,GAAG,KAAA;IACH,KAAK,KAAA;IACL,GAAG,KAAA;IACH,IAAI,KAAA;IACJ,QAAQ,KAAA;IACR,QAAQ,KAAA;IACR,MAAM,KAAA;IACN,MAAM,KAAA;IACN,KAAK,KAAA;IACL,MAAM,KAAA;IACN,UAAU,KAAA;IACV,kBAAkB,KAAA;CACnB;AAED,MAAM,WAAW,IAAI;IACnB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,YAAY,EAAE,MAAM,MAAM,CAAC;IAC3B,iBAAiB,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,IAAI,EAAE,CAAC;IAClD,cAAc,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,MAAM,EAAE,CAAC;IACjD,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,YAAY,KAAK,MAAM,CAAC;IAEvC,QAAQ,EAAE,MAAM,IAAI,CAAC;IACrB,aAAa,EAAE,MAAM;QAAE,EAAE,EAAE,OAAO,CAAA;KAAE,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAC5D"}
1
+ {"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/node.ts"],"names":[],"mappings":"AAEA,oBAAY,QAAQ;IAClB,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,UAAU,IAAA;IACV,KAAK,IAAA;IACL,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,OAAO,IAAA;IACP,MAAM,KAAA;IACN,GAAG,KAAA;IACH,MAAM,KAAA;CACP;AACD,MAAM,MAAM,WAAW,GAAG;IACxB,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,YAAY,CAAC,EAAE,YAAY,CAAC;CAC7B,CAAC;AAEF,MAAM,MAAM,YAAY,GAAG;IACzB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,YAAY,CAAC,EAAE,OAAO,CAAC;IAEvB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,qBAAqB,CAAC,EAAE,OAAO,CAAC;IAChC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF,oBAAY,OAAO;IACjB,GAAG,IAAA;IACH,SAAS,IAAA;IACT,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,MAAM,IAAA;IACN,KAAK,IAAA;IACL,KAAK,IAAA;IACL,MAAM,IAAA;IACN,OAAO,IAAA;IACP,QAAQ,IAAA;IACR,QAAQ,KAAA;IACR,OAAO,KAAA;IACP,WAAW,KAAA;IACX,QAAQ,KAAA;IACR,KAAK,KAAA;IACL,OAAO,KAAA;IACP,KAAK,KAAA;IACL,UAAU,KAAA;IACV,gBAAgB,KAAA;IAChB,GAAG,KAAA;IACH,MAAM,KAAA;IACN,MAAM,KAAA;IACN,MAAM,KAAA;IACN,GAAG,KAAA;IACH,GAAG,KAAA;IACH,GAAG,KAAA;IACH,GAAG,KAAA;IACH,KAAK,KAAA;IACL,GAAG,KAAA;IACH,IAAI,KAAA;IACJ,QAAQ,KAAA;IACR,QAAQ,KAAA;IACR,MAAM,KAAA;IACN,MAAM,KAAA;IACN,KAAK,KAAA;IACL,MAAM,KAAA;IACN,UAAU,KAAA;IACV,kBAAkB,KAAA;IAClB,mBAAmB,KAAA;CACpB;AAED,MAAM,WAAW,IAAI;IACnB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,YAAY,EAAE,MAAM,MAAM,CAAC;IAC3B,iBAAiB,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,IAAI,EAAE,CAAC;IAClD,cAAc,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,MAAM,EAAE,CAAC;IACjD,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,YAAY,KAAK,MAAM,CAAC;IAEvC,QAAQ,EAAE,MAAM,IAAI,CAAC;IACrB,aAAa,EAAE,MAAM;QAAE,EAAE,EAAE,OAAO,CAAA;KAAE,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAC5D"}
@@ -57,4 +57,5 @@ var NodeIds;
57
57
  NodeIds[NodeIds["vector"] = 35] = "vector";
58
58
  NodeIds[NodeIds["inequation"] = 36] = "inequation";
59
59
  NodeIds[NodeIds["inequationSolution"] = 37] = "inequationSolution";
60
+ NodeIds[NodeIds["binomialCoefficient"] = 38] = "binomialCoefficient";
60
61
  })(NodeIds || (exports.NodeIds = NodeIds = {}));