I am trying to implement an example from page 106 in the book Essential Maple 7 in hope that I can understand a problem related to the "solve" function. The example is:

restart;
f[1] := c*x[1]^2*x[2]+9*x[1]^2+2*x[1]*x[2]+5*x[1]+x[2]-3;

f[2] := 2*x[1]^3*x[2]+6*x[1]^3-2*x[1]^2-x[1]*x[2]-3*x[1]-x[2]+3;

f[3] := x[1]^3*x[2]+3*x[1]^3+x[1]^2*x[2]+2*x[1]^2;

with(Groebner)

infolevel[primpart]:=5

gb:=gbasis([f[1],f[2],f[3]],tdeg(x[1],x[2])):

According to the book, I should receive an output that tell me what "content" has been removed. This will tell me what values of the parameter c have special solutions.

If I enter this in my version of Maple 2015 with no changes, I receive no output. This is not so surprising since the example was written for Maple 7. So I changed infolevel[primpart] to infolevel[all]. With this change, I receive some information, but it is rather general and not what I want.

Does anyone know if there is some other way to do this example in Maple 2015?

Thanks for your help.

Part of my research involves finding solutions to polynomial equations in several variables. Presently, I'm using Maple to both generate and solve these systems. With what I'll call a particular type of system the solve function returns several solutions, one of which has a particular variable free and the others where this variable is the root of a polynomial. By finding the roots of the polynomial, I can see that these solutions simply correspond to the solutions where the parameter is free.

So I'm trying to understand why this happens. Using the option dropmultiplicity=true has no effect, and there are no other details that I could find in the documentation. This question is ill-posed, I know, but any help would be appreciated.

Does anyone know if there is a simple way to write a falling factorial (pochhammer symbol) in Maple. It seems pochhammer is the rising factorial with no option to change to falling.

Thanks in advance.

Hi,

I am using the solve command to solve an equation of the form "linear over quadratic is equal to a constant" where the constant is assumed to be nonzero. This is easily solved by hand, of course, but I to use the solution in other computations. So I asked maple to solve it for me. But when I check maple's solution (i.e. just plug the two solutions in on the left hand side and simplify) maple does not return the original constant. Can anyone help me understand what is going wrong?

I have a system of 16 polynomial equations in 15 variables. Independently I know there is at least a one parameter familiy of solutions to this system, so there is reason to think at least two of the equations are redundent. I would like to use Maple to decipher which of the equations are redundent, but I am unsure how to proceed.

So far I have looked at the Groebner package, and it seems like the Reduce and InterReduce commands will be useful. Say I call the set of 16 polynomials X and define a lexicographical order T on the variables. I then ask maple to compute

Reduce(X,X,T)

and receive a list with 7 zeroes and 9 polynomials. What exactly is this telling me? Does this mean that maple has used polynomial division and found that 7 of the equations are redundent?

Thanks for your help!