Items tagged with polynomial polynomial Tagged Items Feed

Basically I'd just like to know how to get x to temporarily equal a specified value, i.e:

if T[2]=(2x^2)-1

how do I find T[2] is x=2?

Thanks for any replies

Find the principal arguments of the 5 roots of the polynomial:p(z)=z^5-5*z^4-5*z-5,and enter a decimal approximation to the largest principal argument in the box below.  Your approximation should be correct to 10 significant figures

Can some one tell me how to write in maple？correct answer is 2.691121659

I have recently discovered that some objects in maple are (unexpectadly, and perhaps undeservedly) considered type:-polynom.

> T := table():
> type( T, polynom );
                                                true

> R := proc() end proc:
> type( R, polynom );
                                                true

My attempts to circumvent this by using a shaper polynom type were in vain (R can be subsituted with T without affecting output):

Hi,

given a ploynomial in three variables x,y,z, I want to check if it is nonnegative for all (x,y,z) in R^3.

I know there is a function 'verify' in maple but it doesn't work with my polynomial, I think it's too complex.

Do you have any idea which other function I could try?

Thank you

flower15

I would like to show a single plot comparing the 2nd, 3rd, and 4th degree Taylor polynomials of y=sqrt(2x+1) centered at x=4, with each polynomial having a different color. By default, Maple produces the plot with the function in red and all polynomials in blue. I can easily do this using the plot command, but I'd like to know if there is an option in the TaylorApproximation command that would achieve the same end result.

Thanks!

I have a polynomial T:=x-2*y-z + 3;

When i input coeff(T,x); i got 1. How can i get the coefficient 3? Please help me. Thank you.

Hi, I am trying to compute the coefficient of a polynomial as follows:

a:=(1/11520)*(4518-4320*r^(2*n)-5760*_C1*n^4*r^2-97920*_C1*n^2*r^2-97920*_C1*n*r^2-40320*_C1*n^3*r^2+2020*r^6*n^3+1500*r^6*n^2-1440*r^(2*n+6)+60*r^8-2880*r^(2+2*n)-720*r^4-100*n^5-339*n^2+3018*r^2+4560*r^(2+2*n)*n-240*r^(2*n+4)*n^2-480*r^(2+2*n)*n^4+50*r^8*n-130*r^8*n^4-270*r^8*n^3-170*r^8*n^2-20*r^8*n^5+480*r^(2*n+6)*n+480*r^(2*n+6)*n^3-480*r^(2*n+6)*n^2-1680*r^(2+2*n)*n^3+160*n^5*r^6-102*n*r+320*r^2*n^5+1783*r^2*n^4...

I have a rather large multivatiate polynomial "Dtest"  I need to divie it by a cubic poly "DGm" using rem and quo. Both are determinants multiplied out,  both given below. Have spent the past 2 nights trying to sort, collect, expand, equate coefficients plex groebner etc. Am trying to collect up all the powers of c₃ but cant anything to work. even expand doesn't fully expand "Dtest". If I set c₁ and c₂ to 1 things are...

Can you divide 2 polynomials with Real coeffs.   eg 1.87x³-2x²+5.789x- 3,2 by    1.5 x²+2x-1.4 to get the quotient and remainder? If so how?

I have a set of multi variate polynomial  equations. I need to setup a matrix [G][x]=[Θ]  Θ is a function of c₁ and c₂ up to 4th order terms

 My problem x=[c₁⁵, c₁⁴c_{2 ,} c₁³c₂² , c₁²c₂³ , c₁c₂⁴ , c₂⁵ ] these 6 5th order terms...

Hi,

I would be thankful if someone help me to generate primitive polynomials (of deferent degree if possible) defined over GF(2^16), i.e., the coefficients of the polynomials are in GF(2^16). Thanks in advance.

I want to write a code to generate Legendre Polynomials using the Gram-Schmidt Process. I have no experience with programing. Here is how the process should work:

Given "(f) = {f[0]=1, f[1]=x , f[2]=x^(2) , f[3]=x^(3) , ... , f[n]=x^(n)} "
       
Find the Legendre Polynomials: "{P[0] , P[1] , P[2] , P[3] , ... , P[n]}"

First,  P[0]=f[0]=1

then, the rest are defined recursively by

P[1]=f[1]-(()/())*P[0] = x

I'm working on a project that involves solving a large system of polynomial equations using 'solve', with some inequalities of the form "a<>b" or "a<>0". Initially, I was using Maple 9.5 with great success; the machine I was using was upgraded to Maple 11, and now 'solve' struggles with problems that were previously easy (<30 seconds).

Were there any major changes in 'solve' between these two versions? (No, according to the documentation; Yes, according to the source....

Is there programs or algorithm to obtain resultant of multivariant polynomials for more than 2 polynomials

Hi everyone,

One minor question:

what would be the code to extract data in the form of 2-d points from the output of dsolve/numeric... output=Array/array?

say, I have 6-d ODE system and I wnat to extract data in the form of 2-d arrays of number s and then approximate this with some polynomials via Curve Fitting package.

For this I need the data to be represented as -dim matrices  for every variable.

Thanks for any help.