Chapter 17: Q10E (page 552)
In the proof of Case (2) of Theorem 4.1, show that R[x] is a subring of S[x] that contains R.
Short Answer
It is proved that is a subring of .
Chapter 17: Q10E (page 552)
In the proof of Case (2) of Theorem 4.1, show that R[x] is a subring of S[x] that contains R.
It is proved that is a subring of .
All the tools & learning materials you need for study success - in one app.
Get started for freeLet n be a positive integer. Suppose that there are three pegs and on one of them n rings are stacked, with each ring being smaller in diameter than the one below it, as shown here for n = 5:
The game is to transfer all the rings to another peg according to these rules:
(i) only one ring may be moved at a time; (ii) a ring may be moved to any
peg but may never be placed on top of a smaller ring; (iii) the final order of
the rings on the new peg must be the same as their original order on the first
peg. Prove that the game can be completed in moves and cannot be
completed in fewer moves.
Let be the set of all real numbers of the form, where and each role="math" localid="1658915882981" .
a. Show that is a subring of role="math" localid="1658915951771" .
b. Assume that if and only if each . (This fact was first proved in 1882; the proof is beyond the scope of this book.) Prove thatrole="math" localid="1658916066626" is isomorphic to the polynomial ring role="math" localid="1658916075331" .
Prove that 3 is a factor offor every positive integer n.
What is wrong with the following "proof" that all roses are the same color. It suffices to prove the statement: In every set of n roses, all the roses in
the set are the same color. If n = 1, the statement is certainly true. Assume
the statement is true for n = k. Let S be a set of k + 1 roses. Remove one
rose (call it rose A) from S; there are k roses remaining, and they must all
be the same color by the induction hypothesis. Replace rose A and remove
a different rose (call it rose B). Once again there are k roses remaining that
must all be the same color by the induction hypothesis. Since the remaining
roses include rose A, all the roses in Shave the same color. This proves that
the statement is true when n = k + 1. Therefore, the statement is true for all
n by induction.
(a) Prove that the following relation on the set R of real numbers is an equivalence relation: if and only if .
(b) Describe the equivalence class of 0 and the equivalence class of .
What do you think about this solution?
We value your feedback to improve our textbook solutions.