@Thomas Richard

Yes, that is the one. The virtual machine is not limited to XP - you can load all the other old Windows operating systems if you are so inclined - I haven't tried.

Your recommendation makes no sense - you state that Maple is slower on virtual XP. That may be true but "slower" is still faster than "not at all".

By the way - I always use the classic worksheet anyway (I have troglodytic tendancies), and have noticed no speed issues between what runs on XP and what runs on Win 7 (when it does run).

Its probably the fancy front end that runs slowly on XP and notatall on Win 7 (just a guess).

The alternative of course is a yearly upgrade to the newest Maple version.

Well, that is a very nice bit of semantics. I think it would be helpful if some authority from MapleSoft could intercede at this point and present the developer's definition - when is a bug not a bug?
Personally, I find it very frustrating (and I suspect that Alex
does too) to continually run into "ordering problems"? Whose "problems"? And why do we never see such characteristics discussed in the Maple advertising or reviews? Why do reviewers not discuss "weaknesses" in this sense? Do "ordering problems" exist in other symbolic codes? Is there a literature on the subject?

Well, that is a very nice bit of semantics. I think it would be helpful if some authority from MapleSoft could intercede at this point and present the developer's definition - when is a bug not a bug?
Personally, I find it very frustrating (and I suspect that Alex
does too) to continually run into "ordering problems"? Whose "problems"? And why do we never see such characteristics discussed in the Maple advertising or reviews? Why do reviewers not discuss "weaknesses" in this sense? Do "ordering problems" exist in other symbolic codes? Is there a literature on the subject?

Hi:
First of all, many thanks for spending so much time with a very thorough reply. Now that I have been thinking about it, let me try again from the viewpoint of a Maple user who is trying to solve a problem, as opposed to a computer algebra theorist.
You start a calculation, work on it many hours and decide to quit for the day, so you save your worksheet and turn off the program.
Next day you fire up Maple and run your worksheet to the point where you left off, and ... guess what? The answer you get isn't the same as the answer you had yesterday. So you track it down and discover that today Maple is writing (1-x) as -(x-1) and your substitutions didn't catch that one. So, you change your program, spend some more quality time with your problem, quit for the day and start again tomorrow. And to your horror, tomorrow you discover that (a-b) has become -(b-a), and the solution you wanted to the 10x10 matrix inversion is no longer the 5'th, but the second element. Well, you get the picture.
So, let me try the question again from a very practical point of view - thanks to your explanation, I now understand why Maple may decide to reorder things according to its own random quirks as a calculation progresses, but surely there must be some way of restarting everything fresh when you go back to the beginning, so the code will always do its quirky thing reproducibly. That's the way computers are supposed to work. I have painfully discovered that starting every worksheet with a preemptive "restart" command isn't enough so there must be more to it than that. In short - how do you invoke a "clean" restart?

Hi:
First of all, many thanks for spending so much time with a very thorough reply. Now that I have been thinking about it, let me try again from the viewpoint of a Maple user who is trying to solve a problem, as opposed to a computer algebra theorist.
You start a calculation, work on it many hours and decide to quit for the day, so you save your worksheet and turn off the program.
Next day you fire up Maple and run your worksheet to the point where you left off, and ... guess what? The answer you get isn't the same as the answer you had yesterday. So you track it down and discover that today Maple is writing (1-x) as -(x-1) and your substitutions didn't catch that one. So, you change your program, spend some more quality time with your problem, quit for the day and start again tomorrow. And to your horror, tomorrow you discover that (a-b) has become -(b-a), and the solution you wanted to the 10x10 matrix inversion is no longer the 5'th, but the second element. Well, you get the picture.
So, let me try the question again from a very practical point of view - thanks to your explanation, I now understand why Maple may decide to reorder things according to its own random quirks as a calculation progresses, but surely there must be some way of restarting everything fresh when you go back to the beginning, so the code will always do its quirky thing reproducibly. That's the way computers are supposed to work. I have painfully discovered that starting every worksheet with a preemptive "restart" command isn't enough so there must be more to it than that. In short - how do you invoke a "clean" restart?

Yours is an interesting thought - hard to believe - so I tried it:
Maple 11 gives the following results for this experiment:
sqrt(exp(I*Pi));
I
sqrt(exp(-I*Pi));
I
sqrt(1/exp(-I*Pi));
I
sqrt(1/exp(I*Pi));
I
which means that Maple doesn't seem to have a means of distinguishing between the two approaches to a branch cut, unless there is a command that I haven't found (yet).
So this explains another Maple mystery from a few months back: when I tried to evaluate the discontinuity of a complicated function across its branch cut by naively evaluating f(I*Pi)-f(-I*Pi), I kept getting the wrong answer.

Yours is an interesting thought - hard to believe - so I tried it:
Maple 11 gives the following results for this experiment:
sqrt(exp(I*Pi));
I
sqrt(exp(-I*Pi));
I
sqrt(1/exp(-I*Pi));
I
sqrt(1/exp(I*Pi));
I
which means that Maple doesn't seem to have a means of distinguishing between the two approaches to a branch cut, unless there is a command that I haven't found (yet).
So this explains another Maple mystery from a few months back: when I tried to evaluate the discontinuity of a complicated function across its branch cut by naively evaluating f(I*Pi)-f(-I*Pi), I kept getting the wrong answer.

Thank you for taking the time to explain all that.
It boggles the mind that someone would deliberately write a program that doesn't do the same thing when started from the same initial state.
You wrote: "if I enter a polynomial in {x,y} and ask for the variables, should Maple return {x,y} or {y,x}"?
Well, I don't care which it chooses, but once it has decided, according to whatever criteria it wants, it should make the same choice if again I ask the same question with the same conditions and polynomial.
My understanding is that computer scientists solved this problem over 60 years ago when they invented pseudo-random numbers - random, but reproducibly so.
What do you mean by the term "global order" and how does one "specify the domain for computations"? Is there some way to impose a different "global order" or some different "computation domain", at the cost of losing efficiency as the price for reproducibility?

Thank you for taking the time to explain all that.
It boggles the mind that someone would deliberately write a program that doesn't do the same thing when started from the same initial state.
You wrote: "if I enter a polynomial in {x,y} and ask for the variables, should Maple return {x,y} or {y,x}"?
Well, I don't care which it chooses, but once it has decided, according to whatever criteria it wants, it should make the same choice if again I ask the same question with the same conditions and polynomial.
My understanding is that computer scientists solved this problem over 60 years ago when they invented pseudo-random numbers - random, but reproducibly so.
What do you mean by the term "global order" and how does one "specify the domain for computations"? Is there some way to impose a different "global order" or some different "computation domain", at the cost of losing efficiency as the price for reproducibility?

You are correct - I had noticed that as well - that is why I believe that Maple's answer is wrong when one uses f(k). Its one thing not to find an answer, since an answer to this problem is probably not known. Its something completely different to generate an incorrect answer. I was hoping that someone would show that the answer Maple came up with is somehow correct.

Sorry, but the case n=k doesn't satisfy the original recursion either (except for the first one: n=2).

The fact that it appears to hang is an interesting observation, but you should run it longer than 20 minutes to be sure. Maybe leave it running overnight?
The real problem is that I don't even want to evaluate that sum. Maple tries to evaluate that sum inside another of its own procedures and gets stuck, so I have no control over it. My real problem is the following program:
restart;
rq:=Q(n+1)=Q(n)/x+4*(n+1)^2*Q(n)+4/3/x*n*(n+1)*(n+1/2);
Ans:=rsolve(rq,Q(n));
and Maple freezes inside "rsolve". I speculate that it is trying to evaluate the sum I previously posted, which happens to be the answer.
When you run the above program, does it freeze after about 20 minutes? By freeze, I mean a complete halt - nonresponsive cursor and keyboard. Sometimes the machine spontaneously reboots instead of freezing. Otherwise it might still be trying to solve the problem after 20 minutes and it will eventually emerge.
Thanks
Mike

The fact that it appears to hang is an interesting observation, but you should run it longer than 20 minutes to be sure. Maybe leave it running overnight?
The real problem is that I don't even want to evaluate that sum. Maple tries to evaluate that sum inside another of its own procedures and gets stuck, so I have no control over it. My real problem is the following program:
restart;
rq:=Q(n+1)=Q(n)/x+4*(n+1)^2*Q(n)+4/3/x*n*(n+1)*(n+1/2);
Ans:=rsolve(rq,Q(n));
and Maple freezes inside "rsolve". I speculate that it is trying to evaluate the sum I previously posted, which happens to be the answer.
When you run the above program, does it freeze after about 20 minutes? By freeze, I mean a complete halt - nonresponsive cursor and keyboard. Sometimes the machine spontaneously reboots instead of freezing. Otherwise it might still be trying to solve the problem after 20 minutes and it will eventually emerge.
Thanks
Mike

Sorry, I don't understand your comment. The sum is from 0 to n-1 not n..n-1, and it was Maple itself that generated the statement in question.
When run on my machine, Maple produces nothing except a CPU freeze. Does it freeze when run on your computer?

Sorry, I don't understand your comment. The sum is from 0 to n-1 not n..n-1, and it was Maple itself that generated the statement in question.
When run on my machine, Maple produces nothing except a CPU freeze. Does it freeze when run on your computer?