pimath 0.1.23 → 0.1.24

package/dist/pimath.js

@@ -1,18 +1,18 @@
-var Si = Object.defineProperty;
+var Ri = Object.defineProperty;
 var yi = (o) => {
   throw TypeError(o);
 };
-var Ri = (o, e, t) => e in o ? Si(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t;
-var a = (o, e, t) => Ri(o, typeof e != "symbol" ? e + "" : e, t), Jt = (o, e, t) => e.has(o) || yi("Cannot " + t);
-var s = (o, e, t) => (Jt(o, e, "read from private field"), t ? t.call(o) : e.get(o)), p = (o, e, t) => e.has(o) ? yi("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), h = (o, e, t, i) => (Jt(o, e, "write to private field"), i ? i.call(o, t) : e.set(o, t), t), q = (o, e, t) => (Jt(o, e, "access private method"), t);
-function zi(o) {
+var zi = (o, e, t) => e in o ? Ri(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t;
+var a = (o, e, t) => zi(o, typeof e != "symbol" ? e + "" : e, t), _t = (o, e, t) => e.has(o) || yi("Cannot " + t);
+var s = (o, e, t) => (_t(o, e, "read from private field"), t ? t.call(o) : e.get(o)), p = (o, e, t) => e.has(o) ? yi("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), h = (o, e, t, i) => (_t(o, e, "write to private field"), i ? i.call(o, t) : e.set(o, t), t), A = (o, e, t) => (_t(o, e, "access private method"), t);
+function Li(o) {
   const e = vi(o), t = [];
   let i, n;
   for (; e.length > 0; )
     i = e.shift() ?? 1, n = (e.length > 0 ? e.pop() : +i) ?? 1, t.push([i, n]);
   return t;
 }
-function Li(...o) {
+function Di(...o) {
   const e = fi(...o);
   return o.map((t) => t / e);
 }
@@ -39,49 +39,49 @@ function fi(...o) {
     ;
   return Math.abs(t);
 }
-function Di(...o) {
+function Vi(...o) {
   return o.reduce(function(e, t) {
     return Math.abs(e * t / fi(e, t));
   });
 }
-function Vi(o, e = 3) {
+function Zi(o, e = 3) {
   return +o.toFixed(e);
 }
-function Zi(o) {
+function Fi(o) {
   if (Number.isSafeInteger(o) || o.toString().split(".")[0].length < 10)
     return 0;
   throw new Error("Periodic value: Not implemented yet");
 }
-function Fi(o) {
+function ji(o) {
   const e = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973];
   return o === void 0 ? e : e.slice(0, Math.min(e.length, o));
 }
-function ji(o, e) {
+function Ui(o, e) {
   const t = [], i = e === !0 ? +o : o ** 2;
   for (let n = 0; n <= o; n++)
     for (let r = 0; r <= o; r++)
       n ** 2 + r ** 2 === i && t.push([n, r, o]);
   return t;
 }
-function Ui(o, e = 2) {
+function Wi(o, e = 2) {
   return +`${Math.round(+`${o}e${e}`)}e-${e}`;
 }
-const G = {
-  decompose: zi,
+const W = {
+  decompose: Li,
   dividers: vi,
-  divideNumbersByGCD: Li,
+  divideNumbersByGCD: Di,
   gcd: fi,
-  lcm: Di,
-  numberCorrection: Vi,
-  periodic: Zi,
-  primes: Fi,
-  pythagoreanTripletsWithTarget: ji,
-  round: Ui
+  lcm: Vi,
+  numberCorrection: Zi,
+  periodic: Fi,
+  primes: ji,
+  pythagoreanTripletsWithTarget: Ui,
+  round: Wi
 };
-var ct, b, w, ze;
+var ft, b, w, ze;
 const $ = class $ {
   constructor(e, t) {
-    p(this, ct, !1);
+    p(this, ft, !1);
     p(this, b, 1);
     p(this, w, 1);
     p(this, ze, "frac");
@@ -181,7 +181,7 @@ const $ = class $ {
       const e = +s(this, w);
       return h(this, w, +s(this, b)), h(this, b, e), this;
     });
-    a(this, "isApproximative", () => s(this, ct) || s(this, w).toString().length >= 15 && s(this, b).toString().length >= 15);
+    a(this, "isApproximative", () => s(this, ft) || s(this, w).toString().length >= 15 && s(this, b).toString().length >= 15);
     a(this, "isEqual", (e) => this.compare(e, "="));
     a(this, "isEven", () => this.isRelative() && this.value % 2 === 0);
     a(this, "isExact", () => !this.isApproximative());
@@ -205,7 +205,7 @@ const $ = class $ {
     a(this, "isOpposite", (e) => this.isEqual(e.clone().opposite()));
     a(this, "isPositive", () => this.sign() === 1);
     a(this, "isRational", () => !this.isRelative());
-    a(this, "isReduced", () => Math.abs(G.gcd(s(this, w), s(this, b))) === 1);
+    a(this, "isReduced", () => Math.abs(W.gcd(s(this, w), s(this, b))) === 1);
     a(this, "isRelative", () => this.clone().reduce().denominator === 1);
     a(this, "isSquare", () => Math.sqrt(s(this, w)) % 1 === 0 && Math.sqrt(s(this, b)) % 1 === 0);
     a(this, "isStrictlyNegative", () => this.value < 0);
@@ -227,7 +227,7 @@ const $ = class $ {
     });
     // ------------------------------------------
     a(this, "reduce", () => {
-      const e = G.gcd(s(this, w), s(this, b));
+      const e = W.gcd(s(this, w), s(this, b));
       return h(this, w, s(this, w) / e), h(this, b, s(this, b) / e), s(this, b) < 0 && (h(this, b, -s(this, b)), h(this, w, -s(this, w))), this;
     });
     a(this, "root", (e) => {
@@ -240,7 +240,7 @@ const $ = class $ {
       const t = this.sign();
       this.abs(), this.reduce();
       const i = Math.floor(Math.pow(s(this, w), Math.abs(1 / e))), n = Math.floor(Math.pow(s(this, b), Math.abs(1 / e)));
-      return h(this, w, Math.pow(s(this, w), Math.abs(1 / e))), h(this, b, Math.pow(s(this, b), Math.abs(1 / e))), (i !== s(this, w) || n !== s(this, b)) && (h(this, w, s(this, w) / s(this, b)), h(this, b, 1), h(this, ct, !0)), this.multiply(t), this;
+      return h(this, w, Math.pow(s(this, w), Math.abs(1 / e))), h(this, b, Math.pow(s(this, b), Math.abs(1 / e))), (i !== s(this, w) || n !== s(this, b)) && (h(this, w, s(this, w) / s(this, b)), h(this, b, 1), h(this, ft, !0)), this.multiply(t), this;
     });
     // ------------------------------------------
     // Getter and setter
@@ -287,7 +287,7 @@ const $ = class $ {
     return e === 0 ? 0 : e;
   }
 };
-ct = new WeakMap(), b = new WeakMap(), w = new WeakMap(), ze = new WeakMap(), a($, "average", (...e) => {
+ft = new WeakMap(), b = new WeakMap(), w = new WeakMap(), ze = new WeakMap(), a($, "average", (...e) => {
   const t = new $().zero();
   for (const i of e)
     t.add(i);
@@ -325,25 +325,25 @@ a($, "unique", (e) => {
   return t;
 });
 let u = $;
-var Z, ee, ie, Xe;
-class vt {
+var Z, te, ne, Ye;
+class bt {
   constructor(...e) {
     p(this, Z);
-    p(this, ee);
-    p(this, ie);
-    p(this, Xe);
+    p(this, te);
+    p(this, ne);
+    p(this, Ye);
     // ------------------------------------------
     // Creation / parsing functions
     // ------------------------------------------
-    a(this, "parse", (e, t, i) => (h(this, ie, i ?? 1), h(this, ee, t ?? 2), h(this, Z, e), s(this, ee) % 2 === 0 && s(this, Z) < 0 && h(this, Xe, !1), this));
+    a(this, "parse", (e, t, i) => (h(this, ne, i ?? 1), h(this, te, t ?? 2), h(this, Z, e), s(this, te) % 2 === 0 && s(this, Z) < 0 && h(this, Ye, !1), this));
     // ------------------------------------------
     // Mathematical operations
     // ------------------------------------------
     a(this, "reduce", () => {
-      let e = Math.floor(Math.pow(s(this, Z), 1 / s(this, ee)));
+      let e = Math.floor(Math.pow(s(this, Z), 1 / s(this, te)));
       for (; e > 1; ) {
-        if (s(this, Z) % Math.pow(e, s(this, ee)) === 0) {
-          h(this, ie, s(this, ie) * e), h(this, Z, s(this, Z) / Math.pow(e, s(this, ee))), e = Math.floor(Math.pow(s(this, Z), 1 / s(this, ee)));
+        if (s(this, Z) % Math.pow(e, s(this, te)) === 0) {
+          h(this, ne, s(this, ne) * e), h(this, Z, s(this, Z) / Math.pow(e, s(this, te))), e = Math.floor(Math.pow(s(this, Z), 1 / s(this, te)));
           continue;
         }
         e--;
@@ -354,8 +354,8 @@ class vt {
     // ------------------------------------------
     // Help functions
     // ------------------------------------------
-    a(this, "hasRadical", () => !(s(this, Z) === 1 || s(this, Z) === 0 || !s(this, Xe)));
-    h(this, Z, 1), h(this, ie, 1), h(this, ee, 2), h(this, Xe, !0), e.length > 0 && this.parse(e[0], e[1], e[2]);
+    a(this, "hasRadical", () => !(s(this, Z) === 1 || s(this, Z) === 0 || !s(this, Ye)));
+    h(this, Z, 1), h(this, ne, 1), h(this, te, 2), h(this, Ye, !0), e.length > 0 && this.parse(e[0], e[1], e[2]);
   }
   // ------------------------------------------
   // Getter and setter
@@ -367,31 +367,31 @@ class vt {
     h(this, Z, e);
   }
   get nth() {
-    return s(this, ee);
+    return s(this, te);
   }
   set nth(e) {
-    Number.isSafeInteger(e) && e >= 2 ? h(this, ee, e) : (console.log("Error setting the nth root"), h(this, ee, 2));
+    Number.isSafeInteger(e) && e >= 2 ? h(this, te, e) : (console.log("Error setting the nth root"), h(this, te, 2));
   }
   get coefficient() {
-    return s(this, ie);
+    return s(this, ne);
   }
   set coefficient(e) {
-    h(this, ie, e);
+    h(this, ne, e);
   }
   get tex() {
     let e;
-    return s(this, ie) === 1 ? e = "" : s(this, ie) === -1 ? e = "-" : e = s(this, ie).toString(), s(this, Z) === 1 ? `${s(this, ie)}` : s(this, ee) === 2 ? `${e}\\sqrt{${s(this, Z)}}` : `${e}\\sqrt[${s(this, ee)}]{${s(this, Z)}}`;
+    return s(this, ne) === 1 ? e = "" : s(this, ne) === -1 ? e = "-" : e = s(this, ne).toString(), s(this, Z) === 1 ? `${s(this, ne)}` : s(this, te) === 2 ? `${e}\\sqrt{${s(this, Z)}}` : `${e}\\sqrt[${s(this, te)}]{${s(this, Z)}}`;
   }
   get display() {
     let e;
-    return s(this, ie) === 1 ? e = "" : s(this, ie) === -1 ? e = "-" : e = s(this, ie).toString(), s(this, Z) === 1 ? `${s(this, ie)}` : s(this, ee) === 2 ? `${e}sqrt{${s(this, Z)}}` : `${e}root(${s(this, ee)}){${s(this, Z)}}`;
+    return s(this, ne) === 1 ? e = "" : s(this, ne) === -1 ? e = "-" : e = s(this, ne).toString(), s(this, Z) === 1 ? `${s(this, ne)}` : s(this, te) === 2 ? `${e}sqrt{${s(this, Z)}}` : `${e}root(${s(this, te)}){${s(this, Z)}}`;
   }
   get value() {
-    return s(this, ie) * Math.pow(s(this, Z), 1 / s(this, ee));
+    return s(this, ne) * Math.pow(s(this, Z), 1 / s(this, te));
   }
 }
-Z = new WeakMap(), ee = new WeakMap(), ie = new WeakMap(), Xe = new WeakMap();
-var fe, je, P, ot, ye, bi, ti, xi, Ei, Ni;
+Z = new WeakMap(), te = new WeakMap(), ne = new WeakMap(), Ye = new WeakMap();
+var fe, je, P, at, ye, bi, ti, xi, Ei, Ni;
 const mi = class mi {
   constructor(e, t, i = "x") {
     p(this, P);
@@ -405,23 +405,23 @@ const mi = class mi {
   }
   solve() {
     if (s(this, fe).degree().isOne())
-      return q(this, P, xi).call(this);
+      return A(this, P, xi).call(this);
     if (s(this, fe).degree().value === 2)
-      return q(this, P, Ei).call(this);
-    const e = q(this, P, bi).call(this);
+      return A(this, P, Ei).call(this);
+    const e = A(this, P, bi).call(this);
     if (e.length > 0)
       return e;
     if (s(this, fe).degree().value === 3)
-      return q(this, P, ti).call(this);
+      return A(this, P, ti).call(this);
     throw new Error("The equation degree is too high.");
   }
   solveAsCardan() {
     if (s(this, fe).degree().value !== 3)
       throw new Error("The equation is not cubic.");
-    return q(this, P, ti).call(this);
+    return A(this, P, ti).call(this);
   }
 };
-fe = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
+fe = new WeakMap(), je = new WeakMap(), P = new WeakSet(), at = function(e, t) {
   return {
     variable: s(this, je),
     exact: !1,
@@ -431,7 +431,7 @@ fe = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
   };
 }, ye = function(e) {
   if (e instanceof u && e.isApproximative())
-    return q(this, P, ot).call(this, e.value);
+    return A(this, P, at).call(this, e.value);
   const t = new u(e);
   return {
     variable: s(this, je),
@@ -447,12 +447,12 @@ fe = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
   const n = e.monomByDegree().coefficient;
   let r = e.monomByDegree(0).coefficient;
   for (; r.isZero(); )
-    t.length === 0 && t.push(q(this, P, ye).call(this, 0)), e = e.divide("x"), r = e.monomByDegree(0).coefficient;
-  const l = G.dividers(n.value), c = G.dividers(r.value);
+    t.length === 0 && t.push(A(this, P, ye).call(this, 0)), e = e.divide("x"), r = e.monomByDegree(0).coefficient;
+  const l = W.dividers(n.value), c = W.dividers(r.value);
   for (const f of l)
     for (const g of c) {
-      const N = new u(g, f);
-      e.evaluate(N).isZero() && !t.find((V) => V.value === N.value) && t.push(q(this, P, ye).call(this, N)), N.opposite(), e.evaluate(N).isZero() && !t.find((V) => V.value === N.value) && t.push(q(this, P, ye).call(this, N));
+      const x = new u(g, f);
+      e.evaluate(x).isZero() && !t.find((V) => V.value === x.value) && t.push(A(this, P, ye).call(this, x)), x.opposite(), e.evaluate(x).isZero() && !t.find((V) => V.value === x.value) && t.push(A(this, P, ye).call(this, x));
     }
   for (const f of t) {
     if (f.exact !== !1 && f.exact.isZero())
@@ -468,29 +468,29 @@ fe = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
   const d = new mi(e, e.clone().parse("0"), s(this, je));
   return t = t.concat(d.solve()), t.sort((f, g) => f.value - g.value);
 }, ti = function() {
-  const e = s(this, fe), t = e.monomByDegree(3).coefficient, i = e.monomByDegree(2).coefficient, n = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, l = i.clone().divide(t), c = n.clone().divide(t), d = r.clone().divide(t), f = c.clone().subtract(l.clone().pow(2).divide(3)), g = d.clone().subtract(l.clone().multiply(c).divide(3)).add(l.clone().pow(3).multiply(2).divide(27)), N = g.clone().opposite(), V = f.clone().opposite().pow(3).divide(27), pe = N.clone().pow(2).subtract(V.clone().multiply(4)).opposite();
+  const e = s(this, fe), t = e.monomByDegree(3).coefficient, i = e.monomByDegree(2).coefficient, n = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, l = i.clone().divide(t), c = n.clone().divide(t), d = r.clone().divide(t), f = c.clone().subtract(l.clone().pow(2).divide(3)), g = d.clone().subtract(l.clone().multiply(c).divide(3)).add(l.clone().pow(3).multiply(2).divide(27)), x = g.clone().opposite(), V = f.clone().opposite().pow(3).divide(27), pe = x.clone().pow(2).subtract(V.clone().multiply(4)).opposite();
   if (pe.isNegative()) {
-    const he = g.clone().opposite().add(pe.clone().opposite().sqrt()).divide(2).root(3), ae = g.clone().opposite().subtract(pe.clone().opposite().sqrt()).divide(2).root(3), ge = he.clone().add(ae).subtract(l.clone().divide(3));
-    return [q(this, P, ye).call(this, ge)];
+    const le = g.clone().opposite().add(pe.clone().opposite().sqrt()).divide(2).root(3), ce = g.clone().opposite().subtract(pe.clone().opposite().sqrt()).divide(2).root(3), ge = le.clone().add(ce).subtract(l.clone().divide(3));
+    return [A(this, P, ye).call(this, ge)];
   }
   if (pe.isZero()) {
-    const he = g.clone().opposite().divide(2).root(3), ae = he.clone().opposite().subtract(l.clone().divide(3)), ge = he.clone().multiply(2).subtract(l.clone().divide(3));
-    return ae.isEqual(ge) ? [q(this, P, ye).call(this, ae)] : [
-      q(this, P, ye).call(this, ge),
-      q(this, P, ye).call(this, ae)
-    ].sort((me, ce) => me.value - ce.value);
+    const le = g.clone().opposite().divide(2).root(3), ce = le.clone().opposite().subtract(l.clone().divide(3)), ge = le.clone().multiply(2).subtract(l.clone().divide(3));
+    return ce.isEqual(ge) ? [A(this, P, ye).call(this, ce)] : [
+      A(this, P, ye).call(this, ge),
+      A(this, P, ye).call(this, ce)
+    ].sort((me, ue) => me.value - ue.value);
   }
   if (pe.isPositive()) {
-    const he = [], ae = f.value, ge = g.value, me = l.value;
-    for (let ce = 0; ce < 3; ce++)
-      he.push(2 * Math.sqrt(-ae / 3) * Math.cos(Math.acos(3 * ge / (2 * ae) * Math.sqrt(-3 / ae)) / 3 + 2 * Math.PI * ce / 3) - me / 3);
-    return he.map((ce) => q(this, P, ot).call(this, ce)).sort((ce, nt) => ce.value - nt.value);
+    const le = [], ce = f.value, ge = g.value, me = l.value;
+    for (let ue = 0; ue < 3; ue++)
+      le.push(2 * Math.sqrt(-ce / 3) * Math.cos(Math.acos(3 * ge / (2 * ce) * Math.sqrt(-3 / ce)) / 3 + 2 * Math.PI * ue / 3) - me / 3);
+    return le.map((ue) => A(this, P, at).call(this, ue)).sort((ue, rt) => ue.value - rt.value);
   }
   return [];
 }, xi = function() {
   const e = s(this, fe).monomByDegree(0).coefficient.clone().opposite().divide(s(this, fe).monomByDegree(1).coefficient);
   return [
-    q(this, P, ye).call(this, e)
+    A(this, P, ye).call(this, e)
   ];
 }, Ei = function() {
   const e = s(this, fe), t = e.monomByDegree(2).coefficient, i = e.monomByDegree(1).coefficient, n = e.monomByDegree(0).coefficient, r = i.clone().pow(2).subtract(t.clone().multiply(n).multiply(4));
@@ -498,60 +498,60 @@ fe = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
     return [];
   if (r.isSquare()) {
     const l = r.sqrt(), c = i.clone().opposite().add(l).divide(t.clone().multiply(2)), d = i.clone().opposite().subtract(l).divide(t.clone().multiply(2));
-    return l.isZero() ? [q(this, P, ye).call(this, c)] : [
-      q(this, P, ye).call(this, c),
-      q(this, P, ye).call(this, d)
+    return l.isZero() ? [A(this, P, ye).call(this, c)] : [
+      A(this, P, ye).call(this, c),
+      A(this, P, ye).call(this, d)
     ].sort((f, g) => f.value - g.value);
   }
-  return q(this, P, Ni).call(this, t, i, r);
+  return A(this, P, Ni).call(this, t, i, r);
 }, Ni = function(e, t, i) {
-  const n = G.dividers(i.value).filter((me) => Math.sqrt(me) % 1 === 0).map((me) => Math.sqrt(me)).pop() ?? 1, r = G.gcd(2 * e.value, t.value, n) * (e.isNegative() ? -1 : 1), l = t.clone().divide(r).opposite(), c = e.clone().divide(r).multiply(2), d = i.clone().divide(n ** 2), f = Math.abs(n / r), g = n === 1 ? "-" : `-${f} `, N = n === 1 ? "+" : `+${f} `;
-  function V(me, ce, nt, Kt) {
-    return `\\frac{ ${ce} ${nt}\\sqrt{ ${Kt} } }{ ${me} }`;
+  const n = W.dividers(i.value).filter((me) => Math.sqrt(me) % 1 === 0).map((me) => Math.sqrt(me)).pop() ?? 1, r = W.gcd(2 * e.value, t.value, n) * (e.isNegative() ? -1 : 1), l = t.clone().divide(r).opposite(), c = e.clone().divide(r).multiply(2), d = i.clone().divide(n ** 2), f = Math.abs(n / r), g = n === 1 ? "-" : `-${f} `, x = n === 1 ? "+" : `+${f} `;
+  function V(me, ue, rt, Jt) {
+    return `\\frac{ ${ue} ${rt}\\sqrt{ ${Jt} } }{ ${me} }`;
   }
-  function pe(me, ce, nt, Kt) {
-    return `(${ce}${nt}sqrt(${Kt}))/${me}`;
+  function pe(me, ue, rt, Jt) {
+    return `(${ue}${rt}sqrt(${Jt}))/${me}`;
   }
-  const he = i.value ** 0.5, ae = (-t.value - he) / (2 * e.value), ge = (-t.value + he) / (2 * e.value);
+  const le = i.value ** 0.5, ce = (-t.value - le) / (2 * e.value), ge = (-t.value + le) / (2 * e.value);
   return [
-    q(this, P, ot).call(this, ae, {
+    A(this, P, at).call(this, ce, {
       tex: V(c.tex, l.tex, g.toString(), d.tex),
       display: pe(c.display, l.display, g.toString(), d.display)
     }),
-    q(this, P, ot).call(this, ge, {
-      tex: V(c.tex, l.tex, N.toString(), d.tex),
-      display: pe(c.display, l.display, N.toString(), d.display)
+    A(this, P, at).call(this, ge, {
+      tex: V(c.tex, l.tex, x.toString(), d.tex),
+      display: pe(c.display, l.display, x.toString(), d.display)
     })
-  ].sort((me, ce) => me.value - ce.value);
+  ].sort((me, ue) => me.value - ue.value);
 };
-let Nt = mi;
-var Gi = Object.defineProperty, Ti = (o) => {
+let Ot = mi;
+var Gi = Object.defineProperty, Oi = (o) => {
   throw TypeError(o);
-}, Wi = (o, e, t) => e in o ? Gi(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t, _t = (o, e, t) => Wi(o, typeof e != "symbol" ? e + "" : e, t), Ai = (o, e, t) => e.has(o) || Ti("Cannot " + t), _ = (o, e, t) => (Ai(o, e, "read from private field"), t ? t.call(o) : e.get(o)), rt = (o, e, t) => e.has(o) ? Ti("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), xe = (o, e, t, i) => (Ai(o, e, "write to private field"), e.set(o, t), t);
+}, Hi = (o, e, t) => e in o ? Gi(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t, ei = (o, e, t) => Hi(o, typeof e != "symbol" ? e + "" : e, t), Ti = (o, e, t) => e.has(o) || Oi("Cannot " + t), ee = (o, e, t) => (Ti(o, e, "read from private field"), t ? t.call(o) : e.get(o)), ot = (o, e, t) => e.has(o) ? Oi("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), xe = (o, e, t, i) => (Ti(o, e, "write to private field"), e.set(o, t), t);
 const di = {
   pi: Math.PI,
   e: Math.exp(1)
 };
 var m = /* @__PURE__ */ ((o) => (o.VARIABLE = "variable", o.COEFFICIENT = "coefficient", o.OPERATION = "operation", o.CONSTANT = "constant", o.FUNCTION = "function", o.FUNCTION_ARGUMENT = "function-argument", o.MONOM = "monom", o.LEFT_PARENTHESIS = "(", o.RIGHT_PARENTHESIS = ")", o))(m || {}), Fe = /* @__PURE__ */ ((o) => (o.EXPRESSION = "expression", o.POLYNOM = "polynom", o.SET = "set", o.NUMERIC = "numeric", o))(Fe || {});
-function Hi(o, e) {
+function Xi(o, e) {
   if (o.length <= 1)
     return o;
-  const t = Object.keys(e).filter((N) => e[N].type === m.FUNCTION).map((N) => N);
-  t.sort((N, V) => V.length - N.length);
+  const t = Object.keys(e).filter((x) => e[x].type === m.FUNCTION).map((x) => x);
+  t.sort((x, V) => V.length - x.length);
   const i = new RegExp(`^(${t.join("|")})\\(`), n = Object.keys(di);
-  n.sort((N, V) => V.length - N.length);
+  n.sort((x, V) => V.length - x.length);
   const r = new RegExp(`^(${n.join("|")})`), l = /^(\d+(\.\d+)?)/;
   let c = "", d, f, g;
   for (; o.length > 0; ) {
     if (d = f, g = void 0, t.length > 0 && i.exec(o)) {
-      const N = t.find((V) => o.startsWith(V));
-      N && (g = N + "(", o = o.slice(N.length + 1), f = m.FUNCTION);
+      const x = t.find((V) => o.startsWith(V));
+      x && (g = x + "(", o = o.slice(x.length + 1), f = m.FUNCTION);
     } else if (n.length > 0 && r.exec(o)) {
-      const N = n.find((V) => o.startsWith(V));
-      N && (g = N, o = o.slice(N.length), f = m.CONSTANT);
+      const x = n.find((V) => o.startsWith(V));
+      x && (g = x, o = o.slice(x.length), f = m.CONSTANT);
     } else if (l.exec(o)) {
-      const N = l.exec(o);
-      N && (g = N[0], o = o.slice(N[0].length), f = m.COEFFICIENT);
+      const x = l.exec(o);
+      x && (g = x[0], o = o.slice(x[0].length), f = m.COEFFICIENT);
     } else
       switch (g = o[0], o = o.slice(1), g) {
         case "(":
@@ -575,20 +575,20 @@ function Hi(o, e) {
       }
     if (g === void 0 || f === void 0)
       throw new Error("The token is undefined");
-    c += Xi(d, f), c += g;
+    c += Yi(d, f), c += g;
   }
   return c;
 }
-function Xi(o, e) {
+function Yi(o, e) {
   return o === void 0 || o === m.OPERATION || e === m.OPERATION || o === m.LEFT_PARENTHESIS || o === m.FUNCTION || o === m.FUNCTION_ARGUMENT || e === m.RIGHT_PARENTHESIS || e === m.FUNCTION_ARGUMENT ? "" : "*";
 }
-const Yi = {
+const Qi = {
   "^": { precedence: 4, associative: "right", type: m.OPERATION },
   "*": { precedence: 3, associative: "left", type: m.OPERATION },
   "/": { precedence: 3, associative: "left", type: m.OPERATION },
   "+": { precedence: 2, associative: "left", type: m.OPERATION },
   "-": { precedence: 2, associative: "left", type: m.OPERATION }
-}, Qi = {
+}, Ki = {
   "^": { precedence: 4, associative: "right", type: m.OPERATION },
   "*": { precedence: 3, associative: "left", type: m.OPERATION },
   "/": { precedence: 3, associative: "left", type: m.OPERATION },
@@ -601,7 +601,7 @@ const Yi = {
   sqrt: { precedence: 4, associative: "right", type: m.FUNCTION },
   nthrt: { precedence: 4, associative: "right", type: m.FUNCTION },
   ",": { precedence: 2, associative: "left", type: m.FUNCTION_ARGUMENT }
-}, Ki = {
+}, Ji = {
   "^": { precedence: 4, associative: "right", type: m.OPERATION },
   "*": { precedence: 3, associative: "left", type: m.OPERATION },
   "/": { precedence: 3, associative: "left", type: m.OPERATION },
@@ -615,26 +615,26 @@ const Yi = {
   nthrt: { precedence: 4, associative: "right", type: m.FUNCTION },
   ln: { precedence: 4, associative: "right", type: m.FUNCTION },
   log: { precedence: 4, associative: "right", type: m.FUNCTION }
-}, Ji = {
+}, _i = {
   "&": { precedence: 3, associative: "left", type: m.OPERATION },
   "|": { precedence: 3, associative: "left", type: m.OPERATION },
   "!": { precedence: 4, associative: "right", type: m.OPERATION },
   "-": { precedence: 2, associative: "left", type: m.OPERATION }
 };
-var We, ht, te, bt, Ve;
-class Qt {
+var He, lt, se, xt, Ve;
+class Kt {
   constructor(e) {
-    rt(this, We), rt(this, ht, []), rt(this, te, {}), rt(this, bt, []), rt(this, Ve), xe(this, We, typeof e > "u" ? Fe.POLYNOM : e), this.tokenConfigInitialization();
+    ot(this, He), ot(this, lt, []), ot(this, se, {}), ot(this, xt, []), ot(this, Ve), xe(this, He, typeof e > "u" ? Fe.POLYNOM : e), this.tokenConfigInitialization();
   }
   // Getter
   get rpn() {
-    return _(this, ht);
+    return ee(this, lt);
   }
   get rpnToken() {
-    return _(this, ht).map((e) => e.token);
+    return ee(this, lt).map((e) => e.token);
   }
   tokenConfigInitialization() {
-    return _(this, We) === Fe.SET ? (xe(this, te, Ji), xe(this, Ve, !1)) : _(this, We) === Fe.NUMERIC ? (xe(this, te, Ki), xe(this, Ve, !0)) : _(this, We) === Fe.EXPRESSION ? (xe(this, te, Qi), xe(this, Ve, !0)) : (xe(this, te, Yi), xe(this, Ve, !0)), xe(this, bt, Object.keys(_(this, te)).sort((e, t) => t.length - e.length)), _(this, te);
+    return ee(this, He) === Fe.SET ? (xe(this, se, _i), xe(this, Ve, !1)) : ee(this, He) === Fe.NUMERIC ? (xe(this, se, Ji), xe(this, Ve, !0)) : ee(this, He) === Fe.EXPRESSION ? (xe(this, se, Ki), xe(this, Ve, !0)) : (xe(this, se, Qi), xe(this, Ve, !0)), xe(this, xt, Object.keys(ee(this, se)).sort((e, t) => t.length - e.length)), ee(this, se);
   }
   /**
    * Get the next token to analyse.
@@ -650,9 +650,9 @@ class Qt {
     else if (e[t] === ",")
       i = ",", n = m.FUNCTION_ARGUMENT;
     else {
-      for (const r of _(this, bt))
+      for (const r of ee(this, xt))
         if (e.substring(t, t + r.length) === r) {
-          i += r, n = _(this, te)[r].type;
+          i += r, n = ee(this, se)[r].type;
           break;
         }
       for (const r in di)
@@ -683,7 +683,7 @@ class Qt {
   parse(e, t) {
     const i = [], n = [];
     let r = "", l = 0, c;
-    (t ?? _(this, Ve)) && (e = Hi(e, _(this, te)));
+    (t ?? ee(this, Ve)) && (e = Xi(e, ee(this, se)));
     const d = 50;
     let f = 50, g;
     for (; l < e.length; ) {
@@ -703,17 +703,17 @@ class Qt {
           break;
         case m.OPERATION:
           if (n.length > 0) {
-            let N = n[n.length - 1];
-            for (g = +d; N.token in _(this, te) && //either o1 is left-associative and its precedence is less than or equal to that of o2,
-            (_(this, te)[r].associative === "left" && _(this, te)[r].precedence <= _(this, te)[N.token].precedence || //or o1 is right associative, and has precedence less than that of o2,
-            _(this, te)[r].associative === "right" && _(this, te)[r].precedence < _(this, te)[N.token].precedence); ) {
+            let x = n[n.length - 1];
+            for (g = +d; x.token in ee(this, se) && //either o1 is left-associative and its precedence is less than or equal to that of o2,
+            (ee(this, se)[r].associative === "left" && ee(this, se)[r].precedence <= ee(this, se)[x.token].precedence || //or o1 is right associative, and has precedence less than that of o2,
+            ee(this, se)[r].associative === "right" && ee(this, se)[r].precedence < ee(this, se)[x.token].precedence); ) {
               if (g--, g === 0) {
                 console.log("SECURITY LEVEL 2 OPERATION EXIT");
                 break;
               }
               if (i.push(n.pop() ?? { token: "", tokenType: m.OPERATION }), n.length === 0)
                 break;
-              N = n[n.length - 1];
+              x = n[n.length - 1];
             }
           }
           n.push({ token: r, tokenType: c });
@@ -747,15 +747,15 @@ class Qt {
           throw new Error(`Token type ${r} is not handled`);
       }
     }
-    return xe(this, ht, i.concat(n.reverse())), this;
+    return xe(this, lt, i.concat(n.reverse())), this;
   }
 }
-We = /* @__PURE__ */ new WeakMap(), ht = /* @__PURE__ */ new WeakMap(), te = /* @__PURE__ */ new WeakMap(), bt = /* @__PURE__ */ new WeakMap(), Ve = /* @__PURE__ */ new WeakMap();
-class _i {
+He = /* @__PURE__ */ new WeakMap(), lt = /* @__PURE__ */ new WeakMap(), se = /* @__PURE__ */ new WeakMap(), xt = /* @__PURE__ */ new WeakMap(), Ve = /* @__PURE__ */ new WeakMap();
+class es {
   constructor(e, t) {
-    _t(this, "_rpn"), _t(this, "_expression"), _t(this, "_isValid"), this._expression = e;
+    ei(this, "_rpn"), ei(this, "_expression"), ei(this, "_isValid"), this._expression = e;
     try {
-      this._rpn = new Qt(Fe.NUMERIC).parse(e, t).rpn;
+      this._rpn = new Kt(Fe.NUMERIC).parse(e, t).rpn;
     } catch {
       throw this._rpn = null, this._isValid = !1, new Error(`There was a problem parsing: ${e}`);
     }
@@ -851,18 +851,18 @@ class _i {
     return +e.toFixed(t);
   }
 }
-var T, v, Ye, xt, Le, qt, kt;
+var O, v, Qe, Et, Le, Mt, kt;
 const I = class I {
   constructor(e) {
-    p(this, Ye);
-    p(this, T);
+    p(this, Qe);
+    p(this, O);
     p(this, v);
     /**
      * Clone the current Monom.
      */
     a(this, "clone", () => {
       const e = new I();
-      e.coefficient = s(this, T).clone();
+      e.coefficient = s(this, O).clone();
       for (const t in s(this, v))
         e.setLetter(t, s(this, v)[t].clone());
       return e;
@@ -874,7 +874,7 @@ const I = class I {
     a(this, "add", (...e) => {
       for (const t of e) {
         const i = t instanceof I ? t : new I(t);
-        this.isSameAs(i) ? (this.isZero() && q(this, Ye, xt).call(this, i), s(this, T).add(i.coefficient)) : console.log("Add monom: " + this.display + " is not similar with ", i.display);
+        this.isSameAs(i) ? (this.isZero() && A(this, Qe, Et).call(this, i), s(this, O).add(i.coefficient)) : console.log("Add monom: " + this.display + " is not similar with ", i.display);
       }
       return this;
     });
@@ -891,7 +891,7 @@ const I = class I {
     a(this, "derivative", (e) => {
       if (e === void 0 && (e = "x"), this.hasVariable(e)) {
         const t = s(this, v)[e].clone(), i = this.clone();
-        return s(i, v)[e].subtract(1), s(i, T).multiply(new u(t.clone())), i;
+        return s(i, v)[e].subtract(1), s(i, O).multiply(new u(t.clone())), i;
       } else
         return new I().zero();
     });
@@ -902,7 +902,7 @@ const I = class I {
     a(this, "divide", (...e) => {
       for (const t of e) {
         const i = t instanceof I ? t : new I(t);
-        s(this, T).divide(i.coefficient);
+        s(this, O).divide(i.coefficient);
         for (const n in i.literal)
           s(this, v)[n] = this.hasVariable(n) ? s(this, v)[n].subtract(i.literal[n]) : i.literal[n].clone().opposite(), s(this, v)[n].isZero() && this.removeVariable(n);
       }
@@ -917,7 +917,7 @@ const I = class I {
       if (t === !0) {
         if (e instanceof u)
           return s(this, Le).call(this, e.value);
-        if (e instanceof vt)
+        if (e instanceof bt)
           return new u().invalid();
         if (typeof e == "number")
           return s(this, Le).call(this, e);
@@ -933,7 +933,7 @@ const I = class I {
         const n = {};
         return n[this.variables[0]] = new u(e), this.evaluate(n);
       }
-      if (e instanceof vt)
+      if (e instanceof bt)
         return new u().invalid();
       if (typeof e == "object") {
         if (this.variables.length === 0)
@@ -952,7 +952,7 @@ const I = class I {
      */
     a(this, "hasVariable", (e) => Object.hasOwn(s(this, v), e ?? "x"));
     a(this, "inverse", () => {
-      s(this, T).opposite();
+      s(this, O).opposite();
       for (const e in s(this, v))
         s(this, v)[e].opposite();
       return this;
@@ -969,7 +969,7 @@ const I = class I {
      * Determine if two monoms are equals
      * @param M
      */
-    a(this, "isEqual", (e) => this.isSameAs(e) && s(this, T).isEqual(e.coefficient));
+    a(this, "isEqual", (e) => this.isSameAs(e) && s(this, O).isEqual(e.coefficient));
     a(this, "isLiteralSquare", () => {
       for (const e in this.literal)
         if (this.literal[e].isRational() || this.literal[e].isEven())
@@ -979,7 +979,7 @@ const I = class I {
     /**
      * Determine if the monom is one
      */
-    a(this, "isOne", () => s(this, T).value === 1 && this.variables.length === 0);
+    a(this, "isOne", () => s(this, O).value === 1 && this.variables.length === 0);
     /**
      * Determine if two monoms are similar
      * @param M
@@ -1001,7 +1001,7 @@ const I = class I {
     /**
      * Determine if the monom is null
      */
-    a(this, "isZero", () => s(this, T).value === 0);
+    a(this, "isZero", () => s(this, O).value === 0);
     /**
      * Multiple multiple monoms to the current monom
      * @param M (Monom[]) The monoms to multiply to.
@@ -1009,7 +1009,7 @@ const I = class I {
     a(this, "multiply", (...e) => {
       for (const t of e) {
         const i = t instanceof I ? t : new I(t);
-        s(this, T).multiply(i.coefficient);
+        s(this, O).multiply(i.coefficient);
         for (const n in i.literal)
           this.hasVariable(n) ? s(this, v)[n].add(i.literal[n]) : s(this, v)[n] = i.literal[n].clone();
       }
@@ -1018,18 +1018,18 @@ const I = class I {
     /**
      * Create a one value monom
      */
-    a(this, "one", () => (h(this, T, new u().one()), h(this, v, {}), this));
+    a(this, "one", () => (h(this, O, new u().one()), h(this, v, {}), this));
     /**
      * Get the opposite
      * Returns a monom.
      */
-    a(this, "opposite", () => (s(this, T).opposite(), this));
+    a(this, "opposite", () => (s(this, O).opposite(), this));
     /**
      * Get the pow of a monom.
      * @param nb (number) : Mathematical pow
      */
     a(this, "pow", (e) => {
-      s(this, T).pow(e);
+      s(this, O).pow(e);
       for (const t in s(this, v))
         s(this, v)[t].multiply(e);
       return this;
@@ -1063,7 +1063,7 @@ const I = class I {
      */
     a(this, "sqrt", () => {
       if (this.isSquare()) {
-        s(this, T).sqrt();
+        s(this, O).sqrt();
         for (const e in s(this, v))
           s(this, v)[e].clone().divide(2);
       }
@@ -1076,14 +1076,14 @@ const I = class I {
     a(this, "subtract", (...e) => {
       for (const t of e) {
         const i = t instanceof I ? t : new I(t);
-        this.isSameAs(i) ? (this.isZero() && q(this, Ye, xt).call(this, i), s(this, T).add(i.clone().coefficient.opposite())) : console.log("Subtract: Is not similar: ", i.display);
+        this.isSameAs(i) ? (this.isZero() && A(this, Qe, Et).call(this, i), s(this, O).add(i.clone().coefficient.opposite())) : console.log("Subtract: Is not similar: ", i.display);
       }
       return this;
     });
     /**
      * Create a zero value monom
      */
-    a(this, "zero", () => (h(this, T, new u().zero()), h(this, v, {}), this));
+    a(this, "zero", () => (h(this, O, new u().zero()), h(this, v, {}), this));
     p(this, Le, (e) => {
       let t = this.coefficient.value;
       if (typeof e == "number") {
@@ -1094,7 +1094,7 @@ const I = class I {
         const i = {};
         return i[this.variables[0]] = new u(e).value, s(this, Le).call(this, i);
       }
-      if (e instanceof vt)
+      if (e instanceof bt)
         return NaN;
       if (typeof e == "object") {
         if (this.variables.length === 0)
@@ -1106,8 +1106,8 @@ const I = class I {
       }
       return t;
     });
-    p(this, qt, (e) => {
-      const i = new Qt().parse(e).rpn, n = [];
+    p(this, Mt, (e) => {
+      const i = new Kt().parse(e).rpn, n = [];
       if (i.length === 0)
         return this.zero(), this;
       if (i.length === 1) {
@@ -1143,7 +1143,7 @@ const I = class I {
           }
         }
     });
-    return h(this, T, new u().zero()), h(this, v, {}), e !== void 0 && this.parse(e), this;
+    return h(this, O, new u().zero()), h(this, v, {}), e !== void 0 && this.parse(e), this;
   }
   // -----------------------------------------
   /**
@@ -1151,21 +1151,21 @@ const I = class I {
    * @param inputStr
    */
   parse(e) {
-    return h(this, T, new u()), h(this, v, {}), typeof e == "string" ? s(this, qt).call(this, e) : typeof e == "number" ? h(this, T, new u(e)) : e instanceof u ? h(this, T, e.clone()) : e instanceof I && (h(this, T, s(e, T).clone()), q(this, Ye, xt).call(this, e)), this;
+    return h(this, O, new u()), h(this, v, {}), typeof e == "string" ? s(this, Mt).call(this, e) : typeof e == "number" ? h(this, O, new u(e)) : e instanceof u ? h(this, O, e.clone()) : e instanceof I && (h(this, O, s(e, O).clone()), A(this, Qe, Et).call(this, e)), this;
   }
   /**
    * Get the coefficient \\(k\\) of the Monom \\(k\\cdot x^{n}\\)
    * @returns {Fraction}
    */
   get coefficient() {
-    return s(this, T);
+    return s(this, O);
   }
   /**
    * Set the coefficient \\(k\\) value of the monom
    * @param {Fraction | number | string} F
    */
   set coefficient(e) {
-    h(this, T, new u(e));
+    h(this, O, new u(e));
   }
   // Display getter
   /**
@@ -1176,7 +1176,7 @@ const I = class I {
     const t = Object.keys(s(this, v)).sort();
     for (const i of t)
       s(this, v)[i].isNotZero() && (e += i, s(this, v)[i].isNotEqual(1) && (e += `^(${s(this, v)[i].display})`));
-    return e === "" ? s(this, T).value != 0 ? s(this, T).display : "" : s(this, T).value === 1 ? e : s(this, T).value === -1 ? `-${e}` : s(this, T).value === 0 ? "0" : `${s(this, T).display}${e}`;
+    return e === "" ? s(this, O).value != 0 ? s(this, O).display : "" : s(this, O).value === 1 ? e : s(this, O).value === -1 ? `-${e}` : s(this, O).value === 0 ? "0" : `${s(this, O).display}${e}`;
   }
   get dividers() {
     if (!this.coefficient.isRelative())
@@ -1185,7 +1185,7 @@ const I = class I {
       return [this.clone()];
     if (this.coefficient.numerator > 1e6)
       return [this.clone()];
-    const e = G.dividers(Math.abs(this.coefficient.numerator));
+    const e = W.dividers(Math.abs(this.coefficient.numerator));
     let t = [];
     for (const n in this.literal)
       t = this._getLiteralDividers(t, n);
@@ -1255,7 +1255,7 @@ const I = class I {
     const t = Object.keys(s(this, v)).sort();
     for (const i of t)
       s(this, v)[i].isNotZero() && (e += (e === "" ? "" : "*") + i, s(this, v)[i].isNotEqual(1) && (e += `^(${s(this, v)[i].display})`));
-    return e === "" ? s(this, T).value != 0 ? s(this, T).display : "" : s(this, T).value === 1 ? e : s(this, T).value === -1 ? `-${e}` : s(this, T).value === 0 ? "0" : `${s(this, T).display}*${e}`;
+    return e === "" ? s(this, O).value != 0 ? s(this, O).display : "" : s(this, O).value === 1 ? e : s(this, O).value === -1 ? `-${e}` : s(this, O).value === 0 ? "0" : `${s(this, O).display}*${e}`;
   }
   removeVariable(e) {
     delete s(this, v)[e];
@@ -1268,7 +1268,7 @@ const I = class I {
     const t = Object.keys(s(this, v)).sort();
     for (const i of t)
       s(this, v)[i].isNotZero() && (e += i, s(this, v)[i].isNotEqual(1) && (e += `^{ ${s(this, v)[i].tfrac.tex} }`));
-    return e === "" ? s(this, T).value != 0 ? s(this, T).frac.tex : "0" : s(this, T).value === 1 ? e : s(this, T).value === -1 ? `-${e}` : s(this, T).value === 0 ? "0" : `${s(this, T).frac.tex}${e}`;
+    return e === "" ? s(this, O).value != 0 ? s(this, O).frac.tex : "0" : s(this, O).value === 1 ? e : s(this, O).value === -1 ? `-${e}` : s(this, O).value === 0 ? "0" : `${s(this, O).frac.tex}${e}`;
   }
   // Getter helpers.
   /**
@@ -1298,14 +1298,14 @@ const I = class I {
     return i;
   }
 };
-T = new WeakMap(), v = new WeakMap(), Ye = new WeakSet(), xt = function(e) {
+O = new WeakMap(), v = new WeakMap(), Qe = new WeakSet(), Et = function(e) {
   for (const t in e.literal)
     s(this, v)[t] = e.literal[t].clone();
-}, Le = new WeakMap(), qt = new WeakMap(), kt = new WeakMap(), a(I, "gcd", (...e) => {
+}, Le = new WeakMap(), Mt = new WeakMap(), kt = new WeakMap(), a(I, "gcd", (...e) => {
   for (const r of e)
     if (r.containsRationalPower())
       return new I().zero();
-  const t = new I(), i = G.gcd(...e.map((r) => r.coefficient.numerator)), n = G.lcm(...e.map((r) => r.coefficient.denominator));
+  const t = new I(), i = W.gcd(...e.map((r) => r.coefficient.numerator)), n = W.lcm(...e.map((r) => r.coefficient.denominator));
   t.coefficient = new u(i, n).reduce();
   for (const r of e) {
     for (const l in t.literal)
@@ -1324,21 +1324,21 @@ a(I, "xMultiply", (...e) => {
     t.multiply(i);
   return t;
 });
-let M = I;
+let k = I;
 function wi(o, e = !0) {
   return e ? `\\left( ${o} \\right)` : `(${o})`;
 }
 function Re(o, e, t, i, n) {
   return o.map((r, l) => i !== void 0 && l < i || n !== void 0 && l > n ? r : r === e ? t : r);
 }
-var Ue, y, Qe, ut, Ke, ft, Mt, Ct, $t, Je, It, dt, Pt, Bt, St, Rt, Oi, zt, Lt;
+var Ue, y, Ke, dt, Je, pt, Ct, $t, It, _e, Pt, mt, Bt, St, Rt, zt, Ai, Lt, Dt;
 const C = class C {
   constructor(e, ...t) {
-    p(this, Rt);
+    p(this, zt);
     p(this, Ue);
     p(this, y);
-    p(this, Qe);
-    p(this, ut, !1);
+    p(this, Ke);
+    p(this, dt, !1);
     /**
      * Parse a string to a polynom.
      * @param inputStr
@@ -1346,12 +1346,12 @@ const C = class C {
      */
     a(this, "parse", (e, ...t) => {
       if (h(this, y, []), h(this, Ue, []), typeof e == "string")
-        return q(this, Rt, Oi).call(this, e, ...t);
-      if ((typeof e == "number" || e instanceof u || e instanceof M) && t.length === 0)
-        s(this, y).push(new M(e));
-      else if (e instanceof M && t.length > 0)
-        s(this, y).push(new M(e)), t.forEach((i) => {
-          s(this, y).push(new M(i));
+        return A(this, zt, Ai).call(this, e, ...t);
+      if ((typeof e == "number" || e instanceof u || e instanceof k) && t.length === 0)
+        s(this, y).push(new k(e));
+      else if (e instanceof k && t.length > 0)
+        s(this, y).push(new k(e)), t.forEach((i) => {
+          s(this, y).push(new k(i));
         });
       else if (e instanceof C)
         for (const i of e.monoms)
@@ -1369,11 +1369,11 @@ const C = class C {
     });
     a(this, "add", (...e) => {
       for (const t of e)
-        t instanceof C ? h(this, y, s(this, y).concat(t.monoms)) : t instanceof M ? s(this, y).push(t.clone()) : typeof t == "number" && Number.isSafeInteger(t) ? s(this, y).push(new M(t.toString())) : s(this, y).push(new M(t));
+        t instanceof C ? h(this, y, s(this, y).concat(t.monoms)) : t instanceof k ? s(this, y).push(t.clone()) : typeof t == "number" && Number.isSafeInteger(t) ? s(this, y).push(new k(t.toString())) : s(this, y).push(new k(t));
       return this.reduce();
     });
     a(this, "commonMonom", () => {
-      const e = new M().one(), t = this.gcdNumerator(), i = this.gcdDenominator(), n = this.degree();
+      const e = new k().one(), t = this.gcdNumerator(), i = this.gcdDenominator(), n = this.degree();
       e.coefficient = new u(t, i);
       for (const r of this.variables) {
         e.setLetter(r, n);
@@ -1397,14 +1397,14 @@ const C = class C {
     });
     a(this, "divide", (e) => {
       if (e instanceof u)
-        return s(this, ft).call(this, e);
+        return s(this, pt).call(this, e);
       if (typeof e == "number" && Number.isSafeInteger(e))
-        return s(this, Mt).call(this, e);
-      if (e instanceof M)
+        return s(this, Ct).call(this, e);
+      if (e instanceof k)
         return this.divide(new C(e));
       if (e instanceof C) {
         if (e.monoms.length === 1 && e.variables.length === 0)
-          return s(this, ft).call(this, e.monoms[0].coefficient);
+          return s(this, pt).call(this, e.monoms[0].coefficient);
         {
           const { quotient: t, reminder: i } = this.euclidean(e);
           if (i.isZero())
@@ -1435,7 +1435,7 @@ const C = class C {
     });
     a(this, "evaluate", (e, t) => {
       if (t)
-        return s(this, Ct).call(this, e);
+        return s(this, $t).call(this, e);
       const i = new u().zero();
       return s(this, y).forEach((n) => {
         i.add(n.evaluate(e, t));
@@ -1462,7 +1462,7 @@ const C = class C {
           t.push(i.clone()), i.one();
           break;
         } else {
-          let c = s(this, It).call(this, i, l, e ?? "x");
+          let c = s(this, Pt).call(this, i, l, e ?? "x");
           for (l = i.degree(e).value; c.length > 0; ) {
             const d = c[0];
             if (!i.isDividableBy(d))
@@ -1470,16 +1470,16 @@ const C = class C {
             else {
               const f = i.euclidean(d);
               t.push(d), i = f.quotient.clone(), c = c.filter((g) => {
-                const N = i.monoms[0], V = i.monoms[i.monoms.length - 1], pe = g.monoms[0], he = g.monoms[g.monoms.length - 1];
-                return V.isDivisible(he) ? N.isDivisible(pe) : !1;
+                const x = i.monoms[0], V = i.monoms[i.monoms.length - 1], pe = g.monoms[0], le = g.monoms[g.monoms.length - 1];
+                return V.isDivisible(le) ? x.isDivisible(pe) : !1;
               });
             }
           }
         }
       return i.isOne() || t.push(i.clone()), h(this, Ue, t), s(this, Ue);
     });
-    a(this, "gcdDenominator", () => G.gcd(...this.getDenominators()));
-    a(this, "gcdNumerator", () => G.gcd(...this.getNumerators()));
+    a(this, "gcdDenominator", () => W.gcd(...this.getDenominators()));
+    a(this, "gcdNumerator", () => W.gcd(...this.getNumerators()));
     // Next functions are used for for commonMonom, which is used in the factorize method.
     a(this, "getDenominators", () => {
       const e = [];
@@ -1493,7 +1493,7 @@ const C = class C {
         e.push(t.coefficient.numerator);
       return e;
     });
-    a(this, "getZeroes", () => this.degree().isZero() ? [] : (this.roots = new Nt(this.clone()).solve(), this.roots));
+    a(this, "getZeroes", () => this.degree().isZero() ? [] : (this.roots = new Ot(this.clone()).solve(), this.roots));
     a(this, "integrate", (e, t, i = "x") => {
       const n = this.primitive(i), r = {}, l = {};
       return r[i] = new u(e), l[i] = new u(t), n.evaluate(l).subtract(n.evaluate(r));
@@ -1519,8 +1519,8 @@ const C = class C {
         return t.isZero();
       }
     });
-    a(this, "isEqual", (e) => s(this, Ke).call(this, e, "="));
-    a(this, "isOppositeAt", (e) => s(this, Ke).call(this, e.clone().opposite(), "="));
+    a(this, "isEqual", (e) => s(this, Je).call(this, e, "="));
+    a(this, "isOppositeAt", (e) => s(this, Je).call(this, e.clone().opposite(), "="));
     a(this, "isReduced", (e) => {
       if (!this.isDeveloped(e))
         return !1;
@@ -1532,9 +1532,9 @@ const C = class C {
           return !1;
       return !1;
     });
-    a(this, "isSameAs", (e) => s(this, Ke).call(this, e, "same"));
-    a(this, "lcmDenominator", () => G.lcm(...this.getDenominators()));
-    a(this, "lcmNumerator", () => G.lcm(...this.getNumerators()));
+    a(this, "isSameAs", (e) => s(this, Je).call(this, e, "same"));
+    a(this, "lcmDenominator", () => W.lcm(...this.getDenominators()));
+    a(this, "lcmNumerator", () => W.lcm(...this.getNumerators()));
     a(this, "letters", () => {
       let e = /* @__PURE__ */ new Set();
       for (const t of s(this, y))
@@ -1556,7 +1556,7 @@ const C = class C {
       for (const n of s(i, y))
         if (n.degree(t).isEqual(e))
           return n.clone();
-      return new M().zero();
+      return new k().zero();
     });
     // Used in LinearSystem.tex
     a(this, "monomByLetter", (e) => {
@@ -1564,7 +1564,7 @@ const C = class C {
       for (const i of s(t, y))
         if (i.hasVariable(e))
           return i.clone();
-      return new M().zero();
+      return new k().zero();
     });
     a(this, "monomsByDegree", (e, t) => {
       if (e === void 0)
@@ -1574,8 +1574,8 @@ const C = class C {
         r.degree(t).isEqual(e) && i.push(r.clone());
       return i;
     });
-    a(this, "multiply", (e) => e instanceof C ? s(this, St).call(this, e) : e instanceof u ? s(this, dt).call(this, e) : e instanceof M ? s(this, Bt).call(this, e) : Number.isSafeInteger(e) && typeof e == "number" ? s(this, Pt).call(this, e) : this);
-    a(this, "one", () => (h(this, y, []), s(this, y).push(new M().one()), this));
+    a(this, "multiply", (e) => e instanceof C ? s(this, Rt).call(this, e) : e instanceof u ? s(this, mt).call(this, e) : e instanceof k ? s(this, St).call(this, e) : Number.isSafeInteger(e) && typeof e == "number" ? s(this, Bt).call(this, e) : this);
+    a(this, "one", () => (h(this, y, []), s(this, y).push(new k().one()), this));
     // ------------------------------------------
     a(this, "opposite", () => (h(this, y, s(this, y).map((e) => e.opposite())), this));
     a(this, "pow", (e) => {
@@ -1600,7 +1600,7 @@ const C = class C {
       let e = 0;
       for (; e < s(this, y).length; ) {
         for (let t = e + 1; t < s(this, y).length; t++)
-          s(this, y)[e].isSameAs(s(this, y)[t]) && (s(this, y)[e].add(s(this, y)[t]), s(this, y).splice(t, 1), s(this, y)[e].isZero() && (s(this, y)[e] = new M().zero()), t--);
+          s(this, y)[e].isSameAs(s(this, y)[t]) && (s(this, y)[e].add(s(this, y)[t]), s(this, y).splice(t, 1), s(this, y)[e].isZero() && (s(this, y)[e] = new k().zero()), t--);
         e++;
       }
       h(this, y, s(this, y).filter((t) => !t.coefficient.isZero()));
@@ -1639,15 +1639,15 @@ const C = class C {
     });
     a(this, "subtract", (...e) => {
       for (const t of e)
-        t instanceof C ? this.add(t.clone().opposite()) : t instanceof M ? s(this, y).push(t.clone().opposite()) : s(this, y).push(new M(t).opposite());
+        t instanceof C ? this.add(t.clone().opposite()) : t instanceof k ? s(this, y).push(t.clone().opposite()) : s(this, y).push(new k(t).opposite());
       return this.reduce();
     });
     /**
      * Set the polynom to zero.
      * @returns {this}
      */
-    a(this, "zero", () => (h(this, y, []), s(this, y).push(new M().zero()), this));
-    p(this, Ke, (e, t) => {
+    a(this, "zero", () => (h(this, y, []), s(this, y).push(new k().zero()), this));
+    p(this, Je, (e, t) => {
       t === void 0 && (t = "=");
       const i = this.clone().reduce().reorder(), n = e.clone().reduce().reorder();
       switch (t) {
@@ -1659,25 +1659,25 @@ const C = class C {
           return !1;
       }
     });
-    p(this, ft, (e) => {
+    p(this, pt, (e) => {
       for (const t of s(this, y))
         t.coefficient.divide(e);
       return this;
     });
-    p(this, Mt, (e) => {
+    p(this, Ct, (e) => {
       const t = new u(e);
       for (const i of s(this, y))
         i.coefficient.divide(t);
       return this;
     });
-    p(this, Ct, (e) => {
+    p(this, $t, (e) => {
       let t = 0;
       return s(this, y).forEach((i) => {
         t += i.evaluate(e, !0);
       }), t;
     });
-    p(this, $t, (e) => {
-      var N;
+    p(this, It, (e) => {
+      var x;
       let t, i, n, r, l, c, d, f, g;
       if (this.numberOfVars === 1)
         return n = this.monomByDegree(2, e).coefficient, r = this.monomByDegree(1, e).coefficient, l = this.monomByDegree(0, e).coefficient, c = r.clone().pow(2).subtract(n.clone().multiply(l).multiply(4)), c.isZero() ? (d = r.clone().opposite().divide(n.clone().multiply(2)), t = new C(e).subtract(d.display).multiply(d.denominator), i = new C(e).subtract(d.display).multiply(d.denominator), g = n.divide(d.denominator).divide(d.denominator), g.isOne() ? [t, i] : [new C(g.display), t, i]) : c.isPositive() && c.isSquare() ? (d = r.clone().opposite().add(c.clone().sqrt()).divide(n.clone().multiply(2)), f = r.clone().opposite().subtract(c.clone().sqrt()).divide(n.clone().multiply(2)), g = n.divide(d.denominator).divide(f.denominator), g.isOne() ? [
@@ -1689,17 +1689,17 @@ const C = class C {
           new C(e).subtract(f.display).multiply(f.denominator)
         ]) : [this.clone()];
       if (n = this.monomByDegree(2, e), r = this.monomByDegree(1, e), l = this.monomByDegree(0, e), n.isLiteralSquare() && l.isLiteralSquare() && r.clone().pow(2).isSameAs(n.clone().multiply(l))) {
-        const V = new C("x", n.coefficient, r.coefficient, l.coefficient), pe = s(N = V, $t).call(N, "x"), he = [];
-        let ae;
+        const V = new C("x", n.coefficient, r.coefficient, l.coefficient), pe = s(x = V, It).call(x, "x"), le = [];
+        let ce;
         if (pe.length >= 2) {
           for (const ge of pe)
-            ge.degree().isZero() ? he.push(ge.clone()) : (ae = ge.clone(), ae.monoms[0].literal = n.literalSqrt, ae.monoms[1].literal = l.literalSqrt, he.push(ae.clone()));
-          return he;
+            ge.degree().isZero() ? le.push(ge.clone()) : (ce = ge.clone(), ce.monoms[0].literal = n.literalSqrt, ce.monoms[1].literal = l.literalSqrt, le.push(ce.clone()));
+          return le;
         }
       }
       return [this.clone()];
     });
-    p(this, Je, (e, t, i, n) => {
+    p(this, _e, (e, t, i, n) => {
       let r = "";
       for (const l of s(this, y)) {
         if (l.coefficient.value === 0)
@@ -1709,7 +1709,7 @@ const C = class C {
       }
       return i === !0 && this.length > 1 && (e === "tex" ? r = `\\left( ${r} \\right)` : r = `(${r})`), r === "" && (r = "0"), r;
     });
-    p(this, It, (e, t, i) => {
+    p(this, Pt, (e, t, i) => {
       const n = e.monoms[0].dividers, r = e.monoms[e.monoms.length - 1].dividers, l = [];
       return n.forEach((c) => {
         c.degree(i).isLeq(t) && r.forEach((d) => {
@@ -1717,43 +1717,43 @@ const C = class C {
         });
       }), l;
     });
-    p(this, dt, (e) => {
+    p(this, mt, (e) => {
       for (const t of s(this, y))
         t.coefficient.multiply(e);
       return this.reduce();
     });
-    p(this, Pt, (e) => s(this, dt).call(this, new u(e)));
-    p(this, Bt, (e) => {
+    p(this, Bt, (e) => s(this, mt).call(this, new u(e)));
+    p(this, St, (e) => {
       for (const t of s(this, y))
         t.multiply(e);
       return this.reduce();
     });
-    p(this, St, (e) => {
+    p(this, Rt, (e) => {
       const t = [];
       for (const i of s(this, y))
         for (const n of e.monoms)
-          t.push(M.xMultiply(i, n));
+          t.push(k.xMultiply(i, n));
       return h(this, y, t), this.reduce();
     });
     /**
      * Main parse using a shutting yard class
      * @param inputStr
      */
-    p(this, zt, (e) => {
-      const i = new Qt().parse(e).rpn;
+    p(this, Lt, (e) => {
+      const i = new Kt().parse(e).rpn;
       this.zero();
       const n = [];
       for (const r of i)
-        s(this, Lt).call(this, n, r);
+        s(this, Dt).call(this, n, r);
       return n.length === 1 && this.add(n[0]), this.reorder();
     });
-    p(this, Lt, (e, t) => {
+    p(this, Dt, (e, t) => {
       switch (t.tokenType) {
         case m.COEFFICIENT:
           e.push(new C(t.token));
           break;
         case m.VARIABLE:
-          e.push(new C().add(new M(t.token)));
+          e.push(new C().add(new k(t.token)));
           break;
         case m.CONSTANT:
           console.log("Actually, not supported - will be added later !");
@@ -1797,10 +1797,10 @@ const C = class C {
           break;
       }
     });
-    return h(this, y, []), h(this, Ue, []), h(this, Qe, []), e !== void 0 && this.parse(e, ...t), this;
+    return h(this, y, []), h(this, Ue, []), h(this, Ke, []), e !== void 0 && this.parse(e, ...t), this;
   }
   get display() {
-    return s(this, Je).call(this);
+    return s(this, _e).call(this);
   }
   hasVariable(e) {
     return this.variables.includes(e);
@@ -1830,16 +1830,16 @@ const C = class C {
     return this.variables.length;
   }
   get plotFunction() {
-    return s(this, Je).call(this, "tex", !1, !1, !0);
+    return s(this, _e).call(this, "tex", !1, !1, !0);
   }
   root() {
     throw new Error("Cannot take the root from a polynom");
   }
   get roots() {
-    return s(this, ut) ? s(this, Qe) : this.getZeroes();
+    return s(this, dt) ? s(this, Ke) : this.getZeroes();
   }
   set roots(e) {
-    h(this, ut, !0), h(this, Qe, e);
+    h(this, dt, !0), h(this, Ke, e);
   }
   sqrt() {
     throw new Error("Cannot take the square root from a polynom");
@@ -1865,14 +1865,14 @@ const C = class C {
           0,
           l
         )), r = g * 2 + 1, l = f === i.length - 1 ? n.length : t.findIndex((V) => V.value === i[f + 1].value) * 2 + 1;
-        const N = f === i.length - 1 ? d.value + 1 : (d.value + i[f + 1].value) / 2;
-        c = this.evaluate(N, !0) < 0 ? "-" : "+", n[r] = "z", n = Re(n, "", c, r, l), r = +l, l = n.length;
+        const x = f === i.length - 1 ? d.value + 1 : (d.value + i[f + 1].value) / 2;
+        c = this.evaluate(x, !0) < 0 ? "-" : "+", n[r] = "z", n = Re(n, "", c, r, l), r = +l, l = n.length;
       });
     }
     return { roots: t, signs: n };
   }
   get tex() {
-    return s(this, Je).call(this, "tex");
+    return s(this, _e).call(this, "tex");
   }
   get variables() {
     let e = [];
@@ -1884,14 +1884,14 @@ const C = class C {
     return this.getZeroes();
   }
 };
-Ue = new WeakMap(), y = new WeakMap(), Qe = new WeakMap(), ut = new WeakMap(), Ke = new WeakMap(), ft = new WeakMap(), Mt = new WeakMap(), Ct = new WeakMap(), $t = new WeakMap(), Je = new WeakMap(), It = new WeakMap(), dt = new WeakMap(), Pt = new WeakMap(), Bt = new WeakMap(), St = new WeakMap(), Rt = new WeakSet(), Oi = function(e, ...t) {
+Ue = new WeakMap(), y = new WeakMap(), Ke = new WeakMap(), dt = new WeakMap(), Je = new WeakMap(), pt = new WeakMap(), Ct = new WeakMap(), $t = new WeakMap(), It = new WeakMap(), _e = new WeakMap(), Pt = new WeakMap(), mt = new WeakMap(), Bt = new WeakMap(), St = new WeakMap(), Rt = new WeakMap(), zt = new WeakSet(), Ai = function(e, ...t) {
   if (t.length === 0) {
     if (e = "" + e, e !== "" && !isNaN(Number(e))) {
       this.empty();
-      const i = new M(e);
+      const i = new k(e);
       return this.add(i), this;
     }
-    return s(this, zt).call(this, e);
+    return s(this, Lt).call(this, e);
   } else if (/^[a-z]+/.test(e)) {
     this.empty();
     const i = t.map((n) => new u(n));
@@ -1899,45 +1899,45 @@ Ue = new WeakMap(), y = new WeakMap(), Qe = new WeakMap(), ut = new WeakMap(), K
       const n = e.split("");
       let r = 0;
       for (const l of i) {
-        const c = new M();
+        const c = new k();
         c.coefficient = l.clone(), c.literalStr = n[r] || "", this.add(c), r++;
       }
     } else {
       let n = i.length - 1;
       for (const r of i) {
-        const l = new M();
+        const l = new k();
         l.coefficient = r.clone(), l.literalStr = `${e}^${n}`, this.add(l), n--;
       }
     }
     return this;
   } else
     return this.zero();
-}, zt = new WeakMap(), Lt = new WeakMap();
-let O = C;
-var A, k, se, Dt, _e, Vt;
+}, Lt = new WeakMap(), Dt = new WeakMap();
+let T = C;
+var q, M, re, Vt, et, Zt;
 const Ee = class Ee {
   constructor(e, t, i) {
     // Left part of the equation
-    p(this, A);
+    p(this, q);
     // Right part of the equation
-    p(this, k);
+    p(this, M);
     // Signe of the equation
-    p(this, se);
+    p(this, re);
     // ------------------------------------------
     a(this, "parse", (e) => {
-      const t = s(this, Dt).call(this, e);
+      const t = s(this, Vt).call(this, e);
       if (t === !1)
         throw new Error("The equation is not valid (no sign found)");
       const i = e.split(t);
-      return this.create(new O(i[0]), new O(i[1]), s(this, _e).call(this, t));
+      return this.create(new T(i[0]), new T(i[1]), s(this, et).call(this, t));
     });
-    a(this, "create", (e, t, i) => (h(this, A, e), h(this, k, t), h(this, se, s(this, _e).call(this, i ?? "=")), this));
-    a(this, "clone", () => new Ee(s(this, A).clone(), s(this, k).clone(), s(this, se)));
+    a(this, "create", (e, t, i) => (h(this, q, e), h(this, M, t), h(this, re, s(this, et).call(this, i ?? "=")), this));
+    a(this, "clone", () => new Ee(s(this, q).clone(), s(this, M).clone(), s(this, re)));
     /**
      * Get the degree of the equation
      * @param letter
      */
-    a(this, "degree", (e) => u.max(s(this, A).degree(e), s(this, k).degree(e)));
+    a(this, "degree", (e) => u.max(s(this, q).degree(e), s(this, M).degree(e)));
     /**
      * divide an equation by a given value (transformed as a fraction)
      *
@@ -1968,7 +1968,7 @@ const Ee = class Ee {
     /**
      * Determine if the equation contains more than one letter/variable.
      */
-    a(this, "isMultiVariable", () => s(this, A).isMultiVariable || s(this, k).isMultiVariable);
+    a(this, "isMultiVariable", () => s(this, q).isMultiVariable || s(this, M).isMultiVariable);
     // -----------------------------------------------
     // Equations helpers
     a(this, "isEqualTo", (e) => {
@@ -1983,47 +1983,47 @@ const Ee = class Ee {
       if (!this.degree(e).isOne() || this.isMultiVariable())
         return !1;
       let t;
-      s(this, A).subtract(s(this, k)), s(this, k).zero();
-      const i = [...s(this, A).monoms];
+      s(this, q).subtract(s(this, M)), s(this, M).zero();
+      const i = [...s(this, q).monoms];
       for (const r of i)
-        r.hasVariable(e) || (t = r.clone(), s(this, A).subtract(t), s(this, k).subtract(t));
-      if (s(this, A).length !== 1)
+        r.hasVariable(e) || (t = r.clone(), s(this, q).subtract(t), s(this, M).subtract(t));
+      if (s(this, q).length !== 1)
         return !1;
-      const n = s(this, A).monoms[0].coefficient.clone();
-      return s(this, A).divide(n), s(this, k).divide(n), this;
+      const n = s(this, q).monoms[0].coefficient.clone();
+      return s(this, q).divide(n), s(this, M).divide(n), this;
     });
     // -----------------------------------------------
     // Equations operations
     // -----------------------------------------------
-    a(this, "letters", () => [.../* @__PURE__ */ new Set([...s(this, A).letters(), ...s(this, k).letters()])]);
+    a(this, "letters", () => [.../* @__PURE__ */ new Set([...s(this, q).letters(), ...s(this, M).letters()])]);
     // -----------------------------------------------
     /**
      * Reorder will move all monoms containing a letter on the left, all the other on the right.
      */
-    a(this, "moveLeft", () => (s(this, A).subtract(s(this, k)), s(this, k).zero(), this));
+    a(this, "moveLeft", () => (s(this, q).subtract(s(this, M)), s(this, M).zero(), this));
     /**
      * Multiple an equation by a fraction value.
      * @param value
      */
     a(this, "multiply", (e) => {
       const t = new u(e);
-      return s(this, A).multiply(t), s(this, k).multiply(t), s(this, se) !== "=" && t.sign() === -1 && s(this, Vt).call(this), this;
+      return s(this, q).multiply(t), s(this, M).multiply(t), s(this, re) !== "=" && t.sign() === -1 && s(this, Zt).call(this), this;
     });
-    a(this, "opposite", () => (h(this, A, s(this, A).opposite()), h(this, k, s(this, k).opposite()), this));
-    a(this, "reorder", (e) => (s(this, A).subtract(s(this, k)), s(this, k).zero(), s(this, A).reorder(), e ? this : (s(this, A).monoms.filter((t) => t.degree().isZero()).forEach((t) => {
+    a(this, "opposite", () => (h(this, q, s(this, q).opposite()), h(this, M, s(this, M).opposite()), this));
+    a(this, "reorder", (e) => (s(this, q).subtract(s(this, M)), s(this, M).zero(), s(this, q).reorder(), e ? this : (s(this, q).monoms.filter((t) => t.degree().isZero()).forEach((t) => {
       const i = t.clone();
-      s(this, A).subtract(i), s(this, k).subtract(i);
-    }), s(this, A).reorder(), s(this, k).reorder(), this)));
+      s(this, q).subtract(i), s(this, M).subtract(i);
+    }), s(this, q).reorder(), s(this, M).reorder(), this)));
     // ------------------------------------------
-    a(this, "replaceBy", (e, t) => (s(this, A).replaceBy(e, t), s(this, k).replaceBy(e, t), this));
+    a(this, "replaceBy", (e, t) => (s(this, q).replaceBy(e, t), s(this, M).replaceBy(e, t), this));
     /**
      * Multiply by the lcm denominator and divide by the gcm numerators.
      */
-    a(this, "simplify", () => (this.multiply(G.lcm(...s(this, A).getDenominators(), ...s(this, k).getDenominators())), this.divide(G.gcd(...s(this, A).getNumerators(), ...s(this, k).getNumerators())), this));
+    a(this, "simplify", () => (this.multiply(W.lcm(...s(this, q).getDenominators(), ...s(this, M).getDenominators())), this.divide(W.gcd(...s(this, q).getNumerators(), ...s(this, M).getNumerators())), this));
     // -----------------------------------------------
-    a(this, "solve", () => new Nt(this.clone()).solve());
+    a(this, "solve", () => new Ot(this.clone()).solve());
     a(this, "test", (e) => this.left.evaluate(e).isEqual(this.right.evaluate(e)));
-    p(this, Dt, (e) => {
+    p(this, Vt, (e) => {
       if (e.includes("geq"))
         return e.includes("\\geq") ? "\\geq" : "geq";
       if (e.includes("leq"))
@@ -2046,13 +2046,13 @@ const Ee = class Ee {
     });
     // -----------------------------------------------
     // Equations solving algorithms
-    p(this, _e, (e) => e === void 0 ? "=" : e.includes("geq") || e.includes(">=") || e.includes("=>") ? ">=" : e.includes(">") ? ">" : e.includes("leq") || e.includes("<=") || e.includes("=<") ? "<=" : e.includes("<") ? "<" : "=");
-    p(this, Vt, () => s(this, se) === "=" ? this : s(this, se).includes("<") ? (s(this, se).replace("<", ">"), this) : s(this, se).includes(">") ? (s(this, se).replace(">", "<"), this) : this);
-    if (h(this, A, new O().zero()), h(this, k, new O().zero()), h(this, se, "="), e !== void 0 && t === void 0) {
+    p(this, et, (e) => e === void 0 ? "=" : e.includes("geq") || e.includes(">=") || e.includes("=>") ? ">=" : e.includes(">") ? ">" : e.includes("leq") || e.includes("<=") || e.includes("=<") ? "<=" : e.includes("<") ? "<" : "=");
+    p(this, Zt, () => s(this, re) === "=" ? this : s(this, re).includes("<") ? (s(this, re).replace("<", ">"), this) : s(this, re).includes(">") ? (s(this, re).replace(">", "<"), this) : this);
+    if (h(this, q, new T().zero()), h(this, M, new T().zero()), h(this, re, "="), e !== void 0 && t === void 0) {
       if (e instanceof Ee)
         return e.clone();
       typeof e == "string" && this.parse(e);
-    } else e !== void 0 && t !== void 0 && (this.left = new O(e), this.right = new O(t));
+    } else e !== void 0 && t !== void 0 && (this.left = new T(e), this.right = new T(t));
     return i !== void 0 && (this.sign = i), this;
   }
   /**
@@ -2065,11 +2065,11 @@ const Ee = class Ee {
    */
   add(e) {
     if (e instanceof Ee)
-      return s(this, A).add(e.left), s(this, k).add(e.right), this;
+      return s(this, q).add(e.left), s(this, M).add(e.right), this;
     if (typeof e == "string" && !Ee.isEquationString(e))
       return this.add(new Ee(e));
-    const t = new O(e);
-    return s(this, A).add(t), s(this, k).add(t), this;
+    const t = new T(e);
+    return s(this, q).add(t), s(this, M).add(t), this;
   }
   /**
    * Create an Equation using two polynoms.
@@ -2078,29 +2078,29 @@ const Ee = class Ee {
    * @param asNumeric
    */
   evaluate(e, t) {
-    const i = s(this, A).evaluate(e, t), n = s(this, k).evaluate(e, t);
+    const i = s(this, q).evaluate(e, t), n = s(this, M).evaluate(e, t);
     return t ? i === n : i.isEqual(n);
   }
   isEqual(e) {
     const t = new Ee(e);
-    return t.left.isEqual(s(this, A)) && t.right.isEqual(s(this, k));
+    return t.left.isEqual(s(this, q)) && t.right.isEqual(s(this, M));
   }
   pow(e) {
-    return s(this, A).pow(e), s(this, k).pow(e), this;
+    return s(this, q).pow(e), s(this, M).pow(e), this;
   }
   reduce() {
-    return this.moveLeft(), s(this, A).reduce(), this.simplify(), s(this, A).monoms[0].coefficient.isNegative() && this.multiply(-1), this;
+    return this.moveLeft(), s(this, q).reduce(), this.simplify(), s(this, q).monoms[0].coefficient.isNegative() && this.multiply(-1), this;
   }
   split() {
-    return [s(this, A).clone(), s(this, k).clone()];
+    return [s(this, q).clone(), s(this, M).clone()];
   }
   subtract(e) {
     if (e instanceof Ee)
-      return s(this, A).subtract(e.left), s(this, k).subtract(e.right), this;
+      return s(this, q).subtract(e.left), s(this, M).subtract(e.right), this;
     if (typeof e == "string" && !Ee.isEquationString(e))
       return this.subtract(new Ee(e));
-    const t = new O(e);
-    return s(this, A).subtract(t), s(this, k).subtract(t), this;
+    const t = new T(e);
+    return s(this, q).subtract(t), s(this, M).subtract(t), this;
   }
   static isEquationString(e) {
     return e.includes("=") || e.includes("<") || e.includes(">") || e.includes("<=") || e.includes(">=");
@@ -2110,57 +2110,57 @@ const Ee = class Ee {
     return t === !0 && n.sort((r, l) => r.value - l.value), n;
   }
   get display() {
-    return `${s(this, A).display}${this.signAsTex}${s(this, k).display}`;
+    return `${s(this, q).display}${this.signAsTex}${s(this, M).display}`;
   }
   // Getter and setter
   get left() {
-    return s(this, A);
+    return s(this, q);
   }
   set left(e) {
-    h(this, A, e);
+    h(this, q, e);
   }
   get numberOfVars() {
     return this.variables.length;
   }
   get right() {
-    return s(this, k);
+    return s(this, M);
   }
   set right(e) {
-    h(this, k, e);
+    h(this, M, e);
   }
   // ------------------------------------------
   get sign() {
-    return s(this, se);
+    return s(this, re);
   }
   set sign(e) {
-    h(this, se, s(this, _e).call(this, e));
+    h(this, re, s(this, et).call(this, e));
   }
   get signAsTex() {
-    return s(this, se) === ">=" ? "\\geq" : s(this, se) === "<=" ? "\\leq" : s(this, se);
+    return s(this, re) === ">=" ? "\\geq" : s(this, re) === "<=" ? "\\leq" : s(this, re);
   }
   get tex() {
-    return `${s(this, A).tex}${this.signAsTex}${s(this, k).tex}`;
+    return `${s(this, q).tex}${this.signAsTex}${s(this, M).tex}`;
   }
   get variables() {
-    return [...new Set(s(this, k).variables.concat(s(this, A).variables))];
+    return [...new Set(s(this, M).variables.concat(s(this, q).variables))];
   }
 };
-A = new WeakMap(), k = new WeakMap(), se = new WeakMap(), Dt = new WeakMap(), _e = new WeakMap(), Vt = new WeakMap();
-let H = Ee;
-var Ne, Te, Ae, et;
+q = new WeakMap(), M = new WeakMap(), re = new WeakMap(), Vt = new WeakMap(), et = new WeakMap(), Zt = new WeakMap();
+let X = Ee;
+var Ne, Oe, Te, tt;
 const ve = class ve {
   constructor(e, t) {
     p(this, Ne);
+    p(this, Oe);
     p(this, Te);
-    p(this, Ae);
-    p(this, et, !1);
+    p(this, tt, !1);
     if (e instanceof ve)
-      h(this, Te, e.polynom.clone()), h(this, Ae, e.power.clone());
+      h(this, Oe, e.polynom.clone()), h(this, Te, e.power.clone());
     else if (typeof e == "string" && t === void 0) {
       const [i, n = "1"] = e.split("^");
-      h(this, Te, new O(i)), h(this, Ae, new u(n.replace("(", "").replace(")", "")));
+      h(this, Oe, new T(i)), h(this, Te, new u(n.replace("(", "").replace(")", "")));
     } else
-      h(this, Te, new O(e)), h(this, Ae, new u(t ?? 1));
+      h(this, Oe, new T(e)), h(this, Te, new u(t ?? 1));
     return h(this, Ne, 1), this;
   }
   parse() {
@@ -2172,18 +2172,18 @@ const ve = class ve {
   get tex() {
     const e = this.power.numerator, t = this.power.denominator;
     let i, n;
-    return s(this, Ne) === 0 && t > 1 ? (i = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, n = e === 1 ? "" : `^{ ${e} }`) : (i = s(this, et) && this.power.isOne() ? this.polynom.tex : wi(this.polynom.tex), n = t === 1 && e === 1 ? "" : `^{ ${this.power.tex} }`), i = `${i}${n}`, s(this, Ne) === 0 && e < 0 && (i = `\\frac{ 1 }{ ${i} }`), i;
+    return s(this, Ne) === 0 && t > 1 ? (i = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, n = e === 1 ? "" : `^{ ${e} }`) : (i = s(this, tt) && this.power.isOne() ? this.polynom.tex : wi(this.polynom.tex), n = t === 1 && e === 1 ? "" : `^{ ${this.power.tex} }`), i = `${i}${n}`, s(this, Ne) === 0 && e < 0 && (i = `\\frac{ 1 }{ ${i} }`), i;
   }
   get display() {
     const e = this.power.numerator, t = this.power.denominator;
     let i, n;
-    return s(this, Ne) === 0 && t > 1 ? (i = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, n = e === 1 ? "" : `^(${e})`) : (i = s(this, et) && this.power.isOne() ? this.polynom.display : wi(this.polynom.display, !1), n = t === 1 && e === 1 ? "" : `^(${this.power.display})`), i = `${i}${n}`, s(this, Ne) === 0 && e < 0 && (i = `1/(${i})`), i;
+    return s(this, Ne) === 0 && t > 1 ? (i = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, n = e === 1 ? "" : `^(${e})`) : (i = s(this, tt) && this.power.isOne() ? this.polynom.display : wi(this.polynom.display, !1), n = t === 1 && e === 1 ? "" : `^(${this.power.display})`), i = `${i}${n}`, s(this, Ne) === 0 && e < 0 && (i = `1/(${i})`), i;
   }
   add() {
     throw new Error("Adding two factors is not possible");
   }
   get asSingle() {
-    return h(this, et, !0), this;
+    return h(this, tt, !0), this;
   }
   degree(e) {
     return this.polynom.degree(e).multiply(this.power);
@@ -2203,7 +2203,7 @@ const ve = class ve {
   divide(e) {
     if (e instanceof ve && this.isSameAs(e))
       return this.power.subtract(e.power), this;
-    const t = new O(e);
+    const t = new T(e);
     if (this.isSameAs(t))
       return this.power.subtract(1), this;
     throw new Error("The two factors must be the same");
@@ -2225,7 +2225,7 @@ const ve = class ve {
   }
   isSameAs(e) {
     let t;
-    return e instanceof ve ? t = e.polynom : e instanceof O ? t = e : t = new O(e), this.polynom.isEqual(t);
+    return e instanceof ve ? t = e.polynom : e instanceof T ? t = e : t = new T(e), this.polynom.isEqual(t);
   }
   isZero() {
     return this.polynom.isZero();
@@ -2233,31 +2233,31 @@ const ve = class ve {
   multiply(e) {
     if (e instanceof ve && this.isSameAs(e))
       return this.power.add(e.power), this;
-    const t = new O(e);
+    const t = new T(e);
     if (this.isSameAs(t))
       return this.power.add(1), this;
     throw new Error("The two factors must be the same");
   }
   one() {
-    return s(this, Te).one(), s(this, Ae).one(), this;
+    return s(this, Oe).one(), s(this, Te).one(), this;
   }
   opposite() {
     throw new Error("Method not implemented.");
   }
   get polynom() {
-    return s(this, Te);
+    return s(this, Oe);
   }
   set polynom(e) {
-    h(this, Te, e);
+    h(this, Oe, e);
   }
   pow(e) {
     return this.power.multiply(e), this;
   }
   get power() {
-    return s(this, Ae);
+    return s(this, Te);
   }
   set power(e) {
-    h(this, Ae, new u(e));
+    h(this, Te, new u(e));
   }
   primitive() {
     throw new Error("Method not implemented.");
@@ -2288,19 +2288,19 @@ const ve = class ve {
     return h(this, Ne, 0), this;
   }
   zero() {
-    return s(this, Te).zero(), s(this, Ae).one(), this;
+    return s(this, Oe).zero(), s(this, Te).one(), this;
   }
 };
-Ne = new WeakMap(), Te = new WeakMap(), Ae = new WeakMap(), et = new WeakMap();
-let le = ve;
-var at = /* @__PURE__ */ ((o) => (o[o.ROOT = 0] = "ROOT", o[o.POWER = 1] = "POWER", o))(at || {}), D, $e, Zt, Ft;
-const He = class He {
+Ne = new WeakMap(), Oe = new WeakMap(), Te = new WeakMap(), tt = new WeakMap();
+let ie = ve;
+var ct = /* @__PURE__ */ ((o) => (o[o.ROOT = 0] = "ROOT", o[o.POWER = 1] = "POWER", o))(ct || {}), D, $e, Ft, jt;
+const Xe = class Xe {
   constructor(...e) {
     p(this, D);
     // Determine the letters in the linear system, usually ['x', 'y']
     p(this, $e);
-    a(this, "parse", (...e) => (h(this, D, e.map((t) => new H(t))), s(this, Zt).call(this), this));
-    a(this, "clone", () => new He().parse(...s(this, D).map((e) => e.clone())));
+    a(this, "parse", (...e) => (h(this, D, e.map((t) => new X(t))), s(this, Ft).call(this), this));
+    a(this, "clone", () => new Xe().parse(...s(this, D).map((e) => e.clone())));
     a(this, "buildTex", (e, t) => {
       let i, n, r = [];
       const l = [];
@@ -2349,8 +2349,8 @@ const He = class He {
       }
       return i.map((n) => n[n.length - 1]);
     });
-    p(this, Zt, () => (h(this, $e, s(this, D).reduce((e, t) => [.../* @__PURE__ */ new Set([...e, ...t.variables])], [])), s(this, $e).sort(), this));
-    p(this, Ft, () => {
+    p(this, Ft, () => (h(this, $e, s(this, D).reduce((e, t) => [.../* @__PURE__ */ new Set([...e, ...t.variables])], [])), s(this, $e).sort(), this));
+    p(this, jt, () => {
       const e = [], t = [];
       for (const i of s(this, D)) {
         const n = [], r = i.clone().reorder();
@@ -2369,15 +2369,15 @@ const He = class He {
     if (e.some((r) => r.length !== i))
       throw new Error("All rows must have the same number of columns");
     const n = t.split("").splice(0, i - 1);
-    return new He(
+    return new Xe(
       ...e.map((r) => {
-        const l = new O(n.join(""), ...r);
-        return new H(l, 0);
+        const l = new T(n.join(""), ...r);
+        return new X(l, 0);
       })
     );
   }
   add(e, t) {
-    if (e instanceof He) {
+    if (e instanceof Xe) {
       const i = e.equations.length;
       if (i !== s(this, D).length)
         throw new Error("The number of equations must be the same");
@@ -2386,7 +2386,7 @@ const He = class He {
     } else {
       if (t === void 0 || t < 0 || t >= s(this, D).length)
         throw new Error("Index out of range");
-      const i = new H(e);
+      const i = new X(e);
       s(this, D)[t].add(i);
     }
     return this;
@@ -2417,7 +2417,7 @@ const He = class He {
     return this.variables.length === s(this, D).length;
   }
   get matrix() {
-    return s(this, Ft).call(this);
+    return s(this, jt).call(this);
   }
   multiply(e, t) {
     if (Array.isArray(e)) {
@@ -2438,7 +2438,7 @@ const He = class He {
     return [];
   }
   subtract(e, t) {
-    if (e instanceof He) {
+    if (e instanceof Xe) {
       const i = e.equations.length;
       if (i !== s(this, D).length)
         throw new Error("The number of equations must be the same");
@@ -2447,7 +2447,7 @@ const He = class He {
     } else {
       if (t === void 0 || t < 0 || t >= s(this, D).length)
         throw new Error("Index out of range");
-      const i = new H(e);
+      const i = new X(e);
       s(this, D)[t].subtract(i);
     }
     return this;
@@ -2464,26 +2464,26 @@ const He = class He {
     t.sort(), h(this, $e, t);
   }
 };
-D = new WeakMap(), $e = new WeakMap(), Zt = new WeakMap(), Ft = new WeakMap();
-let ii = He;
-var Oe, pt, si;
-class es {
+D = new WeakMap(), $e = new WeakMap(), Ft = new WeakMap(), jt = new WeakMap();
+let ii = Xe;
+var Ae, gt, si;
+class ts {
   /**
    *
    * @param {string} value (optional) Default polynom to parse on class creation
    */
   constructor(e) {
-    p(this, pt);
-    p(this, Oe);
-    a(this, "parse", (e) => (h(this, Oe, new Qt(Fe.SET).parse(e).rpn), this));
-    return h(this, Oe, []), e !== void 0 && this.parse(e), this;
+    p(this, gt);
+    p(this, Ae);
+    a(this, "parse", (e) => (h(this, Ae, new Kt(Fe.SET).parse(e).rpn), this));
+    return h(this, Ae, []), e !== void 0 && this.parse(e), this;
   }
   evaluate(e) {
     this.variables.forEach((i) => {
       Object.hasOwn(e, i) || (e[i] = !1);
     });
     const t = [];
-    for (const i of s(this, Oe))
+    for (const i of s(this, Ae))
       if (console.log(i), i.tokenType === "variable")
         t.push(e[i.token]);
       else if (i.tokenType === "operation")
@@ -2512,11 +2512,11 @@ class es {
     return t.length === 1 && t[0];
   }
   get rpn() {
-    return s(this, Oe);
+    return s(this, Ae);
   }
   get tex() {
     const e = [];
-    for (const t of s(this, Oe))
+    for (const t of s(this, Ae))
       if (t.tokenType === "variable")
         e.push(t);
       else
@@ -2549,23 +2549,23 @@ class es {
     return e[0].token;
   }
   get variables() {
-    return s(this, Oe).filter((e) => e.tokenType === "variable").map((e) => e.token);
+    return s(this, Ae).filter((e) => e.tokenType === "variable").map((e) => e.token);
   }
   vennAB() {
-    return q(this, pt, si).call(this, {
+    return A(this, gt, si).call(this, {
       A: ["A", "AB"],
       B: ["B", "AB"]
     }, ["A", "B", "AB", "E"]);
   }
   vennABC() {
-    return q(this, pt, si).call(this, {
+    return A(this, gt, si).call(this, {
       A: ["A", "AB", "AC", "ABC"],
       B: ["B", "AB", "BC", "ABC"],
       C: ["C", "AC", "BC", "ABC"]
     }, ["A", "B", "C", "AB", "AC", "BC", "ABC", "E"]);
   }
 }
-Oe = new WeakMap(), pt = new WeakSet(), si = function(e, t) {
+Ae = new WeakMap(), gt = new WeakSet(), si = function(e, t) {
   const i = [];
   let n;
   if (t === void 0) {
@@ -2577,7 +2577,7 @@ Oe = new WeakMap(), pt = new WeakSet(), si = function(e, t) {
       ]);
   } else
     n = new Set(t);
-  for (const r of s(this, Oe))
+  for (const r of s(this, Ae))
     if (r.tokenType === "variable")
       e[r.token] === void 0 ? i.push(/* @__PURE__ */ new Set()) : i.push(new Set(e[r.token]));
     else
@@ -2609,34 +2609,34 @@ Oe = new WeakMap(), pt = new WeakSet(), si = function(e, t) {
       }
   return [...i[0]].sort();
 };
-var tt, E, mt, ri, gt, oi;
-const ue = class ue {
+var it, N, Ge, ri, qi, yt, oi;
+const G = class G {
   constructor(...e) {
-    p(this, gt);
-    p(this, tt, at.POWER);
-    p(this, E, []);
+    p(this, yt);
+    p(this, it, ct.POWER);
+    p(this, N, []);
     return this.parse(...e), this;
   }
   parse(...e) {
-    return e.length === 0 ? this : (h(this, E, []), e.forEach((t) => {
+    return e.length === 0 ? this : (h(this, N, []), e.forEach((t) => {
       if (typeof t == "string") {
         const i = t.split(")(").join(")*(").split("*");
-        s(this, E).push(...i.map((n) => new le(n)));
-      } else t instanceof ue ? s(this, E).push(...t.factors.map((i) => i.clone())) : s(this, E).push(new le(t));
+        s(this, N).push(...i.map((n) => new ie(n)));
+      } else t instanceof G ? s(this, N).push(...t.factors.map((i) => i.clone())) : s(this, N).push(new ie(t));
     }), this);
   }
   clone() {
-    return new ue(...s(this, E).map((e) => e.clone()));
+    return new G(...s(this, N).map((e) => e.clone()));
   }
   get tex() {
-    const { num: e, den: t } = q(this, gt, oi).call(this);
+    const { num: e, den: t } = A(this, yt, oi).call(this);
     if (t.length === 0)
       return e.length === 1 ? e[0].asSingle.tex : e.map((r) => r.tex).join("");
     const i = e.length === 1 ? e[0].asSingle.tex : e.map((r) => r.tex).join(""), n = t.length === 1 ? t[0].asSingle.tex : t.map((r) => r.tex).join("");
     return `\\frac{ ${i} }{ ${n} }`;
   }
   get display() {
-    const { num: e, den: t } = q(this, gt, oi).call(this);
+    const { num: e, den: t } = A(this, yt, oi).call(this);
     if (t.length === 0)
       return e.length === 1 ? e[0].asSingle.display : e.map((r) => r.display).join("");
     const i = e.length === 1 ? e[0].asSingle.display : e.map((r) => r.display).join(""), n = t.length === 1 ? t[0].asSingle.display : t.map((r) => r.display).join("");
@@ -2645,75 +2645,115 @@ const ue = class ue {
   static gcd(...e) {
     var i;
     if (e.length === 0)
-      return new ue().one();
+      return new G().one();
     if (e.length === 1)
       return e[0];
     if (e.length === 2)
-      return q(i = ue, mt, ri).call(i, e[0], e[1]);
+      return A(i = G, Ge, ri).call(i, e[0], e[1]);
     let t = e[0];
     return e.shift(), e.forEach((n) => {
       var r;
-      return t = q(r = ue, mt, ri).call(r, t, n);
+      return t = A(r = G, Ge, ri).call(r, t, n);
+    }), t;
+  }
+  static lcm(...e) {
+    if (e.length === 0)
+      return new G().one();
+    if (e.length === 1)
+      return e[0];
+    let t = e[0];
+    return e.shift(), e.forEach((i) => {
+      var n;
+      return t = A(n = G, Ge, qi).call(n, t, i);
     }), t;
   }
   add(...e) {
-    let t = [this, ...e];
-    const i = ue.gcd(...t);
-    t = t.map((r) => r.divide(i).reduce());
-    const n = new O("0");
-    return t.forEach((r) => n.add(r.develop())), h(this, E, [
-      ...i.factors,
-      new le(n)
-    ]), this;
+    const t = [this.numerator, ...e.map((c) => c.numerator)], i = [this.denominator, ...e.map((c) => c.denominator)];
+    let n;
+    if (i.some((c) => c.factors.length > 0)) {
+      const c = G.lcm(...i);
+      t.forEach((d, f) => {
+        d.multiply(c.clone().divide(i[f]));
+      }), n = c;
+    }
+    const r = G.gcd(...t), l = new T(0).add(
+      ...t.map((c) => c.divide(r).reduce().develop().factors[0].polynom)
+    );
+    return h(this, N, [
+      ...r.factors,
+      new ie(l)
+    ]), n && this.divide(n), h(this, N, s(this, N).filter((c) => !c.power.isZero())), this;
   }
   get asPower() {
-    return h(this, tt, at.POWER), this;
+    return h(this, it, ct.POWER), this;
   }
   get asRoot() {
-    return h(this, tt, at.ROOT), this;
+    return h(this, it, ct.ROOT), this;
   }
   degree(e) {
-    return s(this, E).reduce((t, i) => t.add(i.degree(e)), new u("0"));
+    return s(this, N).reduce((t, i) => t.add(i.degree(e)), new u("0"));
   }
   get denominator() {
-    return new ue(...s(this, E).filter((e) => e.power.isNegative()));
+    return new G(
+      ...s(this, N).filter((e) => e.power.isNegative()).map((e) => e.clone().inverse())
+    );
   }
   derivative() {
-    const e = [], t = s(this, E).length;
+    const e = [], t = s(this, N).length;
     for (let n = 0; n < t; n++) {
-      const r = s(this, E).slice(), l = r.splice(n, 1)[0];
-      e.push(new ue(...r).multiply(new ue(...l.derivative())));
+      const r = s(this, N).slice(), l = r.splice(n, 1)[0];
+      e.push(new G(...r).multiply(new G(...l.derivative())));
     }
     e.forEach((n) => n.reduce());
     const i = e.shift();
-    return i !== void 0 && h(this, E, i.factors), this.add(...e);
+    return i !== void 0 && h(this, N, i.factors), this.add(...e);
   }
   develop() {
-    const e = new O("1");
-    return s(this, E).forEach((t) => {
-      e.multiply(t.develop());
-    }), e;
+    const e = new T("1"), t = new T("1");
+    return this.numerator.factors.forEach((i) => {
+      e.multiply(i.develop());
+    }), this.denominator.factors.forEach((i) => {
+      t.multiply(i.develop());
+    }), new G().fromPolynom(e, t);
   }
   divide(e) {
-    return h(this, E, s(this, E).concat(e.clone().factors.map((t) => t.inverse()))), this;
+    return h(this, N, s(this, N).concat(e.clone().factors.map((t) => t.inverse()))), this;
   }
   evaluate(e, t) {
-    return t ? s(this, E).reduce((i, n) => i * n.evaluate(e, t), 1) : s(this, E).reduce((i, n) => i.multiply(n.evaluate(e)), new u("1"));
+    return t ? s(this, N).reduce((i, n) => i * n.evaluate(e, t), 1) : s(this, N).reduce((i, n) => i.multiply(n.evaluate(e)), new u("1"));
+  }
+  factorize(e) {
+    const t = [];
+    s(this, N).forEach((l) => {
+      const c = l.polynom.factorize(e);
+      if (c.length > 1) {
+        const d = l.power.clone();
+        t.push(...c.map((f) => new ie(f, d)));
+      } else
+        t.push(l.clone());
+    });
+    const i = new G(...t), n = i.numerator.reduce(), r = i.denominator.reduce();
+    return n.divide(r);
   }
   get factors() {
-    return s(this, E);
+    return s(this, N);
   }
   set factors(e) {
-    h(this, E, e);
-  }
-  fromPolynom(e, t, i) {
-    return h(this, E, new O(e).factorize(i).map((n) => new le(n))), t && new O(t).factorize(i).forEach((n) => s(this, E).push(new le(n, -1))), this;
+    h(this, N, e);
   }
-  getFactors() {
-    return s(this, E);
+  fromPolynom(e, t) {
+    if (h(this, N, [new ie(new T(e))]), t) {
+      const i = new T(t);
+      if (i.isOne())
+        return this;
+      if (i.isZero())
+        throw new Error("Cannot divide by zero");
+      s(this, N).push(new ie(i, -1));
+    }
+    return this;
   }
   getZeroes() {
-    const e = [].concat(...s(this, E).map((t) => t.polynom.getZeroes()));
+    const e = [].concat(...s(this, N).map((t) => t.polynom.getZeroes()));
     return e.sort((t, i) => t.value - i.value), e.filter(
       (t, i, n) => i === n.findIndex(
         (r) => r.value === t.value
@@ -2721,63 +2761,63 @@ const ue = class ue {
     );
   }
   hasVariable(e) {
-    return s(this, E).some((t) => t.hasVariable(e));
+    return s(this, N).some((t) => t.hasVariable(e));
   }
   inverse() {
-    return h(this, E, s(this, E).map((e) => e.inverse())), this;
+    return h(this, N, s(this, N).map((e) => e.inverse())), this;
   }
   isEqual(e) {
-    const t = ue.gcd(this, e), i = this.clone().divide(t).reduce(), n = e.clone().divide(t).reduce();
+    const t = G.gcd(this, e), i = this.clone().divide(t).reduce(), n = e.clone().divide(t).reduce();
     return i.isOne() && n.isOne();
   }
   isOne() {
-    return s(this, E).every((e) => e.isOne());
+    return s(this, N).every((e) => e.isOne());
   }
   isZero() {
-    return s(this, E).every((e) => e.isZero());
+    return s(this, N).every((e) => e.isZero());
   }
   multiply(...e) {
     return e.forEach((t) => {
-      h(this, E, s(this, E).concat(t.clone().factors));
+      h(this, N, s(this, N).concat(t.clone().factors));
     }), this;
   }
   get numerator() {
-    return new ue(...s(this, E).filter((e) => e.power.isPositive()));
+    return new G(...s(this, N).filter((e) => e.power.isPositive()));
   }
   one() {
-    return h(this, E, [new le("1", "1")]), this;
+    return h(this, N, [new ie("1", "1")]), this;
   }
   opposite() {
-    const e = s(this, E).findIndex((t) => t.display === "(-1)");
-    return e >= 0 ? s(this, E).splice(e, 1) : s(this, E).push(new le("-1", "1")), this;
+    const e = s(this, N).findIndex((t) => t.display === "(-1)");
+    return e >= 0 ? s(this, N).splice(e, 1) : s(this, N).push(new ie("-1", "1")), this;
   }
   pow(e) {
-    return h(this, E, s(this, E).map((t) => t.pow(e))), this;
+    return h(this, N, s(this, N).map((t) => t.pow(e))), this;
   }
   primitive() {
     throw new Error("Method not implemented.");
   }
   reduce() {
-    const e = ei(this);
-    return h(this, E, Object.values(e).map((t) => {
+    const e = ht(this);
+    return h(this, N, Object.values(e).map((t) => {
       const i = t[0].polynom, n = t.reduce((r, l) => r.add(l.power), new u("0"));
-      return new le(i, n.reduce());
+      return new ie(i, n.reduce());
     }).filter((t) => !t.power.isZero())), this;
   }
   root(e) {
-    return h(this, E, s(this, E).map((t) => t.root(e))), this;
+    return h(this, N, s(this, N).map((t) => t.root(e))), this;
   }
   sort() {
-    return h(this, E, s(this, E).sort((e, t) => e.degree().isLeq(t.degree()) ? -1 : 1)), this;
+    return h(this, N, s(this, N).sort((e, t) => e.degree().isLeq(t.degree()) ? -1 : 1)), this;
   }
   sqrt() {
-    return h(this, E, s(this, E).map((e) => e.sqrt())), this;
+    return h(this, N, s(this, N).map((e) => e.sqrt())), this;
   }
   subtract(...e) {
     return this.add(...e.map((t) => t.opposite()));
   }
   tableOfSigns() {
-    const e = this.getZeroes(), t = this.factors.map((n) => ({ factor: new le(n), ...n.tableOfSigns(e) }));
+    const e = this.getZeroes(), t = this.factors.map((n) => ({ factor: new ie(n), ...n.tableOfSigns(e) }));
     return { signs: t.map((n) => n.signs).reduce((n, r) => (n.length === 0 ? n = r : r.forEach((l, c) => {
       switch (l) {
         case "d":
@@ -2796,38 +2836,44 @@ const ue = class ue {
     }), n), []), roots: e, factors: t };
   }
   get variables() {
-    return s(this, E).reduce((e, t) => e.concat(t.variables), []);
+    return s(this, N).reduce((e, t) => e.concat(t.variables), []);
   }
   zero() {
-    return h(this, E, [new le("0", "1")]), this;
+    return h(this, N, [new ie("0", "1")]), this;
   }
 };
-tt = new WeakMap(), E = new WeakMap(), mt = new WeakSet(), ri = function(e, t) {
-  const i = ei(e), n = ei(t), l = Object.keys(i).filter((c) => Object.hasOwn(n, c)).map((c) => {
-    const d = i[c].reduce((g, N) => g.add(N.power), new u("0")), f = n[c].reduce((g, N) => g.add(N.power), new u("0"));
-    return new le(c, u.min(d, f));
+it = new WeakMap(), N = new WeakMap(), Ge = new WeakSet(), ri = function(e, t) {
+  const i = ht(e), n = ht(t), l = Object.keys(i).filter((c) => Object.hasOwn(n, c)).map((c) => {
+    const d = i[c].reduce((g, x) => g.add(x.power), new u("0")), f = n[c].reduce((g, x) => g.add(x.power), new u("0"));
+    return new ie(c, u.min(d, f));
   });
-  return new ue(...l);
-}, gt = new WeakSet(), oi = function() {
+  return new G(...l);
+}, qi = function(e, t) {
+  const i = ht(e), n = ht(t), l = [.../* @__PURE__ */ new Set([...Object.keys(i), ...Object.keys(n)])].map((c) => {
+    const d = Object.hasOwn(i, c) ? i[c].reduce((g, x) => g.add(x.power), new u("0")) : new u(0), f = Object.hasOwn(n, c) ? n[c].reduce((g, x) => g.add(x.power), new u("0")) : new u(0);
+    return new ie(c, u.max(d, f));
+  });
+  return new G(...l);
+}, yt = new WeakSet(), oi = function() {
   let e, t = [];
-  return s(this, tt) === at.ROOT ? (e = this.numerator.factors, t = this.denominator.factors.map((i) => i.clone().inverse())) : e = s(this, E), e.length === 0 && (e = [new le("1")]), { num: e, den: t };
-}, p(ue, mt);
-let ni = ue;
-function ei(o) {
+  return s(this, it) === ct.ROOT ? (e = this.numerator.factors, t = this.denominator.factors) : e = s(this, N), e.length === 0 && (e = [new ie("1")]), { num: e, den: t };
+}, p(G, Ge);
+let ni = G;
+function ht(o) {
   const e = new u().one(), t = o.factors.reduce((i, n) => {
     if (n.polynom.degree().isZero())
       return n.polynom.monoms.length > 0 && e.multiply(n.polynom.monoms[0].coefficient), i;
     const r = n.polynom.display;
     return Object.hasOwn(i, r) ? i[r].push(n) : i[r] = [n], i;
   }, {});
-  return e.isOne() || (t[e.display] = [new le(e.display, 1)]), t;
+  return e.isOne() || (t[e.display] = [new ie(e.display, 1)]), t;
 }
-function ts(o, e) {
+function is(o, e) {
   return o.dimension === e.dimension && o.array.every(
     (t, i) => e.array[i].isEqual(t)
   );
 }
-function is(o, e) {
+function ss(o, e) {
   if (o.dimension !== e.dimension)
     return !1;
   const t = e.array[0].value / o.array[0].value;
@@ -2835,13 +2881,13 @@ function is(o, e) {
     (i, n) => e.array[n].value === i.value * t
   );
 }
-function ss(o, e) {
+function ns(o, e) {
   return o.dimension !== e.dimension ? new u().invalid() : o.array.reduce(
     (t, i, n) => t.add(i.clone().multiply(e.array[n])),
     new u(0)
   );
 }
-function ns(...o) {
+function rs(...o) {
   return o.some((e) => e.dimension !== o[0].dimension) ? new u().invalid() : o[0].dimension === 2 && o.length !== 2 ? new u().invalid() : o[0].dimension === 3 && o.length !== 3 ? new u().invalid() : o[0].dimension === 2 ? o[0].array[0].clone().multiply(o[1].array[1]).subtract(o[0].array[1].clone().multiply(o[1].array[0])) : o[0].array[0].clone().multiply(
     o[1].array[1].clone().multiply(o[2].array[2]).subtract(o[1].array[2].clone().multiply(o[2].array[1]))
   ).subtract(
@@ -2864,15 +2910,15 @@ const Se = class Se {
       const e = this.norm;
       return e === 0 ? this : this.divideByScalar(e);
     });
-    a(this, "dot", (e) => ss(this, e));
+    a(this, "dot", (e) => ns(this, e));
     a(this, "normal", () => {
       if (this.dimension >= 3)
         throw new Error("Normal vector can only be determined in 2D");
       const e = this.x.clone().opposite(), t = this.y.clone();
       return s(this, F)[0] = t, s(this, F)[1] = e, this;
     });
-    a(this, "isEqual", (e) => ts(this, e));
-    a(this, "isColinearTo", (e) => is(this, e));
+    a(this, "isEqual", (e) => is(this, e));
+    a(this, "isColinearTo", (e) => ss(this, e));
     a(this, "isNormalTo", (e) => this.dot(e).isZero());
     a(this, "multiplyByScalar", (e) => {
       const t = new u(e);
@@ -2880,9 +2926,9 @@ const Se = class Se {
     });
     a(this, "divideByScalar", (e) => this.multiplyByScalar(new u(e).inverse()));
     a(this, "simplify", () => this.multiplyByScalar(
-      G.lcm(...this.array.map((e) => e.denominator))
+      W.lcm(...this.array.map((e) => e.denominator))
     ).divideByScalar(
-      G.gcd(...this.array.map((e) => e.numerator))
+      W.gcd(...this.array.map((e) => e.numerator))
     ).multiplyByScalar(
       this.x.isNegative() ? -1 : 1
     ));
@@ -3036,9 +3082,9 @@ const Se = class Se {
   }
 };
 F = new WeakMap(), De = new WeakMap();
-let x = Se;
+let E = Se;
 var we = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Perpendicular = "perpendicular", o.Tangent = "tangent", o))(we || {}), hi = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Perpendicular = "perpendicular", o.Tangent = "tangent", o))(hi || {});
-function qi(o = 0.5) {
+function Mi(o = 0.5) {
   return Math.random() < o;
 }
 function de(o, e, t) {
@@ -3055,14 +3101,14 @@ function de(o, e, t) {
     i = de(o, e);
   return i;
 }
-function Y(o, e) {
-  return e === !1 ? qi() ? de(1, o) : -de(1, o) : de(-o, o);
+function Q(o, e) {
+  return e === !1 ? Mi() ? de(1, o) : -de(1, o) : de(-o, o);
 }
-function rs(o) {
-  let e = G.primes();
+function os(o) {
+  let e = W.primes();
   return o !== void 0 && (e = e.filter((t) => t < o)), pi(e);
 }
-function os(o, e) {
+function hs(o, e) {
   return e === void 0 && (e = 1), o.length <= 0 ? Object.values(o) : ki(o).slice(0, e);
 }
 function pi(o) {
@@ -3076,19 +3122,19 @@ function ki(o) {
   }
   return e;
 }
-class B extends x {
+class B extends E {
   constructor(...e) {
     super(), e.length > 0 && this.parse(...e);
   }
   parse(...e) {
     if (this.asPoint = !0, e.length === 1) {
-      if (e[0] instanceof x)
+      if (e[0] instanceof E)
         return this.array = e[0].copy(), this;
       if (typeof e[0] == "string")
         return this.fromString(e[0]), this;
     }
     if (e.length > 1) {
-      if (e.some((i) => i instanceof x))
+      if (e.some((i) => i instanceof E))
         throw new Error("Creating a point with  multiple argument requires an input fraction");
       const t = e.map((i) => new u(i));
       if (t.some((i) => i.isNaN()))
@@ -3102,7 +3148,7 @@ class B extends x {
     return e.array = this.copy(), e.asPoint = !0, e;
   }
 }
-var Ie, S, z, U, ne, Q, Pe, be;
+var Ie, S, z, U, oe, K, Pe, be;
 const Ze = class Ze {
   /**
    * Value can be a mix of:
@@ -3115,19 +3161,19 @@ const Ze = class Ze {
     p(this, S);
     p(this, z);
     p(this, U);
-    p(this, ne);
-    p(this, Q);
+    p(this, oe);
+    p(this, K);
     p(this, Pe);
     p(this, be, "canonical");
     a(this, "randomPoint", (e) => {
-      const t = s(this, Q).clone().multiplyByScalar(Y(e === void 0 || e <= 1 ? 3 : e, !1)).add(s(this, ne));
+      const t = s(this, K).clone().multiplyByScalar(Q(e === void 0 || e <= 1 ? 3 : e, !1)).add(s(this, oe));
       return t.asPoint = !0, t;
     });
     a(this, "randomNearPoint", (e) => {
       const t = this.randomPoint(e);
       let i = 10;
       for (; this.isOnLine(t) && i > 0; )
-        t.x.add(Y(1, !1)), t.y.add(Y(1, !1)), i--;
+        t.x.add(Q(1, !1)), t.y.add(Q(1, !1)), i--;
       return t;
     });
     // ------------------------------------------
@@ -3144,31 +3190,31 @@ const Ze = class Ze {
       if (e.length === 1) {
         if (e[0] instanceof Ze)
           return this.fromCoefficient(e[0].a, e[0].b, e[0].c);
-        if (e[0] instanceof H)
+        if (e[0] instanceof X)
           return this.fromEquation(e[0]);
         if (typeof e[0] == "string")
           try {
-            const t = new H(e[0]);
+            const t = new X(e[0]);
             return this.parse(t);
           } catch {
             return this;
           }
       }
-      if (e.length === 2 && e.every((t) => t instanceof x)) {
+      if (e.length === 2 && e.every((t) => t instanceof E)) {
         const t = e;
         if (t[0].asPoint && t[1].asPoint)
-          return this.fromPointAndDirection(t[0], new x(t[0], t[1]));
+          return this.fromPointAndDirection(t[0], new E(t[0], t[1]));
         if (t[0].asPoint && !t[1].asPoint)
           return this.fromPointAndDirection(t[0], t[1]);
       }
       if (e.length === 3) {
-        if (e[0] instanceof x && e[1] instanceof x) {
+        if (e[0] instanceof E && e[1] instanceof E) {
           if (e[2] === we.Perpendicular)
             return this.fromPointAndNormal(e[0], e[1]);
           if (e[2] === we.Parallel)
             return this.fromPointAndDirection(e[0], e[1]);
         }
-        return e[0] instanceof x && e[1] instanceof Ze ? e[2] === we.Parallel || e[2] === null ? this.fromPointAndLine(e[0], e[1], we.Parallel) : this.fromPointAndLine(e[0], e[1], we.Perpendicular) : this.fromCoefficient(
+        return e[0] instanceof E && e[1] instanceof Ze ? e[2] === we.Parallel || e[2] === null ? this.fromPointAndLine(e[0], e[1], we.Parallel) : this.fromPointAndLine(e[0], e[1], we.Perpendicular) : this.fromCoefficient(
           e[0],
           e[1],
           e[2]
@@ -3189,19 +3235,19 @@ const Ze = class Ze {
         e.left.monomByDegree(0).coefficient
       );
     });
-    a(this, "fromCoefficient", (e, t, i) => (h(this, S, new u(e)), h(this, z, new u(t)), h(this, U, new u(i)), h(this, Q, new x(s(this, z).clone(), s(this, S).clone().opposite())), h(this, ne, new x(new u().zero(), s(this, U).clone())), h(this, Pe, s(this, Q).clone().normal()), this));
+    a(this, "fromCoefficient", (e, t, i) => (h(this, S, new u(e)), h(this, z, new u(t)), h(this, U, new u(i)), h(this, K, new E(s(this, z).clone(), s(this, S).clone().opposite())), h(this, oe, new E(new u().zero(), s(this, U).clone())), h(this, Pe, s(this, K).clone().normal()), this));
     a(this, "fromPointAndDirection", (e, t) => (this.fromCoefficient(
       t.y,
       t.x.clone().opposite(),
       e.x.clone().multiply(t.y).subtract(e.y.clone().multiply(t.x)).opposite()
-    ), h(this, ne, e.clone()), h(this, Q, t.clone()), h(this, Pe, s(this, Q).clone().normal()), this));
+    ), h(this, oe, e.clone()), h(this, K, t.clone()), h(this, Pe, s(this, K).clone().normal()), this));
     a(this, "fromPointAndNormal", (e, t) => this.fromCoefficient(
       t.x,
       t.y,
       e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y)).opposite()
     ));
     a(this, "fromPointAndLine", (e, t, i) => (i === void 0 && (i = we.Parallel), i === we.Parallel ? this.fromPointAndNormal(e, t.normal) : i === we.Perpendicular ? this.fromPointAndNormal(e, t.director) : this));
-    a(this, "clone", () => (h(this, S, s(this, S).clone()), h(this, z, s(this, z).clone()), h(this, U, s(this, U).clone()), h(this, Q, s(this, Q).clone()), h(this, ne, s(this, ne).clone()), h(this, Pe, s(this, Pe).clone()), this));
+    a(this, "clone", () => (h(this, S, s(this, S).clone()), h(this, z, s(this, z).clone()), h(this, U, s(this, U).clone()), h(this, K, s(this, K).clone()), h(this, oe, s(this, oe).clone()), h(this, Pe, s(this, Pe).clone()), this));
     // ------------------------------------------
     // Mathematical operations
     // ------------------------------------------
@@ -3213,14 +3259,14 @@ const Ze = class Ze {
     a(this, "isPerpendicularTo", (e) => this.d.isNormalTo(e.d));
     a(this, "isVertical", () => this.slope.isInfinity());
     a(this, "simplify", () => {
-      const e = G.lcm(s(this, S).denominator, s(this, z).denominator, s(this, U).denominator), t = G.gcd(s(this, S).numerator, s(this, z).numerator, s(this, U).numerator);
+      const e = W.lcm(s(this, S).denominator, s(this, z).denominator, s(this, U).denominator), t = W.gcd(s(this, S).numerator, s(this, z).numerator, s(this, U).numerator);
       return this.fromCoefficient(
         s(this, S).clone().multiply(e).divide(t),
         s(this, z).clone().multiply(e).divide(t),
         s(this, U).clone().multiply(e).divide(t)
       ), this;
     });
-    a(this, "simplifyDirection", () => (s(this, Q).simplify(), this));
+    a(this, "simplifyDirection", () => (s(this, K).simplify(), this));
     a(this, "intersection", (e) => {
       const t = new B();
       let i = !1, n = !1;
@@ -3233,13 +3279,13 @@ const Ze = class Ze {
     });
     a(this, "getValueAtX", (e) => {
       const t = this.getEquation().isolate("y"), i = new u(e);
-      return t instanceof H ? t.right.evaluate({ x: i }) : new u().invalid();
+      return t instanceof X ? t.right.evaluate({ x: i }) : new u().invalid();
     });
     a(this, "getValueAtY", (e) => {
       const t = this.getEquation().isolate("x"), i = new u(e);
-      return t instanceof H ? t.right.evaluate({ y: i }) : new u().invalid();
+      return t instanceof X ? t.right.evaluate({ y: i }) : new u().invalid();
     });
-    return h(this, S, new u().zero()), h(this, z, new u().zero()), h(this, U, new u().zero()), h(this, ne, new x()), h(this, Q, new x()), h(this, Pe, new x()), h(this, Ie, !0), e.length > 0 && this.parse(...e), this;
+    return h(this, S, new u().zero()), h(this, z, new u().zero()), h(this, U, new u().zero()), h(this, oe, new E()), h(this, K, new E()), h(this, Pe, new E()), h(this, Ie, !0), e.length > 0 && this.parse(...e), this;
   }
   get a() {
     return s(this, S);
@@ -3262,23 +3308,23 @@ const Ze = class Ze {
     h(this, U, e);
   }
   get OA() {
-    return s(this, ne);
+    return s(this, oe);
   }
   set OA(e) {
-    h(this, ne, e);
+    h(this, oe, e);
   }
   get d() {
-    return s(this, Q);
+    return s(this, K);
   }
   set d(e) {
-    h(this, Q, e);
+    h(this, K, e);
   }
   get n() {
     return s(this, Pe);
   }
   // ------------------------------------------
   getEquation() {
-    const e = new H(new O().parse("xy", s(this, S), s(this, z), s(this, U)), new O("0"));
+    const e = new X(new T().parse("xy", s(this, S), s(this, z), s(this, U)), new T("0"));
     return s(this, Ie) ? e.simplify() : e;
   }
   // get system(): { x: Equation, y: Equation } {
@@ -3315,13 +3361,13 @@ const Ze = class Ze {
       case "equation":
         return this.getEquation().reorder().tex;
       case "mxh":
-        return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new O().parse("x", this.slope, this.height).tex;
+        return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new T().parse("x", this.slope, this.height).tex;
       case "parametric":
       case "system": {
-        const t = s(this, Q).clone();
-        return s(this, Ie) && t.simplify(), e === "parametric" ? `${x.asTex("x", "y")} = ${x.asTex(s(this, ne).x.tex, s(this, ne).y.tex)} + k\\cdot ${x.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}
-            x &= ${new O(s(this, ne).x).add(new M(s(this, Q).x).multiply(new M("k"))).reorder("k", !0).tex}\\\\ 
-            y &= ${new O(s(this, ne).y).add(new M(s(this, Q).y).multiply(new M("k"))).reorder("k", !0).tex}
+        const t = s(this, K).clone();
+        return s(this, Ie) && t.simplify(), e === "parametric" ? `${E.asTex("x", "y")} = ${E.asTex(s(this, oe).x.tex, s(this, oe).y.tex)} + k\\cdot ${E.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}
+            x &= ${new T(s(this, oe).x).add(new k(s(this, K).x).multiply(new k("k"))).reorder("k", !0).tex}\\\\ 
+            y &= ${new T(s(this, oe).y).add(new k(s(this, K).y).multiply(new k("k"))).reorder("k", !0).tex}
             \\end{aligned}\\right.`;
       }
       default: {
@@ -3342,10 +3388,10 @@ const Ze = class Ze {
       case "equation":
         return this.getEquation().reorder().display;
       case "mxh":
-        return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new O().parse("x", this.slope, this.height).display;
+        return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new T().parse("x", this.slope, this.height).display;
       case "parametric": {
-        const t = s(this, Q).clone();
-        return s(this, Ie) && t.simplify(), `((x,y))=((${s(this, ne).x.display},${s(this, ne).y.display}))+k((${t.x.display},${t.y.display}))`;
+        const t = s(this, K).clone();
+        return s(this, Ie) && t.simplify(), `((x,y))=((${s(this, oe).x.display},${s(this, oe).y.display}))+k((${t.x.display},${t.y.display}))`;
       }
       default: {
         const t = this.getEquation();
@@ -3354,10 +3400,10 @@ const Ze = class Ze {
     }
   }
   get normal() {
-    return new x(s(this, S), s(this, z));
+    return new E(s(this, S), s(this, z));
   }
   get director() {
-    return s(this, Q).clone();
+    return s(this, K).clone();
   }
   get slope() {
     return s(this, S).clone().opposite().divide(s(this, z));
@@ -3366,7 +3412,7 @@ const Ze = class Ze {
     return s(this, U).clone().opposite().divide(s(this, z));
   }
   fromPoints(e, t) {
-    return this.fromPointAndDirection(e, new x(e, t));
+    return this.fromPointAndDirection(e, new E(e, t));
   }
   distanceTo(e) {
     const t = e.x.clone().multiply(s(this, S)).add(e.y.clone().multiply(s(this, z))).add(s(this, U)).abs(), i = this.normal.normSquare;
@@ -3402,14 +3448,14 @@ const Ze = class Ze {
     return s(this, S).isZero() || (s(this, S).isOne() ? t = "x" : s(this, S).clone().opposite().isOne() ? t = "-x" : t = s(this, S).value.toFixed(e) + "x"), s(this, z).isZero() || (s(this, z).isPositive() && (t += "+"), t += s(this, z).value.toFixed(e) + "y"), s(this, U).isZero() || (s(this, U).isPositive() && (t += "+"), t += s(this, U).value.toFixed(e)), t + "=0";
   }
 };
-Ie = new WeakMap(), S = new WeakMap(), z = new WeakMap(), U = new WeakMap(), ne = new WeakMap(), Q = new WeakMap(), Pe = new WeakMap(), be = new WeakMap(), // A line is defined as the canonical form
+Ie = new WeakMap(), S = new WeakMap(), z = new WeakMap(), U = new WeakMap(), oe = new WeakMap(), K = new WeakMap(), Pe = new WeakMap(), be = new WeakMap(), // A line is defined as the canonical form
 a(Ze, "PERPENDICULAR", we.Perpendicular), a(Ze, "PARALLEL", we.Parallel);
 let R = Ze;
-var re, j, qe, jt, Ut, Gt, oe, Mi, Et, Ci, $i, Ii, ai;
-const Wt = class Wt {
+var he, j, qe, Ut, Wt, Gt, ae, Ci, Nt, $i, Ii, Pi, ai;
+const Ht = class Ht {
   constructor(...e) {
-    p(this, oe);
-    p(this, re);
+    p(this, ae);
+    p(this, he);
     p(this, j);
     p(this, qe);
     /**
@@ -3418,9 +3464,9 @@ const Wt = class Wt {
      * @returns {number}
      */
     a(this, "relativePosition", (e) => {
-      if (s(this, re) === void 0 || s(this, j) === void 0)
+      if (s(this, he) === void 0 || s(this, j) === void 0)
         throw new Error("Circle not defined");
-      const t = e.distanceTo(s(this, re)), i = Math.sqrt(s(this, j).value);
+      const t = e.distanceTo(s(this, he)), i = Math.sqrt(s(this, j).value);
       return t.value - i > 1e-10 ? 0 : Math.abs(t.value - i) < 1e-10 ? 1 : 2;
     });
     a(this, "lineIntersection", (e) => {
@@ -3428,15 +3474,15 @@ const Wt = class Wt {
       if (s(this, qe) === void 0)
         return [];
       const i = s(this, qe).clone(), n = e.getEquation().clone().isolate("x"), r = e.getEquation().clone().isolate("y");
-      return n instanceof H && r instanceof H && (i.replaceBy("y", r.right).simplify(), i.solve()), t;
+      return n instanceof X && r instanceof X && (i.replaceBy("y", r.right).simplify(), i.solve()), t;
     });
-    a(this, "tangents", (e) => e instanceof u ? s(this, Gt).call(this, e) : this.isPointOnCircle(e) ? s(this, jt).call(this, e) : s(this, re) !== void 0 && s(this, re).distanceTo(e).value > this.radius.value ? s(this, Ut).call(this, e) : (console.log("No tangents as the point is inside !"), []));
+    a(this, "tangents", (e) => e instanceof u ? s(this, Gt).call(this, e) : this.isPointOnCircle(e) ? s(this, Ut).call(this, e) : s(this, he) !== void 0 && s(this, he).distanceTo(e).value > this.radius.value ? s(this, Wt).call(this, e) : (console.log("No tangents as the point is inside !"), []));
     a(this, "isPointOnCircle", (e) => {
       var t;
       return ((t = s(this, qe)) == null ? void 0 : t.test({ x: e.x, y: e.y })) ?? !1;
     });
     a(this, "getPointsOnCircle", (e) => {
-      const t = G.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), i = [];
+      const t = W.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), i = [];
       return t.forEach((n) => {
         for (const r of [[1, 1], [-1, 1], [-1, -1], [1, -1]])
           i.push(
@@ -3447,15 +3493,15 @@ const Wt = class Wt {
           );
       }), i;
     });
-    p(this, jt, (e) => {
-      const t = new x(this.center, e);
+    p(this, Ut, (e) => {
+      const t = new E(this.center, e);
       return [new R(e, t, we.Perpendicular)];
     });
-    p(this, Ut, (e) => {
-      const t = this.center.x.clone().subtract(e.x), i = this.center.y.clone().subtract(e.y), n = new O("x"), r = new O("x^2+1");
-      return n.multiply(t).subtract(i).pow(2), r.multiply(this.squareRadius), new H(n, r).solve().map((d) => {
+    p(this, Wt, (e) => {
+      const t = this.center.x.clone().subtract(e.x), i = this.center.y.clone().subtract(e.y), n = new T("x"), r = new T("x^2+1");
+      return n.multiply(t).subtract(i).pow(2), r.multiply(this.squareRadius), new X(n, r).solve().map((d) => {
         let f;
-        const g = new H("y", "x");
+        const g = new X("y", "x");
         return d.exact instanceof u ? (f = e.x.clone().opposite().multiply(d.exact).add(e.y), g.right.multiply(d.exact).add(f)) : (f = e.x.clone().opposite().multiply(d.value).add(e.y), g.right.multiply(d.value).add(f)), new R(g);
       });
     });
@@ -3466,7 +3512,7 @@ const Wt = class Wt {
     e.length > 0 && this.parse(...e);
   }
   get center() {
-    return s(this, re) ?? new B();
+    return s(this, he) ?? new B();
   }
   get squareRadius() {
     return s(this, j) ?? new u(0);
@@ -3499,17 +3545,17 @@ const Wt = class Wt {
     return this.center.x.isZero() ? e = "x^2" : e = `(x${this.center.x.isNegative() ? "+" : "-"}${this.center.x.clone().abs().tex})^2`, this.center.y.isZero() ? t = "y^2" : t = `(y${this.center.y.isNegative() ? "+" : "-"}${this.center.y.clone().abs().tex})^2`, `${e}+${t}=${this.squareRadius.display}`;
   }
   clone() {
-    return new Wt(
+    return new Ht(
       this.center.clone(),
       this.squareRadius.clone(),
       !0
     );
   }
   setRadius(e, t) {
-    return t ? h(this, j, new u(e)) : h(this, j, new u(e).pow(2)), q(this, oe, Et).call(this), this;
+    return t ? h(this, j, new u(e)) : h(this, j, new u(e).pow(2)), A(this, ae, Nt).call(this), this;
   }
   parse(...e) {
-    return q(this, oe, Mi).call(this), typeof e[0] == "string" ? q(this, oe, ai).call(this, new H(e[0])) : e[0] instanceof H ? q(this, oe, ai).call(this, e[0]) : e[0] instanceof Wt ? q(this, oe, Ci).call(this, e[0]) : e[0] instanceof B && e.length > 1 && (e[1] instanceof B ? e[2] instanceof B || q(this, oe, Ii).call(this, e[0], e[1]) : (e[1] instanceof u || typeof e[1] == "number") && q(this, oe, $i).call(this, e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), q(this, oe, Et).call(this), this;
+    return A(this, ae, Ci).call(this), typeof e[0] == "string" ? A(this, ae, ai).call(this, new X(e[0])) : e[0] instanceof X ? A(this, ae, ai).call(this, e[0]) : e[0] instanceof Ht ? A(this, ae, $i).call(this, e[0]) : e[0] instanceof B && e.length > 1 && (e[1] instanceof B ? e[2] instanceof B || A(this, ae, Pi).call(this, e[0], e[1]) : (e[1] instanceof u || typeof e[1] == "number") && A(this, ae, Ii).call(this, e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), A(this, ae, Nt).call(this), this;
   }
   // private _parseThroughtThreePoints(A: Point, B: Point, C: Point): this {
   //     const T = new Triangle(A, B, C), mAB = T.remarquables.mediators.AB.clone(),
@@ -3518,35 +3564,35 @@ const Wt = class Wt {
   //     return this
   // }
 };
-re = new WeakMap(), j = new WeakMap(), qe = new WeakMap(), jt = new WeakMap(), Ut = new WeakMap(), Gt = new WeakMap(), oe = new WeakSet(), Mi = function() {
-  return h(this, re, void 0), h(this, j, void 0), h(this, qe, void 0), this;
-}, Et = function() {
-  h(this, qe, new H(
-    new O(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`),
-    new O(this.squareRadius.display)
+he = new WeakMap(), j = new WeakMap(), qe = new WeakMap(), Ut = new WeakMap(), Wt = new WeakMap(), Gt = new WeakMap(), ae = new WeakSet(), Ci = function() {
+  return h(this, he, void 0), h(this, j, void 0), h(this, qe, void 0), this;
+}, Nt = function() {
+  h(this, qe, new X(
+    new T(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`),
+    new T(this.squareRadius.display)
   ).moveLeft());
-}, Ci = function(e) {
-  return h(this, re, e.center.clone()), h(this, j, e.squareRadius.clone()), q(this, oe, Et).call(this), this;
-}, $i = function(e, t, i) {
-  return h(this, re, e.clone()), i ? h(this, j, new u(t)) : h(this, j, new u(t).pow(2)), this;
-}, Ii = function(e, t) {
-  return h(this, re, e.clone()), h(this, j, new x(s(this, re), t).normSquare), this;
+}, $i = function(e) {
+  return h(this, he, e.center.clone()), h(this, j, e.squareRadius.clone()), A(this, ae, Nt).call(this), this;
+}, Ii = function(e, t, i) {
+  return h(this, he, e.clone()), i ? h(this, j, new u(t)) : h(this, j, new u(t).pow(2)), this;
+}, Pi = function(e, t) {
+  return h(this, he, e.clone()), h(this, j, new E(s(this, he), t).normSquare), this;
 }, ai = function(e) {
   if (e.moveLeft(), e.degree("x").value === 2 && e.degree("y").value === 2) {
     const t = e.left.monomByDegree(2, "x"), i = e.left.monomByDegree(2, "y");
     let n, r, l;
-    t.coefficient.isEqual(i.coefficient) ? (e.divide(t.coefficient), n = e.left.monomByDegree(1, "x"), r = e.left.monomByDegree(1, "y"), l = e.left.monomByDegree(0), h(this, re, new B(n.coefficient.clone().divide(2).opposite(), r.coefficient.clone().divide(2).opposite())), h(this, j, l.coefficient.clone().opposite().add(s(this, re).x.clone().pow(2)).add(s(this, re).y.clone().pow(2)))) : (h(this, re, void 0), h(this, j, void 0));
+    t.coefficient.isEqual(i.coefficient) ? (e.divide(t.coefficient), n = e.left.monomByDegree(1, "x"), r = e.left.monomByDegree(1, "y"), l = e.left.monomByDegree(0), h(this, he, new B(n.coefficient.clone().divide(2).opposite(), r.coefficient.clone().divide(2).opposite())), h(this, j, l.coefficient.clone().opposite().add(s(this, he).x.clone().pow(2)).add(s(this, he).y.clone().pow(2)))) : (h(this, he, void 0), h(this, j, void 0));
   }
   return this;
 };
-let Tt = Wt;
-var L, W;
-const lt = class lt {
+let Tt = Ht;
+var L, H;
+const ut = class ut {
   constructor(e, t) {
     // ax + by + c = 0
     p(this, L, new B());
-    p(this, W, new x());
-    a(this, "clone", () => (h(this, W, s(this, W).clone()), h(this, L, s(this, L).clone()), this));
+    p(this, H, new E());
+    a(this, "clone", () => (h(this, H, s(this, H).clone()), h(this, L, s(this, L).clone()), this));
     // ------------------------------------------
     // Mathematical operations
     // ------------------------------------------
@@ -3586,14 +3632,14 @@ const lt = class lt {
     //     return new Fraction().invalid()
     // }
     a(this, "randomPoint", (e = 5) => {
-      const t = s(this, L).clone(), i = new u(Y(e, !1));
+      const t = s(this, L).clone(), i = new u(Q(e, !1));
       return new B(
-        t.x.clone().add(s(this, W).x.clone().multiply(i)),
-        t.y.clone().add(s(this, W).y.clone().multiply(i)),
-        t.z.clone().add(s(this, W).z.clone().multiply(i))
+        t.x.clone().add(s(this, H).x.clone().multiply(i)),
+        t.y.clone().add(s(this, H).y.clone().multiply(i)),
+        t.z.clone().add(s(this, H).z.clone().multiply(i))
       );
     });
-    return h(this, L, e.clone()), h(this, W, t.asPoint ? new x(e, t) : t.clone()), this;
+    return h(this, L, e.clone()), h(this, H, t.asPoint ? new E(e, t) : t.clone()), this;
   }
   get OA() {
     return s(this, L);
@@ -3605,35 +3651,35 @@ const lt = class lt {
     return s(this, L).clone();
   }
   get d() {
-    return s(this, W);
+    return s(this, H);
   }
   set d(e) {
-    h(this, W, e);
+    h(this, H, e);
   }
   get tex() {
     return {
-      parametric: `${x.asTex("x", "y", "z")} = ${x.asTex(s(this, L).x.tex, s(this, L).y.tex, s(this, L).z.tex)} + k\\cdot ${x.asTex(s(this, W).x.tex, s(this, W).y.tex, s(this, W).z.tex)}`,
+      parametric: `${E.asTex("x", "y", "z")} = ${E.asTex(s(this, L).x.tex, s(this, L).y.tex, s(this, L).z.tex)} + k\\cdot ${E.asTex(s(this, H).x.tex, s(this, H).y.tex, s(this, H).z.tex)}`,
       system: `\\left\\{\\begin{aligned}
-    x &= ${new O(s(this, L).x).add(new M(s(this, W).x).multiply(new M("k"))).reorder("k", !0).tex}\\\\ 
-    y &= ${new O(s(this, L).y).add(new M(s(this, W).y).multiply(new M("k"))).reorder("k", !0).tex}\\\\
-    z &= ${new O(s(this, L).z).add(new M(s(this, W).z).multiply(new M("k"))).reorder("k", !0).tex}
+    x &= ${new T(s(this, L).x).add(new k(s(this, H).x).multiply(new k("k"))).reorder("k", !0).tex}\\\\ 
+    y &= ${new T(s(this, L).y).add(new k(s(this, H).y).multiply(new k("k"))).reorder("k", !0).tex}\\\\
+    z &= ${new T(s(this, L).z).add(new k(s(this, H).z).multiply(new k("k"))).reorder("k", !0).tex}
 \\end{aligned}\\right.`,
-      cartesian: `\\frac{ ${new O("x", 1, s(this, L).x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new O("y", 1, s(this, L).y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new O("z", 1, s(this, L).z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
+      cartesian: `\\frac{ ${new T("x", 1, s(this, L).x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new T("y", 1, s(this, L).y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new T("z", 1, s(this, L).z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
     };
   }
   get display() {
     const e = s(this, L).x.display, t = s(this, L).y.display, i = s(this, L).z.display, n = this.direction.simplify(), r = n.x.display, l = n.y.display, c = n.z.display;
     return {
-      parametric: `${x.asDisplay("x", "y", "z")} = ${x.asDisplay(s(this, L).x.display, s(this, L).y.display, s(this, L).z.display)} + k\\cdot ${x.asDisplay(s(this, W).x.display, s(this, W).y.display, s(this, W).z.display)}`,
+      parametric: `${E.asDisplay("x", "y", "z")} = ${E.asDisplay(s(this, L).x.display, s(this, L).y.display, s(this, L).z.display)} + k\\cdot ${E.asDisplay(s(this, H).x.display, s(this, H).y.display, s(this, H).z.display)}`,
       system: "",
       cartesian: `(x-${e})/${r} = (y-${t})/${l} = (z-${i})/${c}`
     };
   }
   get direction() {
-    return s(this, W).clone();
+    return s(this, H).clone();
   }
   distanceTo(e) {
-    const t = new x(s(this, L), e), i = this.direction, n = this.direction.normSquare, r = t.cross(i).normSquare, l = r.clone().divide(n), c = l.clone().sqrt();
+    const t = new E(s(this, L), e), i = this.direction, n = this.direction.normSquare, r = t.cross(i).normSquare, l = r.clone().divide(n), c = l.clone().sqrt();
     return console.log("CROSS", t.cross(i).display), {
       value: Math.sqrt(l.value),
       fraction: l.clone().sqrt(),
@@ -3642,74 +3688,74 @@ const lt = class lt {
   }
   hitSegment(e, t) {
     const i = this.intersection(
-      new lt(e, t)
+      new ut(e, t)
     );
     return i.hasIntersection ? i.point.x.value >= Math.min(e.x.value, t.x.value) && i.point.x.value <= Math.max(e.x.value, t.x.value) && i.point.y.value >= Math.min(e.y.value, t.y.value) && i.point.y.value <= Math.max(e.y.value, t.y.value) && i.point.z.value >= Math.min(e.z.value, t.z.value) && i.point.z.value <= Math.max(e.z.value, t.z.value) : !1;
   }
 };
-L = new WeakMap(), W = new WeakMap(), // A line is defined as the canonical form
-a(lt, "PERPENDICULAR", hi.Perpendicular), a(lt, "PARALLEL", hi.Parallel);
-let At = lt;
-var ke;
-class hs {
+L = new WeakMap(), H = new WeakMap(), // A line is defined as the canonical form
+a(ut, "PERPENDICULAR", hi.Perpendicular), a(ut, "PARALLEL", hi.Parallel);
+let At = ut;
+var Me;
+class as {
   constructor(...e) {
-    p(this, ke, []);
-    return h(this, ke, e), this;
+    p(this, Me, []);
+    return h(this, Me, e), this;
   }
   get values() {
-    return s(this, ke);
+    return s(this, Me);
   }
   get array() {
-    return s(this, ke).map((e) => e.array);
+    return s(this, Me).map((e) => e.array);
   }
   get dimension() {
-    return [s(this, ke).length, s(this, ke)[0].dimension];
+    return [s(this, Me).length, s(this, Me)[0].dimension];
   }
   isSquare() {
-    return s(this, ke).length === s(this, ke)[0].dimension;
+    return s(this, Me).length === s(this, Me)[0].dimension;
   }
   determinant() {
     if (!this.isSquare())
       throw new Error("Matrix is not square");
-    return ns(...this.values);
+    return rs(...this.values);
   }
 }
-ke = new WeakMap();
-var Me, Ge;
+Me = new WeakMap();
+var ke, We;
 const gi = class gi {
   constructor(e) {
-    p(this, Me, new x(0, 0, 1));
-    p(this, Ge, new B(0, 0, 0));
+    p(this, ke, new E(0, 0, 1));
+    p(this, We, new B(0, 0, 0));
     return e && this.parse(e), this;
   }
   get normal() {
-    return s(this, Me);
+    return s(this, ke);
   }
   set normal(e) {
-    h(this, Me, e), s(this, Me).asPoint = !1;
+    h(this, ke, e), s(this, ke).asPoint = !1;
   }
   get point() {
-    return s(this, Ge);
+    return s(this, We);
   }
   set point(e) {
-    h(this, Ge, e), s(this, Ge).asPoint = !0;
+    h(this, We, e), s(this, We).asPoint = !0;
   }
   get a() {
-    return s(this, Me).x;
+    return s(this, ke).x;
   }
   get b() {
-    return s(this, Me).y;
+    return s(this, ke).y;
   }
   get c() {
-    return s(this, Me).z;
+    return s(this, ke).z;
   }
   get d() {
-    return s(this, Me).dot(s(this, Ge)).opposite();
+    return s(this, ke).dot(s(this, We)).opposite();
   }
   get tex() {
-    return new H(
-      new O("xyz", this.a, this.b, this.c, this.d),
-      new O(0)
+    return new X(
+      new T("xyz", this.a, this.b, this.c, this.d),
+      new T(0)
     ).reduce().tex;
   }
   parse(e) {
@@ -3726,17 +3772,17 @@ const gi = class gi {
     }
     if (e.equation) {
       const r = e.equation.moveLeft().reduce().left, l = r.monomByLetter("x").coefficient, c = r.monomByLetter("y").coefficient, d = r.monomByLetter("z").coefficient, f = r.monomByDegree(0).coefficient;
-      this.normal = new x(l, c, d), l.isNotZero() ? this.point = new B(f.clone().divide(l).opposite(), 0, 0) : c.isNotZero() ? this.point = new B(0, f.clone().divide(c).opposite(), 0) : this.point = new B(0, 0, f.clone().divide(d).opposite());
+      this.normal = new E(l, c, d), l.isNotZero() ? this.point = new B(f.clone().divide(l).opposite(), 0, 0) : c.isNotZero() ? this.point = new B(0, f.clone().divide(c).opposite(), 0) : this.point = new B(0, 0, f.clone().divide(d).opposite());
       return;
     }
-    if (((i = e.points) == null ? void 0 : i.length) === 3 && e.points.every((r) => r instanceof x)) {
-      const r = e.points[0], l = e.points[1], c = e.points[2], d = new x(r, l), f = new x(r, c);
+    if (((i = e.points) == null ? void 0 : i.length) === 3 && e.points.every((r) => r instanceof E)) {
+      const r = e.points[0], l = e.points[1], c = e.points[2], d = new E(r, l), f = new E(r, c);
       this.normal = d.cross(f), this.point = r;
       return;
     }
     if (((n = e.coefficients) == null ? void 0 : n.length) === 4) {
       const [r, l, c, d] = e.coefficients;
-      this.normal = new x(r, l, c), this.point = new B(0, 0, -d);
+      this.normal = new E(r, l, c), this.point = new B(0, 0, -d);
       return;
     }
   }
@@ -3744,7 +3790,7 @@ const gi = class gi {
     if (e instanceof gi)
       return this.normal.angle(e.normal, t, i);
     let n;
-    if (e instanceof x) {
+    if (e instanceof E) {
       if (e.dimension !== 3)
         throw new Error("Vector is not 3D");
       n = e;
@@ -3766,15 +3812,15 @@ const gi = class gi {
     return this.normal.dot(e).add(this.d).isZero();
   }
 };
-Me = new WeakMap(), Ge = new WeakMap();
+ke = new WeakMap(), We = new WeakMap();
 let li = gi;
-var X, K, J, it, Ce, yt, Ht, wt, Be, Xt, st;
-const Yt = class Yt {
+var Y, J, _, st, Ce, wt, Xt, vt, Be, Yt, nt;
+const Qt = class Qt {
   constructor(...e) {
-    p(this, X, new B());
-    p(this, K, new B());
+    p(this, Y, new B());
     p(this, J, new B());
-    p(this, it, {
+    p(this, _, new B());
+    p(this, st, {
       AB: new R(),
       AC: new R(),
       BC: new R()
@@ -3784,7 +3830,7 @@ const Yt = class Yt {
       AC: new B(),
       BC: new B()
     });
-    p(this, yt, null);
+    p(this, wt, null);
     // ------------------------------------------
     // Creation / parsing functions
     // ------------------------------------------
@@ -3801,9 +3847,9 @@ const Yt = class Yt {
         if (t.some((i) => i.isNaN()))
           throw new Error("One of the values is not a valid number");
         return this.parse(
-          new x(t[0], t[1]),
-          new x(t[2], t[3]),
-          new x(t[4], t[5])
+          new E(t[0], t[1]),
+          new E(t[2], t[3]),
+          new E(t[4], t[5])
         );
       } else if (e.length === 3) {
         if (e.every((t) => typeof t == "string"))
@@ -3812,36 +3858,36 @@ const Yt = class Yt {
           );
         if (e.every((t) => t instanceof R)) {
           const t = e[0].clone(), i = e[1].clone(), n = e[2].clone();
-          h(this, it, { AB: t, BC: i, AC: n });
+          h(this, st, { AB: t, BC: i, AC: n });
           let r = t.intersection(i);
           if (r.hasIntersection)
-            h(this, K, r.point.clone());
+            h(this, J, r.point.clone());
           else
             throw new Error("Lines do not intersect !");
           if (r = i.intersection(n), r.hasIntersection)
-            h(this, J, r.point.clone());
+            h(this, _, r.point.clone());
           else
             throw new Error("Lines do not intersect !");
           if (r = n.intersection(t), r.hasIntersection)
-            h(this, X, r.point.clone());
+            h(this, Y, r.point.clone());
           else
             throw new Error("Lines do not intersect !");
-        } else e.every((t) => t instanceof B) && (h(this, X, e[0].clone()), h(this, K, e[1].clone()), h(this, J, e[2].clone()), h(this, it, {
-          AB: new R(s(this, X), s(this, K)),
-          BC: new R(s(this, K), s(this, J)),
-          AC: new R(s(this, X), s(this, J))
+        } else e.every((t) => t instanceof B) && (h(this, Y, e[0].clone()), h(this, J, e[1].clone()), h(this, _, e[2].clone()), h(this, st, {
+          AB: new R(s(this, Y), s(this, J)),
+          BC: new R(s(this, J), s(this, _)),
+          AC: new R(s(this, Y), s(this, _))
         }));
-      } else if (e.length === 1 && e[0] instanceof Yt)
+      } else if (e.length === 1 && e[0] instanceof Qt)
         return e[0].clone();
-      return s(this, Ht).call(this), this;
+      return s(this, Xt).call(this), this;
     });
     /**
      * Clone the Triangle class
      */
-    a(this, "clone", () => new Yt(
-      s(this, X).clone(),
-      s(this, K).clone(),
-      s(this, J).clone()
+    a(this, "clone", () => new Qt(
+      s(this, Y).clone(),
+      s(this, J).clone(),
+      s(this, _).clone()
     ));
     // ------------------------------------------
     // Triangle operations and properties
@@ -3849,54 +3895,54 @@ const Yt = class Yt {
     /**
      * Generate the Line object for the three segments of the triangle
      */
-    p(this, Ht, () => {
-      s(this, X).asPoint = !0, s(this, K).asPoint = !0, s(this, J).asPoint = !0, h(this, Ce, {
-        AB: new B().middleOf(s(this, X), s(this, K)),
-        AC: new B().middleOf(s(this, X), s(this, J)),
-        BC: new B().middleOf(s(this, K), s(this, J))
-      }), h(this, yt, s(this, Xt).call(this));
+    p(this, Xt, () => {
+      s(this, Y).asPoint = !0, s(this, J).asPoint = !0, s(this, _).asPoint = !0, h(this, Ce, {
+        AB: new B().middleOf(s(this, Y), s(this, J)),
+        AC: new B().middleOf(s(this, Y), s(this, _)),
+        BC: new B().middleOf(s(this, J), s(this, _))
+      }), h(this, wt, s(this, Yt).call(this));
     });
     /**
      * Get the Vector2D class for the given name
      * @param ptName
      */
-    p(this, wt, (e) => {
+    p(this, vt, (e) => {
       switch (e.toUpperCase()) {
         case "A":
-          return s(this, X);
+          return s(this, Y);
         case "B":
-          return s(this, K);
-        case "C":
           return s(this, J);
+        case "C":
+          return s(this, _);
       }
-      return s(this, X);
+      return s(this, Y);
     });
     /**
      * Get the vector for the segment given by name.
      * @param ptName1
      * @param ptName2
      */
-    p(this, Be, (e, t) => new x(
-      s(this, wt).call(this, e),
-      s(this, wt).call(this, t)
+    p(this, Be, (e, t) => new E(
+      s(this, vt).call(this, e),
+      s(this, vt).call(this, t)
     ));
-    p(this, Xt, () => {
+    p(this, Yt, () => {
       const e = {
-        A: new R().fromPoints(s(this, X), s(this, Ce).BC),
-        B: new R().fromPoints(s(this, K), s(this, Ce).AC),
-        C: new R().fromPoints(s(this, J), s(this, Ce).AB),
+        A: new R().fromPoints(s(this, Y), s(this, Ce).BC),
+        B: new R().fromPoints(s(this, J), s(this, Ce).AC),
+        C: new R().fromPoints(s(this, _), s(this, Ce).AB),
         intersection: null
       }, t = {
-        AB: new R().fromPointAndNormal(s(this, Ce).AB, new x(s(this, X), s(this, K)).normal()),
-        AC: new R().fromPointAndNormal(s(this, Ce).AC, new x(s(this, X), s(this, J)).normal()),
-        BC: new R().fromPointAndNormal(s(this, Ce).BC, new x(s(this, K), s(this, J)).normal()),
+        AB: new R().fromPointAndNormal(s(this, Ce).AB, new E(s(this, Y), s(this, J)).normal()),
+        AC: new R().fromPointAndNormal(s(this, Ce).AC, new E(s(this, Y), s(this, _)).normal()),
+        BC: new R().fromPointAndNormal(s(this, Ce).BC, new E(s(this, J), s(this, _)).normal()),
         intersection: null
       }, i = {
-        A: new R().fromPointAndNormal(s(this, X), new x(s(this, K), s(this, J)).normal()),
-        B: new R().fromPointAndNormal(s(this, K), new x(s(this, X), s(this, J)).normal()),
-        C: new R().fromPointAndNormal(s(this, J), new x(s(this, X), s(this, K)).normal()),
+        A: new R().fromPointAndNormal(s(this, Y), new E(s(this, J), s(this, _)).normal()),
+        B: new R().fromPointAndNormal(s(this, J), new E(s(this, Y), s(this, _)).normal()),
+        C: new R().fromPointAndNormal(s(this, _), new E(s(this, Y), s(this, J)).normal()),
         intersection: null
-      }, n = s(this, st).call(this, "A"), r = s(this, st).call(this, "B"), l = s(this, st).call(this, "C"), c = {
+      }, n = s(this, nt).call(this, "A"), r = s(this, nt).call(this, "B"), l = s(this, nt).call(this, "C"), c = {
         A: n.internal,
         B: r.internal,
         C: r.internal,
@@ -3915,7 +3961,7 @@ const Yt = class Yt {
       };
       return f.medians.intersection = f.medians.A.intersection(f.medians.B).point, f.mediators.intersection = f.mediators.AB.intersection(f.mediators.BC).point, f.heights.intersection = f.heights.A.intersection(f.heights.B).point, f.bisectors.intersection = f.bisectors.A.intersection(f.bisectors.B).point, f;
     });
-    p(this, st, (e) => {
+    p(this, nt, (e) => {
       const t = this.lines;
       let i, n;
       if (e === "A" ? (i = t.AB, n = t.AC) : e === "B" ? (i = t.AB, n = t.BC) : e === "C" && (i = t.BC, n = t.AC), i === void 0 || n === void 0)
@@ -3929,13 +3975,13 @@ const Yt = class Yt {
   // Getter and setters
   // ------------------------------------------
   get A() {
-    return s(this, X);
+    return s(this, Y);
   }
   get B() {
-    return s(this, K);
+    return s(this, J);
   }
   get C() {
-    return s(this, J);
+    return s(this, _);
   }
   get AB() {
     return s(this, Be).call(this, "A", "B");
@@ -3965,15 +4011,15 @@ const Yt = class Yt {
     return this.AB.normSquare.isEqual(this.BC.normSquare) || this.AB.normSquare.isEqual(this.AC.normSquare) || this.BC.normSquare.isEqual(this.AC.normSquare);
   }
   get lines() {
-    return s(this, it);
+    return s(this, st);
   }
   get remarquables() {
-    return s(this, yt);
+    return s(this, wt);
   }
 };
-X = new WeakMap(), K = new WeakMap(), J = new WeakMap(), it = new WeakMap(), Ce = new WeakMap(), yt = new WeakMap(), Ht = new WeakMap(), wt = new WeakMap(), Be = new WeakMap(), Xt = new WeakMap(), st = new WeakMap();
-let ci = Yt;
-function Ot(o) {
+Y = new WeakMap(), J = new WeakMap(), _ = new WeakMap(), st = new WeakMap(), Ce = new WeakMap(), wt = new WeakMap(), Xt = new WeakMap(), vt = new WeakMap(), Be = new WeakMap(), Yt = new WeakMap(), nt = new WeakMap();
+let ci = Qt;
+function qt(o) {
   const e = Object.assign(
     {
       negative: !0,
@@ -3984,7 +4030,7 @@ function Ot(o) {
     },
     o
   ), t = new u();
-  if (e.negative ? t.numerator = Y(e.max, e.zero) : t.numerator = de(e.zero ? 0 : 1, e.max), e.natural)
+  if (e.negative ? t.numerator = Q(e.max, e.zero) : t.numerator = de(e.zero ? 0 : 1, e.max), e.natural)
     t.denominator = 1;
   else {
     let i = 0;
@@ -3993,7 +4039,7 @@ function Ot(o) {
   }
   return e.reduced ? t.reduce() : t;
 }
-function Pi(o) {
+function Bi(o) {
   const e = Object.assign(
     {
       letters: "x",
@@ -4002,8 +4048,8 @@ function Pi(o) {
       zero: !1
     },
     o
-  ), t = new M();
-  if (t.coefficient = Ot({
+  ), t = new k();
+  if (t.coefficient = qt({
     zero: e.zero,
     reduced: !0,
     natural: !e.fraction
@@ -4018,7 +4064,7 @@ function Pi(o) {
     t.setLetter(e.letters, e.degree);
   return t;
 }
-const as = {
+const ls = {
   letters: "x",
   degree: 2,
   fraction: !1,
@@ -4029,14 +4075,14 @@ const as = {
   numberOfMonoms: 0,
   positive: !0
 };
-function Bi(o) {
+function Si(o) {
   const e = Object.assign(
-    as,
+    ls,
     o
-  ), t = new O().empty();
+  ), t = new T().empty();
   let i;
   for (let n = e.degree; n >= 0; n--)
-    i = Pi({
+    i = Bi({
       letters: e.letters,
       degree: n,
       fraction: e.fraction,
@@ -4049,7 +4095,7 @@ function Bi(o) {
     }
   return t.reduce();
 }
-function ls(o) {
+function cs(o) {
   const e = Object.assign(
     {
       letters: "x",
@@ -4069,9 +4115,9 @@ function ls(o) {
       }
     },
     o
-  ), t = new O().one();
+  ), t = new T().one();
   for (let i = 0; i < e.degree; i++) {
-    const n = Bi({
+    const n = Si({
       degree: 1,
       unit: e.unit,
       fraction: e.fraction,
@@ -4080,7 +4126,7 @@ function ls(o) {
     });
     t.multiply(n);
   }
-  return new H(t, 0);
+  return new X(t, 0);
 }
 function ui(o) {
   const e = Object.assign(
@@ -4091,10 +4137,10 @@ function ui(o) {
       quadrant: null
     },
     o
-  ), t = e.axis === "x", i = e.axis === "y", n = e.fraction ? Ot({ max: e.max, zero: t }) : new u(Y(e.max, t)), r = e.fraction ? Ot({ max: e.max, zero: i }) : new u(Y(e.max, i));
+  ), t = e.axis === "x", i = e.axis === "y", n = e.fraction ? qt({ max: e.max, zero: t }) : new u(Q(e.max, t)), r = e.fraction ? qt({ max: e.max, zero: i }) : new u(Q(e.max, i));
   return Number(e.quadrant) === 1 && (n.abs(), r.abs()), Number(e.quadrant) === 2 && (n.isPositive() && n.opposite(), r.isNegative() && r.opposite()), Number(e.quadrant) === 3 && (n.isPositive() && n.opposite(), r.isPositive() && r.opposite()), Number(e.quadrant) === 4 && (n.isNegative() && n.opposite(), r.isPositive() && r.opposite()), new B(n, r);
 }
-function cs(o) {
+function us(o) {
   const e = Object.assign(
     {
       center: {
@@ -4108,76 +4154,76 @@ function cs(o) {
   let i, n;
   return e.pointsOnCircle === 8 ? (i = de(1, 3), n = i ** 2 + (i + 1) ** 2) : n = de(1, 20), new Tt(t, n, !0);
 }
-function us(o) {
+function fs(o) {
   const e = Object.assign(
     {
       A: {
-        x: Y(10),
-        y: Y(10)
+        x: Q(10),
+        y: Q(10)
       }
     },
     o
-  ), t = new x(
-    Y(10),
-    Y(10)
+  ), t = new E(
+    Q(10),
+    Q(10)
   );
   for (; t.isNull; )
-    t.x = Y(10), t.y = Y(10);
-  return e.slope === 1 ? t.x.sign() !== t.y.sign() && t.y.opposite() : e.slope === -1 && t.x.sign() !== t.y.sign() && t.y.opposite(), new R(new x(e.A.x, e.A.y), t);
+    t.x = Q(10), t.y = Q(10);
+  return e.slope === 1 ? t.x.sign() !== t.y.sign() && t.y.opposite() : e.slope === -1 && t.x.sign() !== t.y.sign() && t.y.opposite(), new R(new E(e.A.x, e.A.y), t);
 }
-function fs(o) {
+function ds(o) {
   const e = Object.assign(
     {
       A: {
-        x: Y(10),
-        y: Y(10),
-        z: Y(10)
+        x: Q(10),
+        y: Q(10),
+        z: Q(10)
       },
       direction: {
-        x: Y(10),
-        y: Y(10),
-        z: Y(10)
+        x: Q(10),
+        y: Q(10),
+        z: Q(10)
       }
     },
     o
-  ), t = new B(e.A.x, e.A.y, e.A.z), i = new x(e.direction.x, e.direction.y, e.direction.z);
+  ), t = new B(e.A.x, e.A.y, e.A.z), i = new E(e.direction.x, e.direction.y, e.direction.z);
   return new At(t, i);
 }
-const ds = {
-  equation: (o) => ls(o),
-  polynom: (o) => Bi(o),
-  monom: (o) => Pi(o),
-  fraction: (o) => Ot(o),
+const ps = {
+  equation: (o) => cs(o),
+  polynom: (o) => Si(o),
+  monom: (o) => Bi(o),
+  fraction: (o) => qt(o),
   number: (o, e, t) => de(o, e, t),
-  numberSym: (o, e) => Y(o, e),
-  prime: (o) => rs(o),
-  bool: (o) => qi(o),
-  array: (o, e) => os(o, e),
+  numberSym: (o, e) => Q(o, e),
+  prime: (o) => os(o),
+  bool: (o) => Mi(o),
+  array: (o, e) => hs(o, e),
   item: (o) => pi(o),
   shuffle: (o) => ki(o),
-  line: (o) => us(o),
-  line3: (o) => fs(o),
+  line: (o) => fs(o),
+  line3: (o) => ds(o),
   vector: (o) => ui(o),
   point: (o) => {
     const e = ui(o);
     return e.asPoint = !0, e;
   },
-  circle: (o) => cs(o)
-}, ms = {
-  Numeric: G,
+  circle: (o) => us(o)
+}, gs = {
+  Numeric: W,
   Fraction: u,
-  Root: vt,
-  Monom: M,
-  Polynom: O,
-  Equation: H,
-  Matrix: hs,
+  Root: bt,
+  Monom: k,
+  Polynom: T,
+  Equation: X,
+  Matrix: as,
   LinearSystem: ii,
-  Factor: le,
+  Factor: ie,
   PolyFactor: ni,
-  LogicalSet: es,
-  Random: ds,
+  LogicalSet: ts,
+  Random: ps,
   Geometry: {
-    Vector: x,
+    Vector: E,
     Point: B,
     Line: R,
     Triangle: ci,
@@ -4185,35 +4231,35 @@ const ds = {
     Line3: At,
     Plane3: li
   },
-  NumExp: _i
+  NumExp: es
 };
 export {
   Tt as Circle,
-  H as Equation,
-  Nt as EquationSolver,
-  at as FACTOR_DISPLAY,
-  le as Factor,
+  X as Equation,
+  Ot as EquationSolver,
+  ct as FACTOR_DISPLAY,
+  ie as Factor,
   u as Fraction,
   R as Line,
   At as Line3,
   ii as LinearSystem,
-  es as LogicalSet,
-  hs as Matrix,
-  M as Monom,
-  vt as NthRoot,
-  _i as NumExp,
-  G as Numeric,
+  ts as LogicalSet,
+  as as Matrix,
+  k as Monom,
+  bt as NthRoot,
+  es as NumExp,
+  W as Numeric,
   li as Plane3,
   B as Point,
   ni as PolyFactor,
-  O as Polynom,
-  ds as Random,
+  T as Polynom,
+  ps as Random,
   ci as Triangle,
-  x as Vector,
-  is as areVectorsColinears,
-  ts as areVectorsEquals,
-  ms as default,
-  ns as determinant,
-  ss as dotProduct
+  E as Vector,
+  ss as areVectorsColinears,
+  is as areVectorsEquals,
+  gs as default,
+  rs as determinant,
+  ns as dotProduct
 };
 //# sourceMappingURL=pimath.js.map