8000 Update polynomial.md · cp-algorithms/cp-algorithms@b8c0851 · GitHub
[go: up one dir, main page]

Skip to content
8000

Commit b8c0851

Browse files
peltoratoradamant-pwn
authored andcommitted
Update polynomial.md
typo in indices
1 parent c3aeb45 commit b8c0851

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

src/algebra/polynomial.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -263,15 +263,15 @@ Note that the matrix above is a so-called triangular [Toeplitz matrix](https://e
263263

264264
Let's generalize the Sieveking–Kung algorithm. Consider equation $F(P) = 0$ where $P(x)$ should be a polynomial and $F(x)$ is some polynomial-valued function defined as
265265

266-
$$F(x) = \sum\limits_{i=0}^\infty \alpha_i (x-\beta)^k,$$
266+
$$F(x) = \sum\limits_{i=0}^\infty \alpha_i (x-\beta)^i,$$
267267

268268
where $\beta$ is some constant. It can be proven that if we introduce a new formal variable $y$, we can express $F(x)$ as
269269

270270
$$F(x) = F(y) + (x-y)F'(y) + (x-y)^2 G(x,y),$$
271271

272272
where $F'(x)$ is the derivative formal power series defined as
273273

274-
$$F'(x) = \sum\limits_{i=0}^\infty (k+1)\alpha_{i+1}(x-\beta)^k,$$
274+
$$F'(x) = \sum\limits_{i=0}^\infty (i+1)\alpha_{i+1}(x-\beta)^i,$$
275275

276276
and $G(x, y)$ is some formal power series of $x$ and $y$. With this result we can find the solution iteratively.
277277

0 commit comments

Comments
 (0)
0