I would like to plot this :

yz(x+y+2z)^3-8=0 such as x^2+x(y+2z)-1<0 and y^2+y(x+2z)-3<0

The difficulty is that bounds depend on other variables. I was trying to use Maple implicitplot3d function, but I don't see a way.

Is it possible to use Maple for such plot ? If so, how ?

Thank you for your answer

I am considering to write a wrapper for plot and related commands (could redefine the commands or introduce a new name) which facilitates export of Maple plots to postscript. The command should interpret some of the options and remove them from the options sequence before submitting the remaining ones to the original plot().
E.g. it should recognize a title="TITLE" parameter and process TITLE (e.g. write it to a specific file). Similarly I would want to be able to pass additional parameters, e.g. filename="FILE" in order to specify how the output file name should be set. Is this a sensible approach. How can I realize this detailed option 'parsing' in Maple?

Hi all,

I created a package and saved it already. I checked and found it at D:/CaoHoc/LuanVan/Code/workspace/HINHHOC9.m but when I load it using with command, it has error.

[.............Code to create package..............]

>url := currentdir();
                   url := "D:\CaoHoc\LuanVan\Code\workspace"

>
>save HINHHOC9, cat(url, "/HINHHOC9.m");
>
>libname := libname, url;
libname := "C:\Program Files\Maple 18\lib",

    "D:\CaoHoc\LuanVan\Code\workspace\LuanVan\binaries",

    "C:\Program Files\Maple 18\lib", "D:\CaoHoc\LuanVan\Code\workspace"

>
>         with(HINHHOC9);
Error, (in with) user level initialization for package `HINHHOC9' failed: file
or directory does not exist

Please help me to identify the problem. Thanks

eq1a := Homogenize(eq1, h);
eq2a := Homogenize(eq2, h);
eq3a := Homogenize(eq3, h);
David Cox using Algebraic Geometry page 82 use resultant to eliminate variable h
eq1b := eq1a - x;
eq2b := eq2a - y;
eq3b := eq3a - z;
T2:=lexdeg([a,b,c],[x,y,z]);
GB := Basis([eq1b,eq2b,eq3b], T2);
r1 := resultant(eq1b, eq2b, h);
r2 := resultant(eq1b, eq3b, h);
r1 = r2

page 82 teach how to eliminate, after do question 2, discover r1 and r2 are the same.

how to eliminate the variable h with resultant after homogenize ideal with variable h

Why can't maple 15 solve this eqn. [n= 10]

solve(ithprime(n)=29,n);

Hi Maple friends.

If Maple solves an equation and spits out an answer like this,

{x = 4/3+(1/3)*sqrt(7)}, {x = 4/3-(1/3)*sqrt(7)}

how can I get a decimal answer, other than by using my calculator?

Thanks in advance.

 V = {(2a + b + c, 3a + b + 2c, 2a + c, b + 7c)|a, b, c ∈ R} forms a subspace of R^4 
 
 Show that {(2, 3, 2, 0),(1, 1, 0, 1),(0, 1, 1, 6)} is an (ordered) basis B for V . 

toally confused on how to do this??..please help!!

Hi everyone

Right now I am working on a command that calculates the molar mass of molecules. Mostly it is working like a charm but in some cases the interpretation of the input goes wrong.
The command converts the input to a string, e.g.:

f:=convert(Ca₃(PO₄)₂, string) = "Ca[3](PO[4])[2]"

f := StringTools:-Remove("[]_*^+-", f) = "Ca3(PO4)2"

However, sometimes information such as parentheses is lost (which is understandable considering the fact that maple does not know chemical syntax):

f := convert(NH[3][3]*PO[4], string) = "NH[3][3]*PO[4]"

f := StringTools:-Remove("[]_*^+-", f) = "NH33PO4"

In special cases it goes completely nuts (I am aware this is not a real molecule):

f := convert(Al(OH)₂(NH₃)₂, string) = "Al(`#msub(mfenced(mi("OH")),mn("2"))`)(NH[3])[2]"

The problem could of course simply be solved by typing the input as a string with no subscripts but is looks much nicer with the correct chemical syntax as input.

Do any of you know a way to translate the input charactor by charactor into a (understandable) string?

Thanks in anvance,
Mads 

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

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?

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.

Download ak_BER_9sep.mw

need to plot these values for various values of i.

any help??