Purchase Solution

Calculating the splitting field greatest common divisor

Not what you're looking for?

Ask Custom Question

Assume F has characteristic 0 and K is a splitting field of f (x) in F[x]. If d(x) is the greatest common divisor of f(x) and f ' (x) and h(x) = f(x) / d(x) in F[x], prove that
a) f (x) and h(x) have the same roots in K
b) h (x) is separable

Purchase this Solution
Solution Summary

This solution explains how to calculate the given real analysis problem.

Purchase this Solution
Free BrainMass Quizzes
Graphs and Functions

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

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Multiplying Complex Numbers

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

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

View More Free Quizzes
Related BrainMass Solutions

  • Ring Theory: Greatest Common Divisor (GCD)

    111047 Ring Theory: Greatest Common Divisor (GCD) Please respond to the following question: Find the greatest common divisor of the following polynomials over F, the field of rational numbers: x^3 - 6x^2 + x + 4 and x^5 - 6x + 1 Please see the attached

  • Ring Theory : Greatest Common Divisor ( GCD )

    110351 Ring Theory: Determining the Greatest Common Divisor (GCD) If f(x) = x^5 + 2x^3 + x^2 + 2x + 3, g(x) = x^4 + x^3 + 4x^2 + 3x + 3, then find greatest common divisor of f(x) and g(x) over the field of residue classes modulo 5 and express it in the

  • Ring Theory : Associate of a Greatest Common Divisor and Euclidean Rings

    105221 Associate of a Greatest Common Divisor and Euclidean Rings In a Euclidean ring R, any associate of a greatest common divisor is a greatest common divisor. keywords: GCD, GCDs Please see the attached file for the complete solution.

  • Greatest Common Divisor in Java

    239119 Greatest Common Divisor in Java I have to write an interactive program that will find the Greatest common divisor between two inputted integers.

  • Euclidean Rings and GCD

    , where is the greatest common divisor of and .

  • Discrete Mathematics and its Applications : Greatest Common Divisors

    56004 Discrete Mathematics and its Applications : Greatest Common Divisors A) Define the greatest common divisor of two integers. b) Describe at least three different ways to find the greatest common divisor of two integers.

  • Euclidean algorithm

    49616 Greatest common divisor Find the greatest common divisor of a) 705 and 1962 b) 5339 and 2565 Please see the attached file. This shows how to find the greatest common divisor using the Euclidean algorithm.

  • divisibility

    34168 Finding the Greatest Common Divisor Find the greatest common divisor of the following pairs: a)527, 765 (use technique like 527=341*1+186) b)361, 1178 (use technique like 527=341*1+186) c) -find the gcd (d) of 299, 481 (use technique like

  • Euclidean Algorithm : Finding the Greatest Common Divisor

    11579 Euclidean Algorithm : Finding the Greatest Common Divisor Use the euclidean algorithm to find the greatest common divisor of 981 and 1234. Please see the attached file for the complete solution. Thanks for using BrainMass.

View More Related Solutions