FIND ME ON

GitHub

LinkedIn

Division Algorithm for Polynomials

🌱

Theorem
NumberTheory

Theorem

Let F\mathbb{F} be a field and suppose we have a,bF[x]a,b\in\mathbb{F}[x] with b0b\not=0. Then, q,rF[x]\exists q,r\in\mathbb{F}[x] s.t. a=bq+ra=bq+rwith either r=0r=0 or r0r\not=0 and degr<degb\deg r<\deg b.

Remark

Analogue to Euclidean Algorithm.