pimath 0.2.14 → 0.2.15

package/dist/pimath.js

@@ -3,1318 +3,99 @@ var e = class extends Error {
 	constructor(e, t) {
 		super(e, t), this.name = new.target.name;
 	}
-}, t = class extends e {}, n = class extends e {}, r = class extends e {}, i = class extends e {}, a = class extends e {}, o = class extends e {}, s = class extends e {};
-//#endregion
-//#region src/numeric.ts
-function c(e) {
-	let t = u(e), n = [], r, i;
+}, t = class extends e {}, n = class extends e {}, r = class extends e {}, i = class extends e {}, a = class extends e {}, o = class extends e {}, s = class extends e {}, c = 1e4, l;
+function u(e) {
+	let t = new Uint8Array(e + 1), n = [];
+	for (let r = 2; r <= e; r++) if (t[r] === 0) {
+		n.push(r);
+		for (let n = r * r; n <= e; n += r) t[n] = 1;
+	}
+	return n;
+}
+function d(e) {
+	let t = ee(e), n = [], r, i;
 	for (; t.length > 0;) r = t.shift() ?? 1, i = (t.length > 0 ? t.pop() : +r) ?? 1, n.push([r, i]);
 	return n;
 }
-function l(...e) {
-	let t = d(...e);
+function f(...e) {
+	let t = p(...e);
 	return e.map((e) => e / t);
 }
-function u(e) {
+function ee(e) {
+	if (!Number.isInteger(e)) throw new i(`dividers expects a finite integer, got ${e}`);
 	let t = Math.abs(e), n = Math.sqrt(t), r = [];
 	for (let i = 1; i <= n; i++) e % i === 0 && (r.push(i), r.push(t / i));
 	return r.sort(function(e, t) {
 		return e - t;
 	}), [...new Set(r)];
 }
-function d(...e) {
+function p(...e) {
 	let t = function(e, n) {
 		return isNaN(e) || isNaN(n) ? NaN : n === 0 ? e : e === 0 ? n : t(n, e % n);
 	}, n = 1, r = 2;
 	if (e.length === 0) return 1;
-	if (e.length === 1) return e[0] === 0 ? 1 : e[0];
+	if (e.length === 1) return e[0] === 0 ? 1 : Math.abs(e[0]);
 	if (n = t(e[0], e[1]), n === 1) return 1;
 	for (r = 2; r < e.length && (n = t(n, e[r]), n !== 1); r++);
 	return Math.abs(n);
 }
-function f(...e) {
+function te(...e) {
 	return e.reduce(function(e, t) {
-		return Math.abs(e * t / d(e, t));
-	});
+		return Math.abs(e / p(e, t) * t);
+	}, 1);
 }
-function ee(e, t = 3) {
-	return +e.toFixed(t);
+function ne(e, t = 3) {
+	let n = Math.min(100, Math.max(0, Math.trunc(t)));
+	return +e.toFixed(n);
 }
-function te(e) {
-	if (Number.isSafeInteger(e) || e.toString().split(".")[0].length < 10) return 0;
-	throw new a("Periodic value: Not implemented yet");
+function re(e) {
+	return l ??= u(c), e === void 0 ? [...l] : l.slice(0, Math.min(l.length, e));
 }
-function ne(e) {
-	let t = [
-		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 e === void 0 ? t : t.slice(0, Math.min(t.length, e));
-}
-function re(e, t) {
-	let n = [], r = t === !0 ? +e : e ** 2;
-	for (let t = 0; t <= e; t++) for (let i = 0; i <= e; i++) t ** 2 + i ** 2 === r && n.push([
+function ie(e, t) {
+	let n = t === !0 ? e : e ** 2, r = t === !0 ? Math.sqrt(e) : e, i = [];
+	for (let e = 0; e <= r; e++) for (let t = 0; t <= r; t++) e ** 2 + t ** 2 === n && i.push([
+		e,
 		t,
-		i,
-		e
+		r
 	]);
-	return n;
+	return i;
 }
-function ie(e, t = 2) {
-	let n = Math.round(Number(`${e}e${t}`));
-	return Number(`${n}e-${t}`);
+function ae(e, t = 2) {
+	let n = Math.trunc(t), r = Math.round(Number(`${e}e${n}`));
+	return Number(`${r}e${-n}`);
 }
-function ae(e, t) {
-	let n = Math.floor(e ** (1 / t)), r = e;
+function m(e, t) {
+	if (t <= 0) return 1;
+	if (e < 0) return t % 2 == 1 ? -m(-e, t) : 1;
+	let n = Math.floor(e ** (1 / t));
 	for (; n > 1;) {
-		let e = n ** +t;
-		if (r % e === 0) return e;
+		let r = n ** +t;
+		if (e % r === 0) return r;
 		n--;
 	}
 	return 1;
 }
-var p = {
-	decompose: c,
-	dividers: u,
-	divideNumbersByGCD: l,
-	gcd: d,
-	lcm: f,
-	numberCorrection: ee,
-	periodic: te,
-	primes: ne,
-	pythagoreanTripletsWithTarget: re,
-	round: ie,
-	greatestPower: ae
-}, oe = /* @__PURE__ */ function(e) {
+function h(e, t) {
+	if (t <= 0) return NaN;
+	if (e < 0) return t % 2 == 1 ? -h(-e, t) : NaN;
+	let n = e ** (1 / t), r = Math.round(n);
+	return r ** +t === e ? r : n;
+}
+var g = Object.freeze({
+	decompose: d,
+	dividers: ee,
+	divideNumbersByGCD: f,
+	gcd: p,
+	lcm: te,
+	numberCorrection: ne,
+	primes: re,
+	pythagoreanTripletsWithTarget: ie,
+	round: ae,
+	greatestPower: m,
+	nthRoot: h
+}), oe = /* @__PURE__ */ function(e) {
 	return e.frac = "frac", e.dfrac = "dfrac", e.tfrac = "tfrac", e;
-}({}), m = class e {
+}({}), _ = class e {
 	#e = 1;
 	#t = 3;
 	#n = !0;
@@ -1324,11 +105,13 @@ var p = {
 	constructor(e, t) {
 		return e !== void 0 && this.parse(e, t), this;
 	}
-	parse = (t, n) => t === "" ? (this.#r = 0, this.#e = 1, this) : typeof t == "number" && isNaN(t) ? this.invalid() : typeof t == "number" && !isFinite(t) ? (this.infinite(), t < 0 && this.opposite(), this) : typeof t == "string" ? this.fromString(t) : typeof t == "number" && n === void 0 ? this.fromNumber(t) : typeof t == "number" && typeof n == "number" ? this.fromNumbers(t, n) : t instanceof e ? this.copy(t) : this;
-	clone = () => {
+	parse(t, n) {
+		return t === "" ? (this.#r = 0, this.#e = 1, this) : typeof t == "number" && isNaN(t) ? this.invalid() : typeof t == "number" && !isFinite(t) ? (this.infinite(), t < 0 && this.opposite(), this) : typeof t == "string" ? this.fromString(t) : typeof t == "number" && n === void 0 ? this.fromNumber(t) : typeof t == "number" && typeof n == "number" ? this.fromNumbers(t, n) : t instanceof e ? this.copy(t) : this;
+	}
+	clone() {
 		let t = new e();
 		return t.numerator = this.#r, t.denominator = this.#e, t.exact = this.exact, t.#i = this.#i, t.#t = this.#t, t.#a = this.#a, t;
-	};
+	}
 	copy(e) {
 		return this.#r = e.numerator, this.#e = e.denominator, this.#n = e.exact, this;
 	}
@@ -1342,12 +125,14 @@ var p = {
 		let e = this.#a && this.isPositive() ? "+" : "";
 		return this.exact ? this.#e === 1 ? `${e}${this.#r}` : `${e}${this.#r}/${this.#e}` : e + this.value.toFixed(this.#t);
 	}
-	static areEquals = (...e) => e.every((t) => t.isEqual(e[0]));
-	static average = (...t) => {
+	static areEquals(...e) {
+		return e.every((t) => t.isEqual(e[0]));
+	}
+	static average(...t) {
 		let n = new e().zero();
 		for (let e of t) n.add(e);
 		return n.divide(t.length), n;
-	};
+	}
 	static isFraction(t) {
 		if (t instanceof e || typeof t == "number" && !isNaN(t)) return !0;
 		if (typeof t == "string") {
@@ -1356,53 +141,56 @@ var p = {
 		}
 		return !1;
 	}
-	static max = (...t) => {
+	static max(...t) {
 		let n = new e(t[0]);
 		for (let r of t) {
 			let t = new e(r);
 			t.isGreater(n) && (n = t.clone());
 		}
 		return n;
-	};
-	static min = (...t) => {
+	}
+	static min(...t) {
 		let n = new e(t[0]);
 		for (let r of t) {
 			let t = new e(r);
 			t.isLesser(n) && (n = t.clone());
 		}
 		return n;
-	};
-	static sort = (t, n) => {
+	}
+	static sort(t, n) {
 		let r = t.map((t) => t instanceof e ? t : new e(t)).sort((e, t) => e.value - t.value);
 		return n && r.reverse(), r;
-	};
+	}
 	static toSameDenominateur(...t) {
-		let n = t.map((t) => new e(t)), r = p.lcm(...n.map((e) => e.denominator));
+		let n = t.map((t) => new e(t)), r = g.lcm(...n.map((e) => e.denominator));
 		return n.forEach((e) => e.amplify(r / e.denominator)), n;
 	}
-	static unique = (t) => {
+	static unique(t) {
 		let n = {}, r = [];
 		return t.forEach((t) => {
 			t instanceof e || (t = new e(t)), n[t.clone().reduce().tex] || (r.push(t.clone()), n[t.clone().reduce().tex] = !0);
 		}), r;
-	};
-	static xMultiply = (...t) => {
+	}
+	static xMultiply(...t) {
 		let n = new e();
 		return t.forEach((e) => n.multiply(e, !1)), n;
-	};
-	abs = () => (this.#r = Math.abs(this.#r), this.#e = Math.abs(this.#e), this);
-	add = (t) => {
+	}
+	abs() {
+		return this.#r = Math.abs(this.#r), this.#e = Math.abs(this.#e), this;
+	}
+	add(t) {
 		if (t instanceof e) {
 			let e = this.#r, n = this.#e;
 			this.#r = e * t.denominator + t.numerator * n, this.#e = n * t.denominator, this.exact = this.exact && t.exact;
 		} else return this.add(new e(t));
 		return this.reduce();
-	};
-	amplify = (e) => {
+	}
+	amplify(e) {
 		if (!Number.isSafeInteger(e)) throw new i("The amplification factor must be a safe integer.");
+		if (e === 0) throw new i("The amplification factor cannot be zero.");
 		return this.#r *= e, this.#e *= e, this;
-	};
-	compare = (t, n) => {
+	}
+	compare(t, n) {
 		n ??= "=";
 		let r;
 		switch (r = t instanceof e ? t.clone() : new e(t), n) {
@@ -1418,122 +206,228 @@ var p = {
 			case "<>": return this.#r * r.denominator !== r.numerator * this.#e;
 			default: return !1;
 		}
-	};
+	}
 	get denominator() {
 		return this.#e;
 	}
 	set denominator(e) {
 		this.#e = e;
 	}
-	get dfrac() {
+	get asDfrac() {
 		return this.#i = "dfrac", this;
 	}
 	digits(e) {
 		return this.#t = e, this;
 	}
-	divide = (t) => {
+	divide(t) {
 		let n = new e(t);
-		if (n.numerator === 0) return this.infinite();
+		if (n.numerator === 0) {
+			let e = this.sign();
+			return this.infinite(), e === -1 ? this.opposite() : this;
+		}
 		let r = this.#r, i = this.#e;
 		return this.#r = r * n.denominator, this.#e = i * n.numerator, this.exact = this.exact && n.exact, this.reduce();
-	};
+	}
 	get exact() {
 		return this.#n;
 	}
 	set exact(e) {
 		this.#n = e;
 	}
-	get frac() {
+	get asFrac() {
 		return this.#i = "frac", this;
 	}
 	fromNumber(e) {
 		if (Number.isSafeInteger(e)) return this.#r = e, this.#e = 1, this.#n = !0, this;
+		if (e.toString().includes("e") || e.toString().includes("E")) throw new i(`Exponential notation is not supported: ${e}`);
 		let [, t] = e.toString().split("."), n = t ? t.length : 0, r = 10 ** n;
-		return this.#r = e * r, this.#e = r, this.#r = p.numberCorrection(this.#r), this.#e = p.numberCorrection(this.#e), this.reduce(), this.#n = n < 10, this;
+		return this.#r = e * r, this.#e = r, this.#r = g.numberCorrection(this.#r), this.#e = g.numberCorrection(this.#e), this.reduce(), this.#n = n < 10, this;
 	}
 	fromNumbers(e, t) {
-		return Number.isSafeInteger(e) && Number.isSafeInteger(t) ? (this.#r = e, this.#e = t, this.#n = !0, this) : this.fromNumber(e / t);
+		return t === 0 ? e === 0 ? this.invalid() : e < 0 ? this.infinite().opposite() : this.infinite() : Number.isSafeInteger(e) && Number.isSafeInteger(t) ? (this.#r = e, this.#e = t, this.#n = !0, this) : this.fromNumber(e / t);
 	}
 	fromPeriodic(e, t) {
 		let [, n] = e.toString().split(/[.,]/), r = n ? n.length : 0;
 		if (!Number.isSafeInteger(t) || t <= 0) throw new i("The periodic length must be a positive integer.");
 		if (t > r) throw new i(`The periodic length (${t}) cannot exceed the number of decimal digits (${r}).`);
-		let a = 10 ** r;
-		return this.#r = +e * a - Math.floor(e * 10 ** (r - t)), this.#e = a - 10 ** (r - t), this.#n = !0, this;
+		let a = 10 ** r, o = 10 ** (r - t), s = +e, c = s < 0 ? -1 : 1, l = Math.abs(s);
+		return this.#r = c * Math.round(l * a - Math.floor(l * o)), this.#e = a - o, this.#n = !0, this.reduce();
 	}
 	fromString(e) {
-		let t = e.split("/").map(Number);
-		return this.#n = !0, t.length > 2 || t.some((e) => isNaN(e)) ? (this.#r = NaN, this) : t.length === 1 ? this.fromNumber(+e) : t[1] === 0 ? this.infinite() : (this.#r = t[0], this.#e = t[1], this);
+		let t = /^([+-]?)(\d*)\.(\d*)\((\d+)\)$/.exec(e);
+		if (t) {
+			let [, e, n, r, i] = t, a = `${n || "0"}.${r}${i}`;
+			return this.fromPeriodic(a, i.length), e === "-" && this.opposite(), this.reduce();
+		}
+		if (e.includes("(") || e.includes(")")) return this.invalid();
+		let n = e.split("/").map(Number);
+		return this.#n = !0, n.length > 2 || n.some((e) => isNaN(e)) ? (this.#r = NaN, this) : n.length === 1 ? this.fromNumber(+e) : this.fromNumbers(n[0], n[1]);
 	}
-	infinite = () => (this.#r = Infinity, this.#e = 1, this.exact = !0, this);
-	invalid = () => (this.#r = NaN, this.#e = 1, this.exact = !0, this);
-	inverse = () => {
+	infinite() {
+		return this.#r = Infinity, this.#e = 1, this.exact = !0, this;
+	}
+	invalid() {
+		return this.#r = NaN, this.#e = 1, this.exact = !0, this;
+	}
+	inverse() {
 		let e = this.sign(), t = Math.abs(this.#r);
 		return this.#r = Math.abs(this.#e) * e, this.#e = t, this;
-	};
-	isEqual = (e) => this.compare(e, "=");
-	isEven = () => this.isRelative() && this.value % 2 == 0;
-	isFinite = () => !this.isInfinity() && !this.isNaN();
-	isGeq = (e) => this.compare(e, ">=");
-	isGreater = (e) => this.compare(e, ">");
-	isInfinity = () => Math.abs(this.#r) === Infinity;
-	isLeq = (e) => this.compare(e, "<=");
-	isLesser = (e) => this.compare(e, "<");
-	isNaN = () => isNaN(this.#r);
-	isNatural = () => this.isRelative() && this.isPositive();
-	isNegative = () => this.sign() === -1;
-	isNotEqual = (e) => this.compare(e, "<>");
-	isNotZero = () => this.#r !== 0;
-	isOdd = () => this.isRelative() && Math.abs(this.value % 2) === 1;
-	isOne = () => this.#r === 1 && this.#e === 1;
-	isPositive = () => this.sign() === 1;
-	isRational = () => this.exact && !this.isRelative();
-	isReduced = () => Math.abs(p.gcd(this.#r, this.#e)) === 1;
-	isRelative = () => this.exact && this.clone().reduce().denominator === 1;
-	isSquare = () => Math.sqrt(this.#r) % 1 == 0 && Math.sqrt(this.#e) % 1 == 0;
-	isStrictlyNegative = () => this.value < 0;
-	isStrictlyPositive = () => this.value > 0;
+	}
+	isEqual(e) {
+		return this.compare(e, "=");
+	}
+	isEven() {
+		return this.isRelative() && this.value % 2 == 0;
+	}
+	isFinite() {
+		return !this.isInfinity() && !this.isNaN();
+	}
+	isGeq(e) {
+		return this.compare(e, ">=");
+	}
+	isGreater(e) {
+		return this.compare(e, ">");
+	}
+	isInfinity() {
+		return Math.abs(this.#r) === Infinity;
+	}
+	isLeq(e) {
+		return this.compare(e, "<=");
+	}
+	isLesser(e) {
+		return this.compare(e, "<");
+	}
+	isNaN() {
+		return isNaN(this.#r);
+	}
+	isNatural() {
+		return this.isRelative() && this.isPositive();
+	}
+	isNegative() {
+		return this.sign() === -1;
+	}
+	isNotEqual(e) {
+		return this.compare(e, "<>");
+	}
+	isNotZero() {
+		return this.#r !== 0;
+	}
+	isOdd() {
+		return this.isRelative() && Math.abs(this.value % 2) === 1;
+	}
+	isOne() {
+		return this.#r === 1 && this.#e === 1;
+	}
+	isPeriodic() {
+		if (!this.exact || !this.isFinite()) return !1;
+		let e = Math.abs(this.clone().reduce().denominator);
+		for (; e % 2 == 0;) e /= 2;
+		for (; e % 5 == 0;) e /= 5;
+		return e !== 1;
+	}
+	isPositive() {
+		return this.sign() === 1;
+	}
+	isRational() {
+		return this.exact && this.isFinite();
+	}
+	hasFractionalPart() {
+		return this.exact && !this.isRelative();
+	}
+	isReduced() {
+		return Math.abs(g.gcd(this.#r, this.#e)) === 1;
+	}
+	isRelative() {
+		return this.exact && this.clone().reduce().denominator === 1;
+	}
+	isSquare() {
+		let e = this.clone().reduce();
+		if (e.isNegative()) return !1;
+		let t = Math.abs(e.numerator), n = Math.abs(e.denominator), r = Math.round(Math.sqrt(t)), i = Math.round(Math.sqrt(n));
+		return r * r === t && i * i === n;
+	}
+	isStrictlyNegative() {
+		return this.value < 0;
+	}
+	isStrictlyPositive() {
+		return this.value > 0;
+	}
 	isUnit() {
 		return Math.abs(this.#r) === 1 && this.#e === 1;
 	}
-	isZero = () => this.#r === 0;
-	multiply = (t, n = !0) => {
+	isZero() {
+		return this.#r === 0;
+	}
+	multiply(t, n = !0) {
 		let r = new e(t);
 		return this.#r *= r.numerator, this.#e *= r.denominator, this.exact = this.exact && r.exact, n ? this.reduce() : this;
-	};
+	}
 	get numerator() {
 		return this.#r;
 	}
 	set numerator(e) {
 		this.#r = e;
 	}
-	one = () => this.fromNumber(1);
-	opposite = () => (this.#r = -this.#r, this);
-	pow = (t) => {
+	one() {
+		return this.fromNumber(1);
+	}
+	opposite() {
+		return this.#r = -this.#r, this;
+	}
+	pow(t) {
 		if (t instanceof e) return this.pow(t.value);
 		this.reduce(), t < 0 && this.inverse();
-		let n = Math.abs(t), r = this.#r ** +n, i = this.#e ** +n, a = Math.floor(r), o = Math.floor(i);
-		return a === r && o === i ? (this.#r = a, this.#e = o) : (this.#r = r / i, this.#e = 1, this.exact = !1), this;
-	};
-	reduce = () => {
-		let e = p.gcd(this.#r, this.#e);
+		let n = Math.abs(t);
+		if (Number.isInteger(n)) return this.#r = Math.round(this.#r ** +n), this.#e = Math.round(this.#e ** +n), this;
+		let r = Math.round(this.#r ** +n), i = Math.round(this.#e ** +n);
+		return Math.round(r ** (1 / n)) === this.#r && Math.round(i ** (1 / n)) === this.#e ? (this.#r = r, this.#e = i) : (this.#r = this.#r ** +n / this.#e ** +n, this.#e = 1, this.exact = !1), this;
+	}
+	reduce() {
+		let e = g.gcd(this.#r, this.#e);
 		return this.#r /= e, this.#e /= e, this.#e < 0 && (this.#e = -this.#e, this.#r = -this.#r), this;
-	};
-	root = (e) => {
+	}
+	root(e) {
 		if (e === 0) return this;
 		if (!Number.isSafeInteger(e)) throw new i("The root must be an integer.");
-		if (e < 0 && this.inverse(), this.isNegative() && e % 2 == 0) throw new r("The root of a negative number must be odd.");
+		if (this.isNegative() && e % 2 == 0) throw new r("The root of a negative number must be odd.");
+		e < 0 && this.inverse();
 		let t = this.sign();
 		this.abs(), this.reduce();
-		let n = Math.floor(this.#r ** +Math.abs(1 / e)), a = Math.floor(this.#e ** +Math.abs(1 / e));
-		return this.#r **= +Math.abs(1 / e), this.#e **= +Math.abs(1 / e), (n !== this.#r || a !== this.#e) && (this.#r /= this.#e, this.#e = 1, this.exact = !1), this.multiply(t), this;
-	};
-	sign = () => this.#r * this.#e >= 0 ? 1 : -1;
-	sqrt = () => this.root(2);
-	subtract = (t) => t instanceof e ? this.add(t.clone().opposite()) : this.add(-t);
-	get tfrac() {
+		let n = Math.abs(e), a = Math.round(this.#r ** (1 / n)), o = Math.round(this.#e ** (1 / n));
+		return a ** +n === this.#r && o ** +n === this.#e ? (this.#r = a, this.#e = o) : (this.#r = this.#r ** (1 / n) / this.#e ** (1 / n), this.#e = 1, this.exact = !1), this.multiply(t), this;
+	}
+	sign() {
+		return this.#r * this.#e >= 0 ? 1 : -1;
+	}
+	sqrt() {
+		return this.root(2);
+	}
+	subtract(t) {
+		return t instanceof e ? this.add(t.clone().opposite()) : this.add(-t);
+	}
+	get asTfrac() {
 		return this.#i = "tfrac", this;
 	}
+	toRepeatingDecimal() {
+		if (!this.exact || !this.isFinite()) throw new i("Cannot decompose a non-exact or infinite fraction.");
+		let e = this.clone().reduce(), t = e.sign(), n = Math.abs(e.numerator), r = Math.abs(e.denominator), a = Math.floor(n / r).toString(), o = n % r, s = [], c = /* @__PURE__ */ new Map(), l = -1;
+		for (; o !== 0;) {
+			let e = c.get(o);
+			if (e !== void 0) {
+				l = e;
+				break;
+			}
+			c.set(o, s.length), o *= 10, s.push(Math.floor(o / r)), o %= r;
+		}
+		let u = (l === -1 ? s : s.slice(0, l)).join(""), d = l === -1 ? "" : s.slice(l).join("");
+		return {
+			sign: t,
+			integerPart: a,
+			nonPeriodic: u,
+			periodic: d,
+			periodLength: d.length
+		};
+	}
 	get value() {
 		let e = this.#r / this.#e;
 		return e === 0 ? 0 : e;
@@ -1544,70 +438,52 @@ var p = {
 	get withoutSign() {
 		return this.#a = !1, this;
 	}
-	zero = () => this.fromNumber(0);
-};
-//#endregion
-//#region src/helpers.ts
-function se(e, t = !0) {
-	return t ? `\\left( ${e} \\right)` : `(${e})`;
-}
-function h(e) {
-	if (!e.startsWith("(") || !e.endsWith(")")) return e;
-	let t = 0;
-	for (let n = 0; n < e.length - 1; n++) if (e[n] === "(" ? t++ : e[n] === ")" && t--, t === 0) return e;
-	return e.slice(1, -1);
-}
-function g(e, t, n, r, i) {
-	return e.map((e, a) => r !== void 0 && a < r || i !== void 0 && a > i ? e : e === t ? n : e);
-}
-function _(e, t) {
-	if (t.length !== 1) throw new i(`splitChar must be a single character, got: "${t}"`);
-	let n = 0, r = 0, a = [];
-	for (let i = 0; i < e.length; i++) {
-		let o = e[i];
-		o === "(" ? n++ : o === ")" ? n-- : o === t && n === 0 && (a.push(e.substring(r, i)), r = i + 1);
+	zero() {
+		return this.fromNumber(0);
 	}
-	return a.push(e.substring(r)), a;
-}
-//#endregion
-//#region src/coefficients/root.ts
-var v = class e {
+}, v = class e {
 	#e;
 	#t;
 	#n;
 	#r = !1;
 	constructor(e) {
-		return this.#t = 2, this.#e = new m().zero(), this.#n = new m().zero(), e && this.parse(e), this;
+		return this.#t = 2, this.#e = new _().zero(), this.#n = new _().zero(), e !== void 0 && this.parse(e), this;
 	}
 	parse(t) {
-		if (t instanceof e) return this.index = t.index, this.radical = t.radical.clone(), this.factor = t.factor.clone(), this;
-		if (t instanceof m) return this.index = 2, this.factor = t.clone(), this.radical.one(), this;
-		if (typeof t == "string") {
-			if (t.includes("sqrt")) return this.#s(t);
-			if (t.includes("root")) return this.#o(t);
-		}
-		return this.index = 2, this.factor = new m(t), this.radical.one(), this;
+		return t instanceof e ? this.copy(t) : t instanceof _ ? this.fromFraction(t) : typeof t == "string" ? this.fromString(t) : this.#i(t);
+	}
+	copy(e) {
+		return this.index = e.index, this.radical = e.radical.clone(), this.factor = e.factor.clone(), this;
+	}
+	fromFraction(e) {
+		return this.index = 2, this.factor = e.clone(), this.radical.one(), this;
+	}
+	fromString(e) {
+		return e.includes("sqrt") ? this.#f(e) : e.includes("root") ? this.#d(e) : this.#i(e);
+	}
+	#i(e) {
+		let n = new _(e);
+		if (n.isNaN()) throw new t(`Cannot parse "${e}" as a root or fraction`);
+		return this.index = 2, this.factor = n, this.radical.one(), this;
 	}
 	clone() {
-		return new e().from(this.index, this.radical, this.factor);
+		let t = new e().from(this.index, this.radical, this.factor);
+		return t.#r = this.#r, t;
 	}
 	get tex() {
 		let e = this.#r && this.factor.isPositive() ? "+" : "", t = e && this.#e.numerator === 1 ? " " : "";
-		if (this.value === 0) return `${e}0`;
-		let n = this.#a(this.#e.denominator, this.#n.denominator), r = this.#a(this.#e.numerator, this.#n.numerator) ?? "1";
+		if (this.isZero()) return `${e}0`;
+		let n = this.#l(this.#e.denominator, this.#n.denominator), r = this.#l(this.#e.numerator, this.#n.numerator) ?? "1";
 		return n === null ? `${e}${t}${r}` : `${e}${t}\\frac{ ${r} }{ ${n} }`;
 	}
 	get display() {
 		let e = this.#r && this.factor.isPositive() ? "+" : "";
-		if (this.value === 0) return `${e}0`;
-		let t = this.#i(this.#e.denominator, this.#n.denominator, !0), n = this.#i(this.#e.numerator, this.#n.numerator, t !== null) ?? "1";
+		if (this.isZero()) return `${e}0`;
+		let t = this.#c(this.#e.denominator, this.#n.denominator, !0), n = this.#c(this.#e.numerator, this.#n.numerator, t !== null) ?? "1";
 		return t === null ? `${e}${n}` : `${e}${n}/${t}`;
 	}
-	add(t) {
-		this.reduce();
-		let n = new e(t).reduce();
-		if (this.index !== n.index || !this.radical.isEqual(n.radical)) throw new r("Add can only be done with two same index and radical");
-		return this.factor.add(n.factor), this;
+	add(e) {
+		return this.#s(e, !1);
 	}
 	divide(t) {
 		return this.multiply(new e(t).inverse());
@@ -1618,8 +494,17 @@ var v = class e {
 	set factor(e) {
 		this.#e = e;
 	}
-	from(e, t, n) {
-		return this.index = e, this.radical = new m(t), this.factor = n ? new m(n) : new m().one(), this;
+	from(e, n, r) {
+		this.index = e;
+		let i = new _(n);
+		if (i.isNaN()) throw new t(`Cannot build a root from an invalid radical: "${n}"`);
+		if (this.radical = i, r === void 0) this.factor = new _().one();
+		else {
+			let e = new _(r);
+			if (e.isNaN()) throw new t(`Cannot build a root from an invalid factor: "${r}"`);
+			this.factor = e;
+		}
+		return this;
 	}
 	group() {
 		return this.radical.multiply(this.factor.pow(this.index)), this.factor.one(), this;
@@ -1632,13 +517,23 @@ var v = class e {
 		this.#t = e;
 	}
 	get indexAsPow() {
-		return new m(this.index).inverse();
+		return new _(this.index).inverse();
 	}
 	inverse() {
 		return this.factor.inverse(), this.radical.inverse(), this;
 	}
 	isEqual(e) {
-		return this.value === e.value;
+		if (this.isZero() && e.isZero()) return !0;
+		if (!this.#a() || !e.#a() || this.#o() !== e.#o()) return !1;
+		let t = g.lcm(this.index, e.index), n = this.factor.clone().abs().pow(t).multiply(this.radical.clone().abs().pow(t / this.index)), r = e.factor.clone().abs().pow(t).multiply(e.radical.clone().abs().pow(t / e.index));
+		return n.isEqual(r);
+	}
+	#a() {
+		return !(this.radical.isNegative() && this.index % 2 == 0);
+	}
+	#o() {
+		let e = this.index % 2 == 1 ? this.radical.sign() : 1;
+		return this.factor.sign() * e;
 	}
 	isOne() {
 		return this.factor.isOne() && this.radical.isOne();
@@ -1651,13 +546,14 @@ var v = class e {
 		return this.factor.isZero() || this.radical.isZero();
 	}
 	multiply(t) {
-		let n = new e(t);
-		if (this.factor.multiply(n.factor), this.index === n.index) return this.radical.multiply(n.radical), this;
-		if (this.radical.isEqual(n.radical)) {
-			let e = this.indexAsPow.add(n.indexAsPow).reduce();
-			return this.index = e.denominator, this.radical = this.radical.pow(e.numerator), this;
+		let n = this.clone(), i = new e(t);
+		if (n.index !== i.index && !n.radical.isEqual(i.radical)) throw new r("Multiply can only be done if radical or index as equals.");
+		if (n.factor.multiply(i.factor), n.index === i.index) n.radical.multiply(i.radical);
+		else {
+			let e = n.indexAsPow.add(i.indexAsPow).reduce();
+			n.index = e.denominator, n.radical = n.radical.pow(e.numerator);
 		}
-		throw new r("Multiply can only be done if radical or index as equals.");
+		return this.parse(n);
 	}
 	one() {
 		return this.radical.one(), this.factor.one(), this;
@@ -1667,7 +563,7 @@ var v = class e {
 	}
 	pow(e) {
 		this.factor.pow(e);
-		let t = p.gcd(this.index, e);
+		let t = g.gcd(this.index, e);
 		return this.index /= t, this.radical.pow(e / t), this;
 	}
 	get radical() {
@@ -1677,12 +573,12 @@ var v = class e {
 		this.#n = e;
 	}
 	reduce() {
-		if (this.radical.isRational()) {
-			let e = this.radical.denominator;
-			this.radical.denominator = 1, this.radical.numerator *= e, this.factor.divide(e);
+		if (this.radical.hasFractionalPart()) {
+			let e = this.radical.numerator, t = this.radical.denominator;
+			this.radical = new _(e * t ** (this.index - 1)), this.factor.divide(t);
 		}
-		let e = p.greatestPower(this.radical.value, this.index);
-		return this.factor.multiply(e ** (1 / this.index)), this.radical.divide(e), this;
+		let e = g.greatestPower(this.radical.value, this.index);
+		return this.factor.multiply(g.nthRoot(e, this.index)), this.radical.divide(e), this;
 	}
 	root(e) {
 		return this.group(), this.index *= e, this;
@@ -1690,12 +586,17 @@ var v = class e {
 	sqrt() {
 		return this.root(2);
 	}
-	subtract(t) {
-		let n = new e(t);
-		return this.add(n.opposite());
+	subtract(e) {
+		return this.#s(e, !0);
+	}
+	#s(t, n) {
+		let i = this.clone().reduce(), a = new e(t).reduce();
+		if (i.index !== a.index || !i.radical.isEqual(a.radical)) throw new r("Roots must share the same index and radical to be added or subtracted");
+		return n ? i.factor.subtract(a.factor) : i.factor.add(a.factor), this.parse(i);
 	}
 	get value() {
-		return p.numberCorrection(this.factor.value * this.radical.value ** (1 / this.index));
+		let e = this.radical.value;
+		return e < 0 ? this.index % 2 == 0 ? NaN : g.numberCorrection(this.factor.value * -((-e) ** (1 / this.index))) : g.numberCorrection(this.factor.value * e ** (1 / this.index));
 	}
 	get withSign() {
 		return this.#r = !0, this;
@@ -1706,23 +607,43 @@ var v = class e {
 	zero() {
 		return this.radical.zero(), this.factor.zero(), this;
 	}
-	#i(e, t, n) {
-		let r = this.#t === 2 ? "sqrt" : `root(${this.#t})`, i = [e === 1 || e === 0 ? null : e === -1 ? "-" : e.toString(), t !== 1 && t !== 0 ? `${r}(${t})` : null].filter((e) => e !== null);
-		return i.length === 0 ? null : n && i.length === 2 ? `(${i.join("")})` : i.join("");
+	#c(e, t, n) {
+		let r = this.#t === 2 ? "sqrt" : `root(${this.#t})`;
+		return this.#u(e, t, {
+			radical: (e) => `${r}(${e})`,
+			separator: "",
+			wrap: n
+		});
 	}
-	#a(e, t) {
-		let n = this.#t === 2 ? "\\sqrt" : `\\sqrt[ ${this.#t} ]`, r = [e === 1 || e === 0 ? null : e === -1 ? "-" : e.toString(), t !== 1 && t !== 0 ? `${n}{ ${t} }` : null].filter((e) => e !== null);
-		return r.length === 0 ? null : r.join(" ");
+	#l(e, t) {
+		let n = this.#t === 2 ? "\\sqrt" : `\\sqrt[ ${this.#t} ]`;
+		return this.#u(e, t, {
+			radical: (e) => `${n}{ ${e} }`,
+			separator: " "
+		});
 	}
-	#o(e) {
+	#u(e, t, n) {
+		let r = [e === 1 || e === 0 ? null : e === -1 ? "-" : e.toString(), t !== 1 && t !== 0 ? n.radical(t) : null].filter((e) => e !== null);
+		return r.length === 0 ? null : n.wrap && r.length === 2 ? `(${r.join(n.separator)})` : r.join(n.separator);
+	}
+	#d(e) {
 		let n = /^(.*?)root\((\d+)\)\(?([^)]+)/.exec(e);
 		if (!n) throw new t(`Invalid root format: "${e}"`);
 		let [, r, i, a] = n;
-		return this.index = +i, this.radical = new m(a), this.factor = r === "" ? new m().one() : new m(r.trim()), this;
+		return this.index = +i, this.radical = new _(a), this.factor = r === "" ? new _().one() : new _(r.trim()), this;
 	}
-	#s(e) {
-		let [t, n] = e.split("sqrt");
-		return this.index = 2, this.radical = new m(h(n)), this.factor = t === "" ? new m().one() : new m(t), this;
+	#f(e) {
+		let n = /^\((.+)\)\/(\d+)$/.exec(e);
+		if (n) return this.#f(n[1]), this.factor.divide(+n[2]), this;
+		let r = /^([+-]?\d*(?:\/\d+)?)sqrt(?:\((-?\d+(?:\/\d+)?)\)|(\d+))(?:\/(\d+))?$/.exec(e);
+		if (!r) throw new t(`Invalid sqrt format: "${e}"`);
+		let i = r[1], a = r.at(2), o = r.at(3), s = r.at(4);
+		this.index = 2, this.radical = new _(a ?? o ?? "");
+		let c;
+		if (i === "" || i === "+" || i === "-") c = new _(i === "-" ? -1 : 1);
+		else if (/^[+-]?\d+(?:\/\d+)?$/.test(i)) c = new _(i);
+		else throw new t(`Invalid sqrt format: "${e}"`);
+		return s !== void 0 && c.divide(+s), this.factor = c, this;
 	}
 }, y = class e {
 	#e;
@@ -1733,13 +654,13 @@ var v = class e {
 	#a;
 	#o;
 	constructor() {
-		this.#o = "x", this.#n = !1, this.#t = null, this.#a = null, this.#r = new m().zero(), this.#i = new v(), this.#e = 1;
+		this.#o = "x", this.#n = !1, this.#t = null, this.#a = null, this.#r = new _().zero(), this.#i = new v(), this.#e = 1;
 	}
 	get tex() {
 		if (this.#a) return this.#a;
 		if (this.#i.isZero()) return this.#r.tex;
 		if (this.#r.isZero()) return this.#i.tex;
-		let [e] = m.toSameDenominateur(this.#r, this.#i.factor), t = this.#i.clone().multiply(e.denominator).reduce(), n = `${e.numerator} ${t.withSign.tex}`;
+		let [e] = _.toSameDenominateur(this.#r, this.#i.factor), t = this.#i.clone().multiply(e.denominator).reduce(), n = `${e.numerator} ${t.withSign.tex}`;
 		return e.denominator === 1 ? n : `\\frac{ ${n} }{ ${e.denominator} }`;
 	}
 	set tex(e) {
@@ -1749,7 +670,7 @@ var v = class e {
 		if (this.#t) return this.#t;
 		if (this.#i.isZero()) return this.#r.display;
 		if (this.#r.isZero()) return this.#i.display;
-		let [e] = m.toSameDenominateur(this.#r, this.#i.factor), t = this.#i.clone().multiply(e.denominator).reduce(), n = `${e.numerator}${t.withSign.display}`;
+		let [e] = _.toSameDenominateur(this.#r, this.#i.factor), t = this.#i.clone().multiply(e.denominator).reduce(), n = `${e.numerator}${t.withSign.display}`;
 		return e.denominator === 1 ? n : `(${n})/${e.denominator}`;
 	}
 	set display(e) {
@@ -1758,7 +679,7 @@ var v = class e {
 	static fromFraction(t) {
 		let n = new e();
 		n.setExact();
-		let r = new m(t);
+		let r = new _(t);
 		return n.display = r.display, n.tex = r.tex, n.fraction = r, n.root = new v(), n;
 	}
 	static fromQuadratic(t, n, r) {
@@ -1766,7 +687,7 @@ var v = class e {
 			t,
 			n,
 			r
-		].map((e) => new m(e)), s = a.clone().pow(2).subtract(i.clone().multiply(o).multiply(4));
+		].map((e) => new _(e)), s = a.clone().pow(2).subtract(i.clone().multiply(o).multiply(4));
 		if (s.isNegative()) return [];
 		if (s.isSquare()) {
 			let t = s.sqrt(), n = a.clone().opposite().subtract(t).divide(i.clone().multiply(2)), r = a.clone().opposite().add(t).divide(i.clone().multiply(2));
@@ -1819,11 +740,11 @@ var v = class e {
 	set variable(e) {
 		e !== void 0 && (this.#o = e);
 	}
-}, ce = class {
+}, se = class {
 	#e;
 	#t;
 	constructor(e) {
-		this.#e = e instanceof R || e instanceof P ? new R(e) : new R().fromPolynom(e), this.#t = this.#e.getRoots();
+		this.#e = e instanceof L || e instanceof F ? new L(e) : new L().fromPolynom(e), this.#t = this.#e.getRoots();
 	}
 	get fx() {
 		return this.#e;
@@ -1866,10 +787,10 @@ var v = class e {
 	}
 	#r(e, t) {
 		let n = new y();
-		return n.exact = !1, n.tex = t?.tex ?? null, n.display = t?.display ?? null, n.fraction = new m(e), n.fraction.exact = !1, n.variable = this.#n, n;
+		return n.exact = !1, n.tex = t?.tex ?? null, n.display = t?.display ?? null, n.fraction = new _(e), n.fraction.exact = !1, n.variable = this.#n, n;
 	}
 	#i(e) {
-		return e instanceof m && !e.exact ? this.#r(e.value) : y.fromFraction(e);
+		return e instanceof _ && !e.exact ? this.#r(e.value) : y.fromFraction(e);
 	}
 	#a(e) {
 		let t = [], n = e.degree().value, [r, ...i] = e.getCoefficients(), a = 2 + Math.max(...i.map((e) => e.value / r.value)), o = this.#s(e, a, 100);
@@ -1897,7 +818,7 @@ var v = class e {
 	#s(e, t, n) {
 		let r = [], i = 2 * t / n;
 		for (let n = -t; n <= t; n += i) {
-			let t = p.numberCorrection(n);
+			let t = g.numberCorrection(n);
 			r.push({
 				x: t,
 				fx: e.evaluate(t, !0)
@@ -1922,9 +843,9 @@ var v = class e {
 			let e = t.monoms.reduce((e, t) => t.degree().value < e.degree().value ? t : e), r = e.coefficient;
 			e.clone().divide(r), t.divide(e);
 		}
-		let o = p.dividers(i.value), s = p.dividers(a.value), c = [];
+		let o = g.dividers(i.value), s = g.dividers(a.value), c = [];
 		for (let e of o) for (let t of s) {
-			let n = new m(t, e);
+			let n = new _(t, e);
 			c.find((e) => e.value === n.value) || (c.push(n.clone()), c.push(n.opposite().clone()));
 		}
 		c.forEach((e) => {
@@ -1983,15 +904,15 @@ var v = class e {
 	}
 	#p(e, t, n) {
 		let r = e.clone().multiply(2), i = new y();
-		i.fraction = t.clone().opposite().divide(r.clone()), i.root.radical = n.clone(), i.root.factor = new m().one().divide(r.clone()), i.exact = !0;
+		i.fraction = t.clone().opposite().divide(r.clone()), i.root.radical = n.clone(), i.root.factor = new _().one().divide(r.clone()), i.exact = !0;
 		let a = new y();
-		return a.fraction = t.clone().opposite().divide(r.clone()), a.root.radical = n.clone(), a.root.factor = new m().one().divide(r.clone()).opposite(), a.exact = !0, [i, a].sort((e, t) => e.value - t.value);
+		return a.fraction = t.clone().opposite().divide(r.clone()), a.root.radical = n.clone(), a.root.factor = new _().one().divide(r.clone()).opposite(), a.exact = !0, [i, a].sort((e, t) => e.value - t.value);
 	}
-}, le = class extends Error {
+}, ce = class extends Error {
 	constructor(e, t) {
 		super(e, t), this.name = new.target.name;
 	}
-}, x = class extends le {}, S = class extends le {}, ue = class extends S {}, C = {
+}, x = class extends ce {}, S = class extends ce {}, le = class extends S {}, C = {
 	pi: Math.PI,
 	e: Math.exp(1)
 }, w = /* @__PURE__ */ function(e) {
@@ -1999,7 +920,7 @@ var v = class e {
 }({}), T = /* @__PURE__ */ function(e) {
 	return e.EXPRESSION = "expression", e.POLYNOM = "polynom", e.SET = "set", e.NUMERIC = "numeric", e;
 }({});
-function de(e, t) {
+function ue(e, t) {
 	if (e = e.replace(/\s+/g, ""), e.length <= 1) return e;
 	let n = Object.keys(t).filter((e) => t[e].type === w.FUNCTION).map((e) => e);
 	n.sort((e, t) => t.length - e.length);
@@ -2045,14 +966,14 @@ function de(e, t) {
 			default: l = w.VARIABLE;
 		}
 		if (u === void 0 || l === void 0) throw Error("The token is undefined");
-		s += fe(c, l), s += u;
+		s += de(c, l), s += u;
 	}
 	return s;
 }
-function fe(e, t) {
+function de(e, t) {
 	return e === void 0 || e === w.OPERATION || t === w.OPERATION || e === w.LEFT_PARENTHESIS || e === w.FUNCTION || e === w.FUNCTION_ARGUMENT || t === w.RIGHT_PARENTHESIS || t === w.FUNCTION_ARGUMENT ? "" : "*";
 }
-var pe = {
+var fe = {
 	"^": {
 		precedence: 4,
 		associative: "right",
@@ -2167,12 +1088,12 @@ var pe = {
 };
 function E(...e) {
 	let t = {};
-	for (let n of e) t[n] = pe[n];
+	for (let n of e) t[n] = fe[n];
 	return t;
 }
-var me = {};
-for (let [e, t] of Object.entries(pe)) t.type === w.FUNCTION && (me[e] = t.arity ?? 1);
-var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin", "cos", "tan", "asin", "acos", "atan", "sqrt", "nthrt", "ln", "log", "logn"), ge = D, _e = E("&", "|", "!", "-"), O = class {
+var pe = {};
+for (let [e, t] of Object.entries(fe)) t.type === w.FUNCTION && (pe[e] = t.arity ?? 1);
+var me = E("^", "*", "/", "+", "-"), he = E("^", "*", "/", "+", "-", "%", "sin", "cos", "tan", "asin", "acos", "atan", "sqrt", "nthrt", "ln", "log", "logn"), ge = he, _e = E("&", "|", "!", "-"), D = class {
 	#e;
 	#t = [];
 	#n = {};
@@ -2188,7 +1109,7 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 		return this.#t.map((e) => e.token);
 	}
 	tokenConfigInitialization() {
-		return this.#e === T.SET ? (this.#n = _e, this.#i = !1) : this.#e === T.NUMERIC ? (this.#n = D, this.#i = !0) : this.#e === T.EXPRESSION ? (this.#n = ge, this.#i = !0) : (this.#n = he, this.#i = !0), this.#r = Object.keys(this.#n).sort((e, t) => t.length - e.length), this.#n;
+		return this.#e === T.SET ? (this.#n = _e, this.#i = !1) : this.#e === T.NUMERIC ? (this.#n = he, this.#i = !0) : this.#e === T.EXPRESSION ? (this.#n = ge, this.#i = !0) : (this.#n = me, this.#i = !0), this.#r = Object.keys(this.#n).sort((e, t) => t.length - e.length), this.#n;
 	}
 	NextToken(e, t) {
 		let n, r;
@@ -2221,7 +1142,7 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 	}
 	parse(e, t) {
 		let n = [], r = [], i = 0;
-		for ((t ?? this.#i) && (e = de(e, this.#n)); i < e.length;) {
+		for ((t ?? this.#i) && (e = ue(e, this.#n)); i < e.length;) {
 			let t = i, { token: a, nextPos: o, type: s } = this.NextToken(e, i);
 			if (i = o, i <= t) throw new x(`Parser stalled at position ${t} in "${e}"`);
 			switch (s) {
@@ -2285,13 +1206,13 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 		if (r.some((e) => e.token === "(")) throw new x(`Mismatched parentheses (unclosed '(') in "${e}"`);
 		return this.#t = n.concat(r.reverse()), this;
 	}
-}, k = class {
+}, ve = class {
 	_rpn;
 	_expression;
 	constructor(e, t) {
 		this._expression = e;
 		try {
-			this._rpn = new O(T.NUMERIC).parse(e, t).rpn;
+			this._rpn = new D(T.NUMERIC).parse(e, t).rpn;
 		} catch (t) {
 			throw new x(`There was a problem parsing: ${e}`, { cause: t });
 		}
@@ -2323,7 +1244,7 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 				--e;
 				break;
 			case w.FUNCTION: {
-				let n = me[t.token] ?? 1;
+				let n = pe[t.token] ?? 1;
 				if (e < n) return !1;
 				e += 1 - n;
 				break;
@@ -2336,7 +1257,7 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 		let t = [];
 		for (let n of this._rpn) if (n.tokenType === w.COEFFICIENT) t.push(+n.token);
 		else if (n.tokenType === w.VARIABLE) {
-			if (e === void 0 || !Object.hasOwn(e, n.token)) throw new ue(`Missing value for variable "${n.token}"`);
+			if (e === void 0 || !Object.hasOwn(e, n.token)) throw new le(`Missing value for variable "${n.token}"`);
 			t.push(e[n.token]);
 		} else if (n.tokenType === w.CONSTANT) t.push(C[n.token]);
 		else if (n.tokenType === w.OPERATION) {
@@ -2393,14 +1314,17 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 	_numberCorrection(e, t = 8) {
 		return +e.toFixed(t);
 	}
-}, A = class e {
+}, O = class e {
 	#e;
 	#t;
 	constructor(e) {
-		return this.#e = new m().zero(), this.#t = {}, e !== void 0 && this.parse(e), this;
+		return this.#e = new _().zero(), this.#t = {}, e !== void 0 && this.parse(e), this;
 	}
 	parse(t) {
-		return this.#e = new m(), this.#t = {}, t instanceof e ? (this.#e = t.#e.clone(), this.#n(t), this) : t instanceof m ? (this.#e = t.clone(), this) : typeof t == "number" ? (this.#e = new m(t), this) : (isNaN(Number(t)) ? this.#s(t) : this.#e = new m(Number(t)), this);
+		return this.#e = new _(), this.#t = {}, t instanceof e ? (this.#e = t.#e.clone(), this.#n(t), this) : t instanceof _ ? (this.#e = t.clone(), this) : typeof t == "number" ? (this.#e = new _(t), this) : (isNaN(Number(t)) ? this.#s(t) : this.#e = new _(Number(t)), this);
+	}
+	copy() {
+		throw new a("copy() is not yet implemented for Monom");
 	}
 	clone = () => {
 		let t = new e();
@@ -2417,10 +1341,10 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 	static gcd = (...t) => {
 		for (let n of t) if (n.containsRationalPower()) return new e().zero();
 		let n = new e();
-		n.coefficient = new m(p.gcd(...t.map((e) => e.coefficient.numerator)), p.lcm(...t.map((e) => e.coefficient.denominator))).reduce();
+		n.coefficient = new _(g.gcd(...t.map((e) => e.coefficient.numerator)), g.lcm(...t.map((e) => e.coefficient.denominator))).reduce();
 		for (let e of t) {
 			for (let t in n.literal) t in e.literal || n.removeVariable(t);
-			for (let t in e.literal) !n.hasVariable(t) && e.literal[t].isStrictlyPositive() ? n.literal[t] = e.literal[t].clone() : n.literal[t] = new m(Math.min(e.literal[t].value, n.literal[t].value));
+			for (let t in e.literal) !n.hasVariable(t) && e.literal[t].isStrictlyPositive() ? n.literal[t] = e.literal[t].clone() : n.literal[t] = new _(Math.min(e.literal[t].value, n.literal[t].value));
 		}
 		return n;
 	};
@@ -2441,14 +1365,14 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 		return this.#e;
 	}
 	set coefficient(e) {
-		this.#e = new m(e);
+		this.#e = new _(e);
 	}
-	containsRationalPower = () => Object.values(this.#t).some((e) => e.isRational());
-	degree = (e) => this.variables.length === 0 ? new m().zero() : e === void 0 ? Object.values(this.#t).reduce((e, t) => e.clone().add(t)) : this.hasVariable(e) ? this.#t[e].clone() : new m().zero();
+	containsRationalPower = () => Object.values(this.#t).some((e) => e.hasFractionalPart());
+	degree = (e) => this.variables.length === 0 ? new _().zero() : e === void 0 ? Object.values(this.#t).reduce((e, t) => e.clone().add(t)) : this.hasVariable(e) ? this.#t[e].clone() : new _().zero();
 	derivative = (t = "x") => {
 		if (this.hasVariable(t)) {
 			let e = this.#t[t].clone(), n = this.clone();
-			return n.#t[t].subtract(1), n.#e.multiply(new m(e.clone())), n;
+			return n.#t[t].subtract(1), n.#e.multiply(new _(e.clone())), n;
 		}
 		return new e().zero();
 	};
@@ -2462,42 +1386,42 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 	};
 	get dividers() {
 		if (!this.coefficient.isRelative() || this.containsRationalPower() || this.coefficient.numerator > 1e6) return [this.clone()];
-		let t = p.dividers(Math.abs(this.coefficient.numerator)), n = [];
+		let t = g.dividers(Math.abs(this.coefficient.numerator)), n = [];
 		for (let e in this.literal) n = this.#a(n, e);
 		let r = [];
 		if (n.length > 0 && t.length > 0) for (let i of t) for (let t of n) {
 			let n = new e();
-			n.coefficient = new m(i), n.literal = t, r.push(n);
+			n.coefficient = new _(i), n.literal = t, r.push(n);
 		}
 		else if (t.length === 0) for (let t of n) {
 			let n = new e();
-			n.coefficient = new m().one(), n.literal = t, r.push(n);
+			n.coefficient = new _().one(), n.literal = t, r.push(n);
 		}
 		else for (let n of t) {
 			let t = new e();
-			t.coefficient = new m(n), r.push(t);
+			t.coefficient = new _(n), r.push(t);
 		}
 		return r.length === 0 ? [new e().one()] : r;
 	}
 	evaluate = (e, t) => {
 		if (t === !0) {
-			if (e instanceof m) return this.#r(e.value);
+			if (e instanceof _) return this.#r(e.value);
 			if (typeof e == "number") return this.#r(e);
 			if (typeof e == "object") {
 				let t = {};
-				for (let n in e) t[n] = new m(e[n]).value;
+				for (let n in e) t[n] = new _(e[n]).value;
 				return this.#r(t);
 			}
 		}
 		let n = this.coefficient.clone();
-		if (typeof e == "number" || e instanceof m) {
+		if (typeof e == "number" || e instanceof _) {
 			let t = {};
-			return t[this.variables[0]] = new m(e), this.evaluate(t);
+			return t[this.variables[0]] = new _(e), this.evaluate(t);
 		}
 		if (typeof e == "object") {
 			if (this.variables.length === 0) return this.coefficient;
 			for (let t in this.#t) {
-				let r = new m(e[t]);
+				let r = new _(e[t]);
 				n.multiply(r.pow(this.#t[t]));
 			}
 		}
@@ -2517,11 +1441,11 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 		if (e.degree().isStrictlyPositive()) {
 			for (let t of e.variables) if (!this.degree(t).isGeq(e.degree(t))) return !1;
 		}
-		return this.coefficient.isRational() || e.coefficient.isRational() ? !0 : this.coefficient.clone().divide(e.coefficient).isRelative();
+		return this.coefficient.hasFractionalPart() || e.coefficient.hasFractionalPart() ? !0 : this.coefficient.clone().divide(e.coefficient).isRelative();
 	};
 	isEqual = (e) => this.isSameAs(e) && this.#e.isEqual(e.coefficient);
 	isLiteralSquare = () => {
-		for (let e in this.literal) if (this.literal[e].isRational() || this.literal[e].isOdd()) return !1;
+		for (let e in this.literal) if (this.literal[e].hasFractionalPart() || this.literal[e].isOdd()) return !1;
 		return !0;
 	};
 	isOne = () => this.#e.value === 1 && this.variables.length === 0;
@@ -2543,8 +1467,8 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 		this.#t = e;
 	}
 	set literalStr(e) {
-		for (let t of [...e.matchAll(/([a-z])\^([+-]?[0-9]+)/g)]) t[1] in this.#t || (this.#t[t[1]] = new m().zero()), this.#t[t[1]].add(+t[2]);
-		for (let t of [...e.matchAll(/([a-z](?!\^))/g)]) t[1] in this.#t || (this.#t[t[1]] = new m().zero()), this.#t[t[1]].add(1);
+		for (let t of [...e.matchAll(/([a-z])\^([+-]?[0-9]+)/g)]) t[1] in this.#t || (this.#t[t[1]] = new _().zero()), this.#t[t[1]].add(+t[2]);
+		for (let t of [...e.matchAll(/([a-z](?!\^))/g)]) t[1] in this.#t || (this.#t[t[1]] = new _().zero()), this.#t[t[1]].add(1);
 	}
 	multiply = (...t) => {
 		for (let n of t) {
@@ -2554,7 +1478,7 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 		}
 		return this;
 	};
-	one = () => (this.#e = new m().one(), this.#t = {}, this);
+	one = () => (this.#e = new _().one(), this.#t = {}, this);
 	opposite = () => (this.#e.opposite(), this);
 	get plotFunction() {
 		return this.#i("plot");
@@ -2566,7 +1490,7 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 	};
 	primitive = (e = "x") => {
 		let t = this.clone(), n;
-		return t.hasVariable(e) ? (n = t.degree(e).clone().add(1), t.coefficient = t.coefficient.clone().divide(n), t.setLetter(e, n)) : (t.coefficient.isZero() && (t.coefficient = new m().one()), t.setLetter(e, 1)), t;
+		return t.hasVariable(e) ? (n = t.degree(e).clone().add(1), t.coefficient = t.coefficient.clone().divide(n), t.setLetter(e, n)) : (t.coefficient.isZero() && (t.coefficient = new _().one()), t.setLetter(e, 1)), t;
 	};
 	reduce = () => {
 		this.coefficient.reduce();
@@ -2579,7 +1503,7 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 	root = () => {
 		throw new a("Method not implemented.");
 	};
-	setLetter = (e, t) => t instanceof m ? this.hasVariable(e) && t.isZero() ? (this.removeVariable(e), this) : (this.#t[e] = t.clone(), this) : this.setLetter(e, new m(t));
+	setLetter = (e, t) => t instanceof _ ? this.hasVariable(e) && t.isZero() ? (this.removeVariable(e), this) : (this.#t[e] = t.clone(), this) : this.setLetter(e, new _(t));
 	sqrt = () => {
 		if (this.isSquare()) {
 			this.#e.sqrt();
@@ -2601,7 +1525,7 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 			n.isZero() || e.push(t);
 		}), e.sort(), e;
 	}
-	zero = () => (this.#e = new m().zero(), this.#t = {}, this);
+	zero = () => (this.#e = new _().zero(), this.#t = {}, this);
 	#n(e) {
 		for (let t in e.literal) this.#t[t] = e.literal[t].clone();
 	}
@@ -2611,40 +1535,40 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 			let t = {}, n = this.variables[0];
 			return t[n] = e, this.#r(t);
 		}
-		if (e instanceof m) {
+		if (e instanceof _) {
 			let t = {};
-			return t[this.variables[0]] = new m(e).value, this.#r(t);
+			return t[this.variables[0]] = new _(e).value, this.#r(t);
 		}
 		if (typeof e == "object") {
 			if (this.variables.length === 0) return this.coefficient.value;
 			for (let n in this.#t) {
 				let r = e[n];
-				r instanceof m ? t *= r.value ** this.#t[n].value : t *= r ** this.#t[n].value;
+				r instanceof _ ? t *= r.value ** this.#t[n].value : t *= r ** this.#t[n].value;
 			}
 		}
 		return t;
 	};
 	#i = (e) => {
 		let t = "", n = Object.keys(this.#t).sort();
-		for (let r of n) this.#t[r].isNotZero() && (e === "plot" && t !== "" && (t += "*"), t += r, this.#t[r].isNotEqual(1) && (t += e === "tex" ? `^{ ${this.#t[r].tfrac.tex} }` : `^(${this.#t[r].display})`));
-		let r = e === "tex" ? this.#e.frac.tex : this.#e.display;
+		for (let r of n) this.#t[r].isNotZero() && (e === "plot" && t !== "" && (t += "*"), t += r, this.#t[r].isNotEqual(1) && (t += e === "tex" ? `^{ ${this.#t[r].asTfrac.tex} }` : `^(${this.#t[r].display})`));
+		let r = e === "tex" ? this.#e.asFrac.tex : this.#e.display;
 		return t === "" ? this.#e.value === 0 ? "0" : r : this.#e.value === 1 ? t : this.#e.value === -1 ? `-${t}` : this.#e.value === 0 ? "0" : e === "plot" ? `${r}*${t}` : `${r}${t}`;
 	};
 	#a(e, t) {
 		let n = [];
 		for (let r = 0; r <= this.literal[t].value; r++) if (e.length === 0) {
 			let e = {};
-			e[t] = new m(r), n.push(e);
+			e[t] = new _(r), n.push(e);
 		} else for (let i of e) {
 			let e = {};
 			for (let t in i) e[t] = i[t];
-			e[t] = new m(r), n.push(e);
+			e[t] = new _(r), n.push(e);
 		}
 		return n;
 	}
 	#o = (t, n) => {
 		let r, i, a, o, s;
-		if (n.tokenType === w.COEFFICIENT) t.push(new e(new m(n.token)));
+		if (n.tokenType === w.COEFFICIENT) t.push(new e(new _(n.token)));
 		else if (n.tokenType === w.VARIABLE) {
 			let r = new e().one();
 			r.setLetter(n.token, 1), t.push(r.clone());
@@ -2658,13 +1582,13 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 			case "/":
 				i = t.pop() ?? new e().one(), r = t.pop() ?? new e().one(), t.push(r.divide(i));
 				break;
-			case "^": s = t.pop()?.coefficient ?? new m().one(), a = t.pop() ?? new e().one(), o = a.variables[0], o && a.setLetter(o, s), t.push(a);
+			case "^": s = t.pop()?.coefficient ?? new _().one(), a = t.pop() ?? new e().one(), o = a.variables[0], o && a.setLetter(o, s), t.push(a);
 		}
 	};
 	#s = (e) => {
 		let n;
 		try {
-			n = new O().parse(e);
+			n = new D().parse(e);
 		} catch (n) {
 			throw new t(`Cannot parse "${e}" as a Monom`, { cause: n });
 		}
@@ -2672,15 +1596,38 @@ var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin",
 		if (r.length === 0) return this.zero(), this;
 		if (r.length === 1) {
 			let e = r[0];
-			return this.one(), e.tokenType === w.COEFFICIENT ? this.coefficient = new m(e.token) : e.tokenType === w.VARIABLE && this.setLetter(e.token, 1), this;
+			return this.one(), e.tokenType === w.COEFFICIENT ? this.coefficient = new _(e.token) : e.tokenType === w.VARIABLE && this.setLetter(e.token, 1), this;
 		}
 		for (let e of r) this.#o(i, e);
 		return this.one(), this.multiply(i[0]), this;
 	};
 };
 //#endregion
-//#region src/algebra/operations.ts
+//#region src/helpers.ts
+function ye(e, t = !0) {
+	return t ? `\\left( ${e} \\right)` : `(${e})`;
+}
+function k(e) {
+	if (!e.startsWith("(") || !e.endsWith(")")) return e;
+	let t = 0;
+	for (let n = 0; n < e.length - 1; n++) if (e[n] === "(" ? t++ : e[n] === ")" && t--, t === 0) return e;
+	return e.slice(1, -1);
+}
+function A(e, t, n, r, i) {
+	return e.map((e, a) => r !== void 0 && a < r || i !== void 0 && a > i ? e : e === t ? n : e);
+}
 function j(e, t) {
+	if (t.length !== 1) throw new i(`splitChar must be a single character, got: "${t}"`);
+	let n = 0, r = 0, a = [];
+	for (let i = 0; i < e.length; i++) {
+		let o = e[i];
+		o === "(" ? n++ : o === ")" ? n-- : o === t && n === 0 && (a.push(e.substring(r, i)), r = i + 1);
+	}
+	return a.push(e.substring(r)), a;
+}
+//#endregion
+//#region src/algebra/operations.ts
+function M(e, t) {
 	if (!Number.isSafeInteger(t)) throw new i("Can only raise item by an integer");
 	if (t < 0) throw new i("Can only raise item by a positive integer");
 	if (t === 0) return e.one();
@@ -2690,7 +1637,7 @@ function j(e, t) {
 }
 //#endregion
 //#region src/algebra/polynom.ts
-var M = class e {
+var N = class e {
 	#e = "x";
 	#t;
 	#n;
@@ -2701,13 +1648,16 @@ var M = class e {
 	}
 	parse(t, ...n) {
 		if (this.#n = [], this.#t = [], this.#u(), typeof t == "string") return this.#h(t, ...n);
-		if ((typeof t == "number" || t instanceof m || t instanceof A) && n.length === 0) this.#n.push(new A(t));
-		else if (t instanceof A && n.length > 0) this.#n.push(new A(t)), n.forEach((e) => {
-			this.#n.push(new A(e));
+		if ((typeof t == "number" || t instanceof _ || t instanceof O) && n.length === 0) this.#n.push(new O(t));
+		else if (t instanceof O && n.length > 0) this.#n.push(new O(t)), n.forEach((e) => {
+			this.#n.push(new O(e));
 		});
 		else if (t instanceof e) for (let e of t.monoms) this.#n.push(e.clone());
 		return this;
 	}
+	copy() {
+		throw new a("copy() is not yet implemented for Polynom");
+	}
 	clone() {
 		let t = new e(), n = [];
 		t.#e = this.#e;
@@ -2727,21 +1677,21 @@ var M = class e {
 		}), n;
 	}
 	add(...t) {
-		for (let n of t) n instanceof e ? this.#n = this.#n.concat(n.monoms.map((e) => e.clone())) : n instanceof A ? this.#n.push(n.clone()) : typeof n == "number" && Number.isSafeInteger(n) ? this.#n.push(new A(n.toString())) : this.#n.push(new A(n));
+		for (let n of t) n instanceof e ? this.#n = this.#n.concat(n.monoms.map((e) => e.clone())) : n instanceof O ? this.#n.push(n.clone()) : typeof n == "number" && Number.isSafeInteger(n) ? this.#n.push(new O(n.toString())) : this.#n.push(new O(n));
 		return this.reduce();
 	}
 	commonMonom() {
-		let e = new A().one();
-		e.coefficient = new m(this.gcdNumerator(), this.gcdDenominator());
+		let e = new O().one();
+		e.coefficient = new _(this.gcdNumerator(), this.gcdDenominator());
 		for (let t of this.variables) {
 			e.setLetter(t, this.degree(t));
-			for (let n of this.#n) if (e.setLetter(t, m.min(n.degree(t), e.degree(t))), e.degree(t).isZero()) break;
+			for (let n of this.#n) if (e.setLetter(t, _.min(n.degree(t), e.degree(t))), e.degree(t).isZero()) break;
 		}
 		return e;
 	}
 	degree(e) {
-		let t = new m().zero();
-		for (let n of this.#n) t = m.max(n.degree(e).value, t);
+		let t = new _().zero();
+		for (let n of this.#n) t = _.max(n.degree(e).value, t);
 		return t;
 	}
 	derivative(t) {
@@ -2750,9 +1700,9 @@ var M = class e {
 		return n.reduce();
 	}
 	divide(t) {
-		if (t instanceof m) return this.#o(t);
+		if (t instanceof _) return this.#o(t);
 		if (typeof t == "number" && Number.isSafeInteger(t)) return this.#s(t);
-		if (t instanceof A) return this.divide(new e(t));
+		if (t instanceof O) return this.divide(new e(t));
 		if (t instanceof e) {
 			if (t.monoms.length === 1 && t.variables.length === 0) return this.#o(t.monoms[0].coefficient);
 			{
@@ -2781,7 +1731,7 @@ var M = class e {
 	}
 	evaluate(e, t) {
 		if (t) return this.#c(e);
-		let n = new m().zero();
+		let n = new _().zero();
 		return this.#n.forEach((r) => {
 			n.add(r.evaluate(e, t));
 		}), n;
@@ -2793,7 +1743,7 @@ var M = class e {
 		let i = new b(n).solve();
 		if (i.length === 0) return this.#t.length === 0 ? this.#t = [this.clone()] : this.#t.push(n), this.#t;
 		if (i.forEach((t) => {
-			if (t.exact && t.root.isZero()) for (let n = 0; n < t.count; n++) t.fraction.isRational() ? this.#t.push(new e().fromCoefficients(t.fraction.denominator, -t.fraction.numerator)) : this.#t.push(new e().fromCoefficients(1, t.fraction.clone().opposite()));
+			if (t.exact && t.root.isZero()) for (let n = 0; n < t.count; n++) t.fraction.hasFractionalPart() ? this.#t.push(new e().fromCoefficients(t.fraction.denominator, -t.fraction.numerator)) : this.#t.push(new e().fromCoefficients(1, t.fraction.clone().opposite()));
 		}), this.#t.map((e) => e.degree().value).reduce((e, t) => e + t, 0) < this.degree().value) {
 			let t = e.xMultiply(...this.#t);
 			this.#t.push(this.clone().divide(t));
@@ -2807,19 +1757,19 @@ var M = class e {
 		this.#n = [];
 		let t = this.#e ?? "x";
 		return e.reverse().forEach((e, n) => {
-			let r = new A();
-			r.coefficient = new m(e), r.setLetter(t, n), this.#n.push(r);
+			let r = new O();
+			r.coefficient = new _(e), r.setLetter(t, n), this.#n.push(r);
 		}), this.#u(), this.reorder();
 	}
 	gcdDenominator() {
-		return p.gcd(...this.getDenominators());
+		return g.gcd(...this.getDenominators());
 	}
 	gcdNumerator() {
-		return p.gcd(...this.getNumerators());
+		return g.gcd(...this.getNumerators());
 	}
 	getCoefficients() {
 		if (!this.degree().isNatural()) throw new r("getCoefficients() requires a polynomial with integer degrees");
-		let e = this.clone().reorder(), t = this.degree().value + 1, n = Array.from({ length: t }, () => new m(0));
+		let e = this.clone().reorder(), t = this.degree().value + 1, n = Array.from({ length: t }, () => new _(0));
 		return e.monoms.forEach((e) => {
 			let r = t - e.degree().value - 1;
 			n[r] = e.coefficient.clone();
@@ -2843,7 +1793,7 @@ var M = class e {
 	}
 	integrate(e, t, n = "x") {
 		let r = this.primitive(n), i = {}, a = {};
-		return i[n] = new m(e), a[n] = new m(t), r.evaluate(a).subtract(r.evaluate(i));
+		return i[n] = new _(e), a[n] = new _(t), r.evaluate(a).subtract(r.evaluate(i));
 	}
 	inverse() {}
 	isDeveloped(t) {
@@ -2881,33 +1831,33 @@ var M = class e {
 		return this.#n.length === 1 && this.#n[0].coefficient.isZero() || this.#n.length === 0;
 	}
 	lcmDenominator() {
-		return p.lcm(...this.getDenominators());
+		return g.lcm(...this.getDenominators());
 	}
 	lcmNumerator() {
-		return p.lcm(...this.getNumerators());
+		return g.lcm(...this.getNumerators());
 	}
 	get length() {
 		return this.#n.length;
 	}
 	limitTo(e, t) {
-		let n = new m(e);
+		let n = new _(e);
 		if (n.isFinite()) {
 			let e = t ?? this.variables[0] ?? "x";
 			return this.evaluate({ [e]: n });
 		}
 		let r = this.monomByDegree(void 0, t), i = r.coefficient.sign(), a = r.degree(t);
-		return a.isZero() ? r.coefficient.clone() : a.isStrictlyPositive() ? n.isPositive() ? i === 1 ? new m().infinite() : new m().infinite().opposite() : (a.value % 2 == 0 ? i : -i) === 1 ? new m().infinite() : new m().infinite().opposite() : new m().zero();
+		return a.isZero() ? r.coefficient.clone() : a.isStrictlyPositive() ? n.isPositive() ? i === 1 ? new _().infinite() : new _().infinite().opposite() : (a.value % 2 == 0 ? i : -i) === 1 ? new _().infinite() : new _().infinite().opposite() : new _().zero();
 	}
 	monomByDegree(e, t) {
 		if (e === void 0) return this.monomByDegree(this.degree(t), t);
 		let n = this.clone().reduce();
 		for (let r of n.#n) if (r.degree(t).isEqual(e)) return r.clone();
-		return new A().zero();
+		return new O().zero();
 	}
 	monomByLetter(e) {
 		let t = this.clone().reduce();
 		for (let n of t.#n) if (n.hasVariable(e)) return n.clone();
-		return new A().zero();
+		return new O().zero();
 	}
 	get monoms() {
 		return this.#n;
@@ -2923,11 +1873,11 @@ var M = class e {
 	}
 	multiply(t) {
 		if (t instanceof e) return this.#m(t);
-		if (t instanceof m) return this.#d(t);
-		if (t instanceof A) return this.#p(t);
+		if (t instanceof _) return this.#d(t);
+		if (t instanceof O) return this.#p(t);
 		if (Number.isSafeInteger(t) && typeof t == "number") return this.#f(t);
 		if (typeof t == "string") try {
-			let e = new m(t);
+			let e = new _(t);
 			return this.#d(e);
 		} catch (e) {
 			throw new r("Cannot multiply by this value.", { cause: e });
@@ -2938,7 +1888,7 @@ var M = class e {
 		return this.variables.length;
 	}
 	one() {
-		return this.#n = [], this.#n.push(new A().one()), this.#u(), this;
+		return this.#n = [], this.#n.push(new O().one()), this.#u(), this;
 	}
 	opposite() {
 		return this.#n = this.#n.map((e) => e.opposite()), this.#u(), this;
@@ -2947,7 +1897,7 @@ var M = class e {
 		return this.#l("tex", !1, !1, !0);
 	}
 	pow(e) {
-		return j(this, e).reduce();
+		return M(this, e).reduce();
 	}
 	primitive(t) {
 		let n = new e();
@@ -2957,7 +1907,7 @@ var M = class e {
 	reduce() {
 		let e = 0;
 		for (; e < this.#n.length;) {
-			for (let t = e + 1; t < this.#n.length; t++) this.#n[e].isSameAs(this.#n[t]) && (this.#n[e].add(this.#n[t]), this.#n.splice(t, 1), this.#n[e].isZero() && (this.#n[e] = new A().zero()), t--);
+			for (let t = e + 1; t < this.#n.length; t++) this.#n[e].isSameAs(this.#n[t]) && (this.#n[e].add(this.#n[t]), this.#n.splice(t, 1), this.#n[e].isZero() && (this.#n[e] = new O().zero()), t--);
 			e++;
 		}
 		this.#n = this.#n.filter((e) => !e.coefficient.isZero());
@@ -3001,14 +1951,14 @@ var M = class e {
 		throw new r("Cannot take the square root from a polynom");
 	}
 	subtract(...t) {
-		for (let n of t) n instanceof e ? this.add(n.clone().opposite()) : n instanceof A ? this.#n.push(n.clone().opposite()) : this.#n.push(new A(n).opposite());
+		for (let n of t) n instanceof e ? this.add(n.clone().opposite()) : n instanceof O ? this.#n.push(n.clone().opposite()) : this.#n.push(new O(n).opposite());
 		return this.reduce();
 	}
 	tableOfSigns() {
 		let e = this.roots, t = Array(2 * e.length + 1).fill("").map((e, t) => t % 2 == 0 ? "" : "z");
 		if (t.length === 1) {
 			let [e] = this.getCoefficients().map((e) => e.value);
-			t = g(t, "", e > 0 ? "+" : "-");
+			t = A(t, "", e > 0 ? "+" : "-");
 		} else if (this.degree().isOne()) {
 			let [e] = this.getCoefficients().map((e) => e.value);
 			t[0] = e > 0 ? "-" : "+", t[1] = "z", t[2] = e > 0 ? "+" : "-";
@@ -3028,7 +1978,7 @@ var M = class e {
 		return [...new Set(this.#n.flatMap((e) => e.variables))].sort();
 	}
 	zero() {
-		return this.#n = [], this.#n.push(new A().zero()), this.#u(), this;
+		return this.#n = [], this.#n.push(new O().zero()), this.#u(), this;
 	}
 	get zeroes() {
 		return this.getZeroes();
@@ -3047,7 +1997,7 @@ var M = class e {
 		return this.#u(), this;
 	}
 	#s(e) {
-		let t = new m(e);
+		let t = new _(e);
 		for (let e of this.#n) e.coefficient.divide(t);
 		return this.#u(), this;
 	}
@@ -3074,7 +2024,7 @@ var M = class e {
 		return this.reduce();
 	}
 	#f(e) {
-		return this.#d(new m(e));
+		return this.#d(new _(e));
 	}
 	#p(e) {
 		for (let t of this.#n) t.multiply(e);
@@ -3082,33 +2032,33 @@ var M = class e {
 	}
 	#m(e) {
 		let t = [];
-		for (let n of this.#n) for (let r of e.monoms) t.push(A.xMultiply(n, r));
+		for (let n of this.#n) for (let r of e.monoms) t.push(O.xMultiply(n, r));
 		return this.#n = t, this.reduce();
 	}
 	#h(e, ...t) {
 		if (t.length === 0) {
 			if (e !== "" && !isNaN(Number(e))) {
 				this.empty();
-				let t = new A(Number(e));
+				let t = new O(Number(e));
 				return this.add(t), this;
 			}
 			return this.#_(e);
 		}
 		if (/^[a-z]+$/.test(e)) {
 			this.empty();
-			let n = t.map((e) => new m(e));
+			let n = t.map((e) => new _(e));
 			if (e.length > 1) {
 				let t = e.split("");
 				if (n.length > t.length + 1) throw new i(`Too many values: ${t.length} letters but ${n.length} values provided`);
 				let r = 0;
 				for (let e of n) {
-					let n = new A();
+					let n = new O();
 					n.coefficient = e.clone(), n.literalStr = t[r] ?? "", this.add(n), r++;
 				}
 			} else {
 				let t = n.length - 1;
 				for (let r of n) {
-					let n = new A();
+					let n = new O();
 					n.coefficient = r.clone(), n.literalStr = `${e}^${t}`, this.add(n), t--;
 				}
 			}
@@ -3122,7 +2072,7 @@ var M = class e {
 				n.push(new e(i.token));
 				break;
 			case w.VARIABLE:
-				n.push(new e().add(new A(i.token)));
+				n.push(new e().add(new O(i.token)));
 				break;
 			case w.CONSTANT: throw new t("Unsupported CONSTANT token in Polynom parser");
 			case w.OPERATION:
@@ -3155,7 +2105,7 @@ var M = class e {
 	#_(e) {
 		let n;
 		try {
-			n = new O().parse(e);
+			n = new D().parse(e);
 		} catch (n) {
 			throw new t(`Cannot parse "${e}" as a Polynom`, { cause: n });
 		}
@@ -3165,23 +2115,26 @@ var M = class e {
 		for (let e of r) this.#g(i, e);
 		return i.length === 1 && this.add(i[0]), this.reorder();
 	}
-}, N = class e {
+}, P = class e {
 	#e;
 	#t;
 	#n;
 	constructor(t, n, r) {
-		if (this.#e = new M().zero(), this.#t = new M().zero(), this.#n = "=", t !== void 0 && n === void 0) {
+		if (this.#e = new N().zero(), this.#t = new N().zero(), this.#n = "=", t !== void 0 && n === void 0) {
 			if (t instanceof e) return t.clone();
 			typeof t == "string" && this.parse(t);
-		} else t !== void 0 && n !== void 0 && (this.left = new M(t), this.right = new M(n));
+		} else t !== void 0 && n !== void 0 && (this.left = new N(t), this.right = new N(n));
 		return r !== void 0 && (this.sign = r), this;
 	}
 	parse = (e) => {
 		let n = this.#r(e);
 		if (n === !1) throw new t("The equation is not valid (no sign found)");
 		let r = e.split(n);
-		return this.create(new M(r[0]), new M(r[1]), this.#i(n));
+		return this.create(new N(r[0]), new N(r[1]), this.#i(n));
 	};
+	copy() {
+		throw new a("copy() is not yet implemented for Equation");
+	}
 	clone = () => new e(this.#e.clone(), this.#t.clone(), this.#n);
 	get tex() {
 		return `${this.#e.tex}${this.signAsTex}${this.#t.tex}`;
@@ -3199,13 +2152,13 @@ var M = class e {
 	add(t) {
 		if (t instanceof e) return this.#e.add(t.left), this.#t.add(t.right), this;
 		if (typeof t == "string" && !e.isEquationString(t)) return this.add(new e(t));
-		let n = new M(t);
+		let n = new N(t);
 		return this.#e.add(n), this.#t.add(n), this;
 	}
 	create = (e, t, n) => (this.#e = e, this.#t = t, this.#n = this.#i(n ?? "="), this);
-	degree = (e) => m.max(this.#e.degree(e), this.#t.degree(e));
+	degree = (e) => _.max(this.#e.degree(e), this.#t.degree(e));
 	divide = (e) => {
-		let t = new m(e);
+		let t = new _(e);
 		return t.isZero() ? this : this.multiply(t.inverse());
 	};
 	evaluate(e, t) {
@@ -3245,7 +2198,7 @@ var M = class e {
 	letters = () => [.../* @__PURE__ */ new Set([...this.#e.variables, ...this.#t.variables])];
 	moveLeft = () => (this.#e.subtract(this.#t), this.#t.zero(), this);
 	multiply = (e) => {
-		let t = new m(e);
+		let t = new _(e);
 		return this.#e.multiply(t), this.#t.multiply(t), this.#n !== "=" && t.sign() === -1 && this.#a(), this;
 	};
 	get numberOfVars() {
@@ -3278,7 +2231,7 @@ var M = class e {
 	get signAsTex() {
 		return this.#n === ">=" ? "\\geq" : this.#n === "<=" ? "\\leq" : this.#n;
 	}
-	simplify = () => (this.multiply(p.lcm(...this.#e.getDenominators(), ...this.#t.getDenominators())), this.divide(p.gcd(...this.#e.getNumerators(), ...this.#t.getNumerators())), this);
+	simplify = () => (this.multiply(g.lcm(...this.#e.getDenominators(), ...this.#t.getDenominators())), this.divide(g.gcd(...this.#e.getNumerators(), ...this.#t.getNumerators())), this);
 	solve = () => new b(this.clone()).solve();
 	split() {
 		return [this.#e.clone(), this.#t.clone()];
@@ -3286,7 +2239,7 @@ var M = class e {
 	subtract(t) {
 		if (t instanceof e) return this.#e.subtract(t.left), this.#t.subtract(t.right), this;
 		if (typeof t == "string" && !e.isEquationString(t)) return this.subtract(new e(t));
-		let n = new M(t);
+		let n = new N(t);
 		return this.#e.subtract(n), this.#t.subtract(n), this;
 	}
 	test = (e) => this.left.evaluate(e).isEqual(this.right.evaluate(e));
@@ -3307,27 +2260,30 @@ var M = class e {
 	};
 	#i = (e) => e === void 0 ? "=" : e.includes("geq") || e.includes(">=") || e.includes("=>") ? ">=" : e.includes(">") ? ">" : e.includes("leq") || e.includes("<=") || e.includes("=<") ? "<=" : e.includes("<") ? "<" : "=";
 	#a = () => this.#n === "=" ? this : this.#n.includes("<") ? (this.#n.replace("<", ">"), this) : (this.#n.includes(">") && this.#n.replace(">", "<"), this);
-}, P = class e {
+}, F = class e {
 	#e;
 	#t;
 	#n;
 	#r = !1;
 	constructor(t, n) {
-		return t instanceof e ? (this.#t = t.polynom.clone(), this.#n = t.power.clone(), n !== void 0 && this.#n.multiply(new m(n))) : t === void 0 ? (this.#t = new M(), this.#n = new m(1)) : (this.#t = new M(t), this.#n = new m(n ?? 1)), this.#e = 1, this;
+		return t instanceof e ? (this.#t = t.polynom.clone(), this.#n = t.power.clone(), n !== void 0 && this.#n.multiply(new _(n))) : t === void 0 ? (this.#t = new N(), this.#n = new _(1)) : (this.#t = new N(t), this.#n = new _(n ?? 1)), this.#e = 1, this;
 	}
 	parse() {
 		throw new a("Method not implemented.");
 	}
+	copy() {
+		throw new a("copy() is not yet implemented for Factor");
+	}
 	clone() {
 		return new e(this);
 	}
 	get tex() {
 		let e = this.power.numerator, t = this.power.denominator, n, r;
-		return this.#e === 0 && t > 1 ? (n = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, r = e === 1 ? "" : `^{ ${e} }`) : (n = this.#r && this.power.isOne() ? this.polynom.tex : se(this.polynom.tex), r = t === 1 && e === 1 ? "" : `^{ ${this.power.tex} }`), n = `${n}${r}`, this.#e === 0 && e < 0 && (n = `\\frac{ 1 }{ ${n} }`), n;
+		return this.#e === 0 && t > 1 ? (n = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, r = e === 1 ? "" : `^{ ${e} }`) : (n = this.#r && this.power.isOne() ? this.polynom.tex : ye(this.polynom.tex), r = t === 1 && e === 1 ? "" : `^{ ${this.power.tex} }`), n = `${n}${r}`, this.#e === 0 && e < 0 && (n = `\\frac{ 1 }{ ${n} }`), n;
 	}
 	get display() {
 		let e = this.power.numerator, t = this.power.denominator, n, r;
-		return this.#e === 0 && t > 1 ? (n = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, r = e === 1 ? "" : `^(${e})`) : (n = this.#r && this.power.isOne() ? this.polynom.display : se(this.polynom.display, !1), r = t === 1 && e === 1 ? "" : `^(${this.power.display})`), n = `${n}${r}`, this.#e === 0 && e < 0 && (n = `1/(${n})`), n;
+		return this.#e === 0 && t > 1 ? (n = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, r = e === 1 ? "" : `^(${e})`) : (n = this.#r && this.power.isOne() ? this.polynom.display : ye(this.polynom.display, !1), r = t === 1 && e === 1 ? "" : `^(${this.power.display})`), n = `${n}${r}`, this.#e === 0 && e < 0 && (n = `1/(${n})`), n;
 	}
 	add() {
 		throw new r("Adding two factors is not possible");
@@ -3351,7 +2307,7 @@ var M = class e {
 	}
 	divide(t) {
 		if (t instanceof e && this.isSameAs(t)) return this.power.subtract(t.power), this;
-		let n = new M(t);
+		let n = new N(t);
 		if (this.isSameAs(n)) return this.power.subtract(1), this;
 		throw new r("The two factors must be the same");
 	}
@@ -3359,7 +2315,7 @@ var M = class e {
 		return t ? this.polynom.evaluate(e, !0) ** this.power.value : this.polynom.evaluate(e).pow(this.power);
 	}
 	fromPolynom(e) {
-		return this.#t = new M(e), this.#n = new m(1), this;
+		return this.#t = new N(e), this.#n = new _(1), this;
 	}
 	hasVariable(e) {
 		return this.polynom.hasVariable(e);
@@ -3375,7 +2331,7 @@ var M = class e {
 	}
 	isSameAs(t) {
 		let n;
-		return n = t instanceof e ? t.polynom : t instanceof M ? t : new M(t), this.polynom.isEqual(n);
+		return n = t instanceof e ? t.polynom : t instanceof N ? t : new N(t), this.polynom.isEqual(n);
 	}
 	isZero() {
 		return this.polynom.isZero();
@@ -3384,7 +2340,7 @@ var M = class e {
 		let n = new e(t);
 		if (this.polynom.monoms.length === 1 && this.power.isOne() && n.polynom.monoms.length === 1 && this.power.isOne()) return this.polynom.multiply(n.polynom), this;
 		if (t instanceof e && this.isSameAs(t)) return this.power.add(t.power), this;
-		let i = new M(t);
+		let i = new N(t);
 		if (this.isSameAs(i)) return this.power.add(1), this;
 		throw new r("The two factors must be the same");
 	}
@@ -3407,7 +2363,7 @@ var M = class e {
 		return this.#n;
 	}
 	set power(e) {
-		this.#n = new m(e);
+		this.#n = new _(e);
 	}
 	primitive() {
 		throw new a("Method not implemented.");
@@ -3426,7 +2382,7 @@ var M = class e {
 	}
 	tableOfSigns() {
 		let e = this.power.clone().reduce(), t = this.polynom.tableOfSigns();
-		return e.isStrictlyNegative() && (t.signs = g(t.signs, "z", "d")), e.denominator % 2 == 0 ? t.signs = g(t.signs, "-", "h") : e.numerator % 2 == 0 && (t.signs = g(t.signs, "-", "+")), {
+		return e.isStrictlyNegative() && (t.signs = A(t.signs, "z", "d")), e.denominator % 2 == 0 ? t.signs = A(t.signs, "-", "h") : e.numerator % 2 == 0 && (t.signs = A(t.signs, "-", "+")), {
 			roots: t.roots,
 			signs: t.signs
 		};
@@ -3444,9 +2400,9 @@ var M = class e {
 		return this.#t.zero(), this.#n.one(), this;
 	}
 	static checkParseAsFactors(e) {
-		let t = _(e, "+");
+		let t = j(e, "+");
 		if (t[0] === "" && t.shift(), t.length > 1) return !1;
-		let n = _(e, "-");
+		let n = j(e, "-");
 		return n[0] === "" && n.shift(), !(n.length > 1);
 	}
 	static factorsFromString(t, n = !0) {
@@ -3454,19 +2410,22 @@ var M = class e {
 		let r = n ? 1 : -1, i = [];
 		for (let n of t.matchAll(/\(([^)]+)\)(?:\^(-?[0-9]+(?:\/[0-9]+)?|\(-?[0-9]+(?:\/[0-9]+)?\)))?|([^(]+)/g)) if (n[1] !== void 0) {
 			let t = (n[2] ?? "1").replace(/[()]/g, "");
-			i.push(new e(new M(n[1]), new m(t).multiply(r)));
-		} else n[3]?.trim() && i.push(new e(new M(n[3].trim()), new m(r)));
+			i.push(new e(new N(n[1]), new _(t).multiply(r)));
+		} else n[3]?.trim() && i.push(new e(new N(n[3].trim()), new _(r)));
 		return i;
 	}
-}, F = /* @__PURE__ */ function(e) {
+}, I = /* @__PURE__ */ function(e) {
 	return e[e.ROOT = 0] = "ROOT", e[e.POWER = 1] = "POWER", e;
-}({}), I = class e {
+}({}), be = class e {
 	#e;
 	#t;
 	constructor(...e) {
 		return this.#e = [], this.#t = [], e.length > 0 && this.parse(...e), this;
 	}
-	parse = (...e) => (this.#e = e.map((e) => new N(e)), this.#n(), this);
+	parse = (...e) => (this.#e = e.map((e) => new P(e)), this.#n(), this);
+	copy() {
+		throw new a("copy() is not yet implemented for LinearSystem");
+	}
 	clone = () => new e().parse(...this.#e.map((e) => e.clone()));
 	get tex() {
 		let e = this.clone().reorder();
@@ -3479,7 +2438,7 @@ var M = class e {
 		let i = t[0].length;
 		if (t.some((e) => e.length !== i)) throw new n("All rows must have the same number of columns");
 		let a = r.split("").splice(0, i - 1);
-		return new e(...t.map((e) => new N(new M(a.join(""), ...e), 0)));
+		return new e(...t.map((e) => new P(new N(a.join(""), ...e), 0)));
 	}
 	static solutionAsDisplay(e) {
 		return `(${e.map((e) => e.display).join(";")})`;
@@ -3494,7 +2453,7 @@ var M = class e {
 			for (let n = 0; n < e; n++) this.#e[n].add(t.equations[n]);
 		} else {
 			if (r === void 0 || r < 0 || r >= this.#e.length) throw new o("Index out of range");
-			let e = new N(t);
+			let e = new P(t);
 			this.#e[r].add(e);
 		}
 		return this;
@@ -3517,7 +2476,7 @@ var M = class e {
 		return t !== void 0 && t.length > 0 && (o = t[0].length), `\\left\\{\\begin{array}{${"r".repeat(i.length)}cl ${"|l".repeat(o)}}${a.join("\\\\ ")}\\end{array}\\right.`;
 	};
 	degree(e) {
-		return m.max(...this.#e.map((t) => t.degree(e)));
+		return _.max(...this.#e.map((t) => t.degree(e)));
 	}
 	get equations() {
 		return this.#e;
@@ -3583,7 +2542,7 @@ var M = class e {
 		let t = [], n = this.equations.map((t) => t.left.monomByLetter(e).coefficient.value);
 		return n.forEach((e, r) => {
 			for (let i = r + 1; i < n.length; i++) {
-				let a = p.lcm(e, n[i]), o = e < 0 ? -1 : 1;
+				let a = g.lcm(e, n[i]), o = e < 0 ? -1 : 1;
 				t.push([{
 					id: r,
 					factor: o * a / e
@@ -3601,7 +2560,7 @@ var M = class e {
 			for (let n = 0; n < e; n++) this.#e[n].subtract(t.equations[n]);
 		} else {
 			if (r === void 0 || r < 0 || r >= this.#e.length) throw new o("Index out of range");
-			let e = new N(t);
+			let e = new P(t);
 			this.#e[r].subtract(e);
 		}
 		return this;
@@ -3636,14 +2595,14 @@ var M = class e {
 			n.variable = e, t.push(n);
 		}), t);
 	}
-}, L = class {
+}, xe = class {
 	#e;
 	constructor(e) {
 		return this.#e = [], e !== void 0 && this.parse(e), this;
 	}
 	parse = (e) => {
 		try {
-			this.#e = new O(T.SET).parse(e).rpn;
+			this.#e = new D(T.SET).parse(e).rpn;
 		} catch (n) {
 			throw new t(`Cannot parse "${e}" as a LogicalSet`, { cause: n });
 		}
@@ -3796,8 +2755,8 @@ var M = class e {
 		}
 		return [...n[0]].sort();
 	}
-}, R = class e {
-	#e = F.POWER;
+}, L = class e {
+	#e = I.POWER;
 	#t = [];
 	constructor(...e) {
 		return this.parse(...e), this;
@@ -3805,9 +2764,12 @@ var M = class e {
 	parse(...t) {
 		return this.#t = [], t.length === 0 || t.forEach((t) => {
 			if (typeof t == "string") return this.fromString(t);
-			t instanceof e ? this.#t.push(...t.factors.map((e) => e.clone())) : this.#t.push(new P(t));
+			t instanceof e ? this.#t.push(...t.factors.map((e) => e.clone())) : this.#t.push(new F(t));
 		}), this;
 	}
+	copy() {
+		throw new a("copy() is not yet implemented for PolyFactor");
+	}
 	clone() {
 		return new e(...this.#t.map((e) => e.clone()));
 	}
@@ -3820,16 +2782,16 @@ var M = class e {
 		return t.length === 0 ? e.length === 1 ? e[0].asSingle.display : e.map((e, t) => t === 0 && e.polynom.monoms.length === 1 ? e.asSingle.display : e.display).join("") : `(${e.length === 1 ? e[0].asSingle.display : e.map((e) => e.display).join("")})/(${t.length === 1 ? t[0].asSingle.display : t.map((e) => e.display).join("")})`;
 	}
 	static #n(t, n) {
-		let r = z(t), i = z(n), a = Object.keys(r).filter((e) => Object.hasOwn(i, e)).map((e) => {
-			let t = r[e].reduce((e, t) => e.add(t.power), new m("0")), n = i[e].reduce((e, t) => e.add(t.power), new m("0"));
-			return new P(e, m.min(t, n));
+		let r = R(t), i = R(n), a = Object.keys(r).filter((e) => Object.hasOwn(i, e)).map((e) => {
+			let t = r[e].reduce((e, t) => e.add(t.power), new _("0")), n = i[e].reduce((e, t) => e.add(t.power), new _("0"));
+			return new F(e, _.min(t, n));
 		});
 		return new e(...a);
 	}
 	static #r(t, n) {
-		let r = z(t), i = z(n), a = [.../* @__PURE__ */ new Set([...Object.keys(r), ...Object.keys(i)])].map((e) => {
-			let t = Object.hasOwn(r, e) ? r[e].reduce((e, t) => e.add(t.power), new m("0")) : new m(0), n = Object.hasOwn(i, e) ? i[e].reduce((e, t) => e.add(t.power), new m("0")) : new m(0);
-			return new P(e, m.max(t, n));
+		let r = R(t), i = R(n), a = [.../* @__PURE__ */ new Set([...Object.keys(r), ...Object.keys(i)])].map((e) => {
+			let t = Object.hasOwn(r, e) ? r[e].reduce((e, t) => e.add(t.power), new _("0")) : new _(0), n = Object.hasOwn(i, e) ? i[e].reduce((e, t) => e.add(t.power), new _("0")) : new _(0);
+			return new F(e, _.max(t, n));
 		});
 		return new e(...a);
 	}
@@ -3854,17 +2816,17 @@ var M = class e {
 				e.multiply(t.clone().divide(r[n]));
 			}), i = t;
 		}
-		let a = e.gcd(...n), o = new M(0).add(...n.map((e) => e.divide(a).reduce().develop().factors[0].polynom)).reduce();
-		return this.#t = [...a.factors, new P(o)], i && this.divide(i), this.#t = this.#t.filter((e) => !e.power.isZero()), this;
+		let a = e.gcd(...n), o = new N(0).add(...n.map((e) => e.divide(a).reduce().develop().factors[0].polynom)).reduce();
+		return this.#t = [...a.factors, new F(o)], i && this.divide(i), this.#t = this.#t.filter((e) => !e.power.isZero()), this;
 	}
 	get asPower() {
-		return this.#e = F.POWER, this;
+		return this.#e = I.POWER, this;
 	}
 	get asRoot() {
-		return this.#e = F.ROOT, this;
+		return this.#e = I.ROOT, this;
 	}
 	degree(e) {
-		return this.#t.reduce((t, n) => t.add(n.degree(e)), new m("0"));
+		return this.#t.reduce((t, n) => t.add(n.degree(e)), new _("0"));
 	}
 	get denominator() {
 		return new e(...this.#t.filter((e) => e.power.isNegative()).map((e) => e.clone().inverse()));
@@ -3880,7 +2842,7 @@ var M = class e {
 		return r !== void 0 && (this.#t = r.factors), this.add(...t);
 	}
 	develop() {
-		let t = new M("1"), n = new M("1");
+		let t = new N("1"), n = new N("1");
 		return this.numerator.factors.forEach((e) => {
 			t.multiply(e.develop());
 		}), this.denominator.factors.forEach((e) => {
@@ -3891,7 +2853,7 @@ var M = class e {
 		return this.#t = this.#t.concat(e.clone().factors.map((e) => e.inverse())), this;
 	}
 	evaluate(e, t) {
-		return t ? this.#t.reduce((n, r) => n * r.evaluate(e, t), 1) : this.#t.reduce((t, n) => t.multiply(n.evaluate(e)), new m("1"));
+		return t ? this.#t.reduce((n, r) => n * r.evaluate(e, t), 1) : this.#t.reduce((t, n) => t.multiply(n.evaluate(e)), new _("1"));
 	}
 	factorize(t) {
 		let n = [];
@@ -3899,7 +2861,7 @@ var M = class e {
 			let r = e.polynom.factorize(t);
 			if (r.length > 1) {
 				let t = e.power.clone();
-				n.push(...r.map((e) => new P(e, t)));
+				n.push(...r.map((e) => new F(e, t)));
 			} else n.push(e.clone());
 		});
 		let r = new e(...n), i = r.numerator.reduce(), a = r.denominator.reduce();
@@ -3912,20 +2874,20 @@ var M = class e {
 		this.#t = e;
 	}
 	fromPolynom(e, t) {
-		if (this.#t = [new P(new M(e))], t) {
-			let e = new M(t);
+		if (this.#t = [new F(new N(e))], t) {
+			let e = new N(t);
 			if (e.isOne()) return this;
 			if (e.isZero()) throw new r("Cannot divide by zero");
-			this.#t.push(new P(e, -1));
+			this.#t.push(new F(e, -1));
 		}
 		return this;
 	}
 	fromString(e) {
 		this.#t = [];
-		let [n, ...r] = _(e, "/");
+		let [n, ...r] = j(e, "/");
 		if (n === "") throw new t("Parsing a PolyFactor from a string requires a numerator");
 		if (r.length > 1) throw new t("Parsing a PolyFactor from a string only allows max one signe \"/\"");
-		return this.#t = r.length === 0 ? P.factorsFromString(h(n), !0) : [...P.factorsFromString(h(n), !0), ...P.factorsFromString(h(r[0]), !1)], this;
+		return this.#t = r.length === 0 ? F.factorsFromString(k(n), !0) : [...F.factorsFromString(k(n), !0), ...F.factorsFromString(k(r[0]), !1)], this;
 	}
 	getRoots() {
 		return [];
@@ -3960,11 +2922,11 @@ var M = class e {
 		return new e(...this.#t.filter((e) => e.power.isPositive()));
 	}
 	one() {
-		return this.#t = [new P("1", "1")], this;
+		return this.#t = [new F("1", "1")], this;
 	}
 	opposite() {
 		let e = this.#t.findIndex((e) => e.display === "(-1)");
-		return e >= 0 ? this.#t.splice(e, 1) : this.#t.push(new P("-1", "1")), this;
+		return e >= 0 ? this.#t.splice(e, 1) : this.#t.push(new F("-1", "1")), this;
 	}
 	pow(e) {
 		return this.#t = this.#t.map((t) => t.pow(e)), this;
@@ -3973,14 +2935,14 @@ var M = class e {
 		throw new a("Method not implemented.");
 	}
 	reduce() {
-		let e = z(this);
+		let e = R(this);
 		this.#t = Object.values(e).map((e) => {
 			let t = e[0].polynom;
-			return new P(t, e.reduce((e, t) => e.add(t.power), new m("0")).reduce());
+			return new F(t, e.reduce((e, t) => e.add(t.power), new _("0")).reduce());
 		}).filter((e) => !e.power.isZero());
-		let t = new P(1), n = new P(1), r = this.#t.filter((e) => e.polynom.monoms.length === 1 && e.power.isRelative());
+		let t = new F(1), n = new F(1), r = this.#t.filter((e) => e.polynom.monoms.length === 1 && e.power.isRelative());
 		return r.length > 0 && (r.forEach((e) => {
-			e.power.isPositive() ? t.multiply(new P(e.polynom.clone().pow(e.power.value))) : n.multiply(new P(e.polynom.clone().pow(-e.power.value)));
+			e.power.isPositive() ? t.multiply(new F(e.polynom.clone().pow(e.power.value))) : n.multiply(new F(e.polynom.clone().pow(-e.power.value)));
 		}), this.#t = this.#t.filter((e) => !(e.polynom.monoms.length === 1 && e.power.isRelative())), n.polynom.isOne() || this.#t.push(n.inverse()), t.polynom.isOne() || this.#t.push(t)), this;
 	}
 	root(e) {
@@ -4004,7 +2966,7 @@ var M = class e {
 	}
 	tableOfSigns() {
 		let e = this.getZeroes(), t = e.map((e) => e.value), n = this.factorize().factors.map((e) => ({
-			factor: new P(e),
+			factor: new F(e),
 			...e.tableOfSigns()
 		}));
 		return n.forEach((n) => {
@@ -4038,18 +3000,18 @@ var M = class e {
 		return this.#t.reduce((e, t) => e.concat(t.variables), []);
 	}
 	zero() {
-		return this.#t = [new P("0", "1")], this;
+		return this.#t = [new F("0", "1")], this;
 	}
 	#i() {
 		let e, t = [];
-		return this.#e === F.ROOT ? (e = this.numerator.factors, t = this.denominator.factors) : e = this.#t, e.length === 0 && (e = [new P("1")]), {
+		return this.#e === I.ROOT ? (e = this.numerator.factors, t = this.denominator.factors) : e = this.#t, e.length === 0 && (e = [new F("1")]), {
 			num: e,
 			den: t
 		};
 	}
 };
-function z(e) {
-	let t = new m().one(), n = new m().one(), r = e.factors.reduce((e, r) => {
+function R(e) {
+	let t = new _().one(), n = new _().one(), r = e.factors.reduce((e, r) => {
 		if (r.polynom.degree().isZero() && r.power.isRelative()) {
 			let i = r.polynom.monoms[0].coefficient.pow(r.power.clone().abs());
 			return r.power.isPositive() ? t.multiply(i) : n.multiply(i), e;
@@ -4057,11 +3019,11 @@ function z(e) {
 		let i = r.polynom.display;
 		return Object.hasOwn(e, i) ? e[i].push(r) : e[i] = [r], e;
 	}, {}), { numerator: i, denominator: a } = t.divide(n).reduce();
-	return i !== 1 && (r[i.toString()] = [new P(i, 1)]), a !== 1 && (r[a.toString()] = [new P(a, -1)]), r;
+	return i !== 1 && (r[i.toString()] = [new F(i, 1)]), a !== 1 && (r[a.toString()] = [new F(a, -1)]), r;
 }
 //#endregion
 //#region src/algebra/matrix.ts
-var ve = class e {
+var Se = class e {
 	#e = null;
 	#t = 0;
 	#n = [];
@@ -4071,6 +3033,9 @@ var ve = class e {
 	parse(e) {
 		return this.fromValues(e);
 	}
+	copy() {
+		throw new a("copy() is not yet implemented for Matrix");
+	}
 	clone() {
 		let t = [];
 		return this.#n.forEach((e) => {
@@ -4109,10 +3074,10 @@ var ve = class e {
 	aij(e, t) {
 		return e < 0 || e > this.dimension.rows || t < 0 || t > this.dimension.cols ? null : this.#n[e][t];
 	}
-	get bmatrix() {
+	get asBmatrix() {
 		return this.#t = 1, this;
 	}
-	get Bmatrix() {
+	get asBraceMatrix() {
 		return this.#t = 2, this;
 	}
 	canBeAdded(e) {
@@ -4126,7 +3091,7 @@ var ve = class e {
 		return this.dimension.cols === e.dimension.rows;
 	}
 	characteristic_polynom(t) {
-		return t ??= "k", this.clone().subtract(new e(this.dimension.rows).one().multiply(new M(t))).determinant();
+		return t ??= "k", this.clone().subtract(new e(this.dimension.rows).one().multiply(new N(t))).determinant();
 	}
 	cofactor(e, t) {
 		let n = this.clone();
@@ -4135,14 +3100,14 @@ var ve = class e {
 		}), n.determinant().multiply((-1) ** (e + t));
 	}
 	get cols() {
-		let e = Array.from({ length: this.dimension.cols }, () => Array.from({ length: this.dimension.rows }, () => new M()));
+		let e = Array.from({ length: this.dimension.cols }, () => Array.from({ length: this.dimension.rows }, () => new N()));
 		return this.forEach((t, n, r) => {
 			e[r][n] = t;
 		}), e;
 	}
 	determinant() {
 		if (!this.isSquare()) throw new n("Matrix is not square");
-		let e = new M();
+		let e = new N();
 		return this.#n.length === 1 ? this.#n[0][0].clone() : (this.values[0].forEach((t, n) => {
 			let r = this.cofactor(0, n);
 			e.add(t.clone().multiply(r));
@@ -4165,12 +3130,12 @@ var ve = class e {
 		});
 	}
 	fromDimensions(e, t) {
-		return this.#n = Array.from({ length: e }, () => Array.from({ length: t }, () => new M())), this;
+		return this.#n = Array.from({ length: e }, () => Array.from({ length: t }, () => new N())), this;
 	}
 	fromString(e) {
 		if (e.startsWith("((") && e.endsWith("))")) return this.fromString(e.substring(1, e.length - 1));
 		let t = e.split("),(");
-		return this.#n = t.map((e, n) => n === 0 ? e.substring(1).split(",") : n === t.length - 1 ? e.substring(0, e.length - 1).split(",") : e.split(",")).map((e) => e.map((e) => new M(e))), this;
+		return this.#n = t.map((e, n) => n === 0 ? e.substring(1).split(",") : n === t.length - 1 ? e.substring(0, e.length - 1).split(",") : e.split(",")).map((e) => e.map((e) => new N(e))), this;
 	}
 	fromValues(e) {
 		this.#n = [];
@@ -4179,7 +3144,7 @@ var ve = class e {
 		return e.forEach((e) => {
 			let t = [];
 			e.forEach((e) => {
-				t.push(new M(e));
+				t.push(new N(e));
 			}), this.#n.push(t);
 		}), this;
 	}
@@ -4189,7 +3154,7 @@ var ve = class e {
 		if (e.some((e) => e.dimension !== t)) throw new n("Each vectors must be the same dimension");
 		return this.fromDimensions(e[0].dimension, e.length), e.forEach((e, t) => {
 			e.array.forEach((e, n) => {
-				this.#n[n][t] = new M(e);
+				this.#n[n][t] = new N(e);
 			});
 		}), this;
 	}
@@ -4232,7 +3197,7 @@ var ve = class e {
 			if (!this.canBeMultiplied(t)) throw new n("Cannot multiply a matrix with incompatibles dimensions");
 			let r = new e(this.dimension.rows, t.dimension.cols);
 			return r.forEach((e, n, i) => {
-				let a = this.rows[n], o = t.cols[i], s = new M();
+				let a = this.rows[n], o = t.cols[i], s = new N();
 				a.forEach((e, t) => {
 					s.add(e.clone().multiply(o[t]));
 				}), r.setValue(n, i, s);
@@ -4252,17 +3217,17 @@ var ve = class e {
 			e.opposite();
 		}), this;
 	}
-	get pmatrix() {
+	get asPmatrix() {
 		return this.#t = 0, this;
 	}
-	get vmatrix() {
+	get asVmatrix() {
 		return this.#t = 3, this;
 	}
-	get Vmatrix() {
+	get asDoubleVmatrix() {
 		return this.#t = 4, this;
 	}
 	pow(e) {
-		return j(this, e);
+		return M(this, e);
 	}
 	reduce() {
 		throw new a("Not yet implemented");
@@ -4273,7 +3238,7 @@ var ve = class e {
 	setValue(e, t, n) {
 		let { rows: r, cols: i } = this.dimension;
 		if (e < 0 || e >= r || t < 0 || t >= i) throw new o(`${e}x${t} is out of range (${r}x${i})`);
-		return this.#n[e][t] = new M(n), this;
+		return this.#n[e][t] = new N(n), this;
 	}
 	subtract(e) {
 		if (!this.canBeAdded(e)) throw new n("Cannot subtract a matrix with different dimensions.");
@@ -4298,31 +3263,31 @@ var ve = class e {
 };
 //#endregion
 //#region src/geometry/geomMath.ts
-function ye(e, t) {
+function Ce(e, t) {
 	return e.dimension === t.dimension && e.array.every((e, n) => t.array[n].isEqual(e));
 }
-function be(e, t) {
+function we(e, t) {
 	if (e.dimension !== t.dimension) return !1;
 	let n = t.array[0].value / e.array[0].value;
 	return e.array.every((e, r) => t.array[r].value === e.value * n);
 }
-function xe(e, t) {
-	return e.dimension === t.dimension ? e.array.reduce((e, n, r) => e.add(n.clone().multiply(t.array[r])), new m(0)) : new m().invalid();
+function Te(e, t) {
+	return e.dimension === t.dimension ? e.array.reduce((e, n, r) => e.add(n.clone().multiply(t.array[r])), new _(0)) : new _().invalid();
 }
-function Se(...e) {
+function Ee(...e) {
 	if (e.some((t) => t.dimension !== e[0].dimension)) throw new n("All vectors must have the same dimension");
 	if (e[0].dimension !== e.length) throw new n(`The determinant of dimension ${e[0].dimension} must have the same number of vectors (${e.length} given)`);
 	return e[0].dimension === 2 ? e[0].array[0].clone().multiply(e[1].array[1]).subtract(e[0].array[1].clone().multiply(e[1].array[0])) : e[0].array[0].clone().multiply(e[1].array[1].clone().multiply(e[2].array[2]).subtract(e[1].array[2].clone().multiply(e[2].array[1]))).subtract(e[0].array[1].clone().multiply(e[1].array[0].clone().multiply(e[2].array[2]).subtract(e[1].array[2].clone().multiply(e[2].array[0])))).add(e[0].array[2].clone().multiply(e[1].array[0].clone().multiply(e[2].array[1]).subtract(e[1].array[1].clone().multiply(e[2].array[0]))));
 }
 //#endregion
 //#region src/geometry/TupleN.ts
-var B = class {
+var z = class {
 	#e = [];
 	#t;
 	constructor(...e) {
-		this.#e = e.map((e) => new m(e));
+		this.#e = e.map((e) => new _(e));
 	}
-	copy() {
+	cloneCoordinates() {
 		return this.#e.map((e) => e.clone());
 	}
 	get array() {
@@ -4337,7 +3302,7 @@ var B = class {
 	fromString(e) {
 		e.startsWith("(") && (e = e.substring(1)), e.endsWith(")") && (e = e.substring(0, e.length - 1));
 		let t = e.split(/[,;\s]/g).filter((e) => e.trim() !== "");
-		return t.length < 2 || (this.#e = t.map((e) => new m(e))), this;
+		return t.length < 2 || (this.#e = t.map((e) => new _(e))), this;
 	}
 	get onChange() {
 		return this.#t;
@@ -4348,20 +3313,20 @@ var B = class {
 	setDimension(e = 2) {
 		if (e < 2) throw new n("Dimension must be at least 2");
 		if (e < this.dimension) this.#e = this.#e.slice(0, e);
-		else if (e > this.dimension) for (let t = this.dimension; t < e; t++) this.#e.push(new m(0));
+		else if (e > this.dimension) for (let t = this.dimension; t < e; t++) this.#e.push(new _(0));
 		return this;
 	}
 	get x() {
 		return this.#e[0];
 	}
 	set x(e) {
-		this.#e[0] = new m(e), this.#t?.();
+		this.#e[0] = new _(e), this.#t?.();
 	}
 	get y() {
 		return this.#e[1];
 	}
 	set y(e) {
-		this.#e[1] = new m(e), this.#t?.();
+		this.#e[1] = new _(e), this.#t?.();
 	}
 	get z() {
 		if (this.dimension < 3) throw new n("Vector is not 3D");
@@ -4369,28 +3334,28 @@ var B = class {
 	}
 	set z(e) {
 		if (this.dimension < 3) throw new n("Vector is not 3D");
-		this.#e[2] = new m(e), this.#t?.();
+		this.#e[2] = new _(e), this.#t?.();
 	}
 	zero = () => (this.#e.forEach((e) => e.zero()), this.#t?.(), this);
-}, V = class e extends B {
+}, B = class e extends z {
 	constructor(...e) {
 		super(), e.length > 0 && this.parse(...e);
 	}
 	parse(...n) {
 		if (n.length === 1) {
-			if (n[0] instanceof B) return this.array = n[0].copy(), this;
+			if (n[0] instanceof z) return this.array = n[0].cloneCoordinates(), this;
 			if (typeof n[0] == "string") return this.fromString(n[0]), this;
 		}
 		if (n.length > 1) {
 			if (n.some((t) => t instanceof e)) throw new i("Creating a point with  multiple argument requires an input fraction");
-			let r = n.map((e) => new m(e));
+			let r = n.map((e) => new _(e));
 			if (r.some((e) => e.isNaN())) throw new t("The given values are not a valid point string (a,b): ");
 			this.array = r;
 		}
 		return this;
 	}
 	clone() {
-		return new e(...this.copy());
+		return new e(...this.cloneCoordinates());
 	}
 	get tex() {
 		return `\\left(${this.array.map((e) => e.tex).join(";")}\\right)`;
@@ -4400,7 +3365,7 @@ var B = class {
 	}
 	distanceTo(e) {
 		if (this.dimension !== e.dimension) throw new n("The two points must have the same dimensions.");
-		let t = this.array.map((t, n) => e.array[n].clone().subtract(t)).reduce((e, t) => e.add(t.clone().pow(2)), new m(0));
+		let t = this.array.map((t, n) => e.array[n].clone().subtract(t)).reduce((e, t) => e.add(t.clone().pow(2)), new _(0));
 		return new v().from(2, t).reduce();
 	}
 	isEqual(e) {
@@ -4415,28 +3380,31 @@ var B = class {
 			this.array.push(e.clone().add(t.array[n]).divide(2));
 		}), this;
 	}
-}, H = class e extends B {
+}, V = class e extends z {
 	constructor(...e) {
 		return super(), e.length > 0 && this.parse(...e), this;
 	}
 	parse(...e) {
 		if (e.length === 0) throw new i("Invalid value");
 		if (e.length === 1) {
-			if (e[0] instanceof B) return this.array = e[0].copy(), this;
+			if (e[0] instanceof z) return this.array = e[0].cloneCoordinates(), this;
 			if (typeof e[0] == "string") return this.fromString(e[0]);
 			throw new i("Invalid value");
 		}
 		if (e.length === 2) {
 			let [t, r] = e;
-			if (t instanceof B && r instanceof B) {
+			if (t instanceof z && r instanceof z) {
 				if (t.dimension !== r.dimension) throw new n("Vectors must have the same dimension");
 				return this.array = r.array.map((e, n) => e.clone().subtract(t.array[n])), this;
 			}
 		}
-		return this.array = e.map((e) => new m(e)), this;
+		return this.array = e.map((e) => new _(e)), this;
 	}
 	clone() {
-		return new e(...this.copy());
+		return new e(...this.cloneCoordinates());
+	}
+	copy() {
+		throw new a("copy() is not yet implemented for Vector");
 	}
 	get tex() {
 		return `\\begin{pmatrix} ${this.array.map((e) => e.tex).join(" \\\\ ")} \\end{pmatrix}`;
@@ -4459,13 +3427,13 @@ var B = class {
 		if (this.dimension !== 3 || t.dimension !== 3) throw new n("Cross product can only be determined in 3D");
 		return new e(this.y.clone().multiply(t.z).subtract(this.z.clone().multiply(t.y)), this.z.clone().multiply(t.x).subtract(this.x.clone().multiply(t.z)), this.x.clone().multiply(t.y).subtract(this.y.clone().multiply(t.x)));
 	}
-	divideByScalar = (e) => this.multiplyByScalar(new m(e).inverse());
-	dot = (e) => xe(this, e);
+	divideByScalar = (e) => this.multiplyByScalar(new _(e).inverse());
+	dot = (e) => Te(this, e);
 	fromString(e) {
 		return e.startsWith("((") && e.endsWith("))") ? super.fromString(e.slice(1, -1)) : super.fromString(e);
 	}
-	isColinearTo = (e) => be(this, e);
-	isEqual = (e) => ye(this, e);
+	isColinearTo = (e) => we(this, e);
+	isEqual = (e) => Ce(this, e);
 	isNormalTo = (e) => this.dot(e).isZero();
 	get isNull() {
 		return this.array.every((e) => e.isZero());
@@ -4477,14 +3445,14 @@ var B = class {
 		return this.array.every((e) => e.isZero());
 	}
 	multiplyByScalar = (e) => {
-		let t = new m(e);
+		let t = new _(e);
 		return this.array.forEach((e) => e.multiply(t)), this;
 	};
 	get norm() {
 		return Math.sqrt(this.normSquare.value);
 	}
 	get normSquare() {
-		return this.array.reduce((e, t) => e.add(t.clone().pow(2)), new m(0));
+		return this.array.reduce((e, t) => e.add(t.clone().pow(2)), new _(0));
 	}
 	normal = () => {
 		if (this.dimension >= 3) throw new n("Normal vector can only be determined in 2D");
@@ -4494,8 +3462,8 @@ var B = class {
 	one = () => (this.zero(), this.x.one(), this);
 	opposite = () => (this.array.forEach((e) => e.opposite()), this);
 	simplify = () => {
-		let e = p.lcm(...this.array.map((e) => e.denominator)), t = p.gcd(...this.array.map((e) => e.numerator));
-		return this.multiplyByScalar(new m(e, t)), this.x.isNegative() && this.opposite(), this;
+		let e = g.lcm(...this.array.map((e) => e.denominator)), t = g.gcd(...this.array.map((e) => e.numerator));
+		return this.multiplyByScalar(new _(e, t)), this.x.isNegative() && this.opposite(), this;
 	};
 	subtract = (e) => this.add(e.clone().opposite());
 	translate(...e) {
@@ -4505,43 +3473,43 @@ var B = class {
 		let e = this.norm;
 		return e === 0 ? this : this.divideByScalar(e);
 	};
-}, U = /* @__PURE__ */ function(e) {
+}, H = /* @__PURE__ */ function(e) {
 	return e.None = "none", e.Parallel = "parallel", e.Perpendicular = "perpendicular", e.Tangent = "tangent", e;
-}({}), Ce = /* @__PURE__ */ function(e) {
+}({}), De = /* @__PURE__ */ function(e) {
 	return e.None = "none", e.Parallel = "parallel", e.Perpendicular = "perpendicular", e.Tangent = "tangent", e;
 }({});
 //#endregion
 //#region src/randomization/rndHelpers.ts
-function we(e = .5) {
+function Oe(e = .5) {
 	return Math.random() < e;
 }
-function W(e, t, n) {
-	if (t === void 0) return e >= 0 ? W(0, e) : W(e, 0);
+function U(e, t, n) {
+	if (t === void 0) return e >= 0 ? U(0, e) : U(e, 0);
 	if (e === t) return e;
 	if (n === void 0) return Math.floor(Math.random() * (t - e + 1) + e);
 	if (Math.abs(t - e) <= n.length) throw new i("The number of excluded values is too high.");
-	let r = W(e, t);
-	for (; n.includes(r);) r = W(e, t);
+	let r = U(e, t);
+	for (; n.includes(r);) r = U(e, t);
 	return r;
 }
-function G(e, t) {
-	return t === !1 ? we() ? W(1, e) : -W(1, e) : W(-e, e);
+function W(e, t) {
+	return t === !1 ? Oe() ? U(1, e) : -U(1, e) : U(-e, e);
 }
-function Te(e, t) {
-	let n = p.pythagoreanTripletsWithTarget(e).filter((e) => t === !0 || !e.includes(0));
-	return n.length === 0 ? null : K(n);
+function ke(e, t) {
+	let n = g.pythagoreanTripletsWithTarget(e).filter((e) => t === !0 || !e.includes(0));
+	return n.length === 0 ? null : G(n);
 }
-function Ee(e) {
-	let t = p.primes();
-	return e !== void 0 && (t = t.filter((t) => t < e)), K(t);
+function Ae(e) {
+	let t = g.primes();
+	return e !== void 0 && (t = t.filter((t) => t < e)), G(t);
 }
-function De(e, t) {
-	return t === void 0 && (t = 1), e.length <= 0 ? Object.values(e) : Oe(e).slice(0, t);
+function je(e, t) {
+	return t === void 0 && (t = 1), e.length <= 0 ? Object.values(e) : Me(e).slice(0, t);
 }
-function K(e) {
-	return e.length === 0 ? null : e[W(0, e.length - 1)];
+function G(e) {
+	return e.length === 0 ? null : e[U(0, e.length - 1)];
 }
-function Oe(e) {
+function Me(e) {
 	let t = Object.values(e);
 	for (let e = t.length - 1; e > 0; e--) {
 		let n = Math.floor(Math.random() * (e + 1)), r = t[e];
@@ -4551,9 +3519,9 @@ function Oe(e) {
 }
 //#endregion
 //#region src/geometry/line.ts
-var q = class e {
-	static PARALLEL = U.Parallel;
-	static PERPENDICULAR = U.Perpendicular;
+var K = class e {
+	static PARALLEL = H.Parallel;
+	static PERPENDICULAR = H.Perpendicular;
 	#e;
 	#t;
 	#n;
@@ -4561,36 +3529,39 @@ var q = class e {
 	#i;
 	#a = 1;
 	constructor(...e) {
-		return this.#t = new m().zero(), this.#n = new m().zero(), this.#r = new m().zero(), this.#e = new H(), this.#i = "lr", e.length > 0 && this.parse(...e), this;
+		return this.#t = new _().zero(), this.#n = new _().zero(), this.#r = new _().zero(), this.#e = new V(), this.#i = "lr", e.length > 0 && this.parse(...e), this;
 	}
 	parse = (...n) => {
 		if (n.length === 0) return this;
 		if (n.length === 1) {
 			if (n[0] instanceof e) return this.fromCoefficient(n[0].a, n[0].b, n[0].c);
-			if (n[0] instanceof N) return this.fromEquation(n[0]);
+			if (n[0] instanceof P) return this.fromEquation(n[0]);
 			if (typeof n[0] == "string") try {
-				let e = new N(n[0]);
+				let e = new P(n[0]);
 				return this.parse(e);
 			} catch (e) {
 				throw new t(`Cannot parse "${n[0]}" as a Line`, { cause: e });
 			}
 		}
 		if (n.length === 2) {
-			if (n[0] instanceof V && n[1] instanceof V) return this.fromPoints(n[0], n[1]);
-			if (n[0] instanceof V && n[1] instanceof H) return this.fromPointAndDirection(n[0], n[1]);
+			if (n[0] instanceof B && n[1] instanceof B) return this.fromPoints(n[0], n[1]);
+			if (n[0] instanceof B && n[1] instanceof V) return this.fromPointAndDirection(n[0], n[1]);
 		}
-		return n.length === 3 && n.every((e) => m.isFraction(e)) ? this.fromCoefficient(n[0], n[1], n[2]) : (console.warn("Something wrong happened while creating the line"), console.warn(n), this);
+		return n.length === 3 && n.every((e) => _.isFraction(e)) ? this.fromCoefficient(n[0], n[1], n[2]) : (console.warn("Something wrong happened while creating the line"), console.warn(n), this);
 	};
+	copy() {
+		throw new a("copy() is not yet implemented for Line");
+	}
 	clone = () => new e().fromCoefficient(this.#t, this.#n, this.#r);
 	get tex() {
 		let e = this.#a;
 		switch (this.#a = 1, e) {
 			case 0: return this.getEquation().reorder().tex;
-			case 2: return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new M().parse("x", this.slope, this.height).tex;
+			case 2: return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new N().parse("x", this.slope, this.height).tex;
 			case 3:
 			case 4: {
 				let t = this.d.clone().simplify();
-				return e === 3 ? `${H.asTex("x", "y")} = ${H.asTex(this.#e.x.tex, this.#e.y.tex)} + k\\cdot ${H.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}\n\tx &= ${new M(this.#e.x).add(new A(t.x).multiply(new A("k"))).reorder("k", !0).tex}\\\\\n\ty &= ${new M(this.#e.y).add(new A(t.y).multiply(new A("k"))).reorder("k", !0).tex}\n\\end{aligned}\\right.`;
+				return e === 3 ? `${V.asTex("x", "y")} = ${V.asTex(this.#e.x.tex, this.#e.y.tex)} + k\\cdot ${V.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}\n\tx &= ${new N(this.#e.x).add(new O(t.x).multiply(new O("k"))).reorder("k", !0).tex}\\\\\n\ty &= ${new N(this.#e.y).add(new O(t.y).multiply(new O("k"))).reorder("k", !0).tex}\n\\end{aligned}\\right.`;
 			}
 			default: {
 				let e = this.getEquation();
@@ -4602,13 +3573,13 @@ var q = class e {
 		let e = this.#a;
 		switch (this.#a = 1, e) {
 			case 0: return this.getEquation().reorder().display;
-			case 2: return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new M().parse("x", this.slope, this.height).display;
+			case 2: return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new N().parse("x", this.slope, this.height).display;
 			case 3: {
 				let e = this.d.clone().simplify();
 				return `((x,y))=((${this.#e.x.display},${this.#e.y.display}))+k((${e.x.display},${e.y.display}))`;
 			}
 			case 4: {
-				let e = this.d.clone().simplify(), t = new M(this.#e.x).add(new A(e.x).multiply(new A("k"))).reorder("k", !0), n = new M(this.#e.y).add(new A(e.y).multiply(new A("k"))).reorder("k", !0);
+				let e = this.d.clone().simplify(), t = new N(this.#e.x).add(new O(e.x).multiply(new O("k"))).reorder("k", !0), n = new N(this.#e.y).add(new O(e.y).multiply(new O("k"))).reorder("k", !0);
 				return `{(x,=,${t.display}),(y,=,${n.display}):}`;
 			}
 			default: {
@@ -4661,7 +3632,7 @@ var q = class e {
 		return this.#t.isZero() || (t = this.#t.isOne() ? "x" : this.#t.clone().opposite().isOne() ? "-x" : this.#t.value.toFixed(e) + "x"), this.#n.isZero() || (this.#n.isPositive() && (t += "+"), t += this.#n.value.toFixed(e) + "y"), this.#r.isZero() || (this.#r.isPositive() && (t += "+"), t += this.#r.value.toFixed(e)), t + "=0";
 	}
 	get d() {
-		let e = new H(this.#n.clone(), this.#t.clone().opposite());
+		let e = new V(this.#n.clone(), this.#t.clone().opposite());
 		return (this.#i === "lr" && e.x.isNegative() || this.#i === "rl" && e.x.isPositive()) && e.opposite(), e;
 	}
 	set d(e) {
@@ -4675,19 +3646,19 @@ var q = class e {
 		return n.isZero() ? new v(0) : new v().from(2, n.inverse(), t).reduce();
 	}
 	fromCoefficient(e, t, n) {
-		this.#t = new m(e), this.#n = new m(t), this.#r = new m(n);
+		this.#t = new _(e), this.#n = new _(t), this.#r = new _(n);
 		let r = [
 			this.#t,
 			this.#n,
 			this.#r
-		].every((e) => e.exact) ? p.lcm(this.#t.denominator, this.#n.denominator, this.#r.denominator) : 1;
-		if (r > 1 && (this.#t.multiply(r).reduce(), this.#n.multiply(r).reduce(), this.#r.multiply(r).reduce()), this.#n.isZero()) return this.#e = new H(this.#r.clone().divide(this.#t).opposite(), 0), this;
+		].every((e) => e.exact) ? g.lcm(this.#t.denominator, this.#n.denominator, this.#r.denominator) : 1;
+		if (r > 1 && (this.#t.multiply(r).reduce(), this.#n.multiply(r).reduce(), this.#r.multiply(r).reduce()), this.#n.isZero()) return this.#e = new V(this.#r.clone().divide(this.#t).opposite(), 0), this;
 		for (let e = 0; e < this.#n.value; e++) {
 			let t = this.#t.clone().divide(this.#n).multiply(e).subtract(this.#r.clone().divide(this.#n)).reduce();
-			if (this.#e = new H(e, t), t.isRelative()) return this;
+			if (this.#e = new V(e, t), t.isRelative()) return this;
 		}
 		let i = this.#r.clone().divide(this.#n).opposite().reduce();
-		return this.#e = new H(0, i), this;
+		return this.#e = new V(0, i), this;
 	}
 	fromEquation(e) {
 		e.reorder(!0);
@@ -4705,23 +3676,23 @@ var q = class e {
 	fromPointAndDirection(e, t) {
 		return this.#i = t.x.isPositive() ? "lr" : "rl", this.fromPointAndNormal(e, t.clone().normal());
 	}
-	fromPointAndLine(e, t, n = U.Parallel) {
-		return n === U.Perpendicular ? this.fromPointAndNormal(e, t.director) : this.fromPointAndNormal(e, t.normal);
+	fromPointAndLine(e, t, n = H.Parallel) {
+		return n === H.Perpendicular ? this.fromPointAndNormal(e, t.director) : this.fromPointAndNormal(e, t.normal);
 	}
-	fromPointAndNormal = (e, t) => t.isZero() ? (console.warn("Normal vector is null."), this) : (this.fromCoefficient(t.x, t.y, e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y)).opposite()), this.#e = new H(e.clone()), this);
+	fromPointAndNormal = (e, t) => t.isZero() ? (console.warn("Normal vector is null."), this) : (this.fromCoefficient(t.x, t.y, e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y)).opposite()), this.#e = new V(e.clone()), this);
 	fromPoints(e, t) {
-		return this.fromPointAndNormal(e, new H(e, t).normal());
+		return this.fromPointAndNormal(e, new V(e, t).normal());
 	}
 	getEquation() {
-		return new N(new M().parse("xy", this.#t, this.#n, this.#r), new M("0")).simplify();
+		return new P(new N().parse("xy", this.#t, this.#n, this.#r), new N("0")).simplify();
 	}
 	getValueAtX = (e) => {
-		let t = this.getEquation().isolate("y"), n = new m(e);
-		return t instanceof N ? t.right.evaluate({ x: n }) : new m().invalid();
+		let t = this.getEquation().isolate("y"), n = new _(e);
+		return t instanceof P ? t.right.evaluate({ x: n }) : new _().invalid();
 	};
 	getValueAtY = (e) => {
-		let t = this.getEquation().isolate("x"), n = new m(e);
-		return t instanceof N ? t.right.evaluate({ y: n }) : new m().invalid();
+		let t = this.getEquation().isolate("x"), n = new _(e);
+		return t instanceof P ? t.right.evaluate({ y: n }) : new _().invalid();
 	};
 	get height() {
 		return this.#r.clone().opposite().divide(this.#n);
@@ -4731,8 +3702,8 @@ var q = class e {
 		return r.hasIntersection ? r.point.x.value >= Math.min(t.x.value, n.x.value) && r.point.x.value <= Math.max(t.x.value, n.x.value) && r.point.y.value >= Math.min(t.y.value, n.y.value) && r.point.y.value <= Math.max(t.y.value, n.y.value) : !1;
 	}
 	intersection = (e) => {
-		let t = new V(), n = !1, r = !1;
-		return this.#n.isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new m().invalid(), t.y = new m().invalid(), n = !0) : this.isSameAs(e) ? (t.x = new m().invalid(), t.y = new m().invalid(), r = !0) : (t.x = this.#n.clone().multiply(e.c).subtract(this.#r.clone().multiply(e.b)).divide(this.#t.clone().multiply(e.b).subtract(this.#n.clone().multiply(e.a))), t.y = this.#t.clone().multiply(e.c).subtract(this.#r.clone().multiply(e.a)).divide(this.#n.clone().multiply(e.a).subtract(this.#t.clone().multiply(e.b)))), {
+		let t = new B(), n = !1, r = !1;
+		return this.#n.isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new _().invalid(), t.y = new _().invalid(), n = !0) : this.isSameAs(e) ? (t.x = new _().invalid(), t.y = new _().invalid(), r = !0) : (t.x = this.#n.clone().multiply(e.c).subtract(this.#r.clone().multiply(e.b)).divide(this.#t.clone().multiply(e.b).subtract(this.#n.clone().multiply(e.a))), t.y = this.#t.clone().multiply(e.c).subtract(this.#r.clone().multiply(e.a)).divide(this.#n.clone().multiply(e.a).subtract(this.#t.clone().multiply(e.b)))), {
 			point: t,
 			hasIntersection: !(n || r),
 			isParallel: n,
@@ -4753,25 +3724,25 @@ var q = class e {
 		return this.d.normal();
 	}
 	get normal() {
-		return new H(this.#t, this.#n);
+		return new V(this.#t, this.#n);
 	}
 	randomNearPoint = (e) => {
 		let t = this.randomPoint(e), n = 10;
-		for (; this.isOnLine(t) && n > 0;) t.x.add(G(1, !1)), t.y.add(G(1, !1)), n--;
+		for (; this.isOnLine(t) && n > 0;) t.x.add(W(1, !1)), t.y.add(W(1, !1)), n--;
 		return t;
 	};
-	randomPoint = (e) => new V(this.d.clone().multiplyByScalar(G(e === void 0 || e <= 1 ? 3 : e, !1)).add(this.#e));
+	randomPoint = (e) => new B(this.d.clone().multiplyByScalar(W(e === void 0 || e <= 1 ? 3 : e, !1)).add(this.#e));
 	simplify = () => {
-		let e = p.lcm(this.#t.denominator, this.#n.denominator, this.#r.denominator), t = p.gcd(this.#t.numerator, this.#n.numerator, this.#r.numerator);
+		let e = g.lcm(this.#t.denominator, this.#n.denominator, this.#r.denominator), t = g.gcd(this.#t.numerator, this.#n.numerator, this.#r.numerator);
 		return this.fromCoefficient(this.#t.clone().multiply(e).divide(t), this.#n.clone().multiply(e).divide(t), this.#r.clone().multiply(e).divide(t)), this;
 	};
 	get slope() {
 		return this.#t.clone().opposite().divide(this.#n);
 	}
-}, J = class e {
-	#e = new V();
-	#t = new V();
-	#n = new V();
+}, q = class e {
+	#e = new B();
+	#t = new B();
+	#n = new B();
 	#r = !1;
 	#i = null;
 	#a = !0;
@@ -4792,11 +3763,11 @@ var q = class e {
 				let [e, n, r] = t;
 				return this.fromLines(e, n, r);
 			}
-			if (t.every((e) => e instanceof q)) return this.fromLines(t[0], t[1], t[2]);
-			if (t.every((e) => e instanceof V)) return this.fromPoints(t[0], t[1], t[2]);
+			if (t.every((e) => e instanceof K)) return this.fromLines(t[0], t[1], t[2]);
+			if (t.every((e) => e instanceof B)) return this.fromPoints(t[0], t[1], t[2]);
 		}
 		if (t.length === 6) {
-			let e = t.map((e) => new m(e));
+			let e = t.map((e) => new _(e));
 			if (e.some((e) => e.isNaN())) throw new i("One of the values is not a valid number");
 			return this.fromCoordinates(e[0], e[1], e[2], e[3], e[4], e[5]);
 		}
@@ -4849,10 +3820,10 @@ var q = class e {
 		return this.#a = !0, this;
 	}
 	fromCoordinates(e, t, n, r, i, a) {
-		return this.fromPoints(new V(e, t), new V(n, r), new V(i, a));
+		return this.fromPoints(new B(e, t), new B(n, r), new B(i, a));
 	}
 	fromLines(e, t, n) {
-		let r = new q(e).clone(), i = new q(t).clone(), a = new q(n).clone(), o = r.intersection(i);
+		let r = new K(e).clone(), i = new K(t).clone(), a = new K(n).clone(), o = r.intersection(i);
 		if (o.hasIntersection) this.#t = o.point;
 		else return this.#r = !1, this;
 		if (o = i.intersection(a), o.hasIntersection) this.#n = o.point;
@@ -4895,7 +3866,7 @@ var q = class e {
 	}
 	getHeights() {
 		if (!this.#o.heights) {
-			let e = new q().fromPointAndNormal(this.#e, new H(this.#t, this.#n)), t = new q().fromPointAndNormal(this.#t, new H(this.#e, this.#n)), n = new q().fromPointAndNormal(this.#n, new H(this.#e, this.#t)), r = e.intersection(t).point;
+			let e = new K().fromPointAndNormal(this.#e, new V(this.#t, this.#n)), t = new K().fromPointAndNormal(this.#t, new V(this.#e, this.#n)), n = new K().fromPointAndNormal(this.#n, new V(this.#e, this.#t)), r = e.intersection(t).point;
 			this.#o.heights = {
 				A: e,
 				B: t,
@@ -4908,7 +3879,7 @@ var q = class e {
 	getMedians() {
 		let e = this.getMiddles();
 		if (!this.#o.medians) {
-			let t = new q().fromPoints(this.#e, e.BC), n = new q().fromPoints(this.#t, e.AC), r = new q().fromPoints(this.#n, e.AB), i = t.intersection(n).point;
+			let t = new K().fromPoints(this.#e, e.BC), n = new K().fromPoints(this.#t, e.AC), r = new K().fromPoints(this.#n, e.AB), i = t.intersection(n).point;
 			this.#o.medians = {
 				A: t,
 				B: n,
@@ -4921,7 +3892,7 @@ var q = class e {
 	getMediators() {
 		let e = this.getMiddles();
 		if (!this.#o.mediators) {
-			let t = new q().fromPointAndNormal(e.BC, new H(this.#t, this.#n)), n = new q().fromPointAndNormal(e.AC, new H(this.#e, this.#n)), r = new q().fromPointAndNormal(e.AB, new H(this.#e, this.#t)), i = t.intersection(n).point;
+			let t = new K().fromPointAndNormal(e.BC, new V(this.#t, this.#n)), n = new K().fromPointAndNormal(e.AC, new V(this.#e, this.#n)), r = new K().fromPointAndNormal(e.AB, new V(this.#e, this.#t)), i = t.intersection(n).point;
 			this.#o.mediators = {
 				a: t,
 				b: n,
@@ -4933,9 +3904,9 @@ var q = class e {
 	}
 	getMiddles() {
 		return {
-			AB: new V().middleOf(this.#e, this.#t),
-			AC: new V().middleOf(this.#e, this.#n),
-			BC: new V().middleOf(this.#t, this.#n)
+			AB: new B().middleOf(this.#e, this.#t),
+			AC: new B().middleOf(this.#e, this.#n),
+			BC: new B().middleOf(this.#t, this.#n)
 		};
 	}
 	getPoints() {
@@ -4974,9 +3945,9 @@ var q = class e {
 	}
 	get lines() {
 		return this.#i === null && (this.#i = {
-			AB: new q(this.#e, this.#t),
-			BC: new q(this.#t, this.#n),
-			AC: new q(this.#e, this.#n)
+			AB: new K(this.#e, this.#t),
+			BC: new K(this.#t, this.#n),
+			AC: new K(this.#e, this.#n)
 		}), this.#i;
 	}
 	medianA() {
@@ -5001,14 +3972,14 @@ var q = class e {
 		}, this;
 	}
 	#s(e, t = !0) {
-		let n = this.lines, r = new H(), i = new H(), a = new V();
+		let n = this.lines, r = new V(), i = new V(), a = new B();
 		if (e === "A" ? (a = this.A.clone(), r = n.AB.clone().d, i = n.AC.clone().d) : e === "B" ? (a = this.B.clone(), r = n.AB.clone().d.opposite(), i = n.BC.clone().d) : e === "C" && (a = this.C.clone(), r = n.BC.clone().d.opposite(), i = n.AC.clone().d.opposite()), r === void 0 || i === void 0) throw new o(`The point ${e} does not exist`);
 		let s = t ? r.unit().add(i.unit()) : r.unit().subtract(i.unit());
-		return new q().fromPointAndDirection(a, s);
+		return new K().fromPointAndDirection(a, s);
 	}
 	#c(e, t, n) {
 		let r = (t ** 2 + n ** 2 - e ** 2) / (2 * t * n);
-		return this.#a ? Math.acos(r) : p.numberCorrection(Math.acos(r) * 180 / Math.PI);
+		return this.#a ? Math.acos(r) : g.numberCorrection(Math.acos(r) * 180 / Math.PI);
 	}
 	#l = (e) => {
 		switch (e.toUpperCase()) {
@@ -5018,8 +3989,8 @@ var q = class e {
 		}
 		return this.#e;
 	};
-	#u = (e, t) => new H(this.#l(e), this.#l(t));
-}, Y = class e {
+	#u = (e, t) => new V(this.#l(e), this.#l(t));
+}, J = class e {
 	#e = null;
 	#t = null;
 	#n = 1;
@@ -5028,7 +3999,7 @@ var q = class e {
 		e.length > 0 && this.parse(...e);
 	}
 	parse(...t) {
-		return typeof t[0] == "string" ? this.fromString(t[0]) : t[0] instanceof N ? this.fromEquation(t[0]) : t[0] instanceof e ? this.copy(t[0]) : t.length === 2 && t[0] instanceof V && t[1] instanceof V ? this.fromCenterPoint(t[0], t[1]) : t.length >= 2 && t[0] instanceof V && (t[1] instanceof m || typeof t[1] == "number") ? this.fromCenterRadius(t[0], t[1], typeof t[2] == "boolean" && t[2]) : this;
+		return typeof t[0] == "string" ? this.fromString(t[0]) : t[0] instanceof P ? this.fromEquation(t[0]) : t[0] instanceof e ? this.copy(t[0]) : t.length === 2 && t[0] instanceof B && t[1] instanceof B ? this.fromCenterPoint(t[0], t[1]) : t.length >= 2 && t[0] instanceof B && (t[1] instanceof _ || typeof t[1] == "number") ? this.fromCenterRadius(t[0], t[1], typeof t[2] == "boolean" && t[2]) : this;
 	}
 	clone() {
 		return new e().fromCenterRadius(this.center.clone(), this.squareRadius.clone(), !0);
@@ -5053,36 +4024,36 @@ var q = class e {
 		return this.#n = 1, this;
 	}
 	get center() {
-		return this.#e ?? new V();
+		return this.#e ?? new B();
 	}
 	get equation() {
-		return this.#t?.clone() ?? new N("0=0");
+		return this.#t?.clone() ?? new P("0=0");
 	}
 	fromCenterPoint(e, t) {
-		return this.#e = e.clone(), this.#r = new H(this.#e, t).normSquare, this.#i(), this;
+		return this.#e = e.clone(), this.#r = new V(this.#e, t).normSquare, this.#i(), this;
 	}
 	fromCenterRadius(e, t, n) {
-		return this.#e = e.clone(), this.#r = n ? new m(t) : new m(t).pow(2), this.#i(), this;
+		return this.#e = e.clone(), this.#r = n ? new _(t) : new _(t).pow(2), this.#i(), this;
 	}
 	fromEquation(e) {
 		if (e.moveLeft(), e.degree("x").value === 2 && e.degree("y").value === 2) {
 			let t = e.left.monomByDegree(2, "x"), n = e.left.monomByDegree(2, "y"), r, i, a;
-			if (t.coefficient.isEqual(n.coefficient)) return e.divide(t.coefficient), r = e.left.monomByDegree(1, "x"), i = e.left.monomByDegree(1, "y"), a = e.left.monomByDegree(0), this.#e = new V(r.coefficient.clone().divide(2).opposite(), i.coefficient.clone().divide(2).opposite()), this.#r = a.coefficient.clone().opposite().add(this.#e.x.clone().pow(2)).add(this.#e.y.clone().pow(2)), this.#i(), this;
+			if (t.coefficient.isEqual(n.coefficient)) return e.divide(t.coefficient), r = e.left.monomByDegree(1, "x"), i = e.left.monomByDegree(1, "y"), a = e.left.monomByDegree(0), this.#e = new B(r.coefficient.clone().divide(2).opposite(), i.coefficient.clone().divide(2).opposite()), this.#r = a.coefficient.clone().opposite().add(this.#e.x.clone().pow(2)).add(this.#e.y.clone().pow(2)), this.#i(), this;
 			this.#a();
 		}
 		return this;
 	}
 	fromPoints(e, t, n) {
-		let r = new J(e, t, n);
+		let r = new q(e, t, n);
 		if (!r.isValid || !r.remarquables) return this.#a(), this;
 		let i = r.getMediators().c.clone(), a = r.getMediators().b.clone();
 		return this.fromCenterPoint(i.intersection(a).point, e);
 	}
 	fromString(e) {
-		return this.fromEquation(new N(e));
+		return this.fromEquation(new P(e));
 	}
 	getPointsOnCircle() {
-		let e = p.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), t = [];
+		let e = g.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), t = [];
 		return e.forEach((e) => {
 			for (let n of [
 				[1, 1],
@@ -5091,7 +4062,7 @@ var q = class e {
 				[1, -1]
 			]) {
 				let r = this.center.x.clone().add(n[0] * e[0]), i = this.center.y.clone().add(n[1] * e[1]);
-				t.every((e) => !e.isEqualXY(r, i)) && t.push(new V(r, i));
+				t.every((e) => !e.isEqualXY(r, i)) && t.push(new B(r, i));
 			}
 		}), t;
 	}
@@ -5108,10 +4079,10 @@ var q = class e {
 		if (s.length === 0) return [];
 		if (s.length === 1) {
 			let e = r.add(n.clone().multiplyByScalar(s[0].fraction));
-			return [new V(e.x, e.y)];
+			return [new B(e.x, e.y)];
 		}
 		let c = s[0].exact ? r.clone().add(n.clone().multiplyByScalar(s[0].fraction)) : r.clone().add(n.clone().multiplyByScalar(s[0].value)), l = s[1].exact ? r.clone().add(n.clone().multiplyByScalar(s[1].fraction)) : r.clone().add(n.clone().multiplyByScalar(s[1].value));
-		return [new V(c.x, c.y), new V(l.x, l.y)].sort((e, t) => n.x.isZero() ? n.y.isPositive() ? e.y.value - t.y.value : t.y.value - e.y.value : n.x.isPositive() ? e.x.value - t.x.value : t.x.value - e.x.value);
+		return [new B(c.x, c.y), new B(l.x, l.y)].sort((e, t) => n.x.isZero() ? n.y.isPositive() ? e.y.value - t.y.value : t.y.value - e.y.value : n.x.isPositive() ? e.x.value - t.x.value : t.x.value - e.x.value);
 	}
 	get radius() {
 		return new v().from(2, this.#r ?? 0);
@@ -5122,57 +4093,57 @@ var q = class e {
 		return t - n > 1e-10 ? 0 : Math.abs(t - n) < 1e-10 ? 1 : 2;
 	}
 	setRadius(e, t) {
-		return this.#r = t ? new m(e) : new m(e).pow(2), this.#i(), this;
+		return this.#r = t ? new _(e) : new _(e).pow(2), this.#i(), this;
 	}
 	get squareRadius() {
-		return this.#r?.clone() ?? new m(-1);
+		return this.#r?.clone() ?? new _(-1);
 	}
-	tangents = (e) => e instanceof m ? this.#c(e) : this.isPointOnCircle(e) ? this.#o(e) : this.#e !== null && this.#e.distanceTo(e).value > this.radius.value ? this.#s(e) : [];
+	tangents = (e) => e instanceof _ ? this.#c(e) : this.isPointOnCircle(e) ? this.#o(e) : this.#e !== null && this.#e.distanceTo(e).value > this.radius.value ? this.#s(e) : [];
 	#i() {
-		this.#t = new N(new M(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`), new M(this.squareRadius.display)).moveLeft();
+		this.#t = new P(new N(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`), new N(this.squareRadius.display)).moveLeft();
 	}
 	#a() {
 		this.#e = null, this.#r = null, this.#t = null;
 	}
 	#o = (e) => {
-		let t = new H(this.center, e);
-		return [new q().fromPointAndNormal(e, t)];
+		let t = new V(this.center, e);
+		return [new K().fromPointAndNormal(e, t)];
 	};
 	#s = (e) => {
-		let t = this.center.x.clone().subtract(e.x), n = this.center.y.clone().subtract(e.y), r = new M("x"), i = new M("x^2+1");
-		return r.multiply(t).subtract(n).pow(2), i.multiply(this.squareRadius), new N(r, i).solve().map((t) => {
-			let n, r = new N("y", "x");
-			return t.exact ? (n = e.x.clone().opposite().multiply(t.fraction).add(e.y), r.right.multiply(t.fraction).add(n)) : (n = e.x.clone().opposite().multiply(t.value).add(e.y), r.right.multiply(t.value).add(n)), new q(r);
+		let t = this.center.x.clone().subtract(e.x), n = this.center.y.clone().subtract(e.y), r = new N("x"), i = new N("x^2+1");
+		return r.multiply(t).subtract(n).pow(2), i.multiply(this.squareRadius), new P(r, i).solve().map((t) => {
+			let n, r = new P("y", "x");
+			return t.exact ? (n = e.x.clone().opposite().multiply(t.fraction).add(e.y), r.right.multiply(t.fraction).add(n)) : (n = e.x.clone().opposite().multiply(t.value).add(e.y), r.right.multiply(t.value).add(n)), new K(r);
 		});
 	};
 	#c = (e) => {
 		let t = e.numerator, n = -e.denominator, r = this.center.x.clone(), i = this.center.y.clone(), a = this.squareRadius.clone().multiply(e.numerator ** 2 + e.denominator ** 2), o = r.clone().multiply(t).opposite().subtract(i.clone().multiply(n)).add(a.clone().sqrt()), s = r.clone().multiply(t).opposite().subtract(i.clone().multiply(n)).subtract(a.clone().sqrt());
-		return [new q(t, n, o), new q(t, n, s)];
+		return [new K(t, n, o), new K(t, n, s)];
 	};
-}, X = class e {
-	static PARALLEL = Ce.Parallel;
-	static PERPENDICULAR = Ce.Perpendicular;
-	#e = new V();
-	#t = new H();
+}, Y = class e {
+	static PARALLEL = De.Parallel;
+	static PERPENDICULAR = De.Perpendicular;
+	#e = new B();
+	#t = new V();
 	constructor(e, t) {
-		return this.#e = e.clone(), this.#t = t instanceof V ? new H(e, t) : t.clone(), this;
+		return this.#e = e.clone(), this.#t = t instanceof B ? new V(e, t) : t.clone(), this;
 	}
 	clone = () => (this.#t = this.#t.clone(), this.#e = this.#e.clone(), this);
 	get tex() {
 		return {
-			parametric: `${H.asTex("x", "y", "z")} = ${H.asTex(this.#e.x.tex, this.#e.y.tex, this.#e.z.tex)} + k\\cdot ${H.asTex(this.#t.x.tex, this.#t.y.tex, this.#t.z.tex)}`,
+			parametric: `${V.asTex("x", "y", "z")} = ${V.asTex(this.#e.x.tex, this.#e.y.tex, this.#e.z.tex)} + k\\cdot ${V.asTex(this.#t.x.tex, this.#t.y.tex, this.#t.z.tex)}`,
 			system: `\\left\\{\\begin{aligned}
-    x &= ${new M(this.#e.x).add(new A(this.#t.x).multiply(new A("k"))).reorder("k", !0).tex}\\\\ 
-    y &= ${new M(this.#e.y).add(new A(this.#t.y).multiply(new A("k"))).reorder("k", !0).tex}\\\\
-    z &= ${new M(this.#e.z).add(new A(this.#t.z).multiply(new A("k"))).reorder("k", !0).tex}
+    x &= ${new N(this.#e.x).add(new O(this.#t.x).multiply(new O("k"))).reorder("k", !0).tex}\\\\ 
+    y &= ${new N(this.#e.y).add(new O(this.#t.y).multiply(new O("k"))).reorder("k", !0).tex}\\\\
+    z &= ${new N(this.#e.z).add(new O(this.#t.z).multiply(new O("k"))).reorder("k", !0).tex}
 \\end{aligned}\\right.`,
-			cartesian: `\\frac{ ${new M("x", 1, this.#e.x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new M("y", 1, this.#e.y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new M("z", 1, this.#e.z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
+			cartesian: `\\frac{ ${new N("x", 1, this.#e.x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new N("y", 1, this.#e.y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new N("z", 1, this.#e.z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
 		};
 	}
 	get display() {
 		let e = this.#e.x.display, t = this.#e.y.display, n = this.#e.z.display, r = this.direction.simplify(), i = r.x.display, a = r.y.display, o = r.z.display;
 		return {
-			parametric: `${H.asDisplay("x", "y", "z")} = ${H.asDisplay(this.#e.x.display, this.#e.y.display, this.#e.z.display)} + k\\cdot ${H.asDisplay(this.#t.x.display, this.#t.y.display, this.#t.z.display)}`,
+			parametric: `${V.asDisplay("x", "y", "z")} = ${V.asDisplay(this.#e.x.display, this.#e.y.display, this.#e.z.display)} + k\\cdot ${V.asDisplay(this.#t.x.display, this.#t.y.display, this.#t.z.display)}`,
 			system: "",
 			cartesian: `(x-${e})/${i} = (y-${t})/${a} = (z-${n})/${o}`
 		};
@@ -5193,7 +4164,7 @@ var q = class e {
 		return this.#t.clone();
 	}
 	distanceTo(e) {
-		let t = new H(this.#e, e), n = this.direction, r = this.direction.normSquare, i = t.cross(n).normSquare.clone().divide(r), a = i.clone().sqrt();
+		let t = new V(this.#e, e), n = this.direction, r = this.direction.normSquare, i = t.cross(n).normSquare.clone().divide(r), a = i.clone().sqrt();
 		return {
 			value: Math.sqrt(i.value),
 			fraction: i.clone().sqrt(),
@@ -5224,15 +4195,15 @@ var q = class e {
 		return this.#e.clone();
 	}
 	randomPoint = (e = 5) => {
-		let t = this.#e.clone(), n = new m(G(e, !1));
-		return new V(t.x.clone().add(this.#t.x.clone().multiply(n)), t.y.clone().add(this.#t.y.clone().multiply(n)), t.z.clone().add(this.#t.z.clone().multiply(n)));
+		let t = this.#e.clone(), n = new _(W(e, !1));
+		return new B(t.x.clone().add(this.#t.x.clone().multiply(n)), t.y.clone().add(this.#t.y.clone().multiply(n)), t.z.clone().add(this.#t.z.clone().multiply(n)));
 	};
 	simplify = () => {
 		throw new a("Method not implemented.");
 	};
-}, ke = class e {
-	#e = new H(0, 0, 1);
-	#t = new V(0, 0, 0);
+}, Ne = class e {
+	#e = new V(0, 0, 1);
+	#t = new B(0, 0, 0);
 	constructor(e) {
 		return e && this.parse(e), this;
 	}
@@ -5249,25 +4220,25 @@ var q = class e {
 		}
 		if (e.equation) {
 			let t = e.equation.moveLeft().reduce().left, n = t.monomByLetter("x").coefficient, r = t.monomByLetter("y").coefficient, i = t.monomByLetter("z").coefficient, a = t.monomByDegree(0).coefficient;
-			this.normal = new H(n, r, i), this.point = n.isNotZero() ? new V(a.clone().divide(n).opposite(), 0, 0) : r.isNotZero() ? new V(0, a.clone().divide(r).opposite(), 0) : new V(0, 0, a.clone().divide(i).opposite());
+			this.normal = new V(n, r, i), this.point = n.isNotZero() ? new B(a.clone().divide(n).opposite(), 0, 0) : r.isNotZero() ? new B(0, a.clone().divide(r).opposite(), 0) : new B(0, 0, a.clone().divide(i).opposite());
 			return;
 		}
-		if (e.points?.length === 3 && e.points.every((e) => e instanceof H)) {
-			let t = e.points[0], n = e.points[1], r = e.points[2], i = new H(t, n), a = new H(t, r);
+		if (e.points?.length === 3 && e.points.every((e) => e instanceof V)) {
+			let t = e.points[0], n = e.points[1], r = e.points[2], i = new V(t, n), a = new V(t, r);
 			this.normal = i.cross(a), this.point = t;
 			return;
 		}
 		if (e.coefficients?.length === 4) {
 			let [t, n, r, i] = e.coefficients;
-			this.normal = new H(t, n, r), this.point = new V(0, 0, -i);
+			this.normal = new V(t, n, r), this.point = new B(0, 0, -i);
 			return;
 		}
 	}
 	get tex() {
-		return new N(new M("xyz", this.a, this.b, this.c, this.d), new M(0)).reduce().tex;
+		return new P(new N("xyz", this.a, this.b, this.c, this.d), new N(0)).reduce().tex;
 	}
 	get display() {
-		return new N(new M("xyz", this.a, this.b, this.c, this.d), new M(0)).reduce().display;
+		return new P(new N("xyz", this.a, this.b, this.c, this.d), new N(0)).reduce().display;
 	}
 	get a() {
 		return this.#e.x;
@@ -5275,7 +4246,7 @@ var q = class e {
 	angle(t, r, i) {
 		if (t instanceof e) return this.normal.angle(t.normal, r, i);
 		let a;
-		if (t instanceof H) {
+		if (t instanceof V) {
 			if (t.dimension !== 3) throw new n("Vector is not 3D");
 			a = t;
 		} else a = t.direction;
@@ -5295,10 +4266,10 @@ var q = class e {
 	}
 	intersectWithLine(e) {
 		let { point: t, direction: n } = e, r = this.normal.dot(t).add(this.d).divide(this.normal.dot(n).opposite());
-		return new V(new H(t).add(n.clone().multiplyByScalar(r)));
+		return new B(new V(t).add(n.clone().multiplyByScalar(r)));
 	}
 	intersectWithPlane(e) {
-		throw this.normal.cross(e.normal), new V(0, 0, 0), new a("Intersection with plane  not yet implemented !");
+		throw this.normal.cross(e.normal), new B(0, 0, 0), new a("Intersection with plane  not yet implemented !");
 	}
 	isPointOnPlane(e) {
 		return this.normal.dot(e).add(this.d).isZero();
@@ -5307,33 +4278,33 @@ var q = class e {
 		return this.#e;
 	}
 	set normal(e) {
-		this.#e = new H(e);
+		this.#e = new V(e);
 	}
 	get point() {
 		return this.#t;
 	}
 	set point(e) {
-		this.#t = new V(e);
+		this.#t = new B(e);
 	}
-}, Ae = /* @__PURE__ */ function(e) {
+}, X = /* @__PURE__ */ function(e) {
 	return e[e.INTERIOR = 0] = "INTERIOR", e[e.EXTERIOR = 1] = "EXTERIOR", e[e.SECANT = 2] = "SECANT", e[e.TANGENT_INSIDE = 3] = "TANGENT_INSIDE", e[e.TANGENT_OUTSIDE = 4] = "TANGENT_OUTSIDE", e[e.SUPERPOSED = 5] = "SUPERPOSED", e[e.CONCENTRIC = 6] = "CONCENTRIC", e;
-}({}), je = class {
+}({}), Pe = class {
 	#e = void 0;
 	#t = void 0;
 	#n = void 0;
 	#r = 1;
 	constructor(e, t) {
-		return e && t && (this.#e = e, this.#t = new m(t).clone().pow(2), this.#a()), this;
+		return e && t && (this.#e = e, this.#t = new _(t).clone().pow(2), this.#a()), this;
 	}
 	fromEquation(e) {
-		let t = new N(e).moveLeft().reduce(), n = [
+		let t = new P(e).moveLeft().reduce(), n = [
 			"x",
 			"y",
 			"z"
 		];
 		if (n.some((e) => t.degree(e).value !== 2)) return this.makeUndefined();
 		let r = t.left.monomByDegree(2, "x").coefficient;
-		return n.some((e) => t.left.monomByDegree(2, e).coefficient.isNotEqual(r)) ? this.makeUndefined() : (this.#e = new V(t.left.monomByDegree(1, "x").coefficient.clone().opposite().divide(2), t.left.monomByDegree(1, "y").coefficient.clone().opposite().divide(2), t.left.monomByDegree(1, "z").coefficient.clone().opposite().divide(2)), this.#t = t.left.monomByDegree(0).coefficient.clone().opposite().add(this.#e.x.clone().pow(2)).add(this.#e.y.clone().pow(2)).add(this.#e.z.clone().pow(2)), this.#a(), this);
+		return n.some((e) => t.left.monomByDegree(2, e).coefficient.isNotEqual(r)) ? this.makeUndefined() : (this.#e = new B(t.left.monomByDegree(1, "x").coefficient.clone().opposite().divide(2), t.left.monomByDegree(1, "y").coefficient.clone().opposite().divide(2), t.left.monomByDegree(1, "z").coefficient.clone().opposite().divide(2)), this.#t = t.left.monomByDegree(0).coefficient.clone().opposite().add(this.#e.x.clone().pow(2)).add(this.#e.y.clone().pow(2)).add(this.#e.z.clone().pow(2)), this.#a(), this);
 	}
 	get center() {
 		if (this.#e === void 0) throw new s("Sphere3 is undefined");
@@ -5362,10 +4333,10 @@ var q = class e {
 	makeUndefined() {
 		return this.#e = void 0, this.#t = void 0, this.#n = void 0, this;
 	}
-	get centerRadius() {
+	get asCenterRadius() {
 		return this.#r = 1, this;
 	}
-	get developped() {
+	get asDeveloped() {
 		return this.#r = 0, this;
 	}
 	get tex() {
@@ -5385,15 +4356,15 @@ var q = class e {
 		].forEach((n) => {
 			if (this.center[n].isZero()) t.push(`${n}^2`);
 			else {
-				let r = new M(n).subtract(this.center[n]);
+				let r = new N(n).subtract(this.center[n]);
 				t.push(e ? `\\(${r.tex}\\)^2` : `(${r.display})^2`);
 			}
 		}), t.join("+") + "=" + (e ? this.squareRadius.tex : this.squareRadius.display);
 	};
 	#a() {
-		this.#n = new N(new M("x").subtract(this.center.x).pow(2).add(new M("y").subtract(this.center.y).pow(2)).add(new M("z").subtract(this.center.z).pow(2)), new M(this.squareRadius)).reduce();
+		this.#n = new P(new N("x").subtract(this.center.x).pow(2).add(new N("y").subtract(this.center.y).pow(2)).add(new N("z").subtract(this.center.z).pow(2)), new N(this.squareRadius)).reduce();
 	}
-	static RELATIVE_POSITION = Ae;
+	static RELATIVE_POSITION = X;
 	relativePosition = (e) => {
 		let t = this.center.distanceTo(e.center).value, n = this.radius.value, r = e.radius.value;
 		return t > n + r ? 1 : t === n + r ? 4 : t === 0 ? n === r ? 5 : 6 : t === Math.abs(n - r) ? 3 : t < Math.abs(n - r) ? 0 : 2;
@@ -5413,23 +4384,23 @@ function Z(e) {
 		reduced: !0,
 		zero: !0,
 		natural: !1
-	}, e), n = new m();
-	if (n.numerator = t.negative ? G(t.max, t.zero) : W(+!t.zero, t.max), t.natural) n.denominator = 1;
+	}, e), n = new _();
+	if (n.numerator = t.negative ? W(t.max, t.zero) : U(+!t.zero, t.max), t.natural) n.denominator = 1;
 	else {
 		let e = 0;
-		for (; n.isRelative() && e < 10;) n.denominator = W(1, t.max), e++;
+		for (; n.isRelative() && e < 10;) n.denominator = U(1, t.max), e++;
 	}
 	return t.reduced ? n.reduce() : n;
 }
 //#endregion
 //#region src/randomization/algebra/rndMonom.ts
-function Me(e) {
+function Fe(e) {
 	let t = Object.assign({
 		letters: "x",
 		degree: 2,
 		fraction: !0,
 		zero: !1
-	}, e), n = new A();
+	}, e), n = new O();
 	if (n.coefficient = Z(Object.assign({}, {
 		zero: t.zero,
 		reduced: !0,
@@ -5437,7 +4408,7 @@ function Me(e) {
 	}, typeof t.fraction == "boolean" ? {} : t.fraction)), t.letters.length > 1) {
 		for (let e of t.letters.split("")) n.setLetter(e, 0);
 		for (let e = 0; e < t.degree; e++) {
-			let e = K(t.letters.split(""));
+			let e = G(t.letters.split(""));
 			n.setLetter(e, n.degree(e).clone().add(1));
 		}
 	} else n.setLetter(t.letters, t.degree);
@@ -5445,7 +4416,7 @@ function Me(e) {
 }
 //#endregion
 //#region src/randomization/algebra/rndPolynom.ts
-var Ne = {
+var Ie = {
 	letters: "x",
 	degree: 2,
 	fraction: !1,
@@ -5458,35 +4429,35 @@ var Ne = {
 	positive: !0
 };
 function Q(e) {
-	let t = Object.assign({}, Ne, e);
-	if (t.factorable) return Pe(t);
-	let n = new M().empty(), r, i = t.degree ?? 2;
-	for (let e = i; e >= 0; e--) r = Me({
+	let t = Object.assign({}, Ie, e);
+	if (t.factorable) return Le(t);
+	let n = new N().empty(), r, i = t.degree ?? 2;
+	for (let e = i; e >= 0; e--) r = Fe({
 		letters: t.letters,
 		degree: e,
 		fraction: t.fraction,
 		zero: e !== i && t.allowNullMonom
 	}), t.unit && i === e && r.coefficient.one(), n.add(r);
 	if (t.positive && n.monomByDegree().coefficient.isNegative() && n.opposite(), t.numberOfMonoms && t.numberOfMonoms > 0 && t.numberOfMonoms < n.length) for (; n.length > t.numberOfMonoms;) {
-		let e = W(1, n.length - 1);
+		let e = U(1, n.length - 1);
 		n.monoms.splice(e, 1);
 	}
 	return n.reduce();
 }
-function Pe(e) {
-	let t = Object.assign(Ne, e), n = { ...t };
+function Le(e) {
+	let t = Object.assign(Ie, e), n = { ...t };
 	n.degree = 1, n.factorable = !1;
 	let r = [], i = t.degree ?? 2;
 	for (; r.length < i;) r.push(Q(n));
 	if (e?.commonConstant !== !1) {
-		let t = G(10, !1);
-		e?.commonConstant === !0 && (t === 1 || t === -1) && (t *= W(2, 5)), t !== 1 && t !== -1 && r.unshift(new M(t));
+		let t = W(10, !1);
+		e?.commonConstant === !0 && (t === 1 || t === -1) && (t *= U(2, 5)), t !== 1 && t !== -1 && r.unshift(new N(t));
 	}
-	return M.xMultiply(...r);
+	return N.xMultiply(...r);
 }
 //#endregion
 //#region src/randomization/algebra/rndEquation.ts
-function Fe(e) {
+function Re(e) {
 	let t = Object.assign({
 		letters: "x",
 		degree: 1,
@@ -5503,7 +4474,7 @@ function Fe(e) {
 			nothing: !1,
 			everything: !1
 		}
-	}, e), n = new M().one();
+	}, e), n = new N().one();
 	for (let e = 0; e < t.degree; e++) {
 		let e = Q({
 			degree: 1,
@@ -5514,7 +4485,7 @@ function Fe(e) {
 		});
 		n.multiply(e);
 	}
-	return new N(n, 0);
+	return new P(n, 0);
 }
 //#endregion
 //#region src/randomization/geometry/rndPoint.ts
@@ -5527,15 +4498,15 @@ function $(e) {
 	}, e), n = t.axis === "x", r = t.axis === "y", i = t.fraction ? Z({
 		max: t.max,
 		zero: n
-	}) : new m(G(t.max, n)), a = t.fraction ? Z({
+	}) : new _(W(t.max, n)), a = t.fraction ? Z({
 		max: t.max,
 		zero: r
-	}) : new m(G(t.max, r));
-	return Number(t.quadrant) === 1 && (i.abs(), a.abs()), Number(t.quadrant) === 2 && (i.isPositive() && i.opposite(), a.isNegative() && a.opposite()), Number(t.quadrant) === 3 && (i.isPositive() && i.opposite(), a.isPositive() && a.opposite()), Number(t.quadrant) === 4 && (i.isNegative() && i.opposite(), a.isPositive() && a.opposite()), new V(i, a);
+	}) : new _(W(t.max, r));
+	return Number(t.quadrant) === 1 && (i.abs(), a.abs()), Number(t.quadrant) === 2 && (i.isPositive() && i.opposite(), a.isNegative() && a.opposite()), Number(t.quadrant) === 3 && (i.isPositive() && i.opposite(), a.isPositive() && a.opposite()), Number(t.quadrant) === 4 && (i.isNegative() && i.opposite(), a.isPositive() && a.opposite()), new B(i, a);
 }
 //#endregion
 //#region src/randomization/geometry/rndCircle.ts
-function Ie(e) {
+function ze(e) {
 	let t = Object.assign({
 		center: {
 			x: {
@@ -5549,77 +4520,77 @@ function Ie(e) {
 		},
 		pointsOnCircle: 8
 	}, e), n = $(t.center), r, i;
-	return t.pointsOnCircle === 8 ? (r = W(1, 3), i = r ** 2 + (r + 1) ** 2) : i = W(1, 20), new Y(n, i, !0);
+	return t.pointsOnCircle === 8 ? (r = U(1, 3), i = r ** 2 + (r + 1) ** 2) : i = U(1, 20), new J(n, i, !0);
 }
 //#endregion
 //#region src/randomization/geometry/rndLine.ts
-function Le(e) {
+function Be(e) {
 	let t = Object.assign({ A: {
-		x: G(10),
-		y: G(10)
-	} }, e), n = new H(0, 0);
-	for (; n.isNull;) n.x = G(10, t.allow?.vertical ?? !0), n.y = G(10, t.allow?.horizontal ?? !0);
-	return t.slope === 1 ? n.x.sign() !== n.y.sign() && n.y.opposite() : t.slope === -1 && n.x.sign() !== n.y.sign() && n.y.opposite(), new q().fromPointAndDirection(new H(t.A.x, t.A.y), n);
+		x: W(10),
+		y: W(10)
+	} }, e), n = new V(0, 0);
+	for (; n.isNull;) n.x = W(10, t.allow?.vertical ?? !0), n.y = W(10, t.allow?.horizontal ?? !0);
+	return t.slope === 1 ? n.x.sign() !== n.y.sign() && n.y.opposite() : t.slope === -1 && n.x.sign() !== n.y.sign() && n.y.opposite(), new K().fromPointAndDirection(new V(t.A.x, t.A.y), n);
 }
 //#endregion
 //#region src/randomization/geometry/rndLine3.ts
-function Re(e) {
+function Ve(e) {
 	let t = Object.assign({
 		A: {
-			x: G(10),
-			y: G(10),
-			z: G(10)
+			x: W(10),
+			y: W(10),
+			z: W(10)
 		},
 		direction: {
-			x: G(10),
-			y: G(10),
-			z: G(10)
+			x: W(10),
+			y: W(10),
+			z: W(10)
 		}
 	}, e);
-	return new X(new V(t.A.x, t.A.y, t.A.z), new H(t.direction.x, t.direction.y, t.direction.z));
+	return new Y(new B(t.A.x, t.A.y, t.A.z), new V(t.direction.x, t.direction.y, t.direction.z));
 }
 //#endregion
 //#region src/randomization/random.ts
-var ze = {
-	equation: (e) => Fe(e),
+var He = {
+	equation: (e) => Re(e),
 	polynom: (e) => Q(e),
-	monom: (e) => Me(e),
+	monom: (e) => Fe(e),
 	fraction: (e) => Z(e),
-	number: (e, t, n) => W(e, t, n),
-	numberSym: (e, t) => G(e, t),
-	prime: (e) => Ee(e),
-	triplet: (e, t) => Te(e, t),
-	bool: (e) => we(e),
-	array: (e, t) => De(e, t),
-	item: (e) => K(e),
-	shuffle: (e) => Oe(e),
-	line: (e) => Le(e),
-	line3: (e) => Re(e),
-	vector: (e) => new H($(e)),
+	number: (e, t, n) => U(e, t, n),
+	numberSym: (e, t) => W(e, t),
+	prime: (e) => Ae(e),
+	triplet: (e, t) => ke(e, t),
+	bool: (e) => Oe(e),
+	array: (e, t) => je(e, t),
+	item: (e) => G(e),
+	shuffle: (e) => Me(e),
+	line: (e) => Be(e),
+	line3: (e) => Ve(e),
+	vector: (e) => new V($(e)),
 	point: (e) => $(e),
-	circle: (e) => Ie(e)
-}, Be = {
-	Numeric: p,
-	Fraction: m,
+	circle: (e) => ze(e)
+}, Ue = {
+	Numeric: g,
+	Fraction: _,
 	Root: v,
-	Monom: A,
-	Polynom: M,
-	Equation: N,
-	Matrix: ve,
-	LinearSystem: I,
-	Factor: P,
-	PolyFactor: R,
-	LogicalSet: L,
-	Random: ze,
+	Monom: O,
+	Polynom: N,
+	Equation: P,
+	Matrix: Se,
+	LinearSystem: be,
+	Factor: F,
+	PolyFactor: L,
+	LogicalSet: xe,
+	Random: He,
 	Geometry: {
-		Vector: H,
-		Point: V,
-		Line: q,
-		Triangle: J,
-		Circle: Y,
-		Line3: X,
-		Plane3: ke,
-		Sphere3: je
+		Vector: V,
+		Point: B,
+		Line: K,
+		Triangle: q,
+		Circle: J,
+		Line3: Y,
+		Plane3: Ne,
+		Sphere3: Pe
 	},
 	Errors: {
 		PiMathError: e,
@@ -5631,9 +4602,9 @@ var ze = {
 		IndexError: o,
 		StateError: s
 	},
-	NumExp: k
+	NumExp: ve
 };
 //#endregion
-export { Y as Circle, n as DimensionError, N as Equation, b as EquationSolver, F as FACTOR_DISPLAY, oe as FRAC_TYPE, P as Factor, m as Fraction, o as IndexError, i as InvalidArgumentError, q as Line, X as Line3, I as LinearSystem, L as LogicalSet, r as MathError, ve as Matrix, A as Monom, a as NotImplementedError, k as NumExp, p as Numeric, t as ParseError, e as PiMathError, ke as Plane3, V as Point, R as PolyFactor, M as Polynom, ze as Random, v as Root, Ae as SPHERE3_RELATIVE_POSITION, y as Solution, je as Sphere3, s as StateError, ce as TableOfSigns, J as Triangle, H as Vector, be as areVectorsColinears, ye as areVectorsEquals, Be as default, Se as determinantFromVectors, xe as dotProduct };
+export { J as Circle, n as DimensionError, P as Equation, b as EquationSolver, I as FACTOR_DISPLAY, oe as FRAC_TYPE, F as Factor, _ as Fraction, o as IndexError, i as InvalidArgumentError, K as Line, Y as Line3, be as LinearSystem, xe as LogicalSet, r as MathError, Se as Matrix, O as Monom, a as NotImplementedError, ve as NumExp, g as Numeric, t as ParseError, e as PiMathError, Ne as Plane3, B as Point, L as PolyFactor, N as Polynom, He as Random, v as Root, X as SPHERE3_RELATIVE_POSITION, y as Solution, Pe as Sphere3, s as StateError, se as TableOfSigns, q as Triangle, V as Vector, we as areVectorsColinears, Ce as areVectorsEquals, Ue as default, Ee as determinantFromVectors, Te as dotProduct };
 
 //# sourceMappingURL=pimath.js.map