Maple Questions and Posts

These are Posts and Questions associated with the product, Maple
Help! I've got a system of equations that I solve and it has four sets of solutions, ie the output looks like: [[a= ,b= ,c= ,d=- ],[a= ,b= ,c= ,d= ],[a= ,b=- ,c= ,d= ],[a= ,b=- ,c= ,d=- ]] And specifically, I'm only interested in the solutions where both b and d are positive (the second solution in the list above). Is there a way to only solve for that solution or is there a way to extract out that solution? They're not always in the same order so I can't use something like: solve(...)[1] Thank you very much!
Greetings, For a college math project i am plotting a rocket trajectory to mars using maple. First i solved a system of D.E.'s to get the position of the earth (x(t),y(t),z(t)) as a function of time. Then i did the same thing for mars. however when i use these results to solve the D.E. for the a rocket trajectory i get an error. I will post my code. Any help would be very much appreciated. Download
View file details
I can't believe that the examples for do loops provided by the Maple tutorial does not show how to put more than one state in a do loop. Maple refers to this as a "statement sequence". Yet, an internal search of keyword "statement sequence" in Maple Help yields No Matches. Example: how can I do this simple example: for n from 1 to 10 do x:=2*n y:=3*n end do; ?
Can anyone explain how to write a 10 consecutive sequence of odd x^3 natural numbers?
Write the equation given to ordered pairs. 1. (1,2) and (9,6) y = 2. (5,2) and (3,4) y = 3. (-5,-5) and (5,4) y = 4. (4,6) and (5,4) y = 5. (-2,0) and (3,5) can sum 1 please help her im having trouble!!!!!!! thnx SOoo much =)
Hello again,

I have another simple question. I have a dynamic simulation that I've put together, and I'm solving the system of equations using "dsolve(odeset,numeric)", and all is going well there. However, I added a "product totalizer" that integrates my exit flow with the command:

Ptotal := ptot(t) = int(Fexit, t)

And that works well if the Fexit is a fixed number in my simulation. However, I wanted to change the Fexit variable at certain points in time, so I used the piecewise command:

Fexit := piecewise(`and`(t >= 25, t < 30), 2, `and`(t >= 35, t < 34), 2, 0)

The simulation looks fine with the piecewise logic, but the integration above does not. It looks like the integration resets itself to zero where the steps occur. So my questions are:
I would like to represent the frequency of the output (values of x, values of y) of the following commands.. restart: with(stats): with(Optimization):stats[random, normald](1); for i from 1 to 10 do z:= Maximize(1/3*ln(x)+1/3*ln(y), {x+y

The functionality to extend and augment the context-sensitive menus is quite nice. I especially like the submodule ContextMenu:-Test whose exports allow one to programmatically test the results and new menus.

But what about installing menus with items whose type checks relate to locals?

Here's a simple example.

> newCM:=ContextMenu:-New():
> newCM[Entries][Add]("local to global", "convert(%EXPR,`global`)", `local`):
> newCM[Entries...

Hello, I was curious if someone could enlighten my on what's going on here. I put together a set of ODE's and solved them. I then went back and changed some of the parameters, but not the form, of the ODE's. The output of my ODE set now has a "table" comment in it, and I don't know why. For example, one of my initial ODE's is: XMB; (diff(V(t), t))*X(t)+V(t)*(diff(X(t), t)) = .3*S(t)*X(t)*V(t)/(.1+S(t)) after I change some of my parameters, I get this as output: XMB; (diff(V(t), t))*(table([inlet = 0]))(t)+V(t)*(diff((table([inlet = 0]))(t), t)) = -0.1e-1*(table([inlet = 0]))(t)+.3*(table([inlet = 1.0]))(t)*(table([inlet = 0]))(t)*V(t)/(.1+(table([inlet = 1.0]))(t))
What tools are available to help with the search for syntax errors within Maple code? It seems to me the built-in debugger is designed to assist with the testing of Maple code with no syntax errors. While this is important, and useful, the code has to be syntactically correct before this is of any use. Here's the situation I am facing. I have a file with more than 3500 lines of Maple code. Close to 1000 lines is the definition of a maplet, which has to be in one execution group. If there is a single missing comma, square bracket, or parenthesis, Maple will generate an error message and will place the cursor somewhere within the offending execution group. I have seen enough error messages that I know what they mean; I'm not complaining about the error message. My complaint is about the location of the cursor. While the location is deterministic, it is rarely close to the actual location of the error. Does anyone have any useful tips for how to locate the source of syntax errors within large Maple programs?
Hi I wonder if anyone knows of any maple code to generate polynomials with algebraic constants. eg an order 1 poly would be: a+b*x, order 2: a+b*x+c*x^2, order 3: a+b*x+c*x^2+d*x^3, ...... etc what i'm looking for is a procedure where i input the order, eg 3, and it spits out a+b*x+c*x^2+d*x^3 thanks in advance
None of the built-in features of Maple will help me numerically solve the kinds of complicated differential equations I want. I was hoping that Maple's option in dsolve of solving by Taylor series would at least grind out the first nine terms of the Taylor series expansion of the solution y(x) of e.g. x^3 + (y'(x) - 9*x)^(5/(y(x)+2)) + 4*(x-y(x))^(y'(6*x+4)) = 0 subject to y(1)=0. I dumped in functional equations, too, to see if Maple could handle it. Ok. So, for something like this, R(x,y(x),y'(x),y'(6x+4))=0 Maple should be at least able to do the first 9 differentiations to express
My expression is exp(mu*t), and 'mu' is a complex number.
I am having difficulty getting Maple to find the optimal solution over a specified range. That is, I want to limit the possible range of my maximizers. For my problem I am maximizing the expression "payoff" with respect to p and s and want to tell Maple to search for all solutions where s<pa.

I have the following expression for variable x


where x is an input to the function payoff that I wish to maximize:

payoff:=p*x + s*subs(Q=x,y) + m*(1-subs(Q=x,y)));



Now, defining the FOC of payoff as
A colleague just asked me what Maple would do if asked to solve an equation in which the right hand side is infinity. I didn't really know what it would do, so we did some tests:
f := (x-1)/expand((x-1)*(x+1)*(x-2)):
solve( f=infinity, x );
                                    1, -1
solve( 1/f=0, x );
                                    2, -1
solve( denom(f)=0, x );
                                  1, 2, -1
I could not explain the response to the first solve command. Can you? Thanks in advance, Doug
First 1864 1865 1866 1867 1868 1869 1870 Last Page 1866 of 1981