Hello everyone,

I want to solve the matrix equation U^TCU=M, where I know the matrices C and M and I need to find que matrix U.

I already did so many tests but without success.

Could someone help me?

Thanks!

Hello guys,

I need a guide in using maple to perform the integration of this expression or any guide without using Maple.

int((sum(d[i]*ln(x[i]/theta), i = 1 .. n))/(d*(sum(ln(x[i]/theta), i = 1 .. n))^v), theta = 0 .. x)

Thanks.

can anyone tell me the difference between subs and eval and  evalf ?

How should I proceed to convert 2ln(3) -3ln(2)  to trigonometric form in Maple?

I am unable to do the following multiplication of two vectors(B and C given below), which is possible in Mathematics but not in Maple(Tried all the possible ways)

B := Vector(2, {1 = 2, 2 = 3});
C := Vector(1, {1 = 4});

B . C;
Error, (in LinearAlgebra:-DotProduct) vectors must have the same dimension
B*C;
Error, (in rtable/Product) use *~ for elementwise multiplication of Vectors or Matrices; use . (dot) for Vector/Matrix multiplication
`~`[`*`](B, C);
Error, dimension bounds must be the same for all container objects in an elementwise operation
 

Is it possible to coerce Maple to use all of the CPU capabilities (100%) in computations?

I am using Maple.2016.1a.x64. with following system infos:

If yes how?

If no why?

Dear all,

In Maple 18, I type the following three lines and I wonder how I can then resize the resulting displayed window:

with(plots):
p1:=plot3d(x*y,x=-1..1,y=-1..1):
display(Array([p1]))

Any idea?

Color_letterD.mws

The attached program shows a convex shape viz the letter D made of an implicit curve and a straight upright line.  I'd like to color the interior.  I was thinking of trying to make a polygon from the points of the curve - but I don't know how to access them.  If I could access them I could put the coordinates in a list L:=[[x1,y1],[x2,y2]...[xn,yn]]  and then just use plots( polygon(L).).

Any suggestions appreciated.   ...and please keep it simple - I'm only using Maple 7.

Hello

Let P(x)=ax^2n+bx^(2n-1)+....+h. Then, How can I find Q(x) and R(x) polynomials as P(x)=Q(x)^2-R(x)?

I am trying to calculate a symbolic complex sequence given in the below picture: 

I have written the following code; however, it is not efficient at all and it takes a very long time to calculate even the first elements of the sequences. Can anyone please help me fix that or suggest an efficient way of doing such calculation in complex domain? Any help is appreciated. Thanks

##########################################################

d(0):=1+1I;

M(0):=1-2I;

for k from 0 to 3 do u(k):=-d(k)/M(k);p(k+1):=M__s*u(k)+d__s;d(k+1):=d(k)+gamma*p(k+1)/(nu+abs(u(k))^2);M(k+1):=M(k)+gamma*p(k+1)*conjugate(u(k))/(nu+abs(u(k))^2);od;

Hello, I have attached an image that shows an example of what i want to do, but wanted to see if there was already conventional notation and a package that exists in maple. 

In general, i want to customize binary operations and assign index values, in the example here those index values are the modulo for the equivalence classes for which the binary operator may have elements of as operands, but in another example would be to say assign in to  "~"  in reference to it being the equivalence relation for a congruence class modulo that index.

Thanks in advance, 

Adam.

The  partition function is geven as'

Zvib(Beta)"=integrate(exp^Beta*alpha^2*h^2/4*units*m *(B-2A)+Beta*alpha^2*h^2*B^/8*units*m*(n+c)^2+Beta*alpha^2*h^2*rho^2*drho,rho=(c+n) from to lambda+c

Hi there,

I have a function X that I am trying to plot a phase portrait for against it's derivative dX/dt. I currently have the code:

plot([X,diff(X,t),t=0..10],numpoints=1000) 

which sketches a graph but does not give any arrows to indicate direction.

Could anybody help?

Many thanks

Hi I found a subpackage in the help pages with functions and concepts in mathematics that i have had a very keen interest in for quite a number of years now, and so to find an area of specialization that also has a modern day application is of course a beautiful day for any mathematics enthusiast , and especially so in that the help page provides a very basic example of such an application.

My only problem is that i start laughing when i think of the name that has been given to the algorithm that produces the encryption key. 

Must i refer to the name "BlumBlumShub" in referencing it's creator in any essays or personal writings, or can i shorten this to BBS with the consent of Maple? 

Lett_K_etc_Coloring.mws

In the attached program the letters K, M, H are drawn.  These are examples of concave polygons.  (The fact that they happen to be letters is immaterial here.)  I'm interested in the coloring in process.  I experimented with simple shapes, like the letters I and L, which have a small number of points - and the letter I is convex.  These polygons colored in without a hitch.  It seems a general rule is:

    Color the first half dozen points given, then head home towards the first point - then return to the next point.  Does it color in by separating the polygon into pentagons, or hexagons?  

   I'm aware of how to draw & color shapes by splitting them into a smaller number of polygons, so please don't waste time improving my code.   I'dd appreciate my hunch being verified, or a reference to more information.  TIA