Use the command taylor to find the Taylor’s series about  pi of e^{-(x-pi)^2}

specifically compute the 11_th coefficient a₁₁.

taylor(exp(-(x-Pi)^2),x=Pi,11);

is this correct?

thanks

Hello,

I look for a way to color the different subsystems of my system in the 2D mode.

It should be to have a clearer presentation of my system.

Is somebody known as it is possible to color a subsystem ?

Thank you for help.

Hi!

How do I get Maple to factor to following long expression:

where one factor is (pp1^2+pp2^2+pp3^2)?

Thanks,

Arka

Hello there,

I have some troubles with plotting implicit functions , aswell with plotting polar ones.

When I ask the plot of my function it's not ''smooth'' , it has edgdes everywhere that aren't suposed to be there (I think).

These are 2 examples:

K:=x^2*(x^2+y^2)=a^2*y^2;a:=1;
implicitplot(K,x=-2..3,y=-6..6,colour=red);

K:=(x^2+y^2)^3=a^3*x*(x^2*3*y^2);

implicitplot(K,x=-6..6,y=-6..6,colour=red);

Can somebody help me out on how to draw them smoothly?

Maybe I have to change settings?

Thanks alot!

Thanks

x^4-1equivalent 0 mod 29

after find root of inverse?

In geometry 3D, I have four vertices A(x1,y1,z1), B(x2,y2,z2), C(x3,y3,z3) and D(x4,y4,z4) of a tetrahedron. How to check a point P(x0,y0,z0) inside, outside or lie on  tetrahedron ABCD?

Hello I have a question about how to differentiate integrated equation .

 u:=integrate(q(i),i=0..M);

  diff(u,q(i));

doesn't return the equation of 1. I want to differentiate u with respect to the q(i) in q(0)....q(M).

But, I can't.

I am very glad if you tell me how to do about this calculation.

Thanks in advance.

Taro yamada

Hi everyone

I'm currently working on some mandate distribution using "Jefforson's Method" but I have run into some problems.

The general form of the calculations I do is as follows:

d:=fsolve(m = floor(v1/x)+floor(v2/x), x)

But in the case of m=5, v1=4969 and v2=208 it does not work. If I change v1 a bit it works as a charm but when 
4960=<v1=<4969 it does not.

Can any of you figure out why?

The equation surely has a solution (well, a lot of solutions). I can figure some out just by estimating and trying. Furthermore, wolfram alpha easily gives me several solutions:

http://www.wolframalpha.com/input/?i=5+%3D+floor%284969%2Fx%29%2Bfloor%28208%2Fx%29

So how come I cannot get Maple to solve it?

Thanks in advance!

Hi, I am currently creating a procedure so that i can input two matrices and a vector and multiply them together in different patterns, I want the result to be either one of the vectors {4,0,0,0} or {0,4,0,0} or {0,0,4,0} or {0,0,0,4}, I am trying to create an if loop that says is one of the S's is equal to one of these print ("Synchronising"), I have decalred these vectors inside the procedure and all the S's but my if statement is still not working. I think S needs to be decalred more clearly inside but i'm unsure what to do, any help would be much appreciaited! Here is my procedure:

proc_cerny1:=proc(A::Matrix,B::Matrix,C::Vector)
local s, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11, s12, s13, s14, e, f, g, h;
s:=C.A;
s1:=C.B;
s2:=C.A.B;
s3:=C.B.A;
s4:=C.A.A;
s5:=C.B.B;
s6:=C.A.A.A;
s7:=C.B.B.B;
s8:=C.A.B.B;
s9:=C.A.B.A;
s10:=C.B.B.A;
s11:=C.B.A.A;
s12:=C.A.A.B;
s12:=C.B.A.B;
s13:=C.B.A.A;
s14:=C.B.A.A.A;
e:=Vector([4,0,0,0],orientation=row);
f:=Vector([0,4,0,0],orientation=row);
g:=Vector([0,0,4,0],orientation=row);
h:=Vector([0,0,0,4],orientation=row);
g:=Vector([0,0,4,0],orientation=row);
if (s7 = e)then
print("Synchronising")
elif (s7 = g) then
print ("Synchronising")
elif (s7 = h) then
print ("Synchronising")
elif (s7 = g) then
print("Synchronising")
else
print("Not Synchronising");
end if;

return s, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11, s12, s13, s14;
end proc:

Thanks 

Dears 

I want to sum some series by Maple and plotting. The problem is the sum of series are known like

serer.pdf

the problem is the difference between two graphs at the intersection x-axis and y-axis.

Is there any solution for this problem.

Amr

Hi,

I m trying to substitute numerical values to an expression having assumed parameters, like m should be integer, a>0, but i could not do it.

i could not attach the .m file from which i am reading my expression, but i m attaching the file in which i m reading the expression, and you can see i could not assign values to parameters.

Regards

Sunitquestion.mw

[A restatement, from my memory, of the essential detail of the original, deleted, question.--Carl Love as moderator]

1) a) Compute a primitive 4th root of unity modulo 29. Note that the command numtheory:-rootsofunity(p,r) will not work for this.

1) b) Compute the inverse of the root found in (a).

2) Letting omega be the root found in 1 (a), compute the matrix of the Discrete Fourier Transform DFT[omega] and the matrix of the inverse transform DFT[omega^(-1)]. Show that the product of these matrices is 4I (I being the identity matrix).

"Circular segment" is the unfortunate but standard term for the region between a chord and an arc of a circle sharing the same endpoints (see http://en.wikipedia.org/wiki/Circular_segment).  I say "unfortunate" because the phrase suggests a line segment when it actually means a planar region.

I would like to plot a shaded circular segment using Maple17.  I want the endpoints of the chord & arc to be anything I please, so the chord is not necessarily horizontal, or vertical, or the diameter of the circle, etc.

At the URL

http://www.mapleprimes.com/questions/139057-Segment-Of-A-Circle

there is an image containing a shaded circular segment, but I don't see what code produced the image.  The image there includes a horizontal chord, and I don't know if the code used to produce that image can be adapted for chords that are not horizontal.

If I have to, I can plot a shaded polygon with a huge number of sides that is indistinguishable from a circular segment.  I have plotted polygons before.  But it would obviously be preferable to plot a shaded circular segment.

If there a way to plot two curves of the form r = f(theta) and shade the region between them?  This would be better than the huge-polygon approach, but not as good as a simple command for plotting a shaded circular segment, if such a command exists.

[A restatement of the essential details of the original, deleted, question from my memory.--Carl Love as moderator]

1) Compute the square root of 2 mod 3^8.

2) Compute the cube root of 2 mod 625.

I am trying to work with a for do loop with a while component. I have the error but I am not sure what the desired error should be. I know it has to be small but how small?

Thanks