Karatsubas algorithm, Mathematics

Consider the following two polynomials in F17[x]

214_Karatsubas algorithm.png

 

(a) Use Karatsuba's algorithm, by hand, to multiply these two polynomials.

(b) Use the FFT algorithm, by hand, to multiply these two polynomials.

Remember that if a polynomial has degree 3 or less then it is irreducible if and only if it has at least one linear factor, that (x - a) is a linear factor of a polynomial f(x) if and only if f(a) = 0 and that for small elds it is easy to check by hand if a particular value is a root of a polynomial.

(a) Which of the following polynomials are reducible and irreducible in F5[x]? What is the factorization of the reducible ones?

1616_Karatsubas algorithm1.png

(b) Does the following system have a unique solution of smallest degree:

1739_Karatsubas algorithm2.png

Posted Date: 2/26/2013 1:00:37 AM | Location : United States







Related Discussions:- Karatsubas algorithm, Assignment Help, Ask Question on Karatsubas algorithm, Get Answer, Expert's Help, Karatsubas algorithm Discussions

Write discussion on Karatsubas algorithm
Your posts are moderated
Related Questions

the radii of circular base of right circular cylinder and cone are in the ratio of 3:4 and their height are in the ratio of the 2:3 what is the ratio of their volume?


how to solve fraction word problems


Are you suppose to divide the 1 or subtract

how to work out inequalities with negative signs?

Draw a graph which has slope of a line with rise of five and run of two is positive.

Pat is making a Christmas tree skirt. She needs to know how much fabric to buy. Using the example provided, calculate the area of the skirt to the nearest foot. a. 37.7 ft 2