I need help . Why won't Maple evaluate the 2nd limit? How do I get around that? T is a constant.

> limit(exp(x/2),x=infinity);

                               infinity


> limit(exp(x/T),x=infinity);

                ...

Hi,

I have the following problem, I have a random matrix 50×50 and I want to permute the columns in such way that the number of non-zero elements under the diagonal would be minimal. Is there any function in maple which can do this? Or should I write an algorithm my self?

sorry for this funny question, but where is the "Print Preview" command, it is not under File menu anymore and the export to PDF function is also missing... What am I doing wrong?

running Maple 14 under Max OS X, SL.

cheers.

:-)

Can maple produce an animation while it is still calculating?

What I mean is, if Maple is calculating an animation in a loop have the displayed animation playing slightly behind the calculations so one would not have to wait until Maple is finished the full calculations.

I'm not actually sure if that's possible in Maple.  Everything I've ever done Maple has to finish it's calculations before one can even begin to view any animation.  Same thing for...

I have a vector consisting of taylor expansions of multiple variables, i.e. each element of the vector is a multivariate polynomial in X[1], X[2], etc. Not all the polynomials are of the same order, not all contain all the X[i]s.

I want to extract the coefficients of each component of the vector and store them in a Matrix.

I thought I had done it, but sadly the order of the coefficients is not what I expected.

Here is an example of a vector:

Dear All,

I would like to make multi-variate integration over 9 variables (x11, x12, x13, x21, x22, x23, x31, x32, x33) in order to calculate the probability of a given event. 

The output of the simpleWeightedSum method is a Vector(3,t), giving the mean of the rows of the matrix X. The event which I would like to "measure" is that the first element of the output vector is higher than the two other elements.

The xij elements are iid...

Is there a way to solve the following problem?
Given a nxn A=(A_ij) matrix (for example n=3,4...) where A-ij is a
polynomial of degree one in X_1, ..., X_n, and given a n-vector
v=(B_11*X_1+...+B_1n*X_n, ..., B_n1*X_1+...+B_nn*X_n)^t where B_ij are
parameters, is it possible to find value for B_ij in such way that the
vector v belongs to the vector space spanned by the columns of A?
thank you.
best
Michele

At http://www.maplesoft.com/applications/view.aspx?SID=97879 there seems to be a quite
interesting contribution by Rob Corless, Erik Postma and David Stoutemyer.

It would be helpfull and interesting to provide the according paper as well (through a link?).
Hope this message is read by Eric Postma.

PS: I wanted to drop an according message at the center as comment, but failed to log in,

Hi all,

I'm looking for maplets for operations research (single machine problems)...if possible for free.

Thanks for your time. 

I am trying to draw a triangle with black lines and fill it in gray. Based on the maple help code i am trying this code:

draw(T, thickness = 3, filled = [color = "Blue"])

It does draw the triangle T with the right thickness, but the triangle isn't filled. Any thoughts?

help appreciated

Pieter

I am sorry if this was already mentioned in previous posts but I can not find it. I am dealing with plotting the solids of revolution. It is easy when you have explicit function form, for example 2-x^2. Then, when you want to rotate it around x axis and plot the obtained solid you could write:

> p := plot3d(2-x^2, theta = 0 .. 2*Pi, x = -sqrt(2) .. sqrt(2), axes = frame, coords = cylindrical):
> plots[display](p, orientation = [90, 0, 120]);

Just for fun last night I thought I'd try to whip up a simulation of the simple card game war.  The hoyle rulebook - evenly divide the cards up between 2 players facedown, turn over top card, highest card wins.  In the event of a tie the higher of the next overturned card wins (the more common variant is to play 3 facedown cards and turn up the 4th) - but that introduces more complexity to the programming ... I thought I'd tackle that later, but first ...

Hey guys, 

Its my first post, so please be lenient. I have done an internship at a theoretical physics department and part of my work was to plot a particular only numerically solvable integral over time (problem from Quantum Mechanics). I wrote a maple code and made it work, but it only produces results for certain values and even for those it takes more than one hour to plot one graph. Since this is my first big project written in maple, i assume, that the code...

This should be a simple question. But sadly I couldn't figure it out on my own

:-(

I know how to get the multivariate Taylor series expansion of a function f of arguments X[1] and X[2], about zero, and to, say, the third order,

mtaylor( f(X[1],X[2]), [X[1],X[2]], 3 );

   f(0, 0) + D[1](f)(0, 0) X[1] + D[2](f)(0, 0) X[2]

        1       ...

I was wondering if anyone could explain the theoretical reason (ie derive the
expression for the probability) why the optimal solution for the secretary problem
with n=100 is equal to 100/exp(1) and the probability is (1/exp(1))*100

Robert Israel tend to be good at these kind of things....:-)

The problem can be stated as follows (wikipedia):

 1. There is a single secretarial position to fill.
 2. There are n applicants for the position, and the value of n is known.