Hey guys.

I've been using a format where everything, math and text, is in black. The awnsers come out in blue.

Some coleges use a (ugly?) format where the equations are in red and are, in my opinion, less easy to read and take longer to type down.

So my question is simply this: Can I do everything using the black format I'm used to, or are there certain things that I MUST use the red format to compute?

If there are...

Hi all,

 I want to find the co-efficient for z^k of 2-stage hyper exponential Random Variable. That is expressed as sum of two Taylor series. I have given the code in the attachment. I have tried using convert(A(z),FormalPowerSeries,z) with op([1,1],..), but it didn't work.Coefficient_Extract_.mw

Dear Maple Users!

I'm quite beginner in Maple. I will appreciate all of your help and a guidance.

I have written the simple procedure (in attached file) and it takes about 40 sec to make

one cycle on i5 2.8Ghz, 4Gb RAM, Win7x64, Maple 14 x64. I believe that it can be solved much 

more faster.

  qn_mp_v1.mw

What are the ways to speed up my procedure?

Hi there,

I am calculating he rank of a matrix in Maple and I have a result. However, I want Maple to show me the intermediate steps that it used. I know that the rank function uses gaussian eliminations. Is it possible to make it display these steps? 

The matrix is 8*8 so I think it is taugh to use the tutor tool. 

I tried ShowSteps but it says that rank is not a valid problem.

Any ideas?

Hello,

 I am getting into the pdetools, in particular the analytical options. I saw that I can test the MAPLE solution to a pde, but I want MAPLE to test my solution,  how could I do that, MAPLE just substitutes my solution into the pde without differentiating and simplifying.

Thanks,

Daniel

Hello everyone,

I like to force following:

a/(a+b) --->  1/(1+b/a)

I know that collect is a powerful tool that is actually capable of doing such things. In a similar (old) thread, it was suggested to use a function in the last part like

collect(expression, varialble, (x->something)@factor)

but I don't understand what exactly this means. Any help?

another related question is, is the collect command available as right-click option?

I have a differential equation having a parameter say 'a'.

If I increase 'a' by 10%, got change in the solution as well.

How to calculate change in percentage in the solution?.

Thanks

Hi everyone.

Does anyone know what engine is behind the fsolve command? As we know fsolve can solve the sets of equations even without any initial guesses. Is it working based on GA or another global optimization techniques?

Appreciate any help.

MJ

So I've got this function here:

I'm trying to maximize it over the reals using Maple 16. I know from the graph that the maximum is somewhere between 109 and 111. I tried using maximize( f(x), x=109..111) but it keeps giving an overflow exception. How would I go about maximizing this?

I have written a procedure to overload a new "Subs" function. It uses a seq of equations as its first argument followed by the object to act upon (yes, it is to have subs functionality on these objects). I find the overloading works when I have just one equation in the argument list, but with more than one it never calls any of the procedures. The code worked with multiple equations before I overloaded it (i.e. the first proc was verified by itself). FWIW the objects (elemt or bm...

Does maple 16  work with Visual studio 2012?

Check these 3 code lines. a,b are some reals.

s:=a/b

g:=(a,b)->s

g(1,2)

yields a/b

Is it possible to make Maple spit out 1/2, maybe with some default setting command? I still want to keep the function call format g() , so no eval(g(),...)

We are a group of students trying to solve this, we can't find a way.

We are given the system of equations

ax + y +z +u =  1
  x  -y  -z +u  = -a
       y +z -au = b
  x- y +bz +u =-2a


For what values ​​of a and

Modify the shortest path problem by rewriting a procedure Path, non-Recursion
 that print out the shortest path from a to e base on the information from
 setShortestDistNode
 input:  destination "e" and setShortestDistNode
 output:  path : a -> b -> d -> e the total cost: 9
hint: copy everything that we did in shortest path problem, and rewriting a procedure Path, with while loop

I'm assuming this means this, but...

I don't understand the error that appears in blue sentence. How can I solve this error? Thank you very much.