t0 := arccosh(lambda/(s*(1-lambda)))

f := int(sqrt(lambda-s*cosh(t)/(1+s*cosh(t))), t = -t0 .. t0)

s := 1/10

with(Student[Calculus1])

g := f-Pi*(0+1/2)

Roots(g, lambda = 0 .. 1, numeric)

Why does maple say:

Error, (in mod/Expand) too many levels of recursion?

r(t) = RootOf(Int(_a/sqrt(-4*_a^4+5*_a^2-1), _a = 1 .. _Z)+t), r(t) = RootOf(Int(_a/sqrt(-4*_a^4+5*_a^2-1), _a = _Z .. 1)+t), r(t) = RootOf(Int(_a/sqrt(-4*_a^4+13*_a^2-9), _a = 1 .. _Z)+t), r(t) = RootOf(Int(_a/sqrt(-4*_a^4+13*_a^2-9), _a = _Z .. 1)+t)

ist my result of an ODE

g := dsolve([oder, r(0) = 1, (D(r))(0) = 0])

oder := diff(r(t), t, t) = 4*sqrt(1-(diff(r(t), t))^2)+(1-(diff(r(t), t))^2)/r(t)

Now usually maple gives me one solution, so I can just plot with

Hi all,

This might be more a mathematical problem than a Maple problem, but still maybe somebody could help me out.

I am trying to solve the differential equation of an Euler-Bernoulli beam with an distributed load (q1) and a varying axial force (N(x)). The following equation applies:

I have a rather large number of combinations to search and would like to use Task in order to take advantage of my multicore machine. The easiest way it seems to me to use Task to break up the total number of combinations into say, four pieces. Any one familiar with Task have any suggestions?

Hello Folks:

I'm trying to generate a plot of a procedure that uses fsolve and I get the following error message:

> implicitplot(IC(2, x, y, 1, 1), .1 .. .9, -1 .. 1, filled = true, numpoints = 10);
Error, (in fsolve) x is in the equation, and is not solved for

It seems that Maple is passing x to the procedure IC and not the numerical value of x.

I tried, without success,  to delay the evaluation as suggested here

I have some automatically generated maple code. The code is in fact entirely within a single MAPLE object module. The auto generated code is ugly; fixing it is not feasible. Dealing with it by hand is not feasible.

If you have an ugly MAPLE proc, and just want to get a standard format for the code in the proc, you can print the proc in a maple command window and copy-past it back into the source file. *poof* it looks better. You loose the comments but who needs those anyway :...

Hi,

I'm trying to generate all the possible combinations of each M[i] according to the possible values for c,d and e. The code I have here generates some of them but not all - it misses out the combinations when the two or three elements in the square brackets are different ie. 

it generates
[{1}, [{1}, {1}], [{1}, {1}, {1}]]               
[{1}, [{2}, {2}], [{2}, {2}, {2}]]             

Hello guys,
I'm newb with Maple and trying to solve the following nonlinear recurrence system:

rsolve ({L(0)=1,L(n)=1.025*L(n-1),h(n)=L(n)/(1.1*L(n)-0.1*v(n-1)),v(0)=0.5,v(n)=(1+h(n))*v(n-1)},{L,h,v});

But Maple returns me nothing, no error. What's might be the problem?

Thanks in advance.

In the following task procedure, when i>1, it works well,but if i=1, the task(M,1,5) returns error

Hello,

I've just asked maple to plot a(s) from s=0 ..10 where a(s) is the absaolute value of a complex piecewise function. When I enter the command to plot:

> plot(a(s), s = 0 .. 10, discont = true);

maple just shows 'Evaluating' and fails to produce anything. I've left it for up to 20 minutes without any result. Maple has successfully plotted very similar things before in a matter of seconds so I don't think time is an issue here. The full script is as follows:

I couldn't find a command for this. Is it possible that does not exist for this every day problem?

We conduct regular reviews of our platform support to ensure that we are focusing on the platforms that are most valued by our customers. Based on our most recent review, we will offer the next release of Maple on the platforms listed below. As additional versions of operating systems on these platforms are announced, we will take those into account as well.

Supported Platforms and Operating Systems
Windows
Windows XP
Windows Vista
Windows 7
Windows Server 2008 R2
Windows Server 2012
Windows 8

Linux
Red Hat Enterprise Linux 6
SUSE Linux Enterprise Desktop 11
Ubuntu 12.04 LTS
Ubuntu 13.10 (Planned)

Mac
OS X 10.7
OS X 10.8

Discontinued
Mac OS X 10.6
Red Hat Enterprise Linux 5 update 5
Ubuntu 12.10
Oracle Solaris 10 (the next release of Maple will not be available on Solaris)

If you have any questions or concerns, please don’t hesitate to reply to this topic, or contact us directly at: maplepm (at) maplesoft.com

What's wrong with my loop? It works fine if no_legs is set to 3, but when it is set to 2 or 4 it doesn't work (as in the picture). The code is to list combinations, as in http://www.mapleprimes.com/questions/149475-How-Do-I-Create-Combinations-According. I'm really stuck. Thank you for any help!

Hi everybody,

I already discussed my tasks with @Preben Alsholm. Therefore, I decided to share it with you and try to finalize solution.

Actually, I want to calculate heat dynamics transfer between one, two or more rooms. Hence, I used heat balance approach to set the system of differential equations:

Hi, 

     I was wondering why numeric integrals that approach zero converge slowly? Is there a way to arrive at the answer (0) faster? Besides proving it symbolically