@MDD The package was introduced in Maple 2015.

@MDD Sorry, but the package PolyhedralSets doesn't exist in Maple 15.

What makes you think that there is a solution in the cube (-1000..1000)^3? Indeed, your use of the imaginary I in all three equations leads me to doubt that there are any real solutions. fsolve immediately finds a solution in the complex cube (-1000-1000*I..1000+1000*I)^3.

@tomleslie If you have pressed the button, and the code is still executing (as opposed to simply scrolling spooled output), then the code will stop, eventually, when it returns to Maple-level code. Repressing the button has no effect.

@vv I caught the error and posted the correction while you were writing. But thanks anyway. And I added an expansion of that cryptic code at your suggestion.

@Axel Vogt Hmm. You save first, then kill; I kill first, then save. If you run into another situation where you can't save first, give my method a try. Anyway, I think that's it's faster in all cases, but especially if the mserver is consuming most of your memory.

@Markiyan Hirnyk I edited the Answer, including more explanation. It's very frustrating to me that people would risk losing their unsaved work by killing the Java process. That's totally unnecessary.

@alisha shaikh NB is a standard abbreviation for "note well". The letters come from the Latin phrase meaning the same thing.

If there's any place where f is negative, complex numbers will enter the solution due the fractional exponent of f. It might be beneficial to include an initial approximate solution with f nonnegative.

@Christopher2222 Can you give me an example of what you mean by an attribute? Do you mean a type, like integer, string, etc.?

When you say "call the full list of the Record", do you mean that you want to see the contents of the fields without the field names?

@Vee The % refers to the output of the previous command (even if that output was suppressed). There's also %% and %%%: the former refers to the output of the command previous to the previous command, and the latter refers to the command before that. That's as fas back as you can go.

@Scot Gould Moderators can and do change Posts to Questions and vice versa.

1. I don't see any boundary or initial conditions. Without these, a complete solution isn't possible.
2. You should post your code as plaintext or a worksheet so that we don't have to retype it.
3. Your system seems suitable for Maple's numeric PDE solver. See ?pdsolve,numeric for the syntax.

@Robert Israel Thank you, Robert. It's nice to see you on MaplePrimes. I've missed you, although I do occasionally see your posts on StackExchange.

This distinction between the probabilities in the continuous and discrete cases is what I was trying to capture with the word "infintesimal". Perhaps that word has a more-precise mathematical definition and I'm using it incorrectly.

@Christopher2222 

I converted it back to a Post.

It's an interesting question. I'd be impressed to see an algorithmic solution. Here's an ad hoc solution that gives 6": Your first fold essentially marks off a 2-1/2 x 8-1/2 rectangle of paper. If you fold down a corner of this, it marks off a 2-1/2 x 6 rectangle.

Doing it again reduces it to 2-1/2 x 3-1/2; and then again reduces it to 2-1/2 x 1. Now that we have 1", we can get any multiple of 1, although not necessarily by folds.

The general pattern is that if it's an a x b rectangle, a diagonal fold-down of a corner can produce a min(a,b) x (max(a,b) - min(a,b)) rectangle. Here's a procedure:

FoldRectangle:= proc(a::numeric, b::numeric, maxfolds::posint:= 9)
local r:= [min(a,b), max(a,b)-min(a,b)];
   if a=b then NULL 
   elif maxfolds=1 then r
   else r, thisproc(r[], maxfolds-1)
   end if
end proc:

FoldRectangle(17/2, 11);

   [17/2, 5/2], [5/2, 6], [5/2, 7/2], [5/2, 1], [1, 3/2], [1, 1/2], [1/2, 1/2]

These are just the sizes possible by a sequence of diagonal fold-downs of corners. If we allow folding in half, there are many more.

My procedure above is akin to a primitive subtraction-only form of Euclid's GCD algorithm. Compare with finding the GCD of 17 and 22.

This reads like it was intended to be a Post instead of a Question. If it's a Question, I don't see what exactly the question is.