Question: computer algebra develop an algorithm for computing

(i)develop an algorithm for computing f¡ÊF[x,y],F a field,where the degree of f in y is less than n and and f(x,ui)=vi; for i=0,1......,n-1, for distinct ui∈F,and arbitrary Vi∈F[x].showthat f is unique.

(ii) assuming that the degree of each Vi is less than m, what is the computing time of your algorithm (in term of m and n)?

(iii) computer f∈ F[11][x,y]such thatf(x,0)=x^2+7,f(x,1)=x^3+2*x+3,f(x,2)=x^3+5.

Please Wait...