This question is 99% similiar to an previously posted question, but this one has a little twist(s).

http://www.mapleprimes.com/questions/200101-Solving-For-Coefficients-Of-Polynomial-Equations

Here is the sample problem. Let's say I have the following equations

e1:=(a+b+1)x^2 + (a+1)*x^4 = 0;

e2:=(a-b)*x+ (a^2 - 1)*x^3 = 0;

One can immediately tell the system is inconsistent because on x^3, we have a = -1,1 but on x and x^2 we have a = -1/2

This is precisely the problem I am facing, my e1 and e2 will eventually get bigger (bigger as in the order of the polynomial will increase) and I keep facing inconsistencies.

However if I could find a way to code it so that I can ask Maple to solve only up to a certain degree it would be great. This will eliminate any inconsistency

For example, using the system I have here, the system is consistent up to order 2 (it will always start from constants and up to a certain power). So I will ask Maple to solve the above system up to order 2.

Here is a pseudocode I have been working on.

*For i = 1..2 *//this might be increased, but it will of course be finite and probably won't go past 10.

*For j = 0..N*

*//N is the degree of polynomial*

*f[i]:= coeff(e[i],x,j);*

*end*

*end*

//the above generates the equations, below will solve it

*solve( { f[i], i=1..?} ,{a,b})*

Note that the pseudocode assumes e[i] are expressions and not equations set to 0 (which is what I have). Is there an "un"unapply on maple?

edit1: have to sleep (late where I am! Will check for responses tomorrow) thank you