statement theorem
Remainder theorem
Statement
Let be a commutative ring, let and let . Then the remainder of the division of by is the constant polynomial . That is, there is with .
Remarks
The proof: division by the monic polynomial gives with a constant. Evaluation at gives . For example, the remainder of divided by is .
Explanations
L1 human
You do not need long division to find the remainder of divided by . You only compute .
What this node needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 9 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Group concept
- Ring definition
- Polynomial ring definition
- Degree of a polynomial definition
- Polynomial evaluation definition
- Leading coefficient definition
- Monic polynomial definition
- Division algorithm for polynomials statement
- Remainder theorem statement
What depends on this
7 nodes use this node, directly or through other nodes.
- Finite subgroups of the multiplicative group of a field are cyclic 0CKGBEJX6B
- The multiplicative group of a finite field is cyclic 0EBZ3G455G
- Impossibility of trisecting the angle 0EWXPZCSZ0
- Factor theorem 0K3MWA7DMC
- A polynomial over a field has at most as many roots as its degree 0KJVQV3E0F
- Polynomials of degree two or three are irreducible iff they have no roots 0VNE161QCK
- Primitive element of a finite field 0YAA9CJQXF
Sources
What links here
Used by
- Factor theorem 0K3MWA7DMC