a) Determine the irreducibility of x20-11 over Q(set of rationals), and use it to prove or disprove that the ideal <x20-11> is a maximal ideal of Q[x].
b) Construct an integraldomain R and an element a in R such that a is irreducible but not prime in R.
c) Suppose that R is a principal ideal domain and a in R is irreducible. If a does not divide b in R, prove that a and b are relatively prime.
d) Suppose p in N(set of naturals) is a prime number. Show that every element a in Zp has a p-th root, i.e. there is b in Zp with a=bp.

This shows how to determine irreducibility and use it in a proof of ideal, construct an integral domain and element with given characteristics, complete a proof that a and b are relatively prime, and complete a proof regarding roots of elements in a group.

... This solution helps with a proof about cardinality. It helps show that sets have equal cardinality by constructing an explicit bijection between two sets. ...

...Proof: (1) <-> (2) is clear. ... is not algebraic over A {a}. (3)-> (1) Since the union of a chain of algebraically independent sets is algebraically ...

...set of abstract algebra problems, involving proofs, sets, groups, a ... Prove that the set of of all rational numbers ... x ∈ G | x ≥ 1}. Provide a proof for both ...

... so far I'm correct and various other proofs depend on ... since we take open sets to open sets by well ... Problem #3 (a) Proof: Since is continuous, then we define as ...

... The solution consists of a detailed, step-by-step proof of the following: For a countably infinite set A, (a) there is a one-to-one correspondence between the ...

Truth tables, Propositional Equivalences, Proofs, and Sets are ... 5. Proof by contradiction means that we suppose that ... The intersection of 2 sets consists of all ...

... 3. Use Exercise 2 to give a new proof of Theorem 2?1. 4. Any nonempty set of integers J that fulfills the following two conditions is called an integral ideal ...