Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 99b57e2

Browse files
author
Oleksandr Kulkov
authored
Style fixes
1 parent 779c6c0 commit 99b57e2

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
@@ -55,10 +55,10 @@ Other useful functions:
5555

5656
### Multiplication
5757

58-
The very core operation is the multiplication of two polynomials, that is, given polynomial $A$ and $B$:
58+
The very core operation is the multiplication of two polynomials. That is, given the polynomials $A$ and $B$:
5959
$$A = a_0 + a_1 x + \dots + a_n x^n$$
6060
$$B = b_0 + b_1 x + \dots + b_m x^m$$
61-
You have to compute polynomial $C = A \cdot B$: $$\boxed{C = \sum\limits_{i=0}^n \sum\limits_{j=0}^m a_i b_j x^{i+j}} = c_0 + c_1 x + \dots + c_{n+m} x^{n+m}$$
61+
You have to compute polynomial $C = A \cdot B$, which is defined as $$\boxed{C = \sum\limits_{i=0}^n \sum\limits_{j=0}^m a_i b_j x^{i+j}} = c_0 + c_1 x + \dots + c_{n+m} x^{n+m}.$$
6262
It can be computed in $O(n \log n)$ via the [Fast Fourier transform](./algebra/fft.html) and almost all methods here will use it as subroutine.
6363

6464
### Inverse series

0 commit comments

Comments
 (0)