Purchase Solution

# Prime Ideals and Irreducible Polynomials

Not what you're looking for?

Proofs

1. Let F be a field and p(x) and irreducible polynomial over F. Prove that (p(x)) is a prime ideal of F[x].

2. If R has no divisors of zero, then neither does R[x].

##### Solution Summary

Prime ideals and irreducible polynomials are investigated and discussed The solution is detailed and well presented.

##### Solution Preview

1. Proof:
Suppose f(x), g(x) is in F[x] and f(x)g(x) belongs to (p(x)). This means that p(x) divides f(x)g(x). But we know p(x) is irreducible, then p(x) divides f(x) or p(x) divides g(x). If p(x) divides f(x), then f(x) belongs to (p(x)); if p(x) divides g(x), then g(x) belongs to (p(x)). Therefore, (p(x)) is a prime ideal over ...

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Probability Quiz

Some questions on probability

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.