fix encoding

Author: kolosovpetro

mathematica/MathematicaPrograms.txt

@@ -1,4 +1,4 @@
-(* Requires package: PlotsOfClosedForms.m, see https://github.com/kolosovpetro/AnEfficientMethodOfSplineApproximation*)
+(* Requires package: PlotsOfClosedForms.m, see https://github.com/kolosovpetro/AnEfficientMethodOfSplineApproximation*)
 
 f1[X_] := X^7;
 f2[X_] := P[3, X, 50];

src/sections/03_generalizations.tex

@@ -1,4 +1,4 @@
-Previously, we have discussed that polynomial $P(m,X,N)$ approximates power function $X^j$
+Previously, we have discussed that polynomial $P(m,X,N)$ approximates power function $X^j$
 in some neighborhood of fixed non-negative integer $N$.
 Approximation by $P(m,X,N)$ can be adjusted by $X^k$ multiplication for even exponents of power function.
 In general, it is safe to say that power function $X^j$ is approximated by $P(m,X,N) \cdot X^k$

src/sections/04_use_cases.tex

@@ -1,4 +1,4 @@
-Use case scenarios of the approximation technique we discuss have their own constraints and limitations.
+Use case scenarios of the approximation technique we discuss have their own constraints and limitations.
 For instance, approximation requirements should have precisely specified exponent $j$ in $X^j$ because
 for each $j$ there is a matching polynomial $P(m,X,N)$.
 Perfectly, there should be a set precompiled polynomials $P(m,X,N)$ matching precise exponent $j$ in $X^j$ over

src/sections/figures/032_polynomials_p2_table_n4.tex

@@ -1,4 +1,4 @@
-\begin{table}[H]
+\begin{table}[H]
     \centering
     \begin{tabular}{|c|c|c|c|c|c|}
         \hline