i have the following equation:

1.003225155^(l)-((∫)[0]^1[((((0.6 r^2+1)^1.813666667)/((0.375 r^2+1)^2.666666667))^())^(l)r ⅆr)=0

and throws me the error:

Error, Got internal error in unknown : "invalid input: lhs received sattr, which is not valid for its 1st argument, expr"

do  you know the meaning of the error and why this equation cant be solved for l?

Hello,

Is it possible to install on the same machine both the version 32bits and 64bits ?

For example, for some software (like visio) it is possible to have several version of the softwares.

In fact, it can be useful for me because with 32 bits I can communicate with 32bits softwares and with 64bits I can do quicker some calculations.

Thank you for help.

I want to find the greatest value of this expression 

f:=(x,y,z)->sqrt((x+1)*(y^2+2)*(z^3+3))+sqrt((y+1)*(z^2+2)*(x^3+3))+sqrt((z+1)*(x^2+2)*(y^3+3));

with x>0, y>0 , z>0,x+y+z=3.

I tried

restart:

 f:=(x,y,z)->sqrt((x+1)*(y^2+2)*(z^3+3))+sqrt((y+1)*(z^2+2)*(x^3+3))+sqrt((z+1)*(x^2+2)*(y^3+3));

DirectSearch[GlobalOptima](f(x,y,z), {x>0, y>0 , z>0,x+y+z=3},maximize);

I got the output

[HFloat(infinity), [x = .591166078050740e52, y = .183647204560715e52, z = .786638021216969e52], 1249]

is it possible to find the input ideal from given hilbert series ?

i ask this because maple out of memory when computing all combination of ideals

which book teach how to design hilbert series

i want to research hilbert series and construct similar invariants to classify ideals

i do not know how many memory in order to do this. hope maple can display how much memory need before computation of all combination and display how long will wait for it finish computation.

my home computer can not afford this computation

Is it possible to pass fortran function to a maple file/procdure so that I can get back the numerical result of integration?

I was thinking like:

I tried to create, for example, helloworld.mpl

Executed the command in my terminal:

$ maple helloworld.mpl > output.txt

# executing maple in my terminal is same as doing cmaple.

Now my output.txt has the whole cmaple seesion in it, but I only want "helloworld" in there. How is it possible?

Second If somehow with your help I can remove the extra output from output.txt, and then create a maple procedure as integrator.mpl for integration, how could I pass some input to that integrator.mpl??

Regards!!

I want to write a code but it is too lengthy. I want to do each part of the code in a separate ".mw" file. For example consider the two files "Part1.mw" and "Part2.mw". The "Part2.mw" have specific entries that must be given by "Part1.mw". How should I do this? or in other words How should I link these two files?

I don't want all variables in "Part1.mw" to be passed to "Part2.mw" but just specific variables that are needed.

Hi, I want to make a plot for different scenarios or limits, but I am not sure if this is possible, so if i have the equation 

X:=A*exp(-a*t)+B*exp(-b*t);

where a and b are pre-defined constants i.e. 1 and 2. I want to plot this for when A>>B, A=B and A<<B, is this possible in maple? 

According to this site,"It is known that every even number can be written as a sum of at most six primes". 

http://www.theage.com.au/national/education/christians-goldbachs-magic-sum-20140903-3es2t.html

i wanted to test this using maple.

restart:
> PF := proc (a::integer)

> local cst,obj,res;
> cst := add(x[i], i = 1 .. numtheory:-pi(prevprime(a))) <= 6;
> obj := add(x[i]*ithprime(i), i = 1 .. numtheory:-pi(prevprime(a)))-a;
> res := Optimization:-LPSolve(obj, {cst ,obj>=0}, assume={nonnegative,integer}); end proc:
> PF(30);
[0, [x[1] = 0, x[2] = 0, x[3] = 6, x[4] = 0, x[5] = 0, x[6] = 0,x[7] = 0, x[8] = 0, x[9] = 0, x[10] = 0]]

the third prime is 5 and 6 of them make 30. as an aside, it would be nice to know how to get maple to output "30 = 6x5".

this is obviously pretty limited, because 30 can be written as the sum of two primes (7+23 and 11+19) [GOLDBACH], but using DS's GlobalSearch for all solutions takes a long time to compute. also I have to nominate the highest prime.

any suggestions?

why not maple use NoSQL object database to save objects to prevent out of memory?

i want to use dictionary or hashtable in maple

the key are a function, value are a list of things

how to do?

Error, (in combinat:-permute) Maple was unable to allocate enough memory to complete this computation

would like to get all combination of system of polynomials

but got memory error, another alternatives to do this?

AllMatrices := proc (A::set, k::posint, n::posint)
local B, C, E:
B := [[]]:
C := proc ()
B := [seq(seq([A[i], op(B[j])], i = 1 .. nops(A)), j = 1 .. nops(B))]:
end proc:
E := (C@@(k*n))(B):
seq(Matrix(k, n, E[m]), m = 1 .. nops(A)^(k*n));
end proc:
mm := AllMatrices({0, 1}, 3, 3);

GetRing := proc(sol)
ringequation := 0;
mono1 := 0;
for j from 1 to 3 do
mono1 := 1;
for i from 1 to nops(sol[1][j]) do
mono1 := mono1*op(i, sol[1][j]);
od:
ringequation := ringequation + mono1;
od:
return ringequation;
end proc;

with(LinearAlgebra):
polylistresult := [];
for i from 1 to nops([mm]) do
sol := MatrixMatrixMultiply(Matrix([[a,b,c]]), op(i,[mm]));
sol := GetRing(sol);
polylistresult := [op(polylistresult), sol];
od:
gaga := polylistresult;
nops(polylistresult);
polylistresult := [op(polylistresult), op(gaga)];
nops(polylistresult);
polylistresult := [op(polylistresult), op(gaga)];
nops(polylistresult);
with(combinat):
gg := permute(polylistresult, 3);
Error, (in combinat:-permute) Maple was unable to allocate enough memory to complete this computation. Please see ?alloc

Hey I have a list of matrices and I want to define a proc that will search through the first matrices entries looking for zeroes, and if it finds one to move on to the next matrix in the list and look for zeroes and so on. if for some reason all matrices in the list have zeroes i would like the proc to answer with 0. otherwise I would like it to answer with the ndex of the first matrix wth all non-zero entries. I've played with things and occasionally made things work. But in general I do not have a solution. This is what I'e tried:

Things like this:

recu:=proc(y,n,q)
options trace;
local f,j,t,k;
t[y]:=y:
k:=y:
for f from 1 to n while y<=q do;
for j from 1 to n do;
if evalb(C[k](f,j)=0) then;
t[y+1]:=t[y]+1;
recu(t[y+1],n,q);
else next;
end if;
end do;
end do;
end proc;

like this:

recu:=proc(y,n,q)
local f,j,t,k;
global S;
options trace;
S:=0;
if y=q then return "no";
end if;
for f from 1 to n do;
for j from 1 to n do;
if evalb(C[y](f,j)=0) then;
recu(y+1,n,q);
S:=S+1;
end if;
end do;
end do;
end proc;

And I think I understand well why these are not workinging however I wondered what I can do that will be syntactically (sp?) correct.

Thanks

Hi I am simply trying to rearange equation X, the steoes I want to do are differentiate X w.r.t t then insert equation Y into the new differentiated form but I am stuck, I am not really sure what to try I have used algsubs but it comes up with an error.

here is my code: 

 

X := diff(x(t), t)+(k1+k2+k3)*x(t)-(k4-k1)*y(t)-k1 = 0;
print(`output redirected...`); # input placeholder
/ d \
|--- x(t)| + (k1 + k2 + k3) x(t) - (k4 - k1) y(t) - k1 = 0
\ dt /
Y := diff(y(t), t)+(k4+k5+k6)*y(t)-(k3-k6)*x(t)-k6 = 0;
print(`output redirected...`); # input placeholder
/ d \
|--- y(t)| + (k4 + k5 + k6) y(t) - (k3 - k6) x(t) - k6 = 0
\ dt /
A := diff(X, t);
print(`output redirected...`); # input placeholder
/ d / d \\ / d \
|--- |--- x(t)|| + (k1 + k2 + k3) |--- x(t)|
\ dt \ dt // \ dt /

/ d \
- (k4 - k1) |--- y(t)| = 0
\ dt /
algsubs(Y, A);
%;
Error, (in algsubs) cannot compute degree of pattern in y(t)

 

how to permutate all combination of matrix of each element can only be 0,1,2

although it can be done in other language, and copy to maple

how to do this in maple with combinat package?

I have an indexed equation that contains serval definite integrals in it. I want maple to evaluate the equation for different indices. But when I set the parameter "N=100" in the code, it takes maple lots of time for the evaluation. I am looking for some tricks to make the code numerically more efficient. I will be so thankful for any opinion and help.
you can find my code below. The code is so simple and just contains few lines. I will appreciate any help.

Numerical_Performance.mw

Thanks in advance.