Thanks to you, I now find myself anticipating the "silver" leaf - I'm pretty close, you know. :-)
My biggest decision now is whether I should delay the inevitable for a while, or just "go for it"

How would I generate all possible strings of letters from a given string of letters? (For example, if a given string of letters is "AA", then all possible strings of letters are "A" and "AA". If a given string of letters is "ABA", then all possible strings of letters in lexicographic order are "A", "AA", "AAB", "AB", "ABA", "B", "BA", "BAA".)
I know that I first need to convert the string of letters to a list of letters, but I can't figure out the correct coding.
Thanks for any advice!

How would I find and check 10 distinct solutions to the matrix equation
Matrix(2, 4, {(1, 1) = 1, (1, 2) = 2, (1, 3) = 3, (1, 4) = 4, (2, 1) = 5, (2, 2) = 6, (2, 3) = 7, (2, 4) = 8})
Vector(4, {(1) = x[1], (2) = x[2], (3) = x[3], (4) = x[4]})
=
Vector(2, {(1) = 10, (2) = 10})
?
I know that I need to use LinearSolve, but I'm not sure how to do it exactly...

Unless calculus has changed, when evaluating a definite integral, i.e., one with limits, first one performs the integration on the expression and then one evaluates the result for the upper limit and subtracts the result evaluated for the lower limit. That of course means that the indefinite integral (without limits) has to be produced before evaluating the result using the limits. Considering that, here is the confusing situation I have run into. Maple returns an answer, complicated to be sure, but an answer to
int(sin(x)*sin(x^3+x), x = 0 .. infinity)
suggesting that it CAN integrate sin(x)*sin(x^3+x)

Hello everybody,
I tried to plot the output of my algorithm as follows below, defining two vectors representing the output values of each algortihm iteration. However, in this little example this is easy, because I know the number of steps, i.e. 3. However, how can I work out this problem, if I don't know the number of steps in advance? That is, how can I define a vector which grows in size with the number of algoithm steps, but which keeps the old values of the previous steps as well?
> restart: with(stats): Digits := 14:
>
> N := 4:
> L := 0.002:
> beta:=0.85:
> beta:=0.85:

I am trying to plot surfaces implicitly using implicitplot3d with their color dependent on the value of a function f(x,y,z). I have been unable to use the procedures listed in the help file for Plot3d Color Functions, but on the web I see examples of people using something like implicitplot3d(...., color=z). Did this used to work in an older version of Maple (I'm using 10)?
John Starrett

How do I give variables superscripts that are not indices? I am an economist so, for example,
t[H]^N where t is tariffs, H is the home country and N means Nash equilibrium.

Maple Professionals:
I created an algorithm in maple, which calculates and prints out 2 values after each iteration, i.e. SFR and I (see code below). I wish to create a graph, which displays and connects the output of the iterations. That is, the y-axis should represent the variable SFR and the x-axis should represent the variable I. SFR ranges from 0 to 1 and I can range from 0 to infinity. I would be more than grateful, if someone could help me to create this graph within the code below.
Thanks so much in advance, Nic
> restart: with(stats): Digits := 14:
> N := 4:
> L := 0.002:

Dear folks...
Can you find me some way to do this substitution in a better/easy way ??
Hw := subs(cos(w) = (1/z+z)*1/2, cos(2*w) = (1/z^2+z^2)*1/2, cos(3*w) = (1/z^3+z^3)*1/2, cos(4*w) = (1/z^4+z^4)*1/2, cos(4*w) = (1/z^4+z^4)*1/2, cos(5*w) = (1/z^5+z^5)*1/2, cos(6*w) = (1/z^6+z^6)*1/2, cos(7*w) = (1/z^7+z^7)*1/2, cos(8*w) = (1/z^8+z^8)*1/2, Hw)
The list is already big and I've to add more for sin functions... cos (n*w/2) is later on the list...
is there something like
subs(cos(n*w) = (1/z^n+z^n)*1/2,Hw) ???
Or rather to do a z-transform directly ??

Anybody can explain me how to author a question in Maple TA environment using Flash Images.
Thanks
Ivan

I have a list of data and errors for which I want to do a chi-squared minimization for an arbitrary function. Is there a simple way to do this?

Hi:
Does anyone have any insight into the following:
I have Maple programs that use the following pattern:
restart;
commands;
.
.
.
I run such a program and it runs perfectly. I then go back to the beginning, including the "restart" and run the SAME PROGRAM with NO CHANGES. It (sometimes) runs differently!!
Still gives the same answer, but sometimes the order of elements is changed, sometimes variables have "-" signs outside brackets with the variables inside the brackets also changing sign. I can exit Maple, reload the program and it doesn't always do the same thing. This is not unique to one program - it happens a lot with different programs I have written.

Simple question:
How do I shift a letter (or a set of letters) over 3 or 7 or whatever places in the alphabet using with(Stringtools);
Without converting the letters to numbers?
Is there a shift function? or do i have to create a whole new alphabet to charactermap to for each shift I want to do.
It seems very easy but I can't quite figure it out.
Any help would be appreciated.

Hey:
When running a C++ program in command-line mode in Unix, we can get parameters from argc and argv. If I run maple program in command-line mode in Unix:
>maple myMapleProgram.mw para1 para2
how can myMapleProgram.mw get parameters para1 and para2?
Thanks
Pan.

I have written a couple of lines in Maple as follows, to evaluate for the roots of Bessel's equation, J:
m:=0;
n:=1;
p[m,n]:=evalf(BesselJZeros(m,n));
This produces a value of 2.405 for p[0,1], and p[1,1] to be 3.832 which is what I'm looking for.
However, I also want to be able to evaluate Bessel's equation to get the roots for J', that would give p[0,1] to be 3.832, p[1,1] to be 1.841 etc. I can't find anything in the Maple help on the topic - well, nothing that provides actual solutions.
Sorry I haven't worded this very well, but I'm not sure on the actual mathematical wo