[Home]History of Polynomial

HomePage | Recent Changes | Preferences

Revision 30 . . December 10, 2001 6:53 am by AxelBoldt [long division]
Revision 29 . . (edit) September 28, 2001 9:18 pm by AxelBoldt [*link modular arithmetic]
Revision 22 . . (edit) July 30, 2001 11:40 pm by Jan Hidders
  

Difference (from prior major revision) (author diff)

Added: 133a134,138
The quotient can be computed using the Horner scheme.

If F is a field and f and g are polynomials in F[X] with g ≠ 0, then there exist polynomials q and r in F[X] with
:f = q g + r
and such that that the degree of r is smaller than the degree of g. The polynomials q and r are uniquely determined by f and g. This is called "division with remainder" or "long division" and shows that the ring F[X] is a [euclidean domain]?.

HomePage | Recent Changes | Preferences
Search: