I am running Maple 12 in OSX. I am trying to calculate the order of a group. I know my group is finite, but is very large. The environment variable _EnvMaxCosetsToddCoxeter is set by default to 128000 (see help pages: group,pres) but I need it to be much higher. Does anyone know how I could go about changing it?

hi everyone,

I've heard there's a possibility to plot graphics with scrollbars attached to them. These scrollbars allow for modification of the parameters of the given function and the following instant graphical results .

any ideas  ?

Thanks in advance,

Yoeri.

 

Here is my code but I'm having trouble getting it to work

d := sigma(m)-m; Amicable := proc (m) local n; for m from 2 to 100000 do n := d(m); if d(n) = m then print*m, n end if end do end proc

Would appreciate any advice you guys might have.

Thanks.

Suppose I solved for an arbitrary

because i'v got error like this "can only numerically solve PDE with two independent variables, got {x, y, t}"

 I have been provided with a sequence defined as such,

a_0=1 and b_0=1/surd(2,3)

a_n+1=(1/3)*(a_n+2*b_n) and b_n+1=surd((1/3)*(b_n*(a_n^2+a_n*b_n+b_n^2)),3)

and have been asked to come up with a loop to check the value to which both {a_n} and {b_n} converge.

How do I go about doing this?

Thanks for the help in advance.

Maple not working don't know what is wrond????

 

HELP!!!

 

http://www.mediafire.com/?nbzczfmyyro

I have a nasty expression that solves for eigenvalues of pressure & shear waves propagating along an interface between 2 elastic media.  There are many roots to this expression for eta, but many of them can be excluded because the material properties are both REAL & POSITIVE.  I am very new to MAPLE & I am attempting to get it to solve for the roots where all of the other parameters meet the conditions of REAL & POSITIVE but I am not sure I am doing this correctly because MAPLE runs off to evaluation mode & takes so much memory my computer slows to a crawl &

I put the following into Maple (12) A := 2*x*z+2*z*y+x*y V := x*y*z sys := {A= S, diff(V, x) = lambda*(diff(A, x)), diff(V, y) = lambda*(diff(A, y)), diff(V, z) = lambda*(diff(A, z))} S being a constant solve(sys, [x, y, z, lambda]); and got: [[x = RootOf(3*_Z^2-S, label = _L1), y = RootOf(3*_Z^2-S, label = _L1), z = (1/2)*RootOf(3*_Z^2-S, label = _L1), lambda = (1/4)*RootOf(3*_Z^2-S, label = _L1)]] which makes no sense to me... How can I enter this system into maple and get an answer? (the system is gradA=gradV and A=S, S being a constant, which is shown above) Thanks!

Hi,

 

> restart;
> read "D:/Data/Data7/Advisor/csum.m";
> a :=n ->  (5/n)^(1/n);
> csum(a(n), n);

                                    false

But

 

ok,

my first quations is: How can I get  V(F(x), G(x)) in the last expression in the below picture evaluated at the end point t and T. 

The solution should be a vertical line to the right-hand side of the expression

 

My second quation is: Is there any way I can sequentialy solve the problem without having to manually rewrite the equations

 

 

Is it possible to easily use a procedure that I create in one worksheet in other worksheets (i.e. make it into a loadable package) without having to cut and paste the whole procedure text into each worksheet that I want to use it in?  It is a bit of a pain to have to do manual version management of my particular procedure in each sheet when I use it in a number of different files.

Hi everybody,

I have to solve a symbolic equation.

Therefore I use the convenient solve command.

The problem is, that the result I get is not the one I need. It is a correct soultion though. The equation has two solutions.

So how can I get more results out of the solve command.

I found "_EnvAllSolutions:= true;"

Unfortunately this made only disappear the Warning: Warning, solutions may have been lost" without producing any more solutions.

Regards

Kalle

Hello I was wondering how to generate bitstrings of length n that do not contain two consecutives ones. So far i have the following bitstring := x[i]; for i to 5 do bitstring := [op(bitstring), rand(2)()]; if x[i] = 1 then x[i+1] = 0 else x[i+1] = rand(2)() end if end do; bitstring there are two problems with this: (1) this is not from 1 to n (and i don't know how to specify this) (2) It produces strings which do have consecutive ones. Thank you in advance any help, Herman

Hi folks, I have been trying to solve that problem for the last 2 days, but I dont get it:

 

Lets say I have a velecity vector which is dependent from t:

v:=t->Vector(3,{1=t^2,2=3t,3=t^3})