Chapter 10: Q10E (page 330)
Is irreducible in ? Why not?
Short Answer
No, is not irreducible in.
Chapter 10: Q10E (page 330)
Is irreducible in ? Why not?
No, is not irreducible in.
All the tools & learning materials you need for study success - in one app.
Get started for freeLet be a square-free integer (that is, d has no integer divisors of the form except . Prove that in if and only if and . Give an example to show that this result may be false if d is not square-free.
Let d be a gcd of a1........ak in an integral domain. Prove that every associate of d is also a gcd of a1........ak .
Prove that is irreducible in if and only if is either a prime integer or an irreducible polynomial in with constant term .
Conclude that every irreducible in has the property that whenever , then or .
Let be an integral domain in which any two elements (not both ) have a gcd. Let denote any gcd of and role="math" localid="1654683946993" . Use to denote associates as in Exercise 6 of section 10.1. Prove that for all :
(a) If , then .
(b) If , then .
(c) .
(d) .
Question: Show that the elements q and r in the definition of a Euclidean domain are not necessarily unique. [Hint: In , let a = - 4+i and b = 5 + 3i ; consider q = -1 and = -1+ i.]
What do you think about this solution?
We value your feedback to improve our textbook solutions.