fix rendering

Oleksandr Kulkov · web-flow · commit 4578839c363f · 2022-04-14T23:06:43.000+02:00
diff --git a/src/algebra/polynomial.md b/src/algebra/polynomial.md
@@ -287,7 +287,11 @@ $$\boxed{A(x) = \sum\limits_{i=1}^n y_i \prod\limits_{j \neq i}\dfrac{x-x_j}{x_i
 
 Computing it directly is a hard thing but turns out, we may compute it in $O(n \log^2 n)$ with a divide and conquer approach:
 
-Consider $P(x) = (x-x_1)\dots(x-x_n)$. To know the coefficients of the denominators in $A(x)$ we should compute products like: \[P_i = \prod\limits_{j \neq i} (x_i-x_j)\]
+Consider $P(x) = (x-x_1)\dots(x-x_n)$. To know the coefficients of the denominators in $A(x)$ we should compute products like: 
+
+$$
+P_i = \prod\limits_{j \neq i} (x_i-x_j)
+$$
 
 But if you consider the derivative $P'(x)$ you'll find out that $P'(x_i) = P_i$. Thus you can compute $P_i$'s via evaluation in $O(n \log^2 n)$.
 
