Question: Evaluation via recursive remaindering. Let R be a ring. (a) Show that for all & R and f = R[x] we have f(g) =

Evaluation via recursive remaindering. Let R be a ring. (a) Show that

Evaluation via recursive remaindering. Let R be a ring. (a) Show that for all & R and f = R[x] we have f(g) = frem (x - ). (b) Let a, b, c E R[x], with b and c monic, and suppose that c divides b. Show that a rem c = (a rem b) rem c. Hints: Recall that the quotient and remainder are unique for a, b e R[a] with b monic. Use the defining equality a = qb+r with degr < deg b for both parts. For part (a), investigate what happens when you evaluate the defining equality at .

Step by Step Solution

3.47 Rating (154 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a Recall that given any polynomial x in Rx we can write it as x qxxa r for some qx r in Rx and r of ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!