Purchase Solution

Ring Theory : Greatest Common Divisor ( GCD )

Not what you're looking for?

Ask Custom Question

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 form

d(x) = m(x) f(x) + n(x) g(x) where d(x) = g.c.d. of f(x) and g(x).

Attachments
Purchase this Solution
Solution Summary

The GCD of two polynomials is found in the solution attached.

Solution provided by:
Thokchom Sarojkumar Sinha, MSc
Education
  • BSc, Manipur University
  • MSc, Kanpur University
Recent Feedback
  • "Thanks this really helped."
  • "Sorry for the delay, I was unable to be online during the holiday. The post is very helpful."
  • "Very nice thank you"
  • "Thank you a million!!! Would happen to understand any of the other tensor problems i have posted???"
  • "You are awesome. Thank you"
Purchase this Solution
Free BrainMass Quizzes
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.

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.

Probability Quiz

Some questions on probability

Exponential Expressions

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

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

  • Euclidean Rings and GCD

    106672 Ring Theory : Euclidean Rings and GCD If the least common multiple of a and b in the Euclidean ring R is denoted by [a,b], prove that [a,b] = ab/(a, b) where (a, b) is the greatest common divisor of a

  • 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 (GCD) in C++ with Example

    * A recursive program to calculate the Greatest Common Divisor of two integers using the Euclidean Method.

  • greatest common divisor

    2588 Determining the greatest common divisor using the Euclidean Algorithm. How do I use the Euclidean Algorithm for determining the greatest common divisor of two integers?

  • Greatest common divisor

    (see attached) This shows how to find the greatest common divisor and express it as a linear combination.

  • 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

  • Computing greatest common divisor and least common multiple

    It is not possible to do so because their GCD is 3, so their Least Common Multiple (LCM) is 9*15/3=45 which is not 225. The solution gives detailed steps on computing a greatest common divisor and a least common multiple.

  • 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.

View More Related Solutions