Math 2.0

statement theorem

Remainder theorem

Statement

Let RR be a commutative ring, let f∈R[x]f \in R[x] and let c∈Rc \in R. Then the remainder of the division of ff by x−cx - c is the constant polynomial f(c)f(c). That is, there is q∈R[x]q \in R[x] with f=(x−c)q+f(c)f = (x - c) q + f(c).

Remarks

The proof: division by the monic polynomial x−cx - c gives f=(x−c)q+rf = (x - c) q + r with rr a constant. Evaluation at cc gives r=f(c)r = f(c). For example, the remainder of x3−2x+5x^3 - 2x + 5 divided by x−2x - 2 is 23−4+5=92^3 - 4 + 5 = 9.

Explanations

L1 human

You do not need long division to find the remainder of ff divided by x−cx - c. You only compute f(c)f(c).

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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Polynomial ring definition
  4. Degree of a polynomial definition
  5. Polynomial evaluation definition
  6. Leading coefficient definition
  7. Monic polynomial definition
  8. Division algorithm for polynomials statement
  9. Remainder theorem statement

What depends on this

7 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Polynomial_remainder_theorem, lead section