Is my solution for this gcd correct?

  • Thread starter Thread starter Firepanda
  • Start date Start date
  • Tags Tags
    Gcd
Firepanda
Messages
425
Reaction score
0
For the first part of this question:

25jxgd.pg.gif


So if everything was done correctly is -55/16 my answer?
 
Last edited:
Physics news on Phys.org
-55/16 is a unit, so that is the same as saying they're co-prime
 
Maybe I'm missing something, but I don't get where the -55/16 comes from. f(x) has no zeroes in the rationals, hence no factors with rational coefficients.

I'm not sure what F5 means, but if it represents the integers modulo 5, both f and g have a common zero, hence a common factor.
 
Mark44 said:
Maybe I'm missing something, but I don't get where the -55/16 comes from. f(x) has no zeroes in the rationals, hence no factors with rational coefficients.

I'm not sure what F5 means, but if it represents the integers modulo 5, both f and g have a common zero, hence a common factor.

I had my solution steps up last night but I took it down after office_shredder made the point that it means they are coprime.
 
Last edited:
I'm still interested in where the -55/16 came from.
 
Last remainder of Euclidean division
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top